@applitools/dom-snapshot 4.13.7 → 4.13.9

package/dist/processPagePollCjs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"processPagePollCjs.js","sources":["../../dom-shared/dist/chunkify.js","../../dom-shared/dist/poll.js","../../dom-shared/dist/pollify.js","../../dom-shared/dist/browser/absolutizeUrl.js","../../dom-shared/dist/browser/isInlineFrame.js","../../dom-shared/dist/browser/isAccessibleFrame.js","../../dom-shared/dist/index.js","../src/browser/constants.ts","../../snippets/dist/index.js","../src/browser/removeBasicAuthFromUrl.ts","../src/browser/uuid.ts","../../css-tree/lib/tokenizer/types.js","../../css-tree/lib/tokenizer/char-code-definitions.js","../../css-tree/lib/tokenizer/utils.js","../../css-tree/lib/tokenizer/names.js","../../css-tree/lib/tokenizer/adopt-buffer.js","../../css-tree/lib/tokenizer/OffsetToLocation.js","../../css-tree/lib/tokenizer/TokenStream.js","../../css-tree/lib/tokenizer/index.js","../../css-tree/lib/utils/List.js","../../css-tree/lib/utils/create-custom-error.js","../../css-tree/lib/parser/SyntaxError.js","../../css-tree/lib/parser/sequence.js","../../css-tree/lib/parser/create.js","../../../node_modules/source-map-js/lib/base64.js","../../../node_modules/source-map-js/lib/base64-vlq.js","../../../node_modules/source-map-js/lib/util.js","../../../node_modules/source-map-js/lib/array-set.js","../../../node_modules/source-map-js/lib/mapping-list.js","../../../node_modules/source-map-js/lib/source-map-generator.js","../../css-tree/lib/generator/sourceMap.js","../../css-tree/lib/generator/token-before.js","../../css-tree/lib/generator/create.js","../../css-tree/lib/walker/create.js","../../css-tree/lib/definition-syntax/generate.js","../../css-tree/lib/lexer/error.js","../../css-tree/lib/utils/names.js","../../css-tree/lib/lexer/generic-const.js","../../css-tree/lib/lexer/generic-an-plus-b.js","../../css-tree/lib/lexer/generic-urange.js","../../css-tree/lib/lexer/generic.js","../../css-tree/lib/lexer/units.js","../../css-tree/lib/definition-syntax/SyntaxError.js","../../css-tree/lib/definition-syntax/tokenizer.js","../../css-tree/lib/definition-syntax/parse.js","../../css-tree/lib/definition-syntax/walk.js","../../css-tree/lib/lexer/prepare-tokens.js","../../css-tree/lib/lexer/match-graph.js","../../css-tree/lib/lexer/match.js","../../css-tree/lib/lexer/trace.js","../../css-tree/lib/lexer/search.js","../../css-tree/lib/lexer/structure.js","../../css-tree/lib/lexer/Lexer.js","../../css-tree/lib/syntax/config/mix.js","../../css-tree/lib/syntax/create.js","../../css-tree/lib/convertor/create.js","../../css-tree/lib/syntax/node/AnPlusB.js","../../css-tree/lib/syntax/node/Atrule.js","../../css-tree/lib/syntax/node/AtrulePrelude.js","../../css-tree/lib/syntax/node/AttributeSelector.js","../../css-tree/lib/syntax/node/Block.js","../../css-tree/lib/syntax/node/Brackets.js","../../css-tree/lib/syntax/node/CDC.js","../../css-tree/lib/syntax/node/CDO.js","../../css-tree/lib/syntax/node/ClassSelector.js","../../css-tree/lib/syntax/node/Combinator.js","../../css-tree/lib/syntax/node/Comment.js","../../css-tree/lib/syntax/node/Condition.js","../../css-tree/lib/syntax/node/Declaration.js","../../css-tree/lib/syntax/node/DeclarationList.js","../../css-tree/lib/syntax/node/Dimension.js","../../css-tree/lib/syntax/node/Feature.js","../../css-tree/lib/syntax/node/FeatureFunction.js","../../css-tree/lib/syntax/node/FeatureRange.js","../../css-tree/lib/syntax/node/Function.js","../../css-tree/lib/syntax/node/GeneralEnclosed.js","../../css-tree/lib/syntax/node/Hash.js","../../css-tree/lib/syntax/node/Identifier.js","../../css-tree/lib/syntax/node/IdSelector.js","../../css-tree/lib/syntax/node/Layer.js","../../css-tree/lib/syntax/node/LayerList.js","../../css-tree/lib/syntax/node/MediaQuery.js","../../css-tree/lib/syntax/node/MediaQueryList.js","../../css-tree/lib/syntax/node/NestingSelector.js","../../css-tree/lib/syntax/node/Nth.js","../../css-tree/lib/syntax/node/Number.js","../../css-tree/lib/syntax/node/Operator.js","../../css-tree/lib/syntax/node/Parentheses.js","../../css-tree/lib/syntax/node/Percentage.js","../../css-tree/lib/syntax/node/PseudoClassSelector.js","../../css-tree/lib/syntax/node/PseudoElementSelector.js","../../css-tree/lib/syntax/node/Ratio.js","../../css-tree/lib/syntax/node/Raw.js","../../css-tree/lib/syntax/node/Rule.js","../../css-tree/lib/syntax/node/Scope.js","../../css-tree/lib/syntax/node/Selector.js","../../css-tree/lib/syntax/node/SelectorList.js","../../css-tree/lib/utils/string.js","../../css-tree/lib/syntax/node/String.js","../../css-tree/lib/syntax/node/StyleSheet.js","../../css-tree/lib/syntax/node/SupportsDeclaration.js","../../css-tree/lib/syntax/node/TypeSelector.js","../../css-tree/lib/syntax/node/UnicodeRange.js","../../css-tree/lib/utils/url.js","../../css-tree/lib/syntax/node/Url.js","../../css-tree/lib/syntax/node/Value.js","../../css-tree/lib/syntax/node/WhiteSpace.js","../../css-tree/lib/syntax/config/lexer.js","../../css-tree/dist/data.js","../../css-tree/lib/syntax/scope/default.js","../../css-tree/lib/syntax/scope/atrulePrelude.js","../../css-tree/lib/syntax/scope/selector.js","../../css-tree/lib/syntax/scope/value.js","../../css-tree/lib/syntax/function/expression.js","../../css-tree/lib/syntax/function/var.js","../../css-tree/lib/syntax/atrule/container.js","../../css-tree/lib/syntax/atrule/import.js","../../css-tree/lib/syntax/pseudo/index.js","../../css-tree/lib/syntax/index.js","../../css-tree/lib/syntax/config/parser.js","../../css-tree/lib/syntax/atrule/index.js","../../css-tree/lib/syntax/atrule/font-face.js","../../css-tree/lib/syntax/atrule/layer.js","../../css-tree/lib/syntax/atrule/media.js","../../css-tree/lib/syntax/atrule/nest.js","../../css-tree/lib/syntax/atrule/page.js","../../css-tree/lib/syntax/atrule/scope.js","../../css-tree/lib/syntax/atrule/starting-style.js","../../css-tree/lib/syntax/atrule/supports.js","../../css-tree/lib/syntax/config/walker.js","../../css-tree/lib/index.js","../src/browser/cssom/styleProperties.ts","../src/browser/cssom/createAstFromDeclaration.ts","../src/browser/cssom/createAstFromCssom.ts","../src/browser/cssom/createAstFromTextContent.ts","../src/browser/cssom/mergeRules.ts","../src/browser/noop.ts","../src/browser/getElementAttrSelector.ts","../src/browser/cssom/processInlineCss.ts","../src/browser/md5.ts","../src/browser/getUrlFromCssText.ts","../src/browser/extractResourcesFromStyle.ts","../src/browser/extractLinksFromElement.ts","../src/browser/extractResourceUrlsFromStyleAttrs.ts","../src/browser/cssom/styleSheetToCssText.ts","../src/browser/isInvisibleElement.ts","../src/browser/isScreenMediaQuery.ts","../src/browser/wrapHTMLElement.ts","../src/browser/domNodesToCdt.ts","../src/browser/cssom/processInlineStyleCss.ts","../src/browser/getInlineCssCacheKey.ts","../src/browser/uniq.ts","../src/browser/aggregateResourceUrlsAndBlobs.ts","../../../node_modules/pako/lib/utils/common.js","../../../node_modules/pako/lib/zlib/trees.js","../../../node_modules/pako/lib/zlib/adler32.js","../../../node_modules/pako/lib/zlib/crc32.js","../../../node_modules/pako/lib/zlib/deflate.js","../../../node_modules/pako/lib/zlib/messages.js","../../../node_modules/pako/lib/utils/strings.js","../../../node_modules/pako/lib/zlib/zstream.js","../../../node_modules/pako/lib/deflate.js","../../../node_modules/pako/lib/zlib/inftrees.js","../../../node_modules/pako/lib/zlib/inflate.js","../../../node_modules/pako/lib/zlib/inffast.js","../../../node_modules/pako/lib/zlib/constants.js","../../../node_modules/pako/lib/zlib/gzheader.js","../../../node_modules/pako/lib/inflate.js","../../../node_modules/pako/index.js","../src/browser/createBlob.ts","../src/browser/arrayBufferToBase64.ts","../src/browser/filterInlineUrl.ts","../src/browser/toUnAnchoredUri.ts","../src/browser/flat.ts","../src/browser/makeExtractResourcesFromSvg.ts","../src/browser/findStyleSheetByUrl.ts","../src/browser/sanitizeAuthUrl.ts","../src/browser/createTempStyleSheet.ts","../src/browser/getCorsFreeStyleSheet.ts","../src/browser/buildCanvasBlobs.ts","../src/browser/sessionCache.ts","../src/browser/processPage.ts","../src/browser/processPagePoll.ts","../src/browser/log.ts","../src/browser/extractResourcesFromStyleSheet.ts","../src/browser/extractResourceUrlsFromStyleTags.ts","../src/browser/extractResourceUrlsFromAdoptedStyleSheets.ts","../src/browser/fetchUrl.ts","../src/browser/processResource.ts","../src/browser/getResourceUrlsAndBlobs.ts","../src/browser/getBaseUrl.ts","../src/browser/generate-safe-selectors.ts","../src/browser/toUriEncoding.ts","../src/browser/buildBlobImages.ts","../src/browser/buildBlobVideos.ts"],"sourcesContent":["\"use strict\";\nfunction charCodeAt(string, index = 0) {\n    const code = string.charCodeAt(index);\n    // if the code of high word (16 bits) in this diapason the character encoded by two words\n    if (code >= 0xd800 && code < 0xdc00) {\n        const high = code;\n        const low = string.charCodeAt(index + 1);\n        // convert 2 utf16le words into integer code\n        return (high - 0xd800) * 0x400 + (low - 0xdc00) + 0x10000;\n    }\n    // diapason is reserved for surrogates, we can skip it\n    if (0xdc00 <= code && code <= 0xdfff)\n        return -1;\n    return code;\n}\nfunction chunkify(string, chunkByteLength) {\n    const chunks = [];\n    let currChunkByteLength = 0;\n    for (let index = 0; index < string.length; ++index) {\n        const code = charCodeAt(string, index);\n        let charByteLength = 0;\n        if (code > 0) {\n            if (code < 128)\n                charByteLength = 1;\n            else if (code < 2048)\n                charByteLength = 2;\n            else if (code < 65536)\n                charByteLength = 3;\n            else if (code < 2097152)\n                charByteLength = 4;\n            else if (code < 67108864)\n                charByteLength = 5;\n            else\n                charByteLength = 6;\n        }\n        if (currChunkByteLength + charByteLength > chunkByteLength) {\n            chunks.push(index);\n            currChunkByteLength = charByteLength;\n        }\n        else {\n            currChunkByteLength += charByteLength;\n        }\n    }\n    return chunks;\n}\nmodule.exports = chunkify;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nconst chunkify_1 = __importDefault(require(\"./chunkify\"));\nconst STATUSES = {\n    WIP: 'WIP',\n    SUCCESS: 'SUCCESS',\n    SUCCESS_CHUNKED: 'SUCCESS_CHUNKED',\n    ERROR: 'ERROR',\n};\nconst _DEFAULT_CHUNK_BYTE_LENGTH = 268435456; // 256MB\nfunction createPollResponse(state, { chunkByteLength = 0 } = {}) {\n    if (!state) {\n        return {\n            status: STATUSES.ERROR,\n            error: 'unexpected poll request received - cannot find state of current operation',\n        };\n    }\n    else if (state.value) {\n        if (chunkByteLength) {\n            if (!state.chunks) {\n                try {\n                    const stringified = JSON.stringify(state.value);\n                    state.chunks = (0, chunkify_1.default)(stringified, chunkByteLength);\n                    if (state.chunks.length > 0) {\n                        state.from = 0;\n                        state.value = stringified;\n                    }\n                }\n                catch (e) {\n                    return { status: STATUSES.ERROR, error: e.message };\n                }\n            }\n            if (state.from >= 0) {\n                return {\n                    status: STATUSES.SUCCESS_CHUNKED,\n                    value: state.value.substring(state.from, (state.from = state.chunks.shift())),\n                    done: !state.from,\n                };\n            }\n        }\n        return { status: STATUSES.SUCCESS, value: state.value };\n    }\n    else if (state.error) {\n        return { status: STATUSES.ERROR, error: state.error };\n    }\n    else {\n        return { status: STATUSES.WIP };\n    }\n}\nfunction poll(context, key, options = {}) {\n    context = context || {};\n    const result = createPollResponse(context[key], options);\n    if (result.status === STATUSES.SUCCESS ||\n        result.status === STATUSES.ERROR ||\n        (result.status === STATUSES.SUCCESS_CHUNKED && result.done)) {\n        delete context[key];\n    }\n    return result;\n}\nmodule.exports = poll;\n","\"use strict\";\nconst poll = require(\"./poll\");\nfunction pollify(script, context, key) {\n    return (options) => function (...args) {\n        if (!context[key]) {\n            context[key] = {};\n            Promise.resolve()\n                .then(() => script(...args))\n                .then(value => (context[key].value = value))\n                .catch(err => (context[key].error = err.message + '\\nStack:' + err.stack));\n        }\n        return poll(context, key, options);\n    };\n}\nmodule.exports = pollify;\n","\"use strict\";\nfunction isAbsoluteUrl(url) {\n    try {\n        new URL(url);\n        return true;\n    }\n    catch (err) {\n        return false;\n    }\n}\nfunction absolutizeUrl(url, baseUrl) {\n    if (isAbsoluteUrl(url))\n        return url;\n    let isEncoded = true;\n    try {\n        isEncoded = url !== decodeURI(url);\n    }\n    catch (err) {\n        isEncoded = true;\n    }\n    try {\n        const absoluteUrl = new URL(url, baseUrl).href;\n        return !isEncoded ? decodeURI(absoluteUrl) : absoluteUrl;\n    }\n    catch (err) {\n        return !isEncoded ? decodeURI(url) : url;\n    }\n}\nmodule.exports = absolutizeUrl;\n","\"use strict\";\nfunction isInlineFrame(frame) {\n    return (frame.contentDocument &&\n        frame.contentDocument.location &&\n        !/^https?:$/.test(frame.contentDocument.location.protocol));\n}\nmodule.exports = isInlineFrame;\n","\"use strict\";\nfunction isAccessibleFrame(frame) {\n    try {\n        const doc = frame.contentDocument;\n        return Boolean(doc && doc.defaultView && doc.defaultView.frameElement);\n    }\n    catch (err) {\n        return false;\n    }\n}\nmodule.exports = isAccessibleFrame;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isAccessibleFrame = exports.isInlineFrame = exports.absolutizeUrl = exports.poll = exports.pollify = exports.chunkify = void 0;\nconst chunkify_1 = __importDefault(require(\"./chunkify\"));\nexports.chunkify = chunkify_1.default;\nconst pollify_1 = __importDefault(require(\"./pollify\"));\nexports.pollify = pollify_1.default;\nconst poll_1 = __importDefault(require(\"./poll\"));\nexports.poll = poll_1.default;\nconst absolutizeUrl_1 = __importDefault(require(\"./browser/absolutizeUrl\"));\nexports.absolutizeUrl = absolutizeUrl_1.default;\nconst isInlineFrame_1 = __importDefault(require(\"./browser/isInlineFrame\"));\nexports.isInlineFrame = isInlineFrame_1.default;\nconst isAccessibleFrame_1 = __importDefault(require(\"./browser/isAccessibleFrame\"));\nexports.isAccessibleFrame = isAccessibleFrame_1.default;\n",null,"exports.addElementIds=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=t&&t[0]||null;return!e||(\"isConnected\"in window.Node.prototype?!e.isConnected:document.documentElement.contains?!document.documentElement.contains(e):!e.ownerDocument.documentElement.contains(e))},r=e;var o=function(t){if(!t.hasAttribute(\"data-applitools-fallback-selector\")){if(r([t]))throw new Error(\"The element is not connected to the DOM: \"+function(t){var e=t.attributes,r=t.tagName,o=t.children.length,n=[].slice.call(e).map((function(t){return t.name+'=\"'+t.value+'\"'})).join(\" \");return\"<\"+r+\" \"+n+(o?\">\":\"/>\")}(t));t.setAttribute(\"data-applitools-fallback-selector\",function(t){var e=[];for(;t&&t.nodeType===Node.ELEMENT_NODE;)try{var r,o=t.tagName.toLowerCase(),n=[].slice.call((null==(r=t.parentNode)?void 0:r.children)||[]).indexOf(t);n>-1&&(o+=\":nth-child(\"+(n+1)+\")\"),e.unshift(o),t=t.parentNode}catch(t){break}return e.length?e.join(\" > \"):\"html\"}(t))}},n=e;function a(t,e){if(n([t])){var r=function(t){if(null==t||!t.getAttribute)return{error:\"invalid element: \"+JSON.stringify(t)};var e=t.getAttribute(\"data-applitools-fallback-selector\");return e}(t);if(!r)return{error:\"Failed to recover from stale element\"};if(r.error)return r;var l=document.querySelectorAll(r);if(!l||1!==l.length)return{error:\"Failed to recover from stale element - selector found: \"+r};var i=l[0];return i.setAttribute(\"data-applitools-selector\",e),i.setAttribute(\"data-applitools-recovered\",!0),a(i,e)}o(t);var u=t.getAttribute(\"data-applitools-selector\"),c=u?u+\" \"+e:e;return t.setAttribute(\"data-applitools-selector\",c),'[data-applitools-selector~=\"'+e+'\"]'}return t((function(t){return t.map((function(t){var e=t[0],r=t[1];return e.map((function(t){var e=function(t){var e=[t];if(t.getRootNode)for(var r=t.getRootNode();r!==document&&r.constructor&&\"ShadowRoot\"===r.constructor.name;r=r.host.getRootNode())e.push(r.host);return e}(t);return e.map((function(t){return a(t,r)}))}))}))}))}();\nreturn s(arg)\n}\nexports.addFallbackSelectorIfNeeded=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=t&&t[0]||null;return!e||(\"isConnected\"in window.Node.prototype?!e.isConnected:document.documentElement.contains?!document.documentElement.contains(e):!e.ownerDocument.documentElement.contains(e))};return t((function(t){if(!t.hasAttribute(\"data-applitools-fallback-selector\")){if(e([t]))throw new Error(\"The element is not connected to the DOM: \"+function(t){var e=t.attributes,n=t.tagName,o=t.children.length,r=[].slice.call(e).map((function(t){return t.name+'=\"'+t.value+'\"'})).join(\" \");return\"<\"+n+\" \"+r+(o?\">\":\"/>\")}(t));t.setAttribute(\"data-applitools-fallback-selector\",function(t){var e=[];for(;t&&t.nodeType===Node.ELEMENT_NODE;)try{var n,o=t.tagName.toLowerCase(),r=[].slice.call((null==(n=t.parentNode)?void 0:n.children)||[]).indexOf(t);r>-1&&(o+=\":nth-child(\"+(r+1)+\")\"),e.unshift(o),t=t.parentNode}catch(t){break}return e.length?e.join(\" > \"):\"html\"}(t))}}))}();\nreturn s(arg)\n}\nexports.addPageMarker=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=void 0===t?[]:t,r=e[0],o=e[1],n=Object.keys(o).sort(),a=n.reduce((function(t,e){return t[e]={value:r.style.getPropertyValue(e),important:Boolean(r.style.getPropertyPriority(e))},t}),{});return n.forEach((function(t){r.style.setProperty(t,\"string\"!=typeof o[t]&&o[t]?o[t].value:o[t],o[t]&&o[t].important?\"important\":\"\")})),a};return t((function(t){var r=t[0],o=r.mask,n=r.size,a=void 0===n?1:n,i={1:\"rgb(0, 0, 0)\",0:\"rgb(255, 255, 255)\"},s=a,p=document.createElement(\"div\");p.setAttribute(\"data-applitools-marker\",\"\"),p.style.setProperty(\"position\",\"fixed\",\"important\"),p.style.setProperty(\"top\",\"0\",\"important\"),p.style.setProperty(\"left\",\"0\",\"important\"),p.style.setProperty(\"box-sizing\",\"content-box\",\"important\"),p.style.setProperty(\"padding\",s+\"px\",\"important\"),p.style.setProperty(\"background\",\"rgb(128, 128, 128)\",\"important\"),p.style.setProperty(\"z-index\",\"2147483647\",\"important\");for(var l,y=0;y<o.length;y+=l){for(l=1;o[y]===o[y+l];)++l;var m=o[y],d=document.createElement(\"div\");d.style.setProperty(\"display\",\"block\",\"important\"),d.style.setProperty(\"float\",\"left\",\"important\"),d.style.setProperty(\"width\",l*a+\"px\",\"important\"),d.style.setProperty(\"height\",a+\"px\",\"important\"),d.style.setProperty(\"background\",i[m],\"important\"),p.appendChild(d)}var u={value:\"none\",important:!0},c=e([document.documentElement,{transform:u,\"-webkit-transform\":u}]),f=e([document.body,{transform:u,\"-webkit-transform\":u}]);return document.documentElement.setAttribute(\"data-applitools-original-transforms\",JSON.stringify(c)),document.body.setAttribute(\"data-applitools-original-transforms\",JSON.stringify(f)),document.body.appendChild(p),{mask:o,size:a,offset:s}}))}();\nreturn s(arg)\n}\nexports.blurElement=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var e=(void 0===t?[]:t)[0]||document.activeElement;return e&&e.blur(),e}))}();\nreturn s(arg)\n}\nexports.cleanupElementIds=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){(t=t&&t[0])&&\"function\"==typeof t.forEach&&t.forEach((function(t){if(t.removeAttribute(\"data-applitools-selector\"),t.getRootNode)try{for(var o=t.getRootNode();o!==document&&o.constructor&&\"ShadowRoot\"===o.constructor.name;o=o.host.getRootNode())o.host.removeAttribute(\"data-applitools-selector\")}catch(t){}}))}))}();\nreturn s(arg)\n}\nexports.cleanupPageMarker=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=void 0===t?[]:t,r=e[0],o=e[1],n=Object.keys(o).sort(),a=n.reduce((function(t,e){return t[e]={value:r.style.getPropertyValue(e),important:Boolean(r.style.getPropertyPriority(e))},t}),{});return n.forEach((function(t){r.style.setProperty(t,\"string\"!=typeof o[t]&&o[t]?o[t].value:o[t],o[t]&&o[t].important?\"important\":\"\")})),a};return t((function(){var t=document.querySelector(\"[data-applitools-marker]\");t&&document.body.removeChild(t);var r=document.documentElement.getAttribute(\"data-applitools-original-transforms\"),o=document.body.getAttribute(\"data-applitools-original-transforms\");r&&e([document.documentElement,JSON.parse(r)]),o&&e([document.body,JSON.parse(o)])}))}();\nreturn s(arg)\n}\nexports.focusElement=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var e=(void 0===t?[]:t)[0];e&&e.focus()}))}();\nreturn s(arg)\n}\nexports.getChildFramesInfo=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(){return function t(r){r=r||document;var e=[];r.querySelectorAll(\"frame, iframe\").forEach((function(t){return e.push([t,!t.contentDocument,t.src])}));var n=Array.prototype.filter.call(r.querySelectorAll(\"*\"),(function(t){return t.shadowRoot})).map((function(r){return t(r.shadowRoot)}));return e.concat.apply(e,n)}()}))}();\nreturn s(arg)\n}\nexports.getContextInfo=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=(void 0===t?[]:t)[0],n=\"\",r=e.ownerDocument;if(!r)return n;for(var o=e;o!==r;){var a=Array.prototype.filter.call(o.parentNode.childNodes,(function(t){return t.tagName===o.tagName})).indexOf(o);n=\"/\"+o.tagName+\"[\"+(a+1)+\"]\"+n,o=o.parentNode}return n};return t((function(){var t,n,r;try{t=window.top.document===window.document||\"root-context\"===window.parent.document[\"applitools-marker\"]}catch(e){t=!1}try{n=!window.parent.document===window.document}catch(t){n=!0}if(!n)try{r=e([window.frameElement])}catch(t){r=null}return[document.documentElement,r,t,n]}))}();\nreturn s(arg)\n}\nexports.getDocumentScrollingElement=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(){var t=\"HTML\",e=document.scrollingElement;return e&&(t=e.tagName),t.toLowerCase()}))}();\nreturn s(arg)\n}\nexports.getDocumentSize=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(){var t=document.documentElement.scrollWidth,e=document.documentElement.scrollHeight,n=document.documentElement.clientHeight,o=document.body.scrollWidth,c=document.body.scrollHeight,u=document.body.clientHeight;return{width:Math.max(t,o),height:Math.max(n,e,u,c)}}))}();\nreturn s(arg)\n}\nexports.getElementComputedStyleProperties=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var e=void 0===t?[]:t,r=e[0],n=e[1],u=void 0===n?[]:n,o=window.getComputedStyle(r);return o?u.map((function(t){return o.getPropertyValue(t)})):[]}))}();\nreturn s(arg)\n}\nexports.getElementContentSize=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=void 0===t?[]:t,r=e[0],o=e[1],n=Object.keys(o).sort(),a=n.reduce((function(t,e){return t[e]={value:r.style.getPropertyValue(e),important:Boolean(r.style.getPropertyPriority(e))},t}),{});return n.forEach((function(t){r.style.setProperty(t,\"string\"!=typeof o[t]&&o[t]?o[t].value:o[t],o[t]&&o[t].important?\"important\":\"\")})),a},r=function(){var t=\"HTML\",e=document.scrollingElement;return e&&(t=e.tagName),t.toLowerCase()};return t((function(t){var o,n=(void 0===t?[]:t)[0];n!==document.documentElement&&n.tagName.toLowerCase()!==r()||(o=e([n,{transform:\"none\"}]));var a={width:n.scrollWidth,height:n.scrollHeight};return o&&e([n,o]),a}))}();\nreturn s(arg)\n}\nexports.getElementFixedAncestor=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){for(var e=(void 0===t?[]:t)[0];e.offsetParent&&e.offsetParent!==document.body&&e.offsetParent!==document.documentElement;)e=e.offsetParent;return\"fixed\"===window.getComputedStyle(e).getPropertyValue(\"position\")?e:null}))}();\nreturn s(arg)\n}\nexports.getElementInnerOffset=function(arg){\nvar s=function(){\"use strict\";function r(r){return r&&r.__esModule&&Object.prototype.hasOwnProperty.call(r,\"default\")?r.default:r}var t=function(r){var t=void 0===r?[]:r,e=t[0],o=t[1];return(void 0===o?[]:o).reduce((function(r,t){return r[t]={value:e.style.getPropertyValue(t),important:Boolean(e.style.getPropertyPriority(t))},r}),{})};var e=function(r){var t=(void 0===r?[]:r)[0];return t?{x:t.scrollLeft,y:t.scrollTop}:{x:window.scrollX||window.pageXOffset,y:window.scrollY||window.pageYOffset}},o=function(r){var e=(void 0===r?[]:r)[0],o=void 0===e?document.documentElement:e,n=t([o,[\"transform\",\"-webkit-transform\"]]),u=Object.keys(n).reduce((function(r,t){var e=n[t].value;if(e){var o=e.match(/^translate\\s*\\(\\s*(\\-?[\\d, \\.]+)px\\s*(,\\s*(-?[\\d, \\.]+)px)?\\s*\\)/);if(o){var u=o[1],a=void 0!==o[3]?o[3]:0;r.push({x:Math.round(-parseFloat(u)),y:Math.round(-parseFloat(a))})}else r.push({x:0,y:0})}return r}),[]);if(!u.every((function(r){return u[0].x===r.x||u[0].y===r.y})))throw new Error(\"Got different css positions!\");return u[0]||{x:0,y:0}};return r((function(r){var t=(void 0===r?[]:r)[0],n=e([t]),u=o([t]);return{x:n.x+u.x,y:n.y+u.y}}))}();\nreturn s(arg)\n}\nexports.getElementProperties=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var r=void 0===t?[]:t,e=r[0],n=r[1];return(void 0===n?[]:n).reduce((function(t,r){return t[r]=e[r],t}),{})}))}();\nreturn s(arg)\n}\nexports.getElementRect=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=void 0===t?[]:t,r=e[0],o=e[1];return(void 0===o?[]:o).reduce((function(t,e){return t[e]={value:r.style.getPropertyValue(e),important:Boolean(r.style.getPropertyPriority(e))},t}),{})};var r=function(t){var e=(void 0===t?[]:t)[0];return e?{x:e.scrollLeft,y:e.scrollTop}:{x:window.scrollX||window.pageXOffset,y:window.scrollY||window.pageYOffset}},o=function(t){var r=(void 0===t?[]:t)[0],o=void 0===r?document.documentElement:r,n=e([o,[\"transform\",\"-webkit-transform\"]]),i=Object.keys(n).reduce((function(t,e){var r=n[e].value;if(r){var o=r.match(/^translate\\s*\\(\\s*(\\-?[\\d, \\.]+)px\\s*(,\\s*(-?[\\d, \\.]+)px)?\\s*\\)/);if(o){var i=o[1],a=void 0!==o[3]?o[3]:0;t.push({x:Math.round(-parseFloat(i)),y:Math.round(-parseFloat(a))})}else t.push({x:0,y:0})}return t}),[]);if(!i.every((function(t){return i[0].x===t.x||i[0].y===t.y})))throw new Error(\"Got different css positions!\");return i[0]||{x:0,y:0}};var n=function(t){for(var e=(void 0===t?[]:t)[0];e.offsetParent&&e.offsetParent!==document.body&&e.offsetParent!==document.documentElement;)e=e.offsetParent;return\"fixed\"===window.getComputedStyle(e).getPropertyValue(\"position\")?e:null},i=function(t){var e=(void 0===t?[]:t)[0],n=r([e]),i=o([e]);return{x:n.x+i.x,y:n.y+i.y}},a=function(){var t=\"HTML\",e=document.scrollingElement;return e&&(t=e.tagName),t.toLowerCase()};return t((function(t){var e=void 0===t?[]:t,r=e[0],o=e[1],u=void 0!==o&&o;if(r===document.documentElement||r.tagName.toLowerCase()===a())return{x:0,y:0,width:r.clientWidth,height:r.clientHeight};var d=r.getBoundingClientRect(),l={x:d.left,y:d.top,width:d.width,height:d.height};if(u){var f=window.getComputedStyle(r);l.x+=parseInt(f.getPropertyValue(\"border-left-width\")),l.y+=parseInt(f.getPropertyValue(\"border-top-width\")),l.width=r.clientWidth,l.height=r.clientHeight}var s=n([r]);if(s){if(s!==r){var c=i([s]);l.x+=c.x,l.y+=c.y}}else{var v=i();l.x+=v.x,l.y+=v.y}return l}))}();\nreturn s(arg)\n}\nexports.getElementScrollOffset=function(arg){\nvar s=function(){\"use strict\";function o(o){return o&&o.__esModule&&Object.prototype.hasOwnProperty.call(o,\"default\")?o.default:o}return o((function(o){var t=(void 0===o?[]:o)[0];return t?{x:t.scrollLeft,y:t.scrollTop}:{x:window.scrollX||window.pageXOffset,y:window.scrollY||window.pageYOffset}}))}();\nreturn s(arg)\n}\nexports.getElementStyleProperties=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var e=void 0===t?[]:t,r=e[0],o=e[1];return(void 0===o?[]:o).reduce((function(t,e){return t[e]={value:r.style.getPropertyValue(e),important:Boolean(r.style.getPropertyPriority(e))},t}),{})}))}();\nreturn s(arg)\n}\nexports.getElementTranslateOffset=function(arg){\nvar s=function(){\"use strict\";function r(r){return r&&r.__esModule&&Object.prototype.hasOwnProperty.call(r,\"default\")?r.default:r}var t=function(r){var t=void 0===r?[]:r,e=t[0],n=t[1];return(void 0===n?[]:n).reduce((function(r,t){return r[t]={value:e.style.getPropertyValue(t),important:Boolean(e.style.getPropertyPriority(t))},r}),{})};return r((function(r){var e=(void 0===r?[]:r)[0],n=void 0===e?document.documentElement:e,o=t([n,[\"transform\",\"-webkit-transform\"]]),u=Object.keys(o).reduce((function(r,t){var e=o[t].value;if(e){var n=e.match(/^translate\\s*\\(\\s*(\\-?[\\d, \\.]+)px\\s*(,\\s*(-?[\\d, \\.]+)px)?\\s*\\)/);if(n){var u=n[1],a=void 0!==n[3]?n[3]:0;r.push({x:Math.round(-parseFloat(u)),y:Math.round(-parseFloat(a))})}else r.push({x:0,y:0})}return r}),[]);if(!u.every((function(r){return u[0].x===r.x||u[0].y===r.y})))throw new Error(\"Got different css positions!\");return u[0]||{x:0,y:0}}))}();\nreturn s(arg)\n}\nexports.getElementXpath=function(arg){\nvar s=function(){\"use strict\";function e(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,\"default\")?e.default:e}return e((function(e){var r=(void 0===e?[]:e)[0],t=\"\",n=r.ownerDocument;if(!n)return t;for(var a=r;a!==n;){var o=Array.prototype.filter.call(a.parentNode.childNodes,(function(e){return e.tagName===a.tagName})).indexOf(a);t=\"/\"+a.tagName+\"[\"+(o+1)+\"]\"+t,a=a.parentNode}return t}))}();\nreturn s(arg)\n}\nexports.getShadowRoot=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){return(void 0===t?[]:t)[0].shadowRoot}))}();\nreturn s(arg)\n}\nexports.getText=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){return t[0].innerText}))}();\nreturn s(arg)\n}\nexports.getUserAgent=function(arg){\nvar s=function(){\"use strict\";function n(n){return n&&n.__esModule&&Object.prototype.hasOwnProperty.call(n,\"default\")?n.default:n}function t(){return t=Object.assign?Object.assign.bind():function(n){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var e in r)({}).hasOwnProperty.call(r,e)&&(n[e]=r[e])}return n},t.apply(null,arguments)}var r=\"__EYES__APPLITOOLS__\",e=\"userAgent\";return window[r]=window[r]||{},n((function(){try{if(window[r][e]){var n=window[r][e];return\"WIP\"!==n.status&&delete window[r][e],JSON.stringify(n)}return window.navigator.userAgentData?(window[r][e]={status:\"WIP\"},window.navigator.userAgentData.getHighEntropyValues([\"brands\",\"platform\",\"platformVersion\",\"model\"]).then((function(n){window[r][e]={status:\"SUCCESS\",value:t({legacy:window.navigator.userAgent},n)}})).catch((function(n){window[r][e]={status:\"ERROR\",error:n.message}}))):window[r][e]={status:\"SUCCESS\",value:window.navigator.userAgent},JSON.stringify(window[r][e])}catch(n){return window[r][e]={status:\"ERROR\",error:n.message},JSON.stringify(window[r][e])}}))}();\nreturn s(arg)\n}\nexports.getViewport=function(arg){\nvar s=function(){\"use strict\";function e(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,\"default\")?e.default:e}return e((function(){var e,n=0,t=0;return window.innerHeight?t=window.innerHeight:document.documentElement&&document.documentElement.clientHeight?t=document.documentElement.clientHeight:document.body&&document.body.clientHeight&&(t=document.body.clientHeight),window.innerWidth?n=window.innerWidth:document.documentElement&&document.documentElement.clientWidth?n=document.documentElement.clientWidth:document.body&&document.body.clientWidth&&(n=document.body.clientWidth),window.screen&&window.screen.orientation?e=window.screen.orientation.type.replace(/-primary$/,\"\"):null!=window.orientation&&(0===window.orientation?e=\"portrait\":180===window.orientation?e=\"portrait-secondary\":90===window.orientation?e=\"landscape\":-90===window.orientation&&(e=\"landscape-secondary\")),{viewportSize:{width:n,height:t},pixelRatio:window.devicePixelRatio,viewportScale:window.visualViewport&&window.visualViewport.scale,orientation:e}}))}();\nreturn s(arg)\n}\nexports.isElementScrollable=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var e=function(t){var e=void 0===t?[]:t,o=e[0],r=e[1],n=void 0===r?[]:r,l=window.getComputedStyle(o);return l?n.map((function(t){return l.getPropertyValue(t)})):[]};return t((function(t){var o=(void 0===t?[]:t)[0],r=e([o,[\"overflow-x\",\"overflow-y\",\"overflow\"]]);return(\"scroll\"===r[0]||\"auto\"===r[0]||\"hidden\"===r[2])&&o.scrollWidth>o.clientWidth||(\"scroll\"===r[1]||\"auto\"===r[1]||\"hidden\"===r[2])&&o.scrollHeight>o.clientHeight}))}();\nreturn s(arg)\n}\nexports.isEqualElements=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var r=void 0===t?[]:t;return r[0]===r[1]}))}();\nreturn s(arg)\n}\nexports.isStaleElement=function(arg){\nvar s=function(){\"use strict\";function n(n){return n&&n.__esModule&&Object.prototype.hasOwnProperty.call(n,\"default\")?n.default:n}return n((function(n){var e=n&&n[0]||null;return!e||(\"isConnected\"in window.Node.prototype?!e.isConnected:document.documentElement.contains?!document.documentElement.contains(e):!e.ownerDocument.documentElement.contains(e))}))}();\nreturn s(arg)\n}\nexports.lazyLoad=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var o=function(t){var o=(void 0===t?[]:t)[0];return o?{x:o.scrollLeft,y:o.scrollTop}:{x:window.scrollX||window.pageXOffset,y:window.scrollY||window.pageYOffset}};var r=function(t){var o=void 0===t?[]:t,r=o[0],n=o[1],e=Object.keys(n).sort(),i=e.reduce((function(t,o){return t[o]={value:r.style.getPropertyValue(o),important:Boolean(r.style.getPropertyPriority(o))},t}),{});return e.forEach((function(t){r.style.setProperty(t,\"string\"!=typeof n[t]&&n[t]?n[t].value:n[t],n[t]&&n[t].important?\"important\":\"\")})),i};var n=function(t){var o=void 0===t?[]:t,n=o[0],e=o[1];n=n||document.documentElement;var i=r([n,{\"scroll-behavior\":{value:\"auto\",important:!0}}]);return n.scrollTo?n.scrollTo(e.x,e.y):(n.scrollLeft=e.x,n.scrollTop=e.y),r([n,i]),{x:n.scrollLeft,y:n.scrollTop}},e=\"__EYES__APPLITOOLS__\",i=\"lazyLoadResult\";window[e]=window[e]||{};var l=o,a=n;return t((function(t){var o=void 0===t?[]:t,r=o[0],n=o[1],s=void 0===n?{}:n,u=s.scrollLength,c=s.waitingTime,w=s.maxAmountToScroll;try{if(window[e][i]){var d=window[e][i];return\"WIP\"!==d.status&&delete window[e][i],JSON.stringify(d)}window[e][i]={status:\"WIP\"};var v=l(),y=[];y.push({maxAmountToScroll:w,scrollLength:u,waitingTime:c,startingScrollPositionX:v.x,startingScrollPositionY:v.y});var f=Date.now();return function t(o){var n=void 0===o?{}:o,l=n.doneScrolling,s=n.previousScrollResult,d=void 0===s?{}:s;setTimeout((function(){try{if(l){var o=a([r,v]),n=o.x,s=o.y;return y.push({x:n,y:s,msSinceStart:Date.now()-f}),void(window[e][i]={status:\"SUCCESS\",value:y})}var c=a([r,{x:v.x,y:d.y+u}]),p=c.x,S=c.y;y.push({x:p,y:S,msSinceStart:Date.now()-f}),t({doneScrolling:S===d.y||S===w,previousScrollResult:{x:p,y:S}})}catch(t){window[e][i]={status:\"ERROR\",error:t}}}),c)}(),JSON.stringify(window[e][i])}catch(t){return window[e][i]={status:\"ERROR\",error:t},JSON.stringify(window[e][i])}}))}();\nreturn s(arg)\n}\nexports.reloadPage=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(){window.location.reload()}))}();\nreturn s(arg)\n}\nexports.scrollTo=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var r=function(t){var r=void 0===t?[]:t,o=r[0],e=r[1],l=Object.keys(e).sort(),n=l.reduce((function(t,r){return t[r]={value:o.style.getPropertyValue(r),important:Boolean(o.style.getPropertyPriority(r))},t}),{});return l.forEach((function(t){o.style.setProperty(t,\"string\"!=typeof e[t]&&e[t]?e[t].value:e[t],e[t]&&e[t].important?\"important\":\"\")})),n};return t((function(t){var o=void 0===t?[]:t,e=o[0],l=o[1];e=e||document.documentElement;var n=r([e,{\"scroll-behavior\":{value:\"auto\",important:!0}}]);return e.scrollTo?e.scrollTo(l.x,l.y):(e.scrollLeft=l.x,e.scrollTop=l.y),r([e,n]),{x:e.scrollLeft,y:e.scrollTop}}))}();\nreturn s(arg)\n}\nexports.setElementAttributes=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var e=void 0===t?[]:t,r=e[0],u=e[1];return Object.keys(u).reduce((function(t,e){return t[e]=r.getAttribute(e),r.setAttribute(e,u[e]),t}),{})}))}();\nreturn s(arg)\n}\nexports.setElementStyleProperties=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}return t((function(t){var e=void 0===t?[]:t,r=e[0],o=e[1],n=Object.keys(o).sort(),u=n.reduce((function(t,e){return t[e]={value:r.style.getPropertyValue(e),important:Boolean(r.style.getPropertyPriority(e))},t}),{});return n.forEach((function(t){r.style.setProperty(t,\"string\"!=typeof o[t]&&o[t]?o[t].value:o[t],o[t]&&o[t].important?\"important\":\"\")})),u}))}();\nreturn s(arg)\n}\nexports.translateTo=function(arg){\nvar s=function(){\"use strict\";function t(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}var r=function(t){var r=void 0===t?[]:t,e=r[0],n=r[1],o=Object.keys(n).sort(),a=o.reduce((function(t,r){return t[r]={value:e.style.getPropertyValue(r),important:Boolean(e.style.getPropertyPriority(r))},t}),{});return o.forEach((function(t){e.style.setProperty(t,\"string\"!=typeof n[t]&&n[t]?n[t].value:n[t],n[t]&&n[t].important?\"important\":\"\")})),a};return t((function(t){var e=void 0===t?[]:t,n=e[0],o=e[1];n=n||document.documentElement;var a={value:\"translate(\"+-o.x+\"px, \"+-o.y+\"px)\",important:!0};return r([n,{transform:a,\"-webkit-transform\":a}]),o}))}();\nreturn s(arg)\n}",null,null,"// CSS Syntax Module Level 3\n// https://www.w3.org/TR/css-syntax-3/\nexport const EOF = 0;                 // <EOF-token>\nexport const Ident = 1;               // <ident-token>\nexport const Function = 2;            // <function-token>\nexport const AtKeyword = 3;           // <at-keyword-token>\nexport const Hash = 4;                // <hash-token>\nexport const String = 5;              // <string-token>\nexport const BadString = 6;           // <bad-string-token>\nexport const Url = 7;                 // <url-token>\nexport const BadUrl = 8;              // <bad-url-token>\nexport const Delim = 9;               // <delim-token>\nexport const Number = 10;             // <number-token>\nexport const Percentage = 11;         // <percentage-token>\nexport const Dimension = 12;          // <dimension-token>\nexport const WhiteSpace = 13;         // <whitespace-token>\nexport const CDO = 14;                // <CDO-token>\nexport const CDC = 15;                // <CDC-token>\nexport const Colon = 16;              // <colon-token>     :\nexport const Semicolon = 17;          // <semicolon-token> ;\nexport const Comma = 18;              // <comma-token>     ,\nexport const LeftSquareBracket = 19;  // <[-token>\nexport const RightSquareBracket = 20; // <]-token>\nexport const LeftParenthesis = 21;    // <(-token>\nexport const RightParenthesis = 22;   // <)-token>\nexport const LeftCurlyBracket = 23;   // <{-token>\nexport const RightCurlyBracket = 24;  // <}-token>\nexport const Comment = 25;\n","const EOF = 0;\n\n// https://drafts.csswg.org/css-syntax-3/\n// § 4.2. Definitions\n\n// digit\n// A code point between U+0030 DIGIT ZERO (0) and U+0039 DIGIT NINE (9).\nexport function isDigit(code) {\n    return code >= 0x0030 && code <= 0x0039;\n}\n\n// hex digit\n// A digit, or a code point between U+0041 LATIN CAPITAL LETTER A (A) and U+0046 LATIN CAPITAL LETTER F (F),\n// or a code point between U+0061 LATIN SMALL LETTER A (a) and U+0066 LATIN SMALL LETTER F (f).\nexport function isHexDigit(code) {\n    return (\n        isDigit(code) || // 0 .. 9\n        (code >= 0x0041 && code <= 0x0046) || // A .. F\n        (code >= 0x0061 && code <= 0x0066)    // a .. f\n    );\n}\n\n// uppercase letter\n// A code point between U+0041 LATIN CAPITAL LETTER A (A) and U+005A LATIN CAPITAL LETTER Z (Z).\nexport function isUppercaseLetter(code) {\n    return code >= 0x0041 && code <= 0x005A;\n}\n\n// lowercase letter\n// A code point between U+0061 LATIN SMALL LETTER A (a) and U+007A LATIN SMALL LETTER Z (z).\nexport function isLowercaseLetter(code) {\n    return code >= 0x0061 && code <= 0x007A;\n}\n\n// letter\n// An uppercase letter or a lowercase letter.\nexport function isLetter(code) {\n    return isUppercaseLetter(code) || isLowercaseLetter(code);\n}\n\n// non-ASCII code point\n// A code point with a value equal to or greater than U+0080 <control>.\nexport function isNonAscii(code) {\n    return code >= 0x0080;\n}\n\n// name-start code point\n// A letter, a non-ASCII code point, or U+005F LOW LINE (_).\nexport function isNameStart(code) {\n    return isLetter(code) || isNonAscii(code) || code === 0x005F;\n}\n\n// name code point\n// A name-start code point, a digit, or U+002D HYPHEN-MINUS (-).\nexport function isName(code) {\n    return isNameStart(code) || isDigit(code) || code === 0x002D;\n}\n\n// non-printable code point\n// A code point between U+0000 NULL and U+0008 BACKSPACE, or U+000B LINE TABULATION,\n// or a code point between U+000E SHIFT OUT and U+001F INFORMATION SEPARATOR ONE, or U+007F DELETE.\nexport function isNonPrintable(code) {\n    return (\n        (code >= 0x0000 && code <= 0x0008) ||\n        (code === 0x000B) ||\n        (code >= 0x000E && code <= 0x001F) ||\n        (code === 0x007F)\n    );\n}\n\n// newline\n// U+000A LINE FEED. Note that U+000D CARRIAGE RETURN and U+000C FORM FEED are not included in this definition,\n// as they are converted to U+000A LINE FEED during preprocessing.\n// TODO: we doesn't do a preprocessing, so check a code point for U+000D CARRIAGE RETURN and U+000C FORM FEED\nexport function isNewline(code) {\n    return code === 0x000A || code === 0x000D || code === 0x000C;\n}\n\n// whitespace\n// A newline, U+0009 CHARACTER TABULATION, or U+0020 SPACE.\nexport function isWhiteSpace(code) {\n    return isNewline(code) || code === 0x0020 || code === 0x0009;\n}\n\n// § 4.3.8. Check if two code points are a valid escape\nexport function isValidEscape(first, second) {\n    // If the first code point is not U+005C REVERSE SOLIDUS (\\), return false.\n    if (first !== 0x005C) {\n        return false;\n    }\n\n    // Otherwise, if the second code point is a newline or EOF, return false.\n    if (isNewline(second) || second === EOF) {\n        return false;\n    }\n\n    // Otherwise, return true.\n    return true;\n}\n\n// § 4.3.9. Check if three code points would start an identifier\nexport function isIdentifierStart(first, second, third) {\n    // Look at the first code point:\n\n    // U+002D HYPHEN-MINUS\n    if (first === 0x002D) {\n        // If the second code point is a name-start code point or a U+002D HYPHEN-MINUS,\n        // or the second and third code points are a valid escape, return true. Otherwise, return false.\n        return (\n            isNameStart(second) ||\n            second === 0x002D ||\n            isValidEscape(second, third)\n        );\n    }\n\n    // name-start code point\n    if (isNameStart(first)) {\n        // Return true.\n        return true;\n    }\n\n    // U+005C REVERSE SOLIDUS (\\)\n    if (first === 0x005C) {\n        // If the first and second code points are a valid escape, return true. Otherwise, return false.\n        return isValidEscape(first, second);\n    }\n\n    // anything else\n    // Return false.\n    return false;\n}\n\n// § 4.3.10. Check if three code points would start a number\nexport function isNumberStart(first, second, third) {\n    // Look at the first code point:\n\n    // U+002B PLUS SIGN (+)\n    // U+002D HYPHEN-MINUS (-)\n    if (first === 0x002B || first === 0x002D) {\n        // If the second code point is a digit, return true.\n        if (isDigit(second)) {\n            return 2;\n        }\n\n        // Otherwise, if the second code point is a U+002E FULL STOP (.)\n        // and the third code point is a digit, return true.\n        // Otherwise, return false.\n        return second === 0x002E && isDigit(third) ? 3 : 0;\n    }\n\n    // U+002E FULL STOP (.)\n    if (first === 0x002E) {\n        // If the second code point is a digit, return true. Otherwise, return false.\n        return isDigit(second) ? 2 : 0;\n    }\n\n    // digit\n    if (isDigit(first)) {\n        // Return true.\n        return 1;\n    }\n\n    // anything else\n    // Return false.\n    return 0;\n}\n\n//\n// Misc\n//\n\n// detect BOM (https://en.wikipedia.org/wiki/Byte_order_mark)\nexport function isBOM(code) {\n    // UTF-16BE\n    if (code === 0xFEFF) {\n        return 1;\n    }\n\n    // UTF-16LE\n    if (code === 0xFFFE) {\n        return 1;\n    }\n\n    return 0;\n}\n\n// Fast code category\n// Only ASCII code points has a special meaning, that's why we define a maps for 0..127 codes only\nconst CATEGORY = new Array(0x80);\nexport const EofCategory = 0x80;\nexport const WhiteSpaceCategory = 0x82;\nexport const DigitCategory = 0x83;\nexport const NameStartCategory = 0x84;\nexport const NonPrintableCategory = 0x85;\n\nfor (let i = 0; i < CATEGORY.length; i++) {\n    CATEGORY[i] =\n        isWhiteSpace(i) && WhiteSpaceCategory ||\n        isDigit(i) && DigitCategory ||\n        isNameStart(i) && NameStartCategory ||\n        isNonPrintable(i) && NonPrintableCategory ||\n        i || EofCategory;\n}\n\nexport function charCodeCategory(code) {\n    return code < 0x80 ? CATEGORY[code] : NameStartCategory;\n}\n","import {\n    isDigit,\n    isHexDigit,\n    isUppercaseLetter,\n    isName,\n    isWhiteSpace,\n    isValidEscape\n} from './char-code-definitions.js';\n\nfunction getCharCode(source, offset) {\n    return offset < source.length ? source.charCodeAt(offset) : 0;\n}\n\nexport function getNewlineLength(source, offset, code) {\n    if (code === 13 /* \\r */ && getCharCode(source, offset + 1) === 10 /* \\n */) {\n        return 2;\n    }\n\n    return 1;\n}\n\nexport function cmpChar(testStr, offset, referenceCode) {\n    let code = testStr.charCodeAt(offset);\n\n    // code.toLowerCase() for A..Z\n    if (isUppercaseLetter(code)) {\n        code = code | 32;\n    }\n\n    return code === referenceCode;\n}\n\nexport function cmpStr(testStr, start, end, referenceStr) {\n    if (end - start !== referenceStr.length) {\n        return false;\n    }\n\n    if (start < 0 || end > testStr.length) {\n        return false;\n    }\n\n    for (let i = start; i < end; i++) {\n        const referenceCode = referenceStr.charCodeAt(i - start);\n        let testCode = testStr.charCodeAt(i);\n\n        // testCode.toLowerCase() for A..Z\n        if (isUppercaseLetter(testCode)) {\n            testCode = testCode | 32;\n        }\n\n        if (testCode !== referenceCode) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\nexport function findWhiteSpaceStart(source, offset) {\n    for (; offset >= 0; offset--) {\n        if (!isWhiteSpace(source.charCodeAt(offset))) {\n            break;\n        }\n    }\n\n    return offset + 1;\n}\n\nexport function findWhiteSpaceEnd(source, offset) {\n    for (; offset < source.length; offset++) {\n        if (!isWhiteSpace(source.charCodeAt(offset))) {\n            break;\n        }\n    }\n\n    return offset;\n}\n\nexport function findDecimalNumberEnd(source, offset) {\n    for (; offset < source.length; offset++) {\n        if (!isDigit(source.charCodeAt(offset))) {\n            break;\n        }\n    }\n\n    return offset;\n}\n\n// § 4.3.7. Consume an escaped code point\nexport function consumeEscaped(source, offset) {\n    // It assumes that the U+005C REVERSE SOLIDUS (\\) has already been consumed and\n    // that the next input code point has already been verified to be part of a valid escape.\n    offset += 2;\n\n    // hex digit\n    if (isHexDigit(getCharCode(source, offset - 1))) {\n        // Consume as many hex digits as possible, but no more than 5.\n        // Note that this means 1-6 hex digits have been consumed in total.\n        for (const maxOffset = Math.min(source.length, offset + 5); offset < maxOffset; offset++) {\n            if (!isHexDigit(getCharCode(source, offset))) {\n                break;\n            }\n        }\n\n        // If the next input code point is whitespace, consume it as well.\n        const code = getCharCode(source, offset);\n        if (isWhiteSpace(code)) {\n            offset += getNewlineLength(source, offset, code);\n        }\n    }\n\n    return offset;\n}\n\n// §4.3.11. Consume a name\n// Note: This algorithm does not do the verification of the first few code points that are necessary\n// to ensure the returned code points would constitute an <ident-token>. If that is the intended use,\n// ensure that the stream starts with an identifier before calling this algorithm.\nexport function consumeName(source, offset) {\n    // Let result initially be an empty string.\n    // Repeatedly consume the next input code point from the stream:\n    for (; offset < source.length; offset++) {\n        const code = source.charCodeAt(offset);\n\n        // name code point\n        if (isName(code)) {\n            // Append the code point to result.\n            continue;\n        }\n\n        // the stream starts with a valid escape\n        if (isValidEscape(code, getCharCode(source, offset + 1))) {\n            // Consume an escaped code point. Append the returned code point to result.\n            offset = consumeEscaped(source, offset) - 1;\n            continue;\n        }\n\n        // anything else\n        // Reconsume the current input code point. Return result.\n        break;\n    }\n\n    return offset;\n}\n\n// §4.3.12. Consume a number\nexport function consumeNumber(source, offset) {\n    let code = source.charCodeAt(offset);\n\n    // 2. If the next input code point is U+002B PLUS SIGN (+) or U+002D HYPHEN-MINUS (-),\n    // consume it and append it to repr.\n    if (code === 0x002B || code === 0x002D) {\n        code = source.charCodeAt(offset += 1);\n    }\n\n    // 3. While the next input code point is a digit, consume it and append it to repr.\n    if (isDigit(code)) {\n        offset = findDecimalNumberEnd(source, offset + 1);\n        code = source.charCodeAt(offset);\n    }\n\n    // 4. If the next 2 input code points are U+002E FULL STOP (.) followed by a digit, then:\n    if (code === 0x002E && isDigit(source.charCodeAt(offset + 1))) {\n        // 4.1 Consume them.\n        // 4.2 Append them to repr.\n        offset += 2;\n\n        // 4.3 Set type to \"number\".\n        // TODO\n\n        // 4.4 While the next input code point is a digit, consume it and append it to repr.\n\n        offset = findDecimalNumberEnd(source, offset);\n    }\n\n    // 5. If the next 2 or 3 input code points are U+0045 LATIN CAPITAL LETTER E (E)\n    // or U+0065 LATIN SMALL LETTER E (e), ... , followed by a digit, then:\n    if (cmpChar(source, offset, 101 /* e */)) {\n        let sign = 0;\n        code = source.charCodeAt(offset + 1);\n\n        // ... optionally followed by U+002D HYPHEN-MINUS (-) or U+002B PLUS SIGN (+) ...\n        if (code === 0x002D || code === 0x002B) {\n            sign = 1;\n            code = source.charCodeAt(offset + 2);\n        }\n\n        // ... followed by a digit\n        if (isDigit(code)) {\n            // 5.1 Consume them.\n            // 5.2 Append them to repr.\n\n            // 5.3 Set type to \"number\".\n            // TODO\n\n            // 5.4 While the next input code point is a digit, consume it and append it to repr.\n            offset = findDecimalNumberEnd(source, offset + 1 + sign + 1);\n        }\n    }\n\n    return offset;\n}\n\n// § 4.3.14. Consume the remnants of a bad url\n// ... its sole use is to consume enough of the input stream to reach a recovery point\n// where normal tokenizing can resume.\nexport function consumeBadUrlRemnants(source, offset) {\n    // Repeatedly consume the next input code point from the stream:\n    for (; offset < source.length; offset++) {\n        const code = source.charCodeAt(offset);\n\n        // U+0029 RIGHT PARENTHESIS ())\n        // EOF\n        if (code === 0x0029) {\n            // Return.\n            offset++;\n            break;\n        }\n\n        if (isValidEscape(code, getCharCode(source, offset + 1))) {\n            // Consume an escaped code point.\n            // Note: This allows an escaped right parenthesis (\"\\)\") to be encountered\n            // without ending the <bad-url-token>. This is otherwise identical to\n            // the \"anything else\" clause.\n            offset = consumeEscaped(source, offset);\n        }\n    }\n\n    return offset;\n}\n\n// § 4.3.7. Consume an escaped code point\n// Note: This algorithm assumes that escaped is valid without leading U+005C REVERSE SOLIDUS (\\)\nexport function decodeEscaped(escaped) {\n    // Single char escaped that's not a hex digit\n    if (escaped.length === 1 && !isHexDigit(escaped.charCodeAt(0))) {\n        return escaped[0];\n    }\n\n    // Interpret the hex digits as a hexadecimal number.\n    let code = parseInt(escaped, 16);\n\n    if (\n        (code === 0) ||                       // If this number is zero,\n        (code >= 0xD800 && code <= 0xDFFF) || // or is for a surrogate,\n        (code > 0x10FFFF)                     // or is greater than the maximum allowed code point\n    ) {\n        // ... return U+FFFD REPLACEMENT CHARACTER\n        code = 0xFFFD;\n    }\n\n    // Otherwise, return the code point with that value.\n    return String.fromCodePoint(code);\n}\n","export default [\n    'EOF-token',\n    'ident-token',\n    'function-token',\n    'at-keyword-token',\n    'hash-token',\n    'string-token',\n    'bad-string-token',\n    'url-token',\n    'bad-url-token',\n    'delim-token',\n    'number-token',\n    'percentage-token',\n    'dimension-token',\n    'whitespace-token',\n    'CDO-token',\n    'CDC-token',\n    'colon-token',\n    'semicolon-token',\n    'comma-token',\n    '[-token',\n    ']-token',\n    '(-token',\n    ')-token',\n    '{-token',\n    '}-token',\n    'comment-token'\n];\n","const MIN_SIZE = 16 * 1024;\n\nexport function adoptBuffer(buffer = null, size) {\n    if (buffer === null || buffer.length < size) {\n        return new Uint32Array(Math.max(size + 1024, MIN_SIZE));\n    }\n\n    return buffer;\n};\n","import { adoptBuffer } from './adopt-buffer.js';\nimport { isBOM } from './char-code-definitions.js';\n\nconst N = 10;\nconst F = 12;\nconst R = 13;\n\nfunction computeLinesAndColumns(host) {\n    const source = host.source;\n    const sourceLength = source.length;\n    const startOffset = source.length > 0 ? isBOM(source.charCodeAt(0)) : 0;\n    const lines = adoptBuffer(host.lines, sourceLength);\n    const columns = adoptBuffer(host.columns, sourceLength);\n    let line = host.startLine;\n    let column = host.startColumn;\n\n    for (let i = startOffset; i < sourceLength; i++) {\n        const code = source.charCodeAt(i);\n\n        lines[i] = line;\n        columns[i] = column++;\n\n        if (code === N || code === R || code === F) {\n            if (code === R && i + 1 < sourceLength && source.charCodeAt(i + 1) === N) {\n                i++;\n                lines[i] = line;\n                columns[i] = column;\n            }\n\n            line++;\n            column = 1;\n        }\n    }\n\n    lines[sourceLength] = line;\n    columns[sourceLength] = column;\n\n    host.lines = lines;\n    host.columns = columns;\n    host.computed = true;\n}\n\nexport class OffsetToLocation {\n    constructor() {\n        this.lines = null;\n        this.columns = null;\n        this.computed = false;\n    }\n    setSource(source, startOffset = 0, startLine = 1, startColumn = 1) {\n        this.source = source;\n        this.startOffset = startOffset;\n        this.startLine = startLine;\n        this.startColumn = startColumn;\n        this.computed = false;\n    }\n    getLocation(offset, filename) {\n        if (!this.computed) {\n            computeLinesAndColumns(this);\n        }\n\n        return {\n            source: filename,\n            offset: this.startOffset + offset,\n            line: this.lines[offset],\n            column: this.columns[offset]\n        };\n    }\n    getLocationRange(start, end, filename) {\n        if (!this.computed) {\n            computeLinesAndColumns(this);\n        }\n\n        return {\n            source: filename,\n            start: {\n                offset: this.startOffset + start,\n                line: this.lines[start],\n                column: this.columns[start]\n            },\n            end: {\n                offset: this.startOffset + end,\n                line: this.lines[end],\n                column: this.columns[end]\n            }\n        };\n    }\n};\n","import { adoptBuffer } from './adopt-buffer.js';\nimport { cmpStr } from './utils.js';\nimport tokenNames from './names.js';\nimport {\n    WhiteSpace,\n    Comment,\n    Delim,\n    EOF,\n    Function as FunctionToken,\n    LeftParenthesis,\n    RightParenthesis,\n    LeftSquareBracket,\n    RightSquareBracket,\n    LeftCurlyBracket,\n    RightCurlyBracket\n} from './types.js';\n\nconst OFFSET_MASK = 0x00FFFFFF;\nconst TYPE_SHIFT = 24;\nconst balancePair = new Map([\n    [FunctionToken, RightParenthesis],\n    [LeftParenthesis, RightParenthesis],\n    [LeftSquareBracket, RightSquareBracket],\n    [LeftCurlyBracket, RightCurlyBracket]\n]);\n\nexport class TokenStream {\n    constructor(source, tokenize) {\n        this.setSource(source, tokenize);\n    }\n    reset() {\n        this.eof = false;\n        this.tokenIndex = -1;\n        this.tokenType = 0;\n        this.tokenStart = this.firstCharOffset;\n        this.tokenEnd = this.firstCharOffset;\n    }\n    setSource(source = '', tokenize = () => {}) {\n        source = String(source || '');\n\n        const sourceLength = source.length;\n        const offsetAndType = adoptBuffer(this.offsetAndType, source.length + 1); // +1 because of eof-token\n        const balance = adoptBuffer(this.balance, source.length + 1);\n        let tokenCount = 0;\n        let balanceCloseType = 0;\n        let balanceStart = 0;\n        let firstCharOffset = -1;\n\n        // capture buffers\n        this.offsetAndType = null;\n        this.balance = null;\n\n        tokenize(source, (type, start, end) => {\n            switch (type) {\n                default:\n                    balance[tokenCount] = sourceLength;\n                    break;\n\n                case balanceCloseType: {\n                    let balancePrev = balanceStart & OFFSET_MASK;\n                    balanceStart = balance[balancePrev];\n                    balanceCloseType = balanceStart >> TYPE_SHIFT;\n                    balance[tokenCount] = balancePrev;\n                    balance[balancePrev++] = tokenCount;\n                    for (; balancePrev < tokenCount; balancePrev++) {\n                        if (balance[balancePrev] === sourceLength) {\n                            balance[balancePrev] = tokenCount;\n                        }\n                    }\n                    break;\n                }\n\n                case LeftParenthesis:\n                case FunctionToken:\n                case LeftSquareBracket:\n                case LeftCurlyBracket:\n                    balance[tokenCount] = balanceStart;\n                    balanceCloseType = balancePair.get(type);\n                    balanceStart = (balanceCloseType << TYPE_SHIFT) | tokenCount;\n                    break;\n            }\n\n            offsetAndType[tokenCount++] = (type << TYPE_SHIFT) | end;\n            if (firstCharOffset === -1) {\n                firstCharOffset = start;\n            }\n        });\n\n        // finalize buffers\n        offsetAndType[tokenCount] = (EOF << TYPE_SHIFT) | sourceLength; // <EOF-token>\n        balance[tokenCount] = sourceLength;\n        balance[sourceLength] = sourceLength; // prevents false positive balance match with any token\n        while (balanceStart !== 0) {\n            const balancePrev = balanceStart & OFFSET_MASK;\n            balanceStart = balance[balancePrev];\n            balance[balancePrev] = sourceLength;\n        }\n\n        this.source = source;\n        this.firstCharOffset = firstCharOffset === -1 ? 0 : firstCharOffset;\n        this.tokenCount = tokenCount;\n        this.offsetAndType = offsetAndType;\n        this.balance = balance;\n\n        this.reset();\n        this.next();\n    }\n\n    lookupType(offset) {\n        offset += this.tokenIndex;\n\n        if (offset < this.tokenCount) {\n            return this.offsetAndType[offset] >> TYPE_SHIFT;\n        }\n\n        return EOF;\n    }\n    lookupTypeNonSC(idx) {\n        for (let offset = this.tokenIndex; offset < this.tokenCount; offset++) {\n            const tokenType = this.offsetAndType[offset] >> TYPE_SHIFT;\n\n            if (tokenType !== WhiteSpace && tokenType !== Comment) {\n                if (idx-- === 0) {\n                    return tokenType;\n                }\n            }\n        }\n\n        return EOF;\n    }\n    lookupOffset(offset) {\n        offset += this.tokenIndex;\n\n        if (offset < this.tokenCount) {\n            return this.offsetAndType[offset - 1] & OFFSET_MASK;\n        }\n\n        return this.source.length;\n    }\n    lookupOffsetNonSC(idx) {\n        for (let offset = this.tokenIndex; offset < this.tokenCount; offset++) {\n            const tokenType = this.offsetAndType[offset] >> TYPE_SHIFT;\n\n            if (tokenType !== WhiteSpace && tokenType !== Comment) {\n                if (idx-- === 0) {\n                    return offset - this.tokenIndex;\n                }\n            }\n        }\n\n        return EOF;\n    }\n    lookupValue(offset, referenceStr) {\n        offset += this.tokenIndex;\n\n        if (offset < this.tokenCount) {\n            return cmpStr(\n                this.source,\n                this.offsetAndType[offset - 1] & OFFSET_MASK,\n                this.offsetAndType[offset] & OFFSET_MASK,\n                referenceStr\n            );\n        }\n\n        return false;\n    }\n    getTokenStart(tokenIndex) {\n        if (tokenIndex === this.tokenIndex) {\n            return this.tokenStart;\n        }\n\n        if (tokenIndex > 0) {\n            return tokenIndex < this.tokenCount\n                ? this.offsetAndType[tokenIndex - 1] & OFFSET_MASK\n                : this.offsetAndType[this.tokenCount] & OFFSET_MASK;\n        }\n\n        return this.firstCharOffset;\n    }\n    substrToCursor(start) {\n        return this.source.substring(start, this.tokenStart);\n    }\n\n    isBalanceEdge(pos) {\n        return this.balance[this.tokenIndex] < pos;\n    }\n    isDelim(code, offset) {\n        if (offset) {\n            return (\n                this.lookupType(offset) === Delim &&\n                this.source.charCodeAt(this.lookupOffset(offset)) === code\n            );\n        }\n\n        return (\n            this.tokenType === Delim &&\n            this.source.charCodeAt(this.tokenStart) === code\n        );\n    }\n\n    skip(tokenCount) {\n        let next = this.tokenIndex + tokenCount;\n\n        if (next < this.tokenCount) {\n            this.tokenIndex = next;\n            this.tokenStart = this.offsetAndType[next - 1] & OFFSET_MASK;\n            next = this.offsetAndType[next];\n            this.tokenType = next >> TYPE_SHIFT;\n            this.tokenEnd = next & OFFSET_MASK;\n        } else {\n            this.tokenIndex = this.tokenCount;\n            this.next();\n        }\n    }\n    next() {\n        let next = this.tokenIndex + 1;\n\n        if (next < this.tokenCount) {\n            this.tokenIndex = next;\n            this.tokenStart = this.tokenEnd;\n            next = this.offsetAndType[next];\n            this.tokenType = next >> TYPE_SHIFT;\n            this.tokenEnd = next & OFFSET_MASK;\n        } else {\n            this.eof = true;\n            this.tokenIndex = this.tokenCount;\n            this.tokenType = EOF;\n            this.tokenStart = this.tokenEnd = this.source.length;\n        }\n    }\n    skipSC() {\n        while (this.tokenType === WhiteSpace || this.tokenType === Comment) {\n            this.next();\n        }\n    }\n    skipUntilBalanced(startToken, stopConsume) {\n        let cursor = startToken;\n        let balanceEnd;\n        let offset;\n\n        loop:\n        for (; cursor < this.tokenCount; cursor++) {\n            balanceEnd = this.balance[cursor];\n\n            // stop scanning on balance edge that points to offset before start token\n            if (balanceEnd < startToken) {\n                break loop;\n            }\n\n            offset = cursor > 0 ? this.offsetAndType[cursor - 1] & OFFSET_MASK : this.firstCharOffset;\n\n            // check stop condition\n            switch (stopConsume(this.source.charCodeAt(offset))) {\n                case 1: // just stop\n                    break loop;\n\n                case 2: // stop & included\n                    cursor++;\n                    break loop;\n\n                default:\n                    // fast forward to the end of balanced block\n                    if (this.balance[balanceEnd] === cursor) {\n                        cursor = balanceEnd;\n                    }\n            }\n        }\n\n        this.skip(cursor - this.tokenIndex);\n    }\n\n    forEachToken(fn) {\n        for (let i = 0, offset = this.firstCharOffset; i < this.tokenCount; i++) {\n            const start = offset;\n            const item = this.offsetAndType[i];\n            const end = item & OFFSET_MASK;\n            const type = item >> TYPE_SHIFT;\n\n            offset = end;\n\n            fn(type, start, end, i);\n        }\n    }\n    dump() {\n        const tokens = new Array(this.tokenCount);\n\n        this.forEachToken((type, start, end, index) => {\n            tokens[index] = {\n                idx: index,\n                type: tokenNames[type],\n                chunk: this.source.substring(start, end),\n                balance: this.balance[index]\n            };\n        });\n\n        return tokens;\n    }\n};\n","import * as TYPE from './types.js';\nimport {\n    isNewline,\n    isName,\n    isValidEscape,\n    isNumberStart,\n    isIdentifierStart,\n    isBOM,\n    charCodeCategory,\n    WhiteSpaceCategory,\n    DigitCategory,\n    NameStartCategory,\n    NonPrintableCategory\n} from './char-code-definitions.js';\nimport {\n    cmpStr,\n    getNewlineLength,\n    findWhiteSpaceEnd,\n    consumeEscaped,\n    consumeName,\n    consumeNumber,\n    consumeBadUrlRemnants\n} from './utils.js';\n\nexport function tokenize(source, onToken) {\n    function getCharCode(offset) {\n        return offset < sourceLength ? source.charCodeAt(offset) : 0;\n    }\n\n    // § 4.3.3. Consume a numeric token\n    function consumeNumericToken() {\n        // Consume a number and let number be the result.\n        offset = consumeNumber(source, offset);\n\n        // If the next 3 input code points would start an identifier, then:\n        if (isIdentifierStart(getCharCode(offset), getCharCode(offset + 1), getCharCode(offset + 2))) {\n            // Create a <dimension-token> with the same value and type flag as number, and a unit set initially to the empty string.\n            // Consume a name. Set the <dimension-token>’s unit to the returned value.\n            // Return the <dimension-token>.\n            type = TYPE.Dimension;\n            offset = consumeName(source, offset);\n            return;\n        }\n\n        // Otherwise, if the next input code point is U+0025 PERCENTAGE SIGN (%), consume it.\n        if (getCharCode(offset) === 0x0025) {\n            // Create a <percentage-token> with the same value as number, and return it.\n            type = TYPE.Percentage;\n            offset++;\n            return;\n        }\n\n        // Otherwise, create a <number-token> with the same value and type flag as number, and return it.\n        type = TYPE.Number;\n    }\n\n    // § 4.3.4. Consume an ident-like token\n    function consumeIdentLikeToken() {\n        const nameStartOffset = offset;\n\n        // Consume a name, and let string be the result.\n        offset = consumeName(source, offset);\n\n        // If string’s value is an ASCII case-insensitive match for \"url\",\n        // and the next input code point is U+0028 LEFT PARENTHESIS ((), consume it.\n        if (cmpStr(source, nameStartOffset, offset, 'url') && getCharCode(offset) === 0x0028) {\n            // While the next two input code points are whitespace, consume the next input code point.\n            offset = findWhiteSpaceEnd(source, offset + 1);\n\n            // If the next one or two input code points are U+0022 QUOTATION MARK (\"), U+0027 APOSTROPHE ('),\n            // or whitespace followed by U+0022 QUOTATION MARK (\") or U+0027 APOSTROPHE ('),\n            // then create a <function-token> with its value set to string and return it.\n            if (getCharCode(offset) === 0x0022 ||\n                getCharCode(offset) === 0x0027) {\n                type = TYPE.Function;\n                offset = nameStartOffset + 4;\n                return;\n            }\n\n            // Otherwise, consume a url token, and return it.\n            consumeUrlToken();\n            return;\n        }\n\n        // Otherwise, if the next input code point is U+0028 LEFT PARENTHESIS ((), consume it.\n        // Create a <function-token> with its value set to string and return it.\n        if (getCharCode(offset) === 0x0028) {\n            type = TYPE.Function;\n            offset++;\n            return;\n        }\n\n        // Otherwise, create an <ident-token> with its value set to string and return it.\n        type = TYPE.Ident;\n    }\n\n    // § 4.3.5. Consume a string token\n    function consumeStringToken(endingCodePoint) {\n        // This algorithm may be called with an ending code point, which denotes the code point\n        // that ends the string. If an ending code point is not specified,\n        // the current input code point is used.\n        if (!endingCodePoint) {\n            endingCodePoint = getCharCode(offset++);\n        }\n\n        // Initially create a <string-token> with its value set to the empty string.\n        type = TYPE.String;\n\n        // Repeatedly consume the next input code point from the stream:\n        for (; offset < source.length; offset++) {\n            const code = source.charCodeAt(offset);\n\n            switch (charCodeCategory(code)) {\n                // ending code point\n                case endingCodePoint:\n                    // Return the <string-token>.\n                    offset++;\n                    return;\n\n                    // EOF\n                    // case EofCategory:\n                    // This is a parse error. Return the <string-token>.\n                    // return;\n\n                // newline\n                case WhiteSpaceCategory:\n                    if (isNewline(code)) {\n                        // This is a parse error. Reconsume the current input code point,\n                        // create a <bad-string-token>, and return it.\n                        offset += getNewlineLength(source, offset, code);\n                        type = TYPE.BadString;\n                        return;\n                    }\n                    break;\n\n                // U+005C REVERSE SOLIDUS (\\)\n                case 0x005C:\n                    // If the next input code point is EOF, do nothing.\n                    if (offset === source.length - 1) {\n                        break;\n                    }\n\n                    const nextCode = getCharCode(offset + 1);\n\n                    // Otherwise, if the next input code point is a newline, consume it.\n                    if (isNewline(nextCode)) {\n                        offset += getNewlineLength(source, offset + 1, nextCode);\n                    } else if (isValidEscape(code, nextCode)) {\n                        // Otherwise, (the stream starts with a valid escape) consume\n                        // an escaped code point and append the returned code point to\n                        // the <string-token>’s value.\n                        offset = consumeEscaped(source, offset) - 1;\n                    }\n                    break;\n\n                // anything else\n                // Append the current input code point to the <string-token>’s value.\n            }\n        }\n    }\n\n    // § 4.3.6. Consume a url token\n    // Note: This algorithm assumes that the initial \"url(\" has already been consumed.\n    // This algorithm also assumes that it’s being called to consume an \"unquoted\" value, like url(foo).\n    // A quoted value, like url(\"foo\"), is parsed as a <function-token>. Consume an ident-like token\n    // automatically handles this distinction; this algorithm shouldn’t be called directly otherwise.\n    function consumeUrlToken() {\n        // Initially create a <url-token> with its value set to the empty string.\n        type = TYPE.Url;\n\n        // Consume as much whitespace as possible.\n        offset = findWhiteSpaceEnd(source, offset);\n\n        // Repeatedly consume the next input code point from the stream:\n        for (; offset < source.length; offset++) {\n            const code = source.charCodeAt(offset);\n\n            switch (charCodeCategory(code)) {\n                // U+0029 RIGHT PARENTHESIS ())\n                case 0x0029:\n                    // Return the <url-token>.\n                    offset++;\n                    return;\n\n                    // EOF\n                    // case EofCategory:\n                    // This is a parse error. Return the <url-token>.\n                    // return;\n\n                // whitespace\n                case WhiteSpaceCategory:\n                    // Consume as much whitespace as possible.\n                    offset = findWhiteSpaceEnd(source, offset);\n\n                    // If the next input code point is U+0029 RIGHT PARENTHESIS ()) or EOF,\n                    // consume it and return the <url-token>\n                    // (if EOF was encountered, this is a parse error);\n                    if (getCharCode(offset) === 0x0029 || offset >= source.length) {\n                        if (offset < source.length) {\n                            offset++;\n                        }\n                        return;\n                    }\n\n                    // otherwise, consume the remnants of a bad url, create a <bad-url-token>,\n                    // and return it.\n                    offset = consumeBadUrlRemnants(source, offset);\n                    type = TYPE.BadUrl;\n                    return;\n\n                // U+0022 QUOTATION MARK (\")\n                // U+0027 APOSTROPHE (')\n                // U+0028 LEFT PARENTHESIS (()\n                // non-printable code point\n                case 0x0022:\n                case 0x0027:\n                case 0x0028:\n                case NonPrintableCategory:\n                    // This is a parse error. Consume the remnants of a bad url,\n                    // create a <bad-url-token>, and return it.\n                    offset = consumeBadUrlRemnants(source, offset);\n                    type = TYPE.BadUrl;\n                    return;\n\n                // U+005C REVERSE SOLIDUS (\\)\n                case 0x005C:\n                    // If the stream starts with a valid escape, consume an escaped code point and\n                    // append the returned code point to the <url-token>’s value.\n                    if (isValidEscape(code, getCharCode(offset + 1))) {\n                        offset = consumeEscaped(source, offset) - 1;\n                        break;\n                    }\n\n                    // Otherwise, this is a parse error. Consume the remnants of a bad url,\n                    // create a <bad-url-token>, and return it.\n                    offset = consumeBadUrlRemnants(source, offset);\n                    type = TYPE.BadUrl;\n                    return;\n\n                // anything else\n                // Append the current input code point to the <url-token>’s value.\n            }\n        }\n    }\n\n    // ensure source is a string\n    source = String(source || '');\n\n    const sourceLength = source.length;\n    let start = isBOM(getCharCode(0));\n    let offset = start;\n    let type;\n\n    // https://drafts.csswg.org/css-syntax-3/#consume-token\n    // § 4.3.1. Consume a token\n    while (offset < sourceLength) {\n        const code = source.charCodeAt(offset);\n\n        switch (charCodeCategory(code)) {\n            // whitespace\n            case WhiteSpaceCategory:\n                // Consume as much whitespace as possible. Return a <whitespace-token>.\n                type = TYPE.WhiteSpace;\n                offset = findWhiteSpaceEnd(source, offset + 1);\n                break;\n\n            // U+0022 QUOTATION MARK (\")\n            case 0x0022:\n                // Consume a string token and return it.\n                consumeStringToken();\n                break;\n\n            // U+0023 NUMBER SIGN (#)\n            case 0x0023:\n                // If the next input code point is a name code point or the next two input code points are a valid escape, then:\n                if (isName(getCharCode(offset + 1)) || isValidEscape(getCharCode(offset + 1), getCharCode(offset + 2))) {\n                    // Create a <hash-token>.\n                    type = TYPE.Hash;\n\n                    // If the next 3 input code points would start an identifier, set the <hash-token>’s type flag to \"id\".\n                    // if (isIdentifierStart(getCharCode(offset + 1), getCharCode(offset + 2), getCharCode(offset + 3))) {\n                    //     // TODO: set id flag\n                    // }\n\n                    // Consume a name, and set the <hash-token>’s value to the returned string.\n                    offset = consumeName(source, offset + 1);\n\n                    // Return the <hash-token>.\n                } else {\n                    // Otherwise, return a <delim-token> with its value set to the current input code point.\n                    type = TYPE.Delim;\n                    offset++;\n                }\n\n                break;\n\n            // U+0027 APOSTROPHE (')\n            case 0x0027:\n                // Consume a string token and return it.\n                consumeStringToken();\n                break;\n\n            // U+0028 LEFT PARENTHESIS (()\n            case 0x0028:\n                // Return a <(-token>.\n                type = TYPE.LeftParenthesis;\n                offset++;\n                break;\n\n            // U+0029 RIGHT PARENTHESIS ())\n            case 0x0029:\n                // Return a <)-token>.\n                type = TYPE.RightParenthesis;\n                offset++;\n                break;\n\n            // U+002B PLUS SIGN (+)\n            case 0x002B:\n                // If the input stream starts with a number, ...\n                if (isNumberStart(code, getCharCode(offset + 1), getCharCode(offset + 2))) {\n                    // ... reconsume the current input code point, consume a numeric token, and return it.\n                    consumeNumericToken();\n                } else {\n                    // Otherwise, return a <delim-token> with its value set to the current input code point.\n                    type = TYPE.Delim;\n                    offset++;\n                }\n                break;\n\n            // U+002C COMMA (,)\n            case 0x002C:\n                // Return a <comma-token>.\n                type = TYPE.Comma;\n                offset++;\n                break;\n\n            // U+002D HYPHEN-MINUS (-)\n            case 0x002D:\n                // If the input stream starts with a number, reconsume the current input code point, consume a numeric token, and return it.\n                if (isNumberStart(code, getCharCode(offset + 1), getCharCode(offset + 2))) {\n                    consumeNumericToken();\n                } else {\n                    // Otherwise, if the next 2 input code points are U+002D HYPHEN-MINUS U+003E GREATER-THAN SIGN (->), consume them and return a <CDC-token>.\n                    if (getCharCode(offset + 1) === 0x002D &&\n                        getCharCode(offset + 2) === 0x003E) {\n                        type = TYPE.CDC;\n                        offset = offset + 3;\n                    } else {\n                        // Otherwise, if the input stream starts with an identifier, ...\n                        if (isIdentifierStart(code, getCharCode(offset + 1), getCharCode(offset + 2))) {\n                            // ... reconsume the current input code point, consume an ident-like token, and return it.\n                            consumeIdentLikeToken();\n                        } else {\n                            // Otherwise, return a <delim-token> with its value set to the current input code point.\n                            type = TYPE.Delim;\n                            offset++;\n                        }\n                    }\n                }\n                break;\n\n            // U+002E FULL STOP (.)\n            case 0x002E:\n                // If the input stream starts with a number, ...\n                if (isNumberStart(code, getCharCode(offset + 1), getCharCode(offset + 2))) {\n                    // ... reconsume the current input code point, consume a numeric token, and return it.\n                    consumeNumericToken();\n                } else {\n                    // Otherwise, return a <delim-token> with its value set to the current input code point.\n                    type = TYPE.Delim;\n                    offset++;\n                }\n\n                break;\n\n            // U+002F SOLIDUS (/)\n            case 0x002F:\n                // If the next two input code point are U+002F SOLIDUS (/) followed by a U+002A ASTERISK (*),\n                if (getCharCode(offset + 1) === 0x002A) {\n                    // ... consume them and all following code points up to and including the first U+002A ASTERISK (*)\n                    // followed by a U+002F SOLIDUS (/), or up to an EOF code point.\n                    type = TYPE.Comment;\n                    offset = source.indexOf('*/', offset + 2);\n                    offset = offset === -1 ? source.length : offset + 2;\n                } else {\n                    type = TYPE.Delim;\n                    offset++;\n                }\n                break;\n\n            // U+003A COLON (:)\n            case 0x003A:\n                // Return a <colon-token>.\n                type = TYPE.Colon;\n                offset++;\n                break;\n\n            // U+003B SEMICOLON (;)\n            case 0x003B:\n                // Return a <semicolon-token>.\n                type = TYPE.Semicolon;\n                offset++;\n                break;\n\n            // U+003C LESS-THAN SIGN (<)\n            case 0x003C:\n                // If the next 3 input code points are U+0021 EXCLAMATION MARK U+002D HYPHEN-MINUS U+002D HYPHEN-MINUS (!--), ...\n                if (getCharCode(offset + 1) === 0x0021 &&\n                    getCharCode(offset + 2) === 0x002D &&\n                    getCharCode(offset + 3) === 0x002D) {\n                    // ... consume them and return a <CDO-token>.\n                    type = TYPE.CDO;\n                    offset = offset + 4;\n                } else {\n                    // Otherwise, return a <delim-token> with its value set to the current input code point.\n                    type = TYPE.Delim;\n                    offset++;\n                }\n\n                break;\n\n            // U+0040 COMMERCIAL AT (@)\n            case 0x0040:\n                // If the next 3 input code points would start an identifier, ...\n                if (isIdentifierStart(getCharCode(offset + 1), getCharCode(offset + 2), getCharCode(offset + 3))) {\n                    // ... consume a name, create an <at-keyword-token> with its value set to the returned value, and return it.\n                    type = TYPE.AtKeyword;\n                    offset = consumeName(source, offset + 1);\n                } else {\n                    // Otherwise, return a <delim-token> with its value set to the current input code point.\n                    type = TYPE.Delim;\n                    offset++;\n                }\n\n                break;\n\n            // U+005B LEFT SQUARE BRACKET ([)\n            case 0x005B:\n                // Return a <[-token>.\n                type = TYPE.LeftSquareBracket;\n                offset++;\n                break;\n\n            // U+005C REVERSE SOLIDUS (\\)\n            case 0x005C:\n                // If the input stream starts with a valid escape, ...\n                if (isValidEscape(code, getCharCode(offset + 1))) {\n                    // ... reconsume the current input code point, consume an ident-like token, and return it.\n                    consumeIdentLikeToken();\n                } else {\n                    // Otherwise, this is a parse error. Return a <delim-token> with its value set to the current input code point.\n                    type = TYPE.Delim;\n                    offset++;\n                }\n                break;\n\n            // U+005D RIGHT SQUARE BRACKET (])\n            case 0x005D:\n                // Return a <]-token>.\n                type = TYPE.RightSquareBracket;\n                offset++;\n                break;\n\n            // U+007B LEFT CURLY BRACKET ({)\n            case 0x007B:\n                // Return a <{-token>.\n                type = TYPE.LeftCurlyBracket;\n                offset++;\n                break;\n\n            // U+007D RIGHT CURLY BRACKET (})\n            case 0x007D:\n                // Return a <}-token>.\n                type = TYPE.RightCurlyBracket;\n                offset++;\n                break;\n\n            // digit\n            case DigitCategory:\n                // Reconsume the current input code point, consume a numeric token, and return it.\n                consumeNumericToken();\n                break;\n\n            // name-start code point\n            case NameStartCategory:\n                // Reconsume the current input code point, consume an ident-like token, and return it.\n                consumeIdentLikeToken();\n                break;\n\n                // EOF\n                // case EofCategory:\n                // Return an <EOF-token>.\n                // break;\n\n            // anything else\n            default:\n                // Return a <delim-token> with its value set to the current input code point.\n                type = TYPE.Delim;\n                offset++;\n        }\n\n        // put token to stream\n        onToken(type, start, start = offset);\n    }\n}\n\nexport * from './types.js';\nexport * as tokenTypes from './types.js';\nexport { default as tokenNames } from './names.js';\nexport * from './char-code-definitions.js';\nexport * from './utils.js';\nexport * from './OffsetToLocation.js';\nexport * from './TokenStream.js';\n","//\n//                              list\n//                            ┌──────┐\n//             ┌──────────────┼─head │\n//             │              │ tail─┼──────────────┐\n//             │              └──────┘              │\n//             ▼                                    ▼\n//            item        item        item        item\n//          ┌──────┐    ┌──────┐    ┌──────┐    ┌──────┐\n//  null ◀──┼─prev │◀───┼─prev │◀───┼─prev │◀───┼─prev │\n//          │ next─┼───▶│ next─┼───▶│ next─┼───▶│ next─┼──▶ null\n//          ├──────┤    ├──────┤    ├──────┤    ├──────┤\n//          │ data │    │ data │    │ data │    │ data │\n//          └──────┘    └──────┘    └──────┘    └──────┘\n//\n\nlet releasedCursors = null;\n\nexport class List {\n    static createItem(data) {\n        return {\n            prev: null,\n            next: null,\n            data\n        };\n    }\n\n    constructor() {\n        this.head = null;\n        this.tail = null;\n        this.cursor = null;\n    }\n    createItem(data) {\n        return List.createItem(data);\n    }\n\n    // cursor helpers\n    allocateCursor(prev, next) {\n        let cursor;\n\n        if (releasedCursors !== null) {\n            cursor = releasedCursors;\n            releasedCursors = releasedCursors.cursor;\n            cursor.prev = prev;\n            cursor.next = next;\n            cursor.cursor = this.cursor;\n        } else {\n            cursor = {\n                prev,\n                next,\n                cursor: this.cursor\n            };\n        }\n\n        this.cursor = cursor;\n\n        return cursor;\n    }\n    releaseCursor() {\n        const { cursor } = this;\n\n        this.cursor = cursor.cursor;\n        cursor.prev = null;\n        cursor.next = null;\n        cursor.cursor = releasedCursors;\n        releasedCursors = cursor;\n    }\n    updateCursors(prevOld, prevNew, nextOld, nextNew) {\n        let { cursor } = this;\n\n        while (cursor !== null) {\n            if (cursor.prev === prevOld) {\n                cursor.prev = prevNew;\n            }\n\n            if (cursor.next === nextOld) {\n                cursor.next = nextNew;\n            }\n\n            cursor = cursor.cursor;\n        }\n    }\n    *[Symbol.iterator]() {\n        for (let cursor = this.head; cursor !== null; cursor = cursor.next) {\n            yield cursor.data;\n        }\n    }\n\n    // getters\n    get size() {\n        let size = 0;\n\n        for (let cursor = this.head; cursor !== null; cursor = cursor.next) {\n            size++;\n        }\n\n        return size;\n    }\n    get isEmpty() {\n        return this.head === null;\n    }\n    get first() {\n        return this.head && this.head.data;\n    }\n    get last() {\n        return this.tail && this.tail.data;\n    }\n\n    // convertors\n    fromArray(array) {\n        let cursor = null;\n        this.head = null;\n\n        for (let data of array) {\n            const item = List.createItem(data);\n\n            if (cursor !== null) {\n                cursor.next = item;\n            } else {\n                this.head = item;\n            }\n\n            item.prev = cursor;\n            cursor = item;\n        }\n\n        this.tail = cursor;\n        return this;\n    }\n    toArray() {\n        return [...this];\n    }\n    toJSON() {\n        return [...this];\n    }\n\n    // array-like methods\n    forEach(fn, thisArg = this) {\n        // push cursor\n        const cursor = this.allocateCursor(null, this.head);\n\n        while (cursor.next !== null) {\n            const item = cursor.next;\n            cursor.next = item.next;\n            fn.call(thisArg, item.data, item, this);\n        }\n\n        // pop cursor\n        this.releaseCursor();\n    }\n    forEachRight(fn, thisArg = this) {\n        // push cursor\n        const cursor = this.allocateCursor(this.tail, null);\n\n        while (cursor.prev !== null) {\n            const item = cursor.prev;\n            cursor.prev = item.prev;\n            fn.call(thisArg, item.data, item, this);\n        }\n\n        // pop cursor\n        this.releaseCursor();\n    }\n    reduce(fn, initialValue, thisArg = this) {\n        // push cursor\n        let cursor = this.allocateCursor(null, this.head);\n        let acc = initialValue;\n        let item;\n\n        while (cursor.next !== null) {\n            item = cursor.next;\n            cursor.next = item.next;\n\n            acc = fn.call(thisArg, acc, item.data, item, this);\n        }\n\n        // pop cursor\n        this.releaseCursor();\n\n        return acc;\n    }\n    reduceRight(fn, initialValue, thisArg = this) {\n        // push cursor\n        let cursor = this.allocateCursor(this.tail, null);\n        let acc = initialValue;\n        let item;\n\n        while (cursor.prev !== null) {\n            item = cursor.prev;\n            cursor.prev = item.prev;\n\n            acc = fn.call(thisArg, acc, item.data, item, this);\n        }\n\n        // pop cursor\n        this.releaseCursor();\n\n        return acc;\n    }\n    some(fn, thisArg = this) {\n        for (let cursor = this.head; cursor !== null; cursor = cursor.next) {\n            if (fn.call(thisArg, cursor.data, cursor, this)) {\n                return true;\n            }\n        }\n\n        return false;\n    }\n    map(fn, thisArg = this) {\n        const result = new List();\n\n        for (let cursor = this.head; cursor !== null; cursor = cursor.next) {\n            result.appendData(fn.call(thisArg, cursor.data, cursor, this));\n        }\n\n        return result;\n    }\n    filter(fn, thisArg = this) {\n        const result = new List();\n\n        for (let cursor = this.head; cursor !== null; cursor = cursor.next) {\n            if (fn.call(thisArg, cursor.data, cursor, this)) {\n                result.appendData(cursor.data);\n            }\n        }\n\n        return result;\n    }\n\n    nextUntil(start, fn, thisArg = this) {\n        if (start === null) {\n            return;\n        }\n\n        // push cursor\n        const cursor = this.allocateCursor(null, start);\n\n        while (cursor.next !== null) {\n            const item = cursor.next;\n            cursor.next = item.next;\n            if (fn.call(thisArg, item.data, item, this)) {\n                break;\n            }\n        }\n\n        // pop cursor\n        this.releaseCursor();\n    }\n    prevUntil(start, fn, thisArg = this) {\n        if (start === null) {\n            return;\n        }\n\n        // push cursor\n        const cursor = this.allocateCursor(start, null);\n\n        while (cursor.prev !== null) {\n            const item = cursor.prev;\n            cursor.prev = item.prev;\n            if (fn.call(thisArg, item.data, item, this)) {\n                break;\n            }\n        }\n\n        // pop cursor\n        this.releaseCursor();\n    }\n\n    // mutation\n    clear() {\n        this.head = null;\n        this.tail = null;\n    }\n    copy() {\n        const result = new List();\n\n        for (let data of this) {\n            result.appendData(data);\n        }\n\n        return result;\n    }\n    prepend(item) {\n        //      head\n        //    ^\n        // item\n        this.updateCursors(null, item, this.head, item);\n\n        // insert to the beginning of the list\n        if (this.head !== null) {\n            // new item <- first item\n            this.head.prev = item;\n            // new item -> first item\n            item.next = this.head;\n        } else {\n            // if list has no head, then it also has no tail\n            // in this case tail points to the new item\n            this.tail = item;\n        }\n\n        // head always points to new item\n        this.head = item;\n        return this;\n    }\n    prependData(data) {\n        return this.prepend(List.createItem(data));\n    }\n    append(item) {\n        return this.insert(item);\n    }\n    appendData(data) {\n        return this.insert(List.createItem(data));\n    }\n    insert(item, before = null) {\n        if (before !== null) {\n            // prev   before\n            //      ^\n            //     item\n            this.updateCursors(before.prev, item, before, item);\n\n            if (before.prev === null) {\n                // insert to the beginning of list\n                if (this.head !== before) {\n                    throw new Error('before doesn\\'t belong to list');\n                }\n                // since head points to before therefore list doesn't empty\n                // no need to check tail\n                this.head = item;\n                before.prev = item;\n                item.next = before;\n                this.updateCursors(null, item);\n            } else {\n                // insert between two items\n                before.prev.next = item;\n                item.prev = before.prev;\n                before.prev = item;\n                item.next = before;\n            }\n        } else {\n            // tail\n            //      ^\n            //      item\n            this.updateCursors(this.tail, item, null, item);\n\n            // insert to the ending of the list\n            if (this.tail !== null) {\n                // last item -> new item\n                this.tail.next = item;\n                // last item <- new item\n                item.prev = this.tail;\n            } else {\n                // if list has no tail, then it also has no head\n                // in this case head points to new item\n                this.head = item;\n            }\n\n            // tail always points to new item\n            this.tail = item;\n        }\n\n        return this;\n    }\n    insertData(data, before) {\n        return this.insert(List.createItem(data), before);\n    }\n    remove(item) {\n        //      item\n        //       ^\n        // prev     next\n        this.updateCursors(item, item.prev, item, item.next);\n\n        if (item.prev !== null) {\n            item.prev.next = item.next;\n        } else {\n            if (this.head !== item) {\n                throw new Error('item doesn\\'t belong to list');\n            }\n\n            this.head = item.next;\n        }\n\n        if (item.next !== null) {\n            item.next.prev = item.prev;\n        } else {\n            if (this.tail !== item) {\n                throw new Error('item doesn\\'t belong to list');\n            }\n\n            this.tail = item.prev;\n        }\n\n        item.prev = null;\n        item.next = null;\n\n        return item;\n    }\n    push(data) {\n        this.insert(List.createItem(data));\n    }\n    pop() {\n        return this.tail !== null ? this.remove(this.tail) : null;\n    }\n    unshift(data) {\n        this.prepend(List.createItem(data));\n    }\n    shift() {\n        return this.head !== null ? this.remove(this.head) : null;\n    }\n    prependList(list) {\n        return this.insertList(list, this.head);\n    }\n    appendList(list) {\n        return this.insertList(list);\n    }\n    insertList(list, before) {\n        // ignore empty lists\n        if (list.head === null) {\n            return this;\n        }\n\n        if (before !== undefined && before !== null) {\n            this.updateCursors(before.prev, list.tail, before, list.head);\n\n            // insert in the middle of dist list\n            if (before.prev !== null) {\n                // before.prev <-> list.head\n                before.prev.next = list.head;\n                list.head.prev = before.prev;\n            } else {\n                this.head = list.head;\n            }\n\n            before.prev = list.tail;\n            list.tail.next = before;\n        } else {\n            this.updateCursors(this.tail, list.tail, null, list.head);\n\n            // insert to end of the list\n            if (this.tail !== null) {\n                // if destination list has a tail, then it also has a head,\n                // but head doesn't change\n                // dest tail -> source head\n                this.tail.next = list.head;\n                // dest tail <- source head\n                list.head.prev = this.tail;\n            } else {\n                // if list has no a tail, then it also has no a head\n                // in this case points head to new item\n                this.head = list.head;\n            }\n\n            // tail always start point to new item\n            this.tail = list.tail;\n        }\n\n        list.head = null;\n        list.tail = null;\n        return this;\n    }\n    replace(oldItem, newItemOrList) {\n        if ('head' in newItemOrList) {\n            this.insertList(newItemOrList, oldItem);\n        } else {\n            this.insert(newItemOrList, oldItem);\n        }\n\n        this.remove(oldItem);\n    }\n}\n","export function createCustomError(name, message) {\n    // use Object.create(), because some VMs prevent setting line/column otherwise\n    // (iOS Safari 10 even throws an exception)\n    const error = Object.create(SyntaxError.prototype);\n    const errorStack = new Error();\n\n    return Object.assign(error, {\n        name,\n        message,\n        get stack() {\n            return (errorStack.stack || '').replace(/^(.+\\n){1,3}/, `${name}: ${message}\\n`);\n        }\n    });\n};\n","import { createCustomError } from '../utils/create-custom-error.js';\n\nconst MAX_LINE_LENGTH = 100;\nconst OFFSET_CORRECTION = 60;\nconst TAB_REPLACEMENT = '    ';\n\nfunction sourceFragment({ source, line, column, baseLine, baseColumn }, extraLines) {\n    function processLines(start, end) {\n        return lines\n            .slice(start, end)\n            .map((line, idx) =>\n                String(start + idx + 1).padStart(maxNumLength) + ' |' + line\n            ).join('\\n');\n    }\n\n    const prelines = '\\n'.repeat(Math.max(baseLine - 1, 0));\n    const precolumns = ' '.repeat(Math.max(baseColumn - 1, 0));\n    const lines = (prelines + precolumns + source).split(/\\r\\n?|\\n|\\f/);\n    const startLine = Math.max(1, line - extraLines) - 1;\n    const endLine = Math.min(line + extraLines, lines.length + 1);\n    const maxNumLength = Math.max(4, String(endLine).length) + 1;\n    let cutLeft = 0;\n\n    // column correction according to replaced tab before column\n    column += (TAB_REPLACEMENT.length - 1) * (lines[line - 1].substr(0, column - 1).match(/\\t/g) || []).length;\n\n    if (column > MAX_LINE_LENGTH) {\n        cutLeft = column - OFFSET_CORRECTION + 3;\n        column = OFFSET_CORRECTION - 2;\n    }\n\n    for (let i = startLine; i <= endLine; i++) {\n        if (i >= 0 && i < lines.length) {\n            lines[i] = lines[i].replace(/\\t/g, TAB_REPLACEMENT);\n            lines[i] =\n                (cutLeft > 0 && lines[i].length > cutLeft ? '\\u2026' : '') +\n                lines[i].substr(cutLeft, MAX_LINE_LENGTH - 2) +\n                (lines[i].length > cutLeft + MAX_LINE_LENGTH - 1 ? '\\u2026' : '');\n        }\n    }\n\n    return [\n        processLines(startLine, line),\n        new Array(column + maxNumLength + 2).join('-') + '^',\n        processLines(line, endLine)\n    ].filter(Boolean)\n        .join('\\n')\n        .replace(/^(\\s+\\d+\\s+\\|\\n)+/, '')\n        .replace(/\\n(\\s+\\d+\\s+\\|)+$/, '');\n}\n\nexport function SyntaxError(message, source, offset, line, column, baseLine = 1, baseColumn = 1) {\n    const error = Object.assign(createCustomError('SyntaxError', message), {\n        source,\n        offset,\n        line,\n        column,\n        sourceFragment(extraLines) {\n            return sourceFragment({ source, line, column, baseLine, baseColumn }, isNaN(extraLines) ? 0 : extraLines);\n        },\n        get formattedMessage() {\n            return (\n                `Parse error: ${message}\\n` +\n                sourceFragment({ source, line, column, baseLine, baseColumn }, 2)\n            );\n        }\n    });\n\n    return error;\n}\n","import { WhiteSpace, Comment } from '../tokenizer/index.js';\n\nexport function readSequence(recognizer) {\n    const children = this.createList();\n    let space = false;\n    const context = {\n        recognizer\n    };\n\n    while (!this.eof) {\n        switch (this.tokenType) {\n            case Comment:\n                this.next();\n                continue;\n\n            case WhiteSpace:\n                space = true;\n                this.next();\n                continue;\n        }\n\n        let child = recognizer.getNode.call(this, context);\n\n        if (child === undefined) {\n            break;\n        }\n\n        if (space) {\n            if (recognizer.onWhiteSpace) {\n                recognizer.onWhiteSpace.call(this, child, children, context);\n            }\n            space = false;\n        }\n\n        children.push(child);\n    }\n\n    if (space && recognizer.onWhiteSpace) {\n        recognizer.onWhiteSpace.call(this, null, children, context);\n    }\n\n    return children;\n};\n","import { List } from '../utils/List.js';\nimport { SyntaxError } from './SyntaxError.js';\nimport {\n    tokenize,\n    OffsetToLocation,\n    TokenStream,\n    tokenNames,\n\n    consumeNumber,\n    findWhiteSpaceStart,\n    cmpChar,\n    cmpStr,\n\n    WhiteSpace,\n    Comment,\n    Ident,\n    Function as FunctionToken,\n    Url,\n    Hash,\n    Percentage,\n    Number as NumberToken\n} from '../tokenizer/index.js';\nimport { readSequence } from './sequence.js';\n\nconst NOOP = () => {};\nconst EXCLAMATIONMARK = 0x0021;  // U+0021 EXCLAMATION MARK (!)\nconst NUMBERSIGN = 0x0023;       // U+0023 NUMBER SIGN (#)\nconst SEMICOLON = 0x003B;        // U+003B SEMICOLON (;)\nconst LEFTCURLYBRACKET = 0x007B; // U+007B LEFT CURLY BRACKET ({)\nconst NULL = 0;\n\nfunction createParseContext(name) {\n    return function() {\n        return this[name]();\n    };\n}\n\nfunction fetchParseValues(dict) {\n    const result = Object.create(null);\n\n    for (const name of Object.keys(dict)) {\n        const item = dict[name];\n        const fn = item.parse || item;\n\n        if (fn) {\n            result[name] = fn;\n        }\n    }\n\n    return result;\n}\n\nfunction processConfig(config) {\n    const parseConfig = {\n        context: Object.create(null),\n        features: Object.assign(Object.create(null), config.features),\n        scope: Object.assign(Object.create(null), config.scope),\n        atrule: fetchParseValues(config.atrule),\n        pseudo: fetchParseValues(config.pseudo),\n        node: fetchParseValues(config.node)\n    };\n\n    for (const [name, context] of Object.entries(config.parseContext)) {\n        switch (typeof context) {\n            case 'function':\n                parseConfig.context[name] = context;\n                break;\n\n            case 'string':\n                parseConfig.context[name] = createParseContext(context);\n                break;\n        }\n    }\n\n    return {\n        config: parseConfig,\n        ...parseConfig,\n        ...parseConfig.node\n    };\n}\n\nexport function createParser(config) {\n    let source = '';\n    let filename = '<unknown>';\n    let needPositions = false;\n    let onParseError = NOOP;\n    let onParseErrorThrow = false;\n\n    const locationMap = new OffsetToLocation();\n    const parser = Object.assign(new TokenStream(), processConfig(config || {}), {\n        parseAtrulePrelude: true,\n        parseRulePrelude: true,\n        parseValue: true,\n        parseCustomProperty: false,\n\n        readSequence,\n\n        consumeUntilBalanceEnd: () => 0,\n        consumeUntilLeftCurlyBracket(code) {\n            return code === LEFTCURLYBRACKET ? 1 : 0;\n        },\n        consumeUntilLeftCurlyBracketOrSemicolon(code) {\n            return code === LEFTCURLYBRACKET || code === SEMICOLON ? 1 : 0;\n        },\n        consumeUntilExclamationMarkOrSemicolon(code) {\n            return code === EXCLAMATIONMARK || code === SEMICOLON ? 1 : 0;\n        },\n        consumeUntilSemicolonIncluded(code) {\n            return code === SEMICOLON ? 2 : 0;\n        },\n\n        createList() {\n            return new List();\n        },\n        createSingleNodeList(node) {\n            return new List().appendData(node);\n        },\n        getFirstListNode(list) {\n            return list && list.first;\n        },\n        getLastListNode(list) {\n            return list && list.last;\n        },\n\n        parseWithFallback(consumer, fallback) {\n            const startIndex = this.tokenIndex;\n\n            try {\n                return consumer.call(this);\n            } catch (e) {\n                if (onParseErrorThrow) {\n                    throw e;\n                }\n\n                this.skip(startIndex - this.tokenIndex);\n                const fallbackNode = fallback.call(this);\n\n                onParseErrorThrow = true;\n                onParseError(e, fallbackNode);\n                onParseErrorThrow = false;\n\n                return fallbackNode;\n            }\n        },\n\n        lookupNonWSType(offset) {\n            let type;\n\n            do {\n                type = this.lookupType(offset++);\n                if (type !== WhiteSpace && type !== Comment) {\n                    return type;\n                }\n            } while (type !== NULL);\n\n            return NULL;\n        },\n\n        charCodeAt(offset) {\n            return offset >= 0 && offset < source.length ? source.charCodeAt(offset) : 0;\n        },\n        substring(offsetStart, offsetEnd) {\n            return source.substring(offsetStart, offsetEnd);\n        },\n        substrToCursor(start) {\n            return this.source.substring(start, this.tokenStart);\n        },\n\n        cmpChar(offset, charCode) {\n            return cmpChar(source, offset, charCode);\n        },\n        cmpStr(offsetStart, offsetEnd, str) {\n            return cmpStr(source, offsetStart, offsetEnd, str);\n        },\n\n        consume(tokenType) {\n            const start = this.tokenStart;\n\n            this.eat(tokenType);\n\n            return this.substrToCursor(start);\n        },\n        consumeFunctionName() {\n            const name = source.substring(this.tokenStart, this.tokenEnd - 1);\n\n            this.eat(FunctionToken);\n\n            return name;\n        },\n        consumeNumber(type) {\n            const number = source.substring(this.tokenStart, consumeNumber(source, this.tokenStart));\n\n            this.eat(type);\n\n            return number;\n        },\n\n        eat(tokenType) {\n            if (this.tokenType !== tokenType) {\n                const tokenName = tokenNames[tokenType].slice(0, -6).replace(/-/g, ' ').replace(/^./, m => m.toUpperCase());\n                let message = `${/[[\\](){}]/.test(tokenName) ? `\"${tokenName}\"` : tokenName} is expected`;\n                let offset = this.tokenStart;\n\n                // tweak message and offset\n                switch (tokenType) {\n                    case Ident:\n                        // when identifier is expected but there is a function or url\n                        if (this.tokenType === FunctionToken || this.tokenType === Url) {\n                            offset = this.tokenEnd - 1;\n                            message = 'Identifier is expected but function found';\n                        } else {\n                            message = 'Identifier is expected';\n                        }\n                        break;\n\n                    case Hash:\n                        if (this.isDelim(NUMBERSIGN)) {\n                            this.next();\n                            offset++;\n                            message = 'Name is expected';\n                        }\n                        break;\n\n                    case Percentage:\n                        if (this.tokenType === NumberToken) {\n                            offset = this.tokenEnd;\n                            message = 'Percent sign is expected';\n                        }\n                        break;\n                }\n\n                this.error(message, offset);\n            }\n\n            this.next();\n        },\n        eatIdent(name) {\n            if (this.tokenType !== Ident || this.lookupValue(0, name) === false) {\n                this.error(`Identifier \"${name}\" is expected`);\n            }\n\n            this.next();\n        },\n        eatDelim(code) {\n            if (!this.isDelim(code)) {\n                this.error(`Delim \"${String.fromCharCode(code)}\" is expected`);\n            }\n\n            this.next();\n        },\n\n        getLocation(start, end) {\n            if (needPositions) {\n                return locationMap.getLocationRange(\n                    start,\n                    end,\n                    filename\n                );\n            }\n\n            return null;\n        },\n        getLocationFromList(list) {\n            if (needPositions) {\n                const head = this.getFirstListNode(list);\n                const tail = this.getLastListNode(list);\n                return locationMap.getLocationRange(\n                    head !== null ? head.loc.start.offset - locationMap.startOffset : this.tokenStart,\n                    tail !== null ? tail.loc.end.offset - locationMap.startOffset : this.tokenStart,\n                    filename\n                );\n            }\n\n            return null;\n        },\n\n        error(message, offset) {\n            const location = typeof offset !== 'undefined' && offset < source.length\n                ? locationMap.getLocation(offset)\n                : this.eof\n                    ? locationMap.getLocation(findWhiteSpaceStart(source, source.length - 1))\n                    : locationMap.getLocation(this.tokenStart);\n\n            throw new SyntaxError(\n                message || 'Unexpected input',\n                source,\n                location.offset,\n                location.line,\n                location.column,\n                locationMap.startLine,\n                locationMap.startColumn\n            );\n        }\n    });\n\n    const parse = function(source_, options) {\n        source = source_;\n        options = options || {};\n\n        parser.setSource(source, tokenize);\n        locationMap.setSource(\n            source,\n            options.offset,\n            options.line,\n            options.column\n        );\n\n        filename = options.filename || '<unknown>';\n        needPositions = Boolean(options.positions);\n        onParseError = typeof options.onParseError === 'function' ? options.onParseError : NOOP;\n        onParseErrorThrow = false;\n\n        parser.parseAtrulePrelude = 'parseAtrulePrelude' in options ? Boolean(options.parseAtrulePrelude) : true;\n        parser.parseRulePrelude = 'parseRulePrelude' in options ? Boolean(options.parseRulePrelude) : true;\n        parser.parseValue = 'parseValue' in options ? Boolean(options.parseValue) : true;\n        parser.parseCustomProperty = 'parseCustomProperty' in options ? Boolean(options.parseCustomProperty) : false;\n\n        const { context = 'default', onComment } = options;\n\n        if (context in parser.context === false) {\n            throw new Error('Unknown context `' + context + '`');\n        }\n\n        if (typeof onComment === 'function') {\n            parser.forEachToken((type, start, end) => {\n                if (type === Comment) {\n                    const loc = parser.getLocation(start, end);\n                    const value = cmpStr(source, end - 2, end, '*/')\n                        ? source.slice(start + 2, end - 2)\n                        : source.slice(start + 2, end);\n\n                    onComment(value, loc);\n                }\n            });\n        }\n\n        const ast = parser.context[context].call(parser, options);\n\n        if (!parser.eof) {\n            parser.error();\n        }\n\n        return ast;\n    };\n\n    return Object.assign(parse, {\n        SyntaxError,\n        config: parser.config\n    });\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n  if (0 <= number && number < intToCharMap.length) {\n    return intToCharMap[number];\n  }\n  throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n  var bigA = 65;     // 'A'\n  var bigZ = 90;     // 'Z'\n\n  var littleA = 97;  // 'a'\n  var littleZ = 122; // 'z'\n\n  var zero = 48;     // '0'\n  var nine = 57;     // '9'\n\n  var plus = 43;     // '+'\n  var slash = 47;    // '/'\n\n  var littleOffset = 26;\n  var numberOffset = 52;\n\n  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n  if (bigA <= charCode && charCode <= bigZ) {\n    return (charCode - bigA);\n  }\n\n  // 26 - 51: abcdefghijklmnopqrstuvwxyz\n  if (littleA <= charCode && charCode <= littleZ) {\n    return (charCode - littleA + littleOffset);\n  }\n\n  // 52 - 61: 0123456789\n  if (zero <= charCode && charCode <= nine) {\n    return (charCode - zero + numberOffset);\n  }\n\n  // 62: +\n  if (charCode == plus) {\n    return 62;\n  }\n\n  // 63: /\n  if (charCode == slash) {\n    return 63;\n  }\n\n  // Invalid base64 digit.\n  return -1;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *  * Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n *  * Redistributions in binary form must reproduce the above\n *    copyright notice, this list of conditions and the following\n *    disclaimer in the documentation and/or other materials provided\n *    with the distribution.\n *  * Neither the name of Google Inc. nor the names of its\n *    contributors may be used to endorse or promote products derived\n *    from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = require('./base64');\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n//   Continuation\n//   |    Sign\n//   |    |\n//   V    V\n//   101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n  return aValue < 0\n    ? ((-aValue) << 1) + 1\n    : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n  var isNegative = (aValue & 1) === 1;\n  var shifted = aValue >> 1;\n  return isNegative\n    ? -shifted\n    : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n  var encoded = \"\";\n  var digit;\n\n  var vlq = toVLQSigned(aValue);\n\n  do {\n    digit = vlq & VLQ_BASE_MASK;\n    vlq >>>= VLQ_BASE_SHIFT;\n    if (vlq > 0) {\n      // There are still more digits in this value, so we must make sure the\n      // continuation bit is marked.\n      digit |= VLQ_CONTINUATION_BIT;\n    }\n    encoded += base64.encode(digit);\n  } while (vlq > 0);\n\n  return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n  var strLen = aStr.length;\n  var result = 0;\n  var shift = 0;\n  var continuation, digit;\n\n  do {\n    if (aIndex >= strLen) {\n      throw new Error(\"Expected more digits in base 64 VLQ value.\");\n    }\n\n    digit = base64.decode(aStr.charCodeAt(aIndex++));\n    if (digit === -1) {\n      throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n    }\n\n    continuation = !!(digit & VLQ_CONTINUATION_BIT);\n    digit &= VLQ_BASE_MASK;\n    result = result + (digit << shift);\n    shift += VLQ_BASE_SHIFT;\n  } while (continuation);\n\n  aOutParam.value = fromVLQSigned(result);\n  aOutParam.rest = aIndex;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n  if (aName in aArgs) {\n    return aArgs[aName];\n  } else if (arguments.length === 3) {\n    return aDefaultValue;\n  } else {\n    throw new Error('\"' + aName + '\" is a required argument.');\n  }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n  var match = aUrl.match(urlRegexp);\n  if (!match) {\n    return null;\n  }\n  return {\n    scheme: match[1],\n    auth: match[2],\n    host: match[3],\n    port: match[4],\n    path: match[5]\n  };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n  var url = '';\n  if (aParsedUrl.scheme) {\n    url += aParsedUrl.scheme + ':';\n  }\n  url += '//';\n  if (aParsedUrl.auth) {\n    url += aParsedUrl.auth + '@';\n  }\n  if (aParsedUrl.host) {\n    url += aParsedUrl.host;\n  }\n  if (aParsedUrl.port) {\n    url += \":\" + aParsedUrl.port\n  }\n  if (aParsedUrl.path) {\n    url += aParsedUrl.path;\n  }\n  return url;\n}\nexports.urlGenerate = urlGenerate;\n\nvar MAX_CACHED_INPUTS = 32;\n\n/**\n * Takes some function `f(input) -> result` and returns a memoized version of\n * `f`.\n *\n * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The\n * memoization is a dumb-simple, linear least-recently-used cache.\n */\nfunction lruMemoize(f) {\n  var cache = [];\n\n  return function(input) {\n    for (var i = 0; i < cache.length; i++) {\n      if (cache[i].input === input) {\n        var temp = cache[0];\n        cache[0] = cache[i];\n        cache[i] = temp;\n        return cache[0].result;\n      }\n    }\n\n    var result = f(input);\n\n    cache.unshift({\n      input,\n      result,\n    });\n\n    if (cache.length > MAX_CACHED_INPUTS) {\n      cache.pop();\n    }\n\n    return result;\n  };\n}\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nvar normalize = lruMemoize(function normalize(aPath) {\n  var path = aPath;\n  var url = urlParse(aPath);\n  if (url) {\n    if (!url.path) {\n      return aPath;\n    }\n    path = url.path;\n  }\n  var isAbsolute = exports.isAbsolute(path);\n  // Split the path into parts between `/` characters. This is much faster than\n  // using `.split(/\\/+/g)`.\n  var parts = [];\n  var start = 0;\n  var i = 0;\n  while (true) {\n    start = i;\n    i = path.indexOf(\"/\", start);\n    if (i === -1) {\n      parts.push(path.slice(start));\n      break;\n    } else {\n      parts.push(path.slice(start, i));\n      while (i < path.length && path[i] === \"/\") {\n        i++;\n      }\n    }\n  }\n\n  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n    part = parts[i];\n    if (part === '.') {\n      parts.splice(i, 1);\n    } else if (part === '..') {\n      up++;\n    } else if (up > 0) {\n      if (part === '') {\n        // The first part is blank if the path is absolute. Trying to go\n        // above the root is a no-op. Therefore we can remove all '..' parts\n        // directly after the root.\n        parts.splice(i + 1, up);\n        up = 0;\n      } else {\n        parts.splice(i, 2);\n        up--;\n      }\n    }\n  }\n  path = parts.join('/');\n\n  if (path === '') {\n    path = isAbsolute ? '/' : '.';\n  }\n\n  if (url) {\n    url.path = path;\n    return urlGenerate(url);\n  }\n  return path;\n});\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n *   first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n *   is updated with the result and aRoot is returned. Otherwise the result\n *   is returned.\n *   - If aPath is absolute, the result is aPath.\n *   - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n  if (aPath === \"\") {\n    aPath = \".\";\n  }\n  var aPathUrl = urlParse(aPath);\n  var aRootUrl = urlParse(aRoot);\n  if (aRootUrl) {\n    aRoot = aRootUrl.path || '/';\n  }\n\n  // `join(foo, '//www.example.org')`\n  if (aPathUrl && !aPathUrl.scheme) {\n    if (aRootUrl) {\n      aPathUrl.scheme = aRootUrl.scheme;\n    }\n    return urlGenerate(aPathUrl);\n  }\n\n  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n    return aPath;\n  }\n\n  // `join('http://', 'www.example.com')`\n  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n    aRootUrl.host = aPath;\n    return urlGenerate(aRootUrl);\n  }\n\n  var joined = aPath.charAt(0) === '/'\n    ? aPath\n    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n  if (aRootUrl) {\n    aRootUrl.path = joined;\n    return urlGenerate(aRootUrl);\n  }\n  return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n\n  aRoot = aRoot.replace(/\\/$/, '');\n\n  // It is possible for the path to be above the root. In this case, simply\n  // checking whether the root is a prefix of the path won't work. Instead, we\n  // need to remove components from the root one by one, until either we find\n  // a prefix that fits, or we run out of components to remove.\n  var level = 0;\n  while (aPath.indexOf(aRoot + '/') !== 0) {\n    var index = aRoot.lastIndexOf(\"/\");\n    if (index < 0) {\n      return aPath;\n    }\n\n    // If the only part of the root that is left is the scheme (i.e. http://,\n    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n    // have exhausted all components, so the path is not relative to the root.\n    aRoot = aRoot.slice(0, index);\n    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n      return aPath;\n    }\n\n    ++level;\n  }\n\n  // Make sure we add a \"../\" for each component we removed from the root.\n  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n  return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n  if (!s) {\n    return false;\n  }\n\n  var length = s.length;\n\n  if (length < 9 /* \"__proto__\".length */) {\n    return false;\n  }\n\n  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n    return false;\n  }\n\n  for (var i = length - 10; i >= 0; i--) {\n    if (s.charCodeAt(i) !== 36 /* '$' */) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\nfunction compareByOriginalPositionsNoSource(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositionsNoSource = compareByOriginalPositionsNoSource;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction compareByGeneratedPositionsDeflatedNoLine(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflatedNoLine = compareByGeneratedPositionsDeflatedNoLine;\n\nfunction strcmp(aStr1, aStr2) {\n  if (aStr1 === aStr2) {\n    return 0;\n  }\n\n  if (aStr1 === null) {\n    return 1; // aStr2 !== null\n  }\n\n  if (aStr2 === null) {\n    return -1; // aStr1 !== null\n  }\n\n  if (aStr1 > aStr2) {\n    return 1;\n  }\n\n  return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n      sourceRoot += '/';\n    }\n    // The spec says:\n    //   Line 4: An optional source root, useful for relocating source\n    //   files on a server or removing repeated values in the\n    //   “sources” entry.  This value is prepended to the individual\n    //   entries in the “source” field.\n    sourceURL = sourceRoot + sourceURL;\n  }\n\n  // Historically, SourceMapConsumer did not take the sourceMapURL as\n  // a parameter.  This mode is still somewhat supported, which is why\n  // this code block is conditional.  However, it's preferable to pass\n  // the source map URL to SourceMapConsumer, so that this function\n  // can implement the source URL resolution algorithm as outlined in\n  // the spec.  This block is basically the equivalent of:\n  //    new URL(sourceURL, sourceMapURL).toString()\n  // ... except it avoids using URL, which wasn't available in the\n  // older releases of node still supported by this library.\n  //\n  // The spec says:\n  //   If the sources are not absolute URLs after prepending of the\n  //   “sourceRoot”, the sources are resolved relative to the\n  //   SourceMap (like resolving script src in a html document).\n  if (sourceMapURL) {\n    var parsed = urlParse(sourceMapURL);\n    if (!parsed) {\n      throw new Error(\"sourceMapURL could not be parsed\");\n    }\n    if (parsed.path) {\n      // Strip the last path component, but keep the \"/\".\n      var index = parsed.path.lastIndexOf('/');\n      if (index >= 0) {\n        parsed.path = parsed.path.substring(0, index + 1);\n      }\n    }\n    sourceURL = join(urlGenerate(parsed), sourceURL);\n  }\n\n  return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n  this._array = [];\n  this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n  var set = new ArraySet();\n  for (var i = 0, len = aArray.length; i < len; i++) {\n    set.add(aArray[i], aAllowDuplicates);\n  }\n  return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n  var idx = this._array.length;\n  if (!isDuplicate || aAllowDuplicates) {\n    this._array.push(aStr);\n  }\n  if (!isDuplicate) {\n    if (hasNativeMap) {\n      this._set.set(aStr, idx);\n    } else {\n      this._set[sStr] = idx;\n    }\n  }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n  if (hasNativeMap) {\n    return this._set.has(aStr);\n  } else {\n    var sStr = util.toSetString(aStr);\n    return has.call(this._set, sStr);\n  }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n  if (hasNativeMap) {\n    var idx = this._set.get(aStr);\n    if (idx >= 0) {\n        return idx;\n    }\n  } else {\n    var sStr = util.toSetString(aStr);\n    if (has.call(this._set, sStr)) {\n      return this._set[sStr];\n    }\n  }\n\n  throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n  if (aIdx >= 0 && aIdx < this._array.length) {\n    return this._array[aIdx];\n  }\n  throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n  return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n  // Optimized for most common case\n  var lineA = mappingA.generatedLine;\n  var lineB = mappingB.generatedLine;\n  var columnA = mappingA.generatedColumn;\n  var columnB = mappingB.generatedColumn;\n  return lineB > lineA || lineB == lineA && columnB >= columnA ||\n         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n  this._array = [];\n  this._sorted = true;\n  // Serves as infimum\n  this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n  function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n  };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n  if (generatedPositionAfter(this._last, aMapping)) {\n    this._last = aMapping;\n    this._array.push(aMapping);\n  } else {\n    this._sorted = false;\n    this._array.push(aMapping);\n  }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n  if (!this._sorted) {\n    this._array.sort(util.compareByGeneratedPositionsInflated);\n    this._sorted = true;\n  }\n  return this._array;\n};\n\nexports.MappingList = MappingList;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n *   - file: The filename of the generated source.\n *   - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n  if (!aArgs) {\n    aArgs = {};\n  }\n  this._file = util.getArg(aArgs, 'file', null);\n  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n  this._mappings = new MappingList();\n  this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n    var sourceRoot = aSourceMapConsumer.sourceRoot;\n    var generator = new SourceMapGenerator({\n      file: aSourceMapConsumer.file,\n      sourceRoot: sourceRoot\n    });\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      var newMapping = {\n        generated: {\n          line: mapping.generatedLine,\n          column: mapping.generatedColumn\n        }\n      };\n\n      if (mapping.source != null) {\n        newMapping.source = mapping.source;\n        if (sourceRoot != null) {\n          newMapping.source = util.relative(sourceRoot, newMapping.source);\n        }\n\n        newMapping.original = {\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        };\n\n        if (mapping.name != null) {\n          newMapping.name = mapping.name;\n        }\n      }\n\n      generator.addMapping(newMapping);\n    });\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var sourceRelative = sourceFile;\n      if (sourceRoot !== null) {\n        sourceRelative = util.relative(sourceRoot, sourceFile);\n      }\n\n      if (!generator._sources.has(sourceRelative)) {\n        generator._sources.add(sourceRelative);\n      }\n\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        generator.setSourceContent(sourceFile, content);\n      }\n    });\n    return generator;\n  };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n *   - generated: An object with the generated line and column positions.\n *   - original: An object with the original line and column positions.\n *   - source: The original source file (relative to the sourceRoot).\n *   - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\n    var generated = util.getArg(aArgs, 'generated');\n    var original = util.getArg(aArgs, 'original', null);\n    var source = util.getArg(aArgs, 'source', null);\n    var name = util.getArg(aArgs, 'name', null);\n\n    if (!this._skipValidation) {\n      this._validateMapping(generated, original, source, name);\n    }\n\n    if (source != null) {\n      source = String(source);\n      if (!this._sources.has(source)) {\n        this._sources.add(source);\n      }\n    }\n\n    if (name != null) {\n      name = String(name);\n      if (!this._names.has(name)) {\n        this._names.add(name);\n      }\n    }\n\n    this._mappings.add({\n      generatedLine: generated.line,\n      generatedColumn: generated.column,\n      originalLine: original != null && original.line,\n      originalColumn: original != null && original.column,\n      source: source,\n      name: name\n    });\n  };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n    var source = aSourceFile;\n    if (this._sourceRoot != null) {\n      source = util.relative(this._sourceRoot, source);\n    }\n\n    if (aSourceContent != null) {\n      // Add the source content to the _sourcesContents map.\n      // Create a new _sourcesContents map if the property is null.\n      if (!this._sourcesContents) {\n        this._sourcesContents = Object.create(null);\n      }\n      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n    } else if (this._sourcesContents) {\n      // Remove the source file from the _sourcesContents map.\n      // If the _sourcesContents map is empty, set the property to null.\n      delete this._sourcesContents[util.toSetString(source)];\n      if (Object.keys(this._sourcesContents).length === 0) {\n        this._sourcesContents = null;\n      }\n    }\n  };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n *        If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n *        to be applied. If relative, it is relative to the SourceMapConsumer.\n *        This parameter is needed when the two source maps aren't in the same\n *        directory, and the source map to be applied contains relative source\n *        paths. If so, those relative source paths need to be rewritten\n *        relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n    var sourceFile = aSourceFile;\n    // If aSourceFile is omitted, we will use the file property of the SourceMap\n    if (aSourceFile == null) {\n      if (aSourceMapConsumer.file == null) {\n        throw new Error(\n          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n          'or the source map\\'s \"file\" property. Both were omitted.'\n        );\n      }\n      sourceFile = aSourceMapConsumer.file;\n    }\n    var sourceRoot = this._sourceRoot;\n    // Make \"sourceFile\" relative if an absolute Url is passed.\n    if (sourceRoot != null) {\n      sourceFile = util.relative(sourceRoot, sourceFile);\n    }\n    // Applying the SourceMap can add and remove items from the sources and\n    // the names array.\n    var newSources = new ArraySet();\n    var newNames = new ArraySet();\n\n    // Find mappings for the \"sourceFile\"\n    this._mappings.unsortedForEach(function (mapping) {\n      if (mapping.source === sourceFile && mapping.originalLine != null) {\n        // Check if it can be mapped by the source map, then update the mapping.\n        var original = aSourceMapConsumer.originalPositionFor({\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        });\n        if (original.source != null) {\n          // Copy mapping\n          mapping.source = original.source;\n          if (aSourceMapPath != null) {\n            mapping.source = util.join(aSourceMapPath, mapping.source)\n          }\n          if (sourceRoot != null) {\n            mapping.source = util.relative(sourceRoot, mapping.source);\n          }\n          mapping.originalLine = original.line;\n          mapping.originalColumn = original.column;\n          if (original.name != null) {\n            mapping.name = original.name;\n          }\n        }\n      }\n\n      var source = mapping.source;\n      if (source != null && !newSources.has(source)) {\n        newSources.add(source);\n      }\n\n      var name = mapping.name;\n      if (name != null && !newNames.has(name)) {\n        newNames.add(name);\n      }\n\n    }, this);\n    this._sources = newSources;\n    this._names = newNames;\n\n    // Copy sourcesContents of applied map.\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aSourceMapPath != null) {\n          sourceFile = util.join(aSourceMapPath, sourceFile);\n        }\n        if (sourceRoot != null) {\n          sourceFile = util.relative(sourceRoot, sourceFile);\n        }\n        this.setSourceContent(sourceFile, content);\n      }\n    }, this);\n  };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n *   1. Just the generated position.\n *   2. The Generated position, original position, and original source.\n *   3. Generated and original position, original source, as well as a name\n *      token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\n    // When aOriginal is truthy but has empty values for .line and .column,\n    // it is most likely a programmer error. In this case we throw a very\n    // specific error message to try to guide them the right way.\n    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n        throw new Error(\n            'original.line and original.column are not numbers -- you probably meant to omit ' +\n            'the original mapping entirely and only map the generated position. If so, pass ' +\n            'null for the original mapping instead of an object with empty or null values.'\n        );\n    }\n\n    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\n      }));\n    }\n  };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n  function SourceMapGenerator_serializeMappings() {\n    var previousGeneratedColumn = 0;\n    var previousGeneratedLine = 1;\n    var previousOriginalColumn = 0;\n    var previousOriginalLine = 0;\n    var previousName = 0;\n    var previousSource = 0;\n    var result = '';\n    var next;\n    var mapping;\n    var nameIdx;\n    var sourceIdx;\n\n    var mappings = this._mappings.toArray();\n    for (var i = 0, len = mappings.length; i < len; i++) {\n      mapping = mappings[i];\n      next = ''\n\n      if (mapping.generatedLine !== previousGeneratedLine) {\n        previousGeneratedColumn = 0;\n        while (mapping.generatedLine !== previousGeneratedLine) {\n          next += ';';\n          previousGeneratedLine++;\n        }\n      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\n      previousGeneratedColumn = mapping.generatedColumn;\n\n      if (mapping.source != null) {\n        sourceIdx = this._sources.indexOf(mapping.source);\n        next += base64VLQ.encode(sourceIdx - previousSource);\n        previousSource = sourceIdx;\n\n        // lines are stored 0-based in SourceMap spec version 3\n        next += base64VLQ.encode(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\n        previousOriginalColumn = mapping.originalColumn;\n\n        if (mapping.name != null) {\n          nameIdx = this._names.indexOf(mapping.name);\n          next += base64VLQ.encode(nameIdx - previousName);\n          previousName = nameIdx;\n        }\n      }\n\n      result += next;\n    }\n\n    return result;\n  };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n    return aSources.map(function (source) {\n      if (!this._sourcesContents) {\n        return null;\n      }\n      if (aSourceRoot != null) {\n        source = util.relative(aSourceRoot, source);\n      }\n      var key = util.toSetString(source);\n      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  function SourceMapGenerator_toJSON() {\n    var map = {\n      version: this._version,\n      sources: this._sources.toArray(),\n      names: this._names.toArray(),\n      mappings: this._serializeMappings()\n    };\n    if (this._file != null) {\n      map.file = this._file;\n    }\n    if (this._sourceRoot != null) {\n      map.sourceRoot = this._sourceRoot;\n    }\n    if (this._sourcesContents) {\n      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n","import { SourceMapGenerator } from 'source-map-js/lib/source-map-generator.js';\n\nconst trackNodes = new Set(['Atrule', 'Selector', 'Declaration']);\n\nexport function generateSourceMap(handlers) {\n    const map = new SourceMapGenerator();\n    const generated = {\n        line: 1,\n        column: 0\n    };\n    const original = {\n        line: 0, // should be zero to add first mapping\n        column: 0\n    };\n    const activatedGenerated = {\n        line: 1,\n        column: 0\n    };\n    const activatedMapping = {\n        generated: activatedGenerated\n    };\n    let line = 1;\n    let column = 0;\n    let sourceMappingActive = false;\n\n    const origHandlersNode = handlers.node;\n    handlers.node = function(node) {\n        if (node.loc && node.loc.start && trackNodes.has(node.type)) {\n            const nodeLine = node.loc.start.line;\n            const nodeColumn = node.loc.start.column - 1;\n\n            if (original.line !== nodeLine ||\n                original.column !== nodeColumn) {\n                original.line = nodeLine;\n                original.column = nodeColumn;\n\n                generated.line = line;\n                generated.column = column;\n\n                if (sourceMappingActive) {\n                    sourceMappingActive = false;\n                    if (generated.line !== activatedGenerated.line ||\n                        generated.column !== activatedGenerated.column) {\n                        map.addMapping(activatedMapping);\n                    }\n                }\n\n                sourceMappingActive = true;\n                map.addMapping({\n                    source: node.loc.source,\n                    original,\n                    generated\n                });\n            }\n        }\n\n        origHandlersNode.call(this, node);\n\n        if (sourceMappingActive && trackNodes.has(node.type)) {\n            activatedGenerated.line = line;\n            activatedGenerated.column = column;\n        }\n    };\n\n    const origHandlersEmit = handlers.emit;\n    handlers.emit = function(value, type, auto) {\n        for (let i = 0; i < value.length; i++) {\n            if (value.charCodeAt(i) === 10) { // \\n\n                line++;\n                column = 0;\n            } else {\n                column++;\n            }\n        }\n\n        origHandlersEmit(value, type, auto);\n    };\n\n    const origHandlersResult = handlers.result;\n    handlers.result = function() {\n        if (sourceMappingActive) {\n            map.addMapping(activatedMapping);\n        }\n\n        return {\n            css: origHandlersResult(),\n            map\n        };\n    };\n\n    return handlers;\n};\n","import {\n    WhiteSpace,\n    Delim,\n    Ident,\n    Function as FunctionToken,\n    Url,\n    BadUrl,\n    AtKeyword,\n    Hash,\n    Percentage,\n    Dimension,\n    Number as NumberToken,\n    String as StringToken,\n    Colon,\n    LeftParenthesis,\n    RightParenthesis,\n    CDC\n} from '../tokenizer/index.js';\n\nconst PLUSSIGN = 0x002B;    // U+002B PLUS SIGN (+)\nconst HYPHENMINUS = 0x002D; // U+002D HYPHEN-MINUS (-)\n\nconst code = (type, value) => {\n    if (type === Delim) {\n        type = value;\n    }\n\n    if (typeof type === 'string') {\n        const charCode = type.charCodeAt(0);\n        return charCode > 0x7F ? 0x8000 : charCode << 8;\n    }\n\n    return type;\n};\n\n// https://www.w3.org/TR/css-syntax-3/#serialization\n// The only requirement for serialization is that it must \"round-trip\" with parsing,\n// that is, parsing the stylesheet must produce the same data structures as parsing,\n// serializing, and parsing again, except for consecutive <whitespace-token>s,\n// which may be collapsed into a single token.\n\nconst specPairs = [\n    [Ident, Ident],\n    [Ident, FunctionToken],\n    [Ident, Url],\n    [Ident, BadUrl],\n    [Ident, '-'],\n    [Ident, NumberToken],\n    [Ident, Percentage],\n    [Ident, Dimension],\n    [Ident, CDC],\n    [Ident, LeftParenthesis],\n\n    [AtKeyword, Ident],\n    [AtKeyword, FunctionToken],\n    [AtKeyword, Url],\n    [AtKeyword, BadUrl],\n    [AtKeyword, '-'],\n    [AtKeyword, NumberToken],\n    [AtKeyword, Percentage],\n    [AtKeyword, Dimension],\n    [AtKeyword, CDC],\n\n    [Hash, Ident],\n    [Hash, FunctionToken],\n    [Hash, Url],\n    [Hash, BadUrl],\n    [Hash, '-'],\n    [Hash, NumberToken],\n    [Hash, Percentage],\n    [Hash, Dimension],\n    [Hash, CDC],\n\n    [Dimension, Ident],\n    [Dimension, FunctionToken],\n    [Dimension, Url],\n    [Dimension, BadUrl],\n    [Dimension, '-'],\n    [Dimension, NumberToken],\n    [Dimension, Percentage],\n    [Dimension, Dimension],\n    [Dimension, CDC],\n\n    ['#', Ident],\n    ['#', FunctionToken],\n    ['#', Url],\n    ['#', BadUrl],\n    ['#', '-'],\n    ['#', NumberToken],\n    ['#', Percentage],\n    ['#', Dimension],\n    ['#', CDC], // https://github.com/w3c/csswg-drafts/pull/6874\n\n    ['-', Ident],\n    ['-', FunctionToken],\n    ['-', Url],\n    ['-', BadUrl],\n    ['-', '-'],\n    ['-', NumberToken],\n    ['-', Percentage],\n    ['-', Dimension],\n    ['-', CDC], // https://github.com/w3c/csswg-drafts/pull/6874\n\n    [NumberToken, Ident],\n    [NumberToken, FunctionToken],\n    [NumberToken, Url],\n    [NumberToken, BadUrl],\n    [NumberToken, NumberToken],\n    [NumberToken, Percentage],\n    [NumberToken, Dimension],\n    [NumberToken, '%'],\n    [NumberToken, CDC], // https://github.com/w3c/csswg-drafts/pull/6874\n\n    ['@', Ident],\n    ['@', FunctionToken],\n    ['@', Url],\n    ['@', BadUrl],\n    ['@', '-'],\n    ['@', CDC], // https://github.com/w3c/csswg-drafts/pull/6874\n\n    ['.', NumberToken],\n    ['.', Percentage],\n    ['.', Dimension],\n\n    ['+', NumberToken],\n    ['+', Percentage],\n    ['+', Dimension],\n\n    ['/', '*']\n];\n// validate with scripts/generate-safe\nconst safePairs = specPairs.concat([\n    [Ident, Hash],\n\n    [Dimension, Hash],\n\n    [Hash, Hash],\n\n    [AtKeyword, LeftParenthesis],\n    [AtKeyword, StringToken],\n    [AtKeyword, Colon],\n\n    [Percentage, Percentage],\n    [Percentage, Dimension],\n    [Percentage, FunctionToken],\n    [Percentage, '-'],\n\n    [RightParenthesis, Ident],\n    [RightParenthesis, FunctionToken],\n    [RightParenthesis, Percentage],\n    [RightParenthesis, Dimension],\n    [RightParenthesis, Hash],\n    [RightParenthesis, '-']\n]);\n\nfunction createMap(pairs) {\n    const isWhiteSpaceRequired = new Set(\n        pairs.map(([prev, next]) => (code(prev) << 16 | code(next)))\n    );\n\n    return function(prevCode, type, value) {\n        const nextCode = code(type, value);\n        const nextCharCode = value.charCodeAt(0);\n        const emitWs =\n            (nextCharCode === HYPHENMINUS &&\n                type !== Ident &&\n                type !== FunctionToken &&\n                type !== CDC) ||\n            (nextCharCode === PLUSSIGN)\n                ? isWhiteSpaceRequired.has(prevCode << 16 | nextCharCode << 8)\n                : isWhiteSpaceRequired.has(prevCode << 16 | nextCode);\n\n        if (emitWs) {\n            this.emit(' ', WhiteSpace, true);\n        }\n\n        return nextCode;\n    };\n}\n\nexport const spec = createMap(specPairs);\nexport const safe = createMap(safePairs);\n","import { tokenize, Delim, WhiteSpace } from '../tokenizer/index.js';\nimport { generateSourceMap } from './sourceMap.js';\nimport * as tokenBefore from './token-before.js';\n\nconst REVERSESOLIDUS = 0x005c; // U+005C REVERSE SOLIDUS (\\)\n\nfunction processChildren(node, delimeter) {\n    if (typeof delimeter === 'function') {\n        let prev = null;\n\n        node.children.forEach(node => {\n            if (prev !== null) {\n                delimeter.call(this, prev);\n            }\n\n            this.node(node);\n            prev = node;\n        });\n\n        return;\n    }\n\n    node.children.forEach(this.node, this);\n}\n\nfunction processChunk(chunk) {\n    tokenize(chunk, (type, start, end) => {\n        this.token(type, chunk.slice(start, end));\n    });\n}\n\nexport function createGenerator(config) {\n    const types = new Map();\n\n    for (let [name, item] of Object.entries(config.node)) {\n        const fn = item.generate || item;\n\n        if (typeof fn === 'function') {\n            types.set(name, item.generate || item);\n        }\n    }\n\n    return function(node, options) {\n        let buffer = '';\n        let prevCode = 0;\n        let handlers = {\n            node(node) {\n                if (types.has(node.type)) {\n                    types.get(node.type).call(publicApi, node);\n                } else {\n                    throw new Error('Unknown node type: ' + node.type);\n                }\n            },\n            tokenBefore: tokenBefore.safe,\n            token(type, value) {\n                prevCode = this.tokenBefore(prevCode, type, value);\n\n                this.emit(value, type, false);\n\n                if (type === Delim && value.charCodeAt(0) === REVERSESOLIDUS) {\n                    this.emit('\\n', WhiteSpace, true);\n                }\n            },\n            emit(value) {\n                buffer += value;\n            },\n            result() {\n                return buffer;\n            }\n        };\n\n        if (options) {\n            if (typeof options.decorator === 'function') {\n                handlers = options.decorator(handlers);\n            }\n\n            if (options.sourceMap) {\n                handlers = generateSourceMap(handlers);\n            }\n\n            if (options.mode in tokenBefore) {\n                handlers.tokenBefore = tokenBefore[options.mode];\n            }\n        }\n\n        const publicApi = {\n            node: (node) => handlers.node(node),\n            children: processChildren,\n            token: (type, value) => handlers.token(type, value),\n            tokenize: processChunk\n        };\n\n        handlers.node(node);\n\n        return handlers.result();\n    };\n};\n","const { hasOwnProperty } = Object.prototype;\nconst noop = function() {};\n\nfunction ensureFunction(value) {\n    return typeof value === 'function' ? value : noop;\n}\n\nfunction invokeForType(fn, type) {\n    return function(node, item, list) {\n        if (node.type === type) {\n            fn.call(this, node, item, list);\n        }\n    };\n}\n\nfunction getWalkersFromStructure(name, nodeType) {\n    const structure = nodeType.structure;\n    const walkers = [];\n\n    for (const key in structure) {\n        if (hasOwnProperty.call(structure, key) === false) {\n            continue;\n        }\n\n        let fieldTypes = structure[key];\n        const walker = {\n            name: key,\n            type: false,\n            nullable: false\n        };\n\n        if (!Array.isArray(fieldTypes)) {\n            fieldTypes = [fieldTypes];\n        }\n\n        for (const fieldType of fieldTypes) {\n            if (fieldType === null) {\n                walker.nullable = true;\n            } else if (typeof fieldType === 'string') {\n                walker.type = 'node';\n            } else if (Array.isArray(fieldType)) {\n                walker.type = 'list';\n            }\n        }\n\n        if (walker.type) {\n            walkers.push(walker);\n        }\n    }\n\n    if (walkers.length) {\n        return {\n            context: nodeType.walkContext,\n            fields: walkers\n        };\n    }\n\n    return null;\n}\n\nfunction getTypesFromConfig(config) {\n    const types = {};\n\n    for (const name in config.node) {\n        if (hasOwnProperty.call(config.node, name)) {\n            const nodeType = config.node[name];\n\n            if (!nodeType.structure) {\n                throw new Error('Missed `structure` field in `' + name + '` node type definition');\n            }\n\n            types[name] = getWalkersFromStructure(name, nodeType);\n        }\n    }\n\n    return types;\n}\n\nfunction createTypeIterator(config, reverse) {\n    const fields = config.fields.slice();\n    const contextName = config.context;\n    const useContext = typeof contextName === 'string';\n\n    if (reverse) {\n        fields.reverse();\n    }\n\n    return function(node, context, walk, walkReducer) {\n        let prevContextValue;\n\n        if (useContext) {\n            prevContextValue = context[contextName];\n            context[contextName] = node;\n        }\n\n        for (const field of fields) {\n            const ref = node[field.name];\n\n            if (!field.nullable || ref) {\n                if (field.type === 'list') {\n                    const breakWalk = reverse\n                        ? ref.reduceRight(walkReducer, false)\n                        : ref.reduce(walkReducer, false);\n\n                    if (breakWalk) {\n                        return true;\n                    }\n                } else if (walk(ref)) {\n                    return true;\n                }\n            }\n        }\n\n        if (useContext) {\n            context[contextName] = prevContextValue;\n        }\n    };\n}\n\nfunction createFastTraveralMap({\n    StyleSheet,\n    Atrule,\n    Rule,\n    Block,\n    DeclarationList\n}) {\n    return {\n        Atrule: {\n            StyleSheet,\n            Atrule,\n            Rule,\n            Block\n        },\n        Rule: {\n            StyleSheet,\n            Atrule,\n            Rule,\n            Block\n        },\n        Declaration: {\n            StyleSheet,\n            Atrule,\n            Rule,\n            Block,\n            DeclarationList\n        }\n    };\n}\n\nexport function createWalker(config) {\n    const types = getTypesFromConfig(config);\n    const iteratorsNatural = {};\n    const iteratorsReverse = {};\n    const breakWalk = Symbol('break-walk');\n    const skipNode = Symbol('skip-node');\n\n    for (const name in types) {\n        if (hasOwnProperty.call(types, name) && types[name] !== null) {\n            iteratorsNatural[name] = createTypeIterator(types[name], false);\n            iteratorsReverse[name] = createTypeIterator(types[name], true);\n        }\n    }\n\n    const fastTraversalIteratorsNatural = createFastTraveralMap(iteratorsNatural);\n    const fastTraversalIteratorsReverse = createFastTraveralMap(iteratorsReverse);\n\n    const walk = function(root, options) {\n        function walkNode(node, item, list) {\n            const enterRet = enter.call(context, node, item, list);\n\n            if (enterRet === breakWalk) {\n                return true;\n            }\n\n            if (enterRet === skipNode) {\n                return false;\n            }\n\n            if (iterators.hasOwnProperty(node.type)) {\n                if (iterators[node.type](node, context, walkNode, walkReducer)) {\n                    return true;\n                }\n            }\n\n            if (leave.call(context, node, item, list) === breakWalk) {\n                return true;\n            }\n\n            return false;\n        }\n\n        let enter = noop;\n        let leave = noop;\n        let iterators = iteratorsNatural;\n        let walkReducer = (ret, data, item, list) => ret || walkNode(data, item, list);\n        const context = {\n            break: breakWalk,\n            skip: skipNode,\n\n            root,\n            stylesheet: null,\n            atrule: null,\n            atrulePrelude: null,\n            rule: null,\n            selector: null,\n            block: null,\n            declaration: null,\n            function: null\n        };\n\n        if (typeof options === 'function') {\n            enter = options;\n        } else if (options) {\n            enter = ensureFunction(options.enter);\n            leave = ensureFunction(options.leave);\n\n            if (options.reverse) {\n                iterators = iteratorsReverse;\n            }\n\n            if (options.visit) {\n                if (fastTraversalIteratorsNatural.hasOwnProperty(options.visit)) {\n                    iterators = options.reverse\n                        ? fastTraversalIteratorsReverse[options.visit]\n                        : fastTraversalIteratorsNatural[options.visit];\n                } else if (!types.hasOwnProperty(options.visit)) {\n                    throw new Error('Bad value `' + options.visit + '` for `visit` option (should be: ' + Object.keys(types).sort().join(', ') + ')');\n                }\n\n                enter = invokeForType(enter, options.visit);\n                leave = invokeForType(leave, options.visit);\n            }\n        }\n\n        if (enter === noop && leave === noop) {\n            throw new Error('Neither `enter` nor `leave` walker handler is set or both aren\\'t a function');\n        }\n\n        walkNode(root);\n    };\n\n    walk.break = breakWalk;\n    walk.skip = skipNode;\n\n    walk.find = function(ast, fn) {\n        let found = null;\n\n        walk(ast, function(node, item, list) {\n            if (fn.call(this, node, item, list)) {\n                found = node;\n                return breakWalk;\n            }\n        });\n\n        return found;\n    };\n\n    walk.findLast = function(ast, fn) {\n        let found = null;\n\n        walk(ast, {\n            reverse: true,\n            enter(node, item, list) {\n                if (fn.call(this, node, item, list)) {\n                    found = node;\n                    return breakWalk;\n                }\n            }\n        });\n\n        return found;\n    };\n\n    walk.findAll = function(ast, fn) {\n        const found = [];\n\n        walk(ast, function(node, item, list) {\n            if (fn.call(this, node, item, list)) {\n                found.push(node);\n            }\n        });\n\n        return found;\n    };\n\n    return walk;\n};\n","function noop(value) {\n    return value;\n}\n\nfunction generateMultiplier(multiplier) {\n    const { min, max, comma } = multiplier;\n\n    if (min === 0 && max === 0) {\n        return comma ? '#?' : '*';\n    }\n\n    if (min === 0 && max === 1) {\n        return '?';\n    }\n\n    if (min === 1 && max === 0) {\n        return comma ? '#' : '+';\n    }\n\n    if (min === 1 && max === 1) {\n        return '';\n    }\n\n    return (\n        (comma ? '#' : '') +\n        (min === max\n            ? '{' + min + '}'\n            : '{' + min + ',' + (max !== 0 ? max : '') + '}'\n        )\n    );\n}\n\nfunction generateTypeOpts(node) {\n    switch (node.type) {\n        case 'Range':\n            return (\n                ' [' +\n                (node.min === null ? '-∞' : node.min) +\n                ',' +\n                (node.max === null ? '∞' : node.max) +\n                ']'\n            );\n\n        default:\n            throw new Error('Unknown node type `' + node.type + '`');\n    }\n}\n\nfunction generateSequence(node, decorate, forceBraces, compact) {\n    const combinator = node.combinator === ' ' || compact ? node.combinator : ' ' + node.combinator + ' ';\n    const result = node.terms\n        .map(term => internalGenerate(term, decorate, forceBraces, compact))\n        .join(combinator);\n\n    if (node.explicit || forceBraces) {\n        return (compact || result[0] === ',' ? '[' : '[ ') + result + (compact ? ']' : ' ]');\n    }\n\n    return result;\n}\n\nfunction internalGenerate(node, decorate, forceBraces, compact) {\n    let result;\n\n    switch (node.type) {\n        case 'Group':\n            result =\n                generateSequence(node, decorate, forceBraces, compact) +\n                (node.disallowEmpty ? '!' : '');\n            break;\n\n        case 'Multiplier':\n            // return since node is a composition\n            return (\n                internalGenerate(node.term, decorate, forceBraces, compact) +\n                decorate(generateMultiplier(node), node)\n            );\n\n        case 'Type':\n            result = '<' + node.name + (node.opts ? decorate(generateTypeOpts(node.opts), node.opts) : '') + '>';\n            break;\n\n        case 'Property':\n            result = '<\\'' + node.name + '\\'>';\n            break;\n\n        case 'Keyword':\n            result = node.name;\n            break;\n\n        case 'AtKeyword':\n            result = '@' + node.name;\n            break;\n\n        case 'Function':\n            result = node.name + '(';\n            break;\n\n        case 'String':\n        case 'Token':\n            result = node.value;\n            break;\n\n        case 'Comma':\n            result = ',';\n            break;\n\n        default:\n            throw new Error('Unknown node type `' + node.type + '`');\n    }\n\n    return decorate(result, node);\n}\n\nexport function generate(node, options) {\n    let decorate = noop;\n    let forceBraces = false;\n    let compact = false;\n\n    if (typeof options === 'function') {\n        decorate = options;\n    } else if (options) {\n        forceBraces = Boolean(options.forceBraces);\n        compact = Boolean(options.compact);\n        if (typeof options.decorate === 'function') {\n            decorate = options.decorate;\n        }\n    }\n\n    return internalGenerate(node, decorate, forceBraces, compact);\n};\n","import { createCustomError } from '../utils/create-custom-error.js';\nimport { generate } from '../definition-syntax/generate.js';\n\nconst defaultLoc = { offset: 0, line: 1, column: 1 };\n\nfunction locateMismatch(matchResult, node) {\n    const tokens = matchResult.tokens;\n    const longestMatch = matchResult.longestMatch;\n    const mismatchNode = longestMatch < tokens.length ? tokens[longestMatch].node || null : null;\n    const badNode = mismatchNode !== node ? mismatchNode : null;\n    let mismatchOffset = 0;\n    let mismatchLength = 0;\n    let entries = 0;\n    let css = '';\n    let start;\n    let end;\n\n    for (let i = 0; i < tokens.length; i++) {\n        const token = tokens[i].value;\n\n        if (i === longestMatch) {\n            mismatchLength = token.length;\n            mismatchOffset = css.length;\n        }\n\n        if (badNode !== null && tokens[i].node === badNode) {\n            if (i <= longestMatch) {\n                entries++;\n            } else {\n                entries = 0;\n            }\n        }\n\n        css += token;\n    }\n\n    if (longestMatch === tokens.length || entries > 1) { // last\n        start = fromLoc(badNode || node, 'end') || buildLoc(defaultLoc, css);\n        end = buildLoc(start);\n    } else {\n        start = fromLoc(badNode, 'start') ||\n            buildLoc(fromLoc(node, 'start') || defaultLoc, css.slice(0, mismatchOffset));\n        end = fromLoc(badNode, 'end') ||\n            buildLoc(start, css.substr(mismatchOffset, mismatchLength));\n    }\n\n    return {\n        css,\n        mismatchOffset,\n        mismatchLength,\n        start,\n        end\n    };\n}\n\nfunction fromLoc(node, point) {\n    const value = node && node.loc && node.loc[point];\n\n    if (value) {\n        return 'line' in value ? buildLoc(value) : value;\n    }\n\n    return null;\n}\n\nfunction buildLoc({ offset, line, column }, extra) {\n    const loc = {\n        offset,\n        line,\n        column\n    };\n\n    if (extra) {\n        const lines = extra.split(/\\n|\\r\\n?|\\f/);\n\n        loc.offset += extra.length;\n        loc.line += lines.length - 1;\n        loc.column = lines.length === 1 ? loc.column + extra.length : lines.pop().length + 1;\n    }\n\n    return loc;\n}\n\nexport const SyntaxReferenceError = function(type, referenceName) {\n    const error = createCustomError(\n        'SyntaxReferenceError',\n        type + (referenceName ? ' `' + referenceName + '`' : '')\n    );\n\n    error.reference = referenceName;\n\n    return error;\n};\n\nexport const SyntaxMatchError = function(message, syntax, node, matchResult) {\n    const error = createCustomError('SyntaxMatchError', message);\n    const {\n        css,\n        mismatchOffset,\n        mismatchLength,\n        start,\n        end\n    } = locateMismatch(matchResult, node);\n\n    error.rawMessage = message;\n    error.syntax = syntax ? generate(syntax) : '<generic>';\n    error.css = css;\n    error.mismatchOffset = mismatchOffset;\n    error.mismatchLength = mismatchLength;\n    error.message = message + '\\n' +\n        '  syntax: ' + error.syntax + '\\n' +\n        '   value: ' + (css || '<empty string>') + '\\n' +\n        '  --------' + new Array(error.mismatchOffset + 1).join('-') + '^';\n\n    Object.assign(error, start);\n    error.loc = {\n        source: (node && node.loc && node.loc.source) || '<unknown>',\n        start,\n        end\n    };\n\n    return error;\n};\n","const keywords = new Map();\nconst properties = new Map();\nconst HYPHENMINUS = 45; // '-'.charCodeAt()\n\nexport const keyword = getKeywordDescriptor;\nexport const property = getPropertyDescriptor;\nexport const vendorPrefix = getVendorPrefix;\nexport function isCustomProperty(str, offset) {\n    offset = offset || 0;\n\n    return str.length - offset >= 2 &&\n           str.charCodeAt(offset) === HYPHENMINUS &&\n           str.charCodeAt(offset + 1) === HYPHENMINUS;\n}\n\nfunction getVendorPrefix(str, offset) {\n    offset = offset || 0;\n\n    // verdor prefix should be at least 3 chars length\n    if (str.length - offset >= 3) {\n        // vendor prefix starts with hyper minus following non-hyper minus\n        if (str.charCodeAt(offset) === HYPHENMINUS &&\n            str.charCodeAt(offset + 1) !== HYPHENMINUS) {\n            // vendor prefix should contain a hyper minus at the ending\n            const secondDashIndex = str.indexOf('-', offset + 2);\n\n            if (secondDashIndex !== -1) {\n                return str.substring(offset, secondDashIndex + 1);\n            }\n        }\n    }\n\n    return '';\n}\n\nfunction getKeywordDescriptor(keyword) {\n    if (keywords.has(keyword)) {\n        return keywords.get(keyword);\n    }\n\n    const name = keyword.toLowerCase();\n    let descriptor = keywords.get(name);\n\n    if (descriptor === undefined) {\n        const custom = isCustomProperty(name, 0);\n        const vendor = !custom ? getVendorPrefix(name, 0) : '';\n        descriptor = Object.freeze({\n            basename: name.substr(vendor.length),\n            name,\n            prefix: vendor,\n            vendor,\n            custom\n        });\n    }\n\n    keywords.set(keyword, descriptor);\n\n    return descriptor;\n}\n\nfunction getPropertyDescriptor(property) {\n    if (properties.has(property)) {\n        return properties.get(property);\n    }\n\n    let name = property;\n    let hack = property[0];\n\n    if (hack === '/') {\n        hack = property[1] === '/' ? '//' : '/';\n    } else if (hack !== '_' &&\n               hack !== '*' &&\n               hack !== '$' &&\n               hack !== '#' &&\n               hack !== '+' &&\n               hack !== '&') {\n        hack = '';\n    }\n\n    const custom = isCustomProperty(name, hack.length);\n\n    // re-use result when possible (the same as for lower case)\n    if (!custom) {\n        name = name.toLowerCase();\n        if (properties.has(name)) {\n            const descriptor = properties.get(name);\n            properties.set(property, descriptor);\n            return descriptor;\n        }\n    }\n\n    const vendor = !custom ? getVendorPrefix(name, hack.length) : '';\n    const prefix = name.substr(0, hack.length + vendor.length);\n    const descriptor = Object.freeze({\n        basename: name.substr(prefix.length),\n        name: name.substr(hack.length),\n        hack,\n        vendor,\n        prefix,\n        custom\n    });\n\n    properties.set(property, descriptor);\n\n    return descriptor;\n}\n","// https://drafts.csswg.org/css-cascade-5/\nexport const cssWideKeywords = [\n    'initial',\n    'inherit',\n    'unset',\n    'revert',\n    'revert-layer'\n];\n","import {\n    isDigit,\n    cmpChar,\n    Delim,\n    WhiteSpace,\n    Comment,\n    Ident,\n    Number as NumberToken,\n    Dimension\n} from '../tokenizer/index.js';\n\nconst PLUSSIGN = 0x002B;    // U+002B PLUS SIGN (+)\nconst HYPHENMINUS = 0x002D; // U+002D HYPHEN-MINUS (-)\nconst N = 0x006E;           // U+006E LATIN SMALL LETTER N (n)\nconst DISALLOW_SIGN = true;\nconst ALLOW_SIGN = false;\n\nfunction isDelim(token, code) {\n    return token !== null && token.type === Delim && token.value.charCodeAt(0) === code;\n}\n\nfunction skipSC(token, offset, getNextToken) {\n    while (token !== null && (token.type === WhiteSpace || token.type === Comment)) {\n        token = getNextToken(++offset);\n    }\n\n    return offset;\n}\n\nfunction checkInteger(token, valueOffset, disallowSign, offset) {\n    if (!token) {\n        return 0;\n    }\n\n    const code = token.value.charCodeAt(valueOffset);\n\n    if (code === PLUSSIGN || code === HYPHENMINUS) {\n        if (disallowSign) {\n            // Number sign is not allowed\n            return 0;\n        }\n        valueOffset++;\n    }\n\n    for (; valueOffset < token.value.length; valueOffset++) {\n        if (!isDigit(token.value.charCodeAt(valueOffset))) {\n            // Integer is expected\n            return 0;\n        }\n    }\n\n    return offset + 1;\n}\n\n// ... <signed-integer>\n// ... ['+' | '-'] <signless-integer>\nfunction consumeB(token, offset_, getNextToken) {\n    let sign = false;\n    let offset = skipSC(token, offset_, getNextToken);\n\n    token = getNextToken(offset);\n\n    if (token === null) {\n        return offset_;\n    }\n\n    if (token.type !== NumberToken) {\n        if (isDelim(token, PLUSSIGN) || isDelim(token, HYPHENMINUS)) {\n            sign = true;\n            offset = skipSC(getNextToken(++offset), offset, getNextToken);\n            token = getNextToken(offset);\n\n            if (token === null || token.type !== NumberToken) {\n                return 0;\n            }\n        } else {\n            return offset_;\n        }\n    }\n\n    if (!sign) {\n        const code = token.value.charCodeAt(0);\n        if (code !== PLUSSIGN && code !== HYPHENMINUS) {\n            // Number sign is expected\n            return 0;\n        }\n    }\n\n    return checkInteger(token, sign ? 0 : 1, sign, offset);\n}\n\n// An+B microsyntax https://www.w3.org/TR/css-syntax-3/#anb\nexport default function anPlusB(token, getNextToken) {\n    /* eslint-disable brace-style*/\n    let offset = 0;\n\n    if (!token) {\n        return 0;\n    }\n\n    // <integer>\n    if (token.type === NumberToken) {\n        return checkInteger(token, 0, ALLOW_SIGN, offset); // b\n    }\n\n    // -n\n    // -n <signed-integer>\n    // -n ['+' | '-'] <signless-integer>\n    // -n- <signless-integer>\n    // <dashndashdigit-ident>\n    else if (token.type === Ident && token.value.charCodeAt(0) === HYPHENMINUS) {\n        // expect 1st char is N\n        if (!cmpChar(token.value, 1, N)) {\n            return 0;\n        }\n\n        switch (token.value.length) {\n            // -n\n            // -n <signed-integer>\n            // -n ['+' | '-'] <signless-integer>\n            case 2:\n                return consumeB(getNextToken(++offset), offset, getNextToken);\n\n            // -n- <signless-integer>\n            case 3:\n                if (token.value.charCodeAt(2) !== HYPHENMINUS) {\n                    return 0;\n                }\n\n                offset = skipSC(getNextToken(++offset), offset, getNextToken);\n                token = getNextToken(offset);\n\n                return checkInteger(token, 0, DISALLOW_SIGN, offset);\n\n            // <dashndashdigit-ident>\n            default:\n                if (token.value.charCodeAt(2) !== HYPHENMINUS) {\n                    return 0;\n                }\n\n                return checkInteger(token, 3, DISALLOW_SIGN, offset);\n        }\n    }\n\n    // '+'? n\n    // '+'? n <signed-integer>\n    // '+'? n ['+' | '-'] <signless-integer>\n    // '+'? n- <signless-integer>\n    // '+'? <ndashdigit-ident>\n    else if (token.type === Ident || (isDelim(token, PLUSSIGN) && getNextToken(offset + 1).type === Ident)) {\n        // just ignore a plus\n        if (token.type !== Ident) {\n            token = getNextToken(++offset);\n        }\n\n        if (token === null || !cmpChar(token.value, 0, N)) {\n            return 0;\n        }\n\n        switch (token.value.length) {\n            // '+'? n\n            // '+'? n <signed-integer>\n            // '+'? n ['+' | '-'] <signless-integer>\n            case 1:\n                return consumeB(getNextToken(++offset), offset, getNextToken);\n\n            // '+'? n- <signless-integer>\n            case 2:\n                if (token.value.charCodeAt(1) !== HYPHENMINUS) {\n                    return 0;\n                }\n\n                offset = skipSC(getNextToken(++offset), offset, getNextToken);\n                token = getNextToken(offset);\n\n                return checkInteger(token, 0, DISALLOW_SIGN, offset);\n\n            // '+'? <ndashdigit-ident>\n            default:\n                if (token.value.charCodeAt(1) !== HYPHENMINUS) {\n                    return 0;\n                }\n\n                return checkInteger(token, 2, DISALLOW_SIGN, offset);\n        }\n    }\n\n    // <ndashdigit-dimension>\n    // <ndash-dimension> <signless-integer>\n    // <n-dimension>\n    // <n-dimension> <signed-integer>\n    // <n-dimension> ['+' | '-'] <signless-integer>\n    else if (token.type === Dimension) {\n        let code = token.value.charCodeAt(0);\n        let sign = code === PLUSSIGN || code === HYPHENMINUS ? 1 : 0;\n        let i = sign;\n\n        for (; i < token.value.length; i++) {\n            if (!isDigit(token.value.charCodeAt(i))) {\n                break;\n            }\n        }\n\n        if (i === sign) {\n            // Integer is expected\n            return 0;\n        }\n\n        if (!cmpChar(token.value, i, N)) {\n            return 0;\n        }\n\n        // <n-dimension>\n        // <n-dimension> <signed-integer>\n        // <n-dimension> ['+' | '-'] <signless-integer>\n        if (i + 1 === token.value.length) {\n            return consumeB(getNextToken(++offset), offset, getNextToken);\n        } else {\n            if (token.value.charCodeAt(i + 1) !== HYPHENMINUS) {\n                return 0;\n            }\n\n            // <ndash-dimension> <signless-integer>\n            if (i + 2 === token.value.length) {\n                offset = skipSC(getNextToken(++offset), offset, getNextToken);\n                token = getNextToken(offset);\n\n                return checkInteger(token, 0, DISALLOW_SIGN, offset);\n            }\n            // <ndashdigit-dimension>\n            else {\n                return checkInteger(token, i + 2, DISALLOW_SIGN, offset);\n            }\n        }\n    }\n\n    return 0;\n};\n","import {\n    isHexDigit,\n    cmpChar,\n    Ident,\n    Delim,\n    Number as NumberToken,\n    Dimension\n} from '../tokenizer/index.js';\n\nconst PLUSSIGN = 0x002B;     // U+002B PLUS SIGN (+)\nconst HYPHENMINUS = 0x002D;  // U+002D HYPHEN-MINUS (-)\nconst QUESTIONMARK = 0x003F; // U+003F QUESTION MARK (?)\nconst U = 0x0075;            // U+0075 LATIN SMALL LETTER U (u)\n\nfunction isDelim(token, code) {\n    return token !== null && token.type === Delim && token.value.charCodeAt(0) === code;\n}\n\nfunction startsWith(token, code) {\n    return token.value.charCodeAt(0) === code;\n}\n\nfunction hexSequence(token, offset, allowDash) {\n    let hexlen = 0;\n\n    for (let pos = offset; pos < token.value.length; pos++) {\n        const code = token.value.charCodeAt(pos);\n\n        if (code === HYPHENMINUS && allowDash && hexlen !== 0) {\n            hexSequence(token, offset + hexlen + 1, false);\n            return 6; // dissallow following question marks\n        }\n\n        if (!isHexDigit(code)) {\n            return 0; // not a hex digit\n        }\n\n        if (++hexlen > 6) {\n            return 0; // too many hex digits\n        };\n    }\n\n    return hexlen;\n}\n\nfunction withQuestionMarkSequence(consumed, length, getNextToken) {\n    if (!consumed) {\n        return 0; // nothing consumed\n    }\n\n    while (isDelim(getNextToken(length), QUESTIONMARK)) {\n        if (++consumed > 6) {\n            return 0; // too many question marks\n        }\n\n        length++;\n    }\n\n    return length;\n}\n\n// https://drafts.csswg.org/css-syntax/#urange\n// Informally, the <urange> production has three forms:\n// U+0001\n//      Defines a range consisting of a single code point, in this case the code point \"1\".\n// U+0001-00ff\n//      Defines a range of codepoints between the first and the second value, in this case\n//      the range between \"1\" and \"ff\" (255 in decimal) inclusive.\n// U+00??\n//      Defines a range of codepoints where the \"?\" characters range over all hex digits,\n//      in this case defining the same as the value U+0000-00ff.\n// In each form, a maximum of 6 digits is allowed for each hexadecimal number (if you treat \"?\" as a hexadecimal digit).\n//\n// <urange> =\n//   u '+' <ident-token> '?'* |\n//   u <dimension-token> '?'* |\n//   u <number-token> '?'* |\n//   u <number-token> <dimension-token> |\n//   u <number-token> <number-token> |\n//   u '+' '?'+\nexport default function urange(token, getNextToken) {\n    let length = 0;\n\n    // should start with `u` or `U`\n    if (token === null || token.type !== Ident || !cmpChar(token.value, 0, U)) {\n        return 0;\n    }\n\n    token = getNextToken(++length);\n    if (token === null) {\n        return 0;\n    }\n\n    // u '+' <ident-token> '?'*\n    // u '+' '?'+\n    if (isDelim(token, PLUSSIGN)) {\n        token = getNextToken(++length);\n        if (token === null) {\n            return 0;\n        }\n\n        if (token.type === Ident) {\n            // u '+' <ident-token> '?'*\n            return withQuestionMarkSequence(hexSequence(token, 0, true), ++length, getNextToken);\n        }\n\n        if (isDelim(token, QUESTIONMARK)) {\n            // u '+' '?'+\n            return withQuestionMarkSequence(1, ++length, getNextToken);\n        }\n\n        // Hex digit or question mark is expected\n        return 0;\n    }\n\n    // u <number-token> '?'*\n    // u <number-token> <dimension-token>\n    // u <number-token> <number-token>\n    if (token.type === NumberToken) {\n        const consumedHexLength = hexSequence(token, 1, true);\n        if (consumedHexLength === 0) {\n            return 0;\n        }\n\n        token = getNextToken(++length);\n        if (token === null) {\n            // u <number-token> <eof>\n            return length;\n        }\n\n        if (token.type === Dimension || token.type === NumberToken) {\n            // u <number-token> <dimension-token>\n            // u <number-token> <number-token>\n            if (!startsWith(token, HYPHENMINUS) || !hexSequence(token, 1, false)) {\n                return 0;\n            }\n\n            return length + 1;\n        }\n\n        // u <number-token> '?'*\n        return withQuestionMarkSequence(consumedHexLength, length, getNextToken);\n    }\n\n    // u <dimension-token> '?'*\n    if (token.type === Dimension) {\n        return withQuestionMarkSequence(hexSequence(token, 1, true), ++length, getNextToken);\n    }\n\n    return 0;\n};\n","import { cssWideKeywords } from './generic-const.js';\nimport anPlusB from './generic-an-plus-b.js';\nimport urange from './generic-urange.js';\nimport {\n    isIdentifierStart,\n    isHexDigit,\n    isDigit,\n    cmpStr,\n    consumeNumber,\n\n    Ident,\n    Function as FunctionToken,\n    AtKeyword,\n    Hash,\n    String as StringToken,\n    BadString,\n    Url,\n    BadUrl,\n    Delim,\n    Number as NumberToken,\n    Percentage,\n    Dimension,\n    WhiteSpace,\n    CDO,\n    CDC,\n    Colon,\n    Semicolon,\n    Comma,\n    LeftSquareBracket,\n    RightSquareBracket,\n    LeftParenthesis,\n    RightParenthesis,\n    LeftCurlyBracket,\n    RightCurlyBracket\n} from '../tokenizer/index.js';\n\nconst calcFunctionNames = ['calc(', '-moz-calc(', '-webkit-calc('];\nconst balancePair = new Map([\n    [FunctionToken, RightParenthesis],\n    [LeftParenthesis, RightParenthesis],\n    [LeftSquareBracket, RightSquareBracket],\n    [LeftCurlyBracket, RightCurlyBracket]\n]);\n\n// safe char code getter\nfunction charCodeAt(str, index) {\n    return index < str.length ? str.charCodeAt(index) : 0;\n}\n\nfunction eqStr(actual, expected) {\n    return cmpStr(actual, 0, actual.length, expected);\n}\n\nfunction eqStrAny(actual, expected) {\n    for (let i = 0; i < expected.length; i++) {\n        if (eqStr(actual, expected[i])) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\n// IE postfix hack, i.e. 123\\0 or 123px\\9\nfunction isPostfixIeHack(str, offset) {\n    if (offset !== str.length - 2) {\n        return false;\n    }\n\n    return (\n        charCodeAt(str, offset) === 0x005C &&  // U+005C REVERSE SOLIDUS (\\)\n        isDigit(charCodeAt(str, offset + 1))\n    );\n}\n\nfunction outOfRange(opts, value, numEnd) {\n    if (opts && opts.type === 'Range') {\n        const num = Number(\n            numEnd !== undefined && numEnd !== value.length\n                ? value.substr(0, numEnd)\n                : value\n        );\n\n        if (isNaN(num)) {\n            return true;\n        }\n\n        // FIXME: when opts.min is a string it's a dimension, skip a range validation\n        // for now since it requires a type covertation which is not implmented yet\n        if (opts.min !== null && num < opts.min && typeof opts.min !== 'string') {\n            return true;\n        }\n\n        // FIXME: when opts.max is a string it's a dimension, skip a range validation\n        // for now since it requires a type covertation which is not implmented yet\n        if (opts.max !== null && num > opts.max && typeof opts.max !== 'string') {\n            return true;\n        }\n    }\n\n    return false;\n}\n\nfunction consumeFunction(token, getNextToken) {\n    let balanceCloseType = 0;\n    let balanceStash = [];\n    let length = 0;\n\n    // balanced token consuming\n    scan:\n    do {\n        switch (token.type) {\n            case RightCurlyBracket:\n            case RightParenthesis:\n            case RightSquareBracket:\n                if (token.type !== balanceCloseType) {\n                    break scan;\n                }\n\n                balanceCloseType = balanceStash.pop();\n\n                if (balanceStash.length === 0) {\n                    length++;\n                    break scan;\n                }\n\n                break;\n\n            case FunctionToken:\n            case LeftParenthesis:\n            case LeftSquareBracket:\n            case LeftCurlyBracket:\n                balanceStash.push(balanceCloseType);\n                balanceCloseType = balancePair.get(token.type);\n                break;\n        }\n\n        length++;\n    } while (token = getNextToken(length));\n\n    return length;\n}\n\n// TODO: implement\n// can be used wherever <length>, <frequency>, <angle>, <time>, <percentage>, <number>, or <integer> values are allowed\n// https://drafts.csswg.org/css-values/#calc-notation\nfunction calc(next) {\n    return function(token, getNextToken, opts) {\n        if (token === null) {\n            return 0;\n        }\n\n        if (token.type === FunctionToken && eqStrAny(token.value, calcFunctionNames)) {\n            return consumeFunction(token, getNextToken);\n        }\n\n        return next(token, getNextToken, opts);\n    };\n}\n\nfunction tokenType(expectedTokenType) {\n    return function(token) {\n        if (token === null || token.type !== expectedTokenType) {\n            return 0;\n        }\n\n        return 1;\n    };\n}\n\n// =========================\n// Complex types\n//\n\n// https://drafts.csswg.org/css-values-4/#custom-idents\n// 4.2. Author-defined Identifiers: the <custom-ident> type\n// Some properties accept arbitrary author-defined identifiers as a component value.\n// This generic data type is denoted by <custom-ident>, and represents any valid CSS identifier\n// that would not be misinterpreted as a pre-defined keyword in that property’s value definition.\n//\n// See also: https://developer.mozilla.org/en-US/docs/Web/CSS/custom-ident\nfunction customIdent(token) {\n    if (token === null || token.type !== Ident) {\n        return 0;\n    }\n\n    const name = token.value.toLowerCase();\n\n    // The CSS-wide keywords are not valid <custom-ident>s\n    if (eqStrAny(name, cssWideKeywords)) {\n        return 0;\n    }\n\n    // The default keyword is reserved and is also not a valid <custom-ident>\n    if (eqStr(name, 'default')) {\n        return 0;\n    }\n\n    // TODO: ignore property specific keywords (as described https://developer.mozilla.org/en-US/docs/Web/CSS/custom-ident)\n    // Specifications using <custom-ident> must specify clearly what other keywords\n    // are excluded from <custom-ident>, if any—for example by saying that any pre-defined keywords\n    // in that property’s value definition are excluded. Excluded keywords are excluded\n    // in all ASCII case permutations.\n\n    return 1;\n}\n\n// https://drafts.csswg.org/css-values-4/#dashed-idents\n// The <dashed-ident> production is a <custom-ident>, with all the case-sensitivity that implies,\n// with the additional restriction that it must start with two dashes (U+002D HYPHEN-MINUS).\nfunction dashedIdent(token) {\n    if (token === null || token.type !== Ident) {\n        return 0;\n    }\n\n    // ... must start with two dashes (U+002D HYPHEN-MINUS)\n    if (charCodeAt(token.value, 0) !== 0x002D || charCodeAt(token.value, 1) !== 0x002D) {\n        return 0;\n    }\n\n    return 1;\n}\n\n// https://drafts.csswg.org/css-variables/#typedef-custom-property-name\n// A custom property is any property whose name starts with two dashes (U+002D HYPHEN-MINUS), like --foo.\n// The <custom-property-name> production corresponds to this: it’s defined as any <dashed-ident>\n// (a valid identifier that starts with two dashes), except -- itself, which is reserved for future use by CSS.\nfunction customPropertyName(token) {\n    // ... it’s defined as any <dashed-ident>\n    if (!dashedIdent(token)) {\n        return 0;\n    }\n\n    // ... except -- itself, which is reserved for future use by CSS\n    if (token.value === '--') {\n        return 0;\n    }\n\n    return 1;\n}\n\n// https://drafts.csswg.org/css-color-4/#hex-notation\n// The syntax of a <hex-color> is a <hash-token> token whose value consists of 3, 4, 6, or 8 hexadecimal digits.\n// In other words, a hex color is written as a hash character, \"#\", followed by some number of digits 0-9 or\n// letters a-f (the case of the letters doesn’t matter - #00ff00 is identical to #00FF00).\nfunction hexColor(token) {\n    if (token === null || token.type !== Hash) {\n        return 0;\n    }\n\n    const length = token.value.length;\n\n    // valid values (length): #rgb (4), #rgba (5), #rrggbb (7), #rrggbbaa (9)\n    if (length !== 4 && length !== 5 && length !== 7 && length !== 9) {\n        return 0;\n    }\n\n    for (let i = 1; i < length; i++) {\n        if (!isHexDigit(charCodeAt(token.value, i))) {\n            return 0;\n        }\n    }\n\n    return 1;\n}\n\nfunction idSelector(token) {\n    if (token === null || token.type !== Hash) {\n        return 0;\n    }\n\n    if (!isIdentifierStart(charCodeAt(token.value, 1), charCodeAt(token.value, 2), charCodeAt(token.value, 3))) {\n        return 0;\n    }\n\n    return 1;\n}\n\n// https://drafts.csswg.org/css-syntax/#any-value\n// It represents the entirety of what a valid declaration can have as its value.\nfunction declarationValue(token, getNextToken) {\n    if (!token) {\n        return 0;\n    }\n\n    let balanceCloseType = 0;\n    let balanceStash = [];\n    let length = 0;\n\n    // The <declaration-value> production matches any sequence of one or more tokens,\n    // so long as the sequence does not contain ...\n    scan:\n    do {\n        switch (token.type) {\n            // ... <bad-string-token>, <bad-url-token>,\n            case BadString:\n            case BadUrl:\n                break scan;\n\n            // ... unmatched <)-token>, <]-token>, or <}-token>,\n            case RightCurlyBracket:\n            case RightParenthesis:\n            case RightSquareBracket:\n                if (token.type !== balanceCloseType) {\n                    break scan;\n                }\n\n                balanceCloseType = balanceStash.pop();\n                break;\n\n            // ... or top-level <semicolon-token> tokens\n            case Semicolon:\n                if (balanceCloseType === 0) {\n                    break scan;\n                }\n\n                break;\n\n            // ... or <delim-token> tokens with a value of \"!\"\n            case Delim:\n                if (balanceCloseType === 0 && token.value === '!') {\n                    break scan;\n                }\n\n                break;\n\n            case FunctionToken:\n            case LeftParenthesis:\n            case LeftSquareBracket:\n            case LeftCurlyBracket:\n                balanceStash.push(balanceCloseType);\n                balanceCloseType = balancePair.get(token.type);\n                break;\n        }\n\n        length++;\n    } while (token = getNextToken(length));\n\n    return length;\n}\n\n// https://drafts.csswg.org/css-syntax/#any-value\n// The <any-value> production is identical to <declaration-value>, but also\n// allows top-level <semicolon-token> tokens and <delim-token> tokens\n// with a value of \"!\". It represents the entirety of what valid CSS can be in any context.\nfunction anyValue(token, getNextToken) {\n    if (!token) {\n        return 0;\n    }\n\n    let balanceCloseType = 0;\n    let balanceStash = [];\n    let length = 0;\n\n    // The <any-value> production matches any sequence of one or more tokens,\n    // so long as the sequence ...\n    scan:\n    do {\n        switch (token.type) {\n            // ... does not contain <bad-string-token>, <bad-url-token>,\n            case BadString:\n            case BadUrl:\n                break scan;\n\n            // ... unmatched <)-token>, <]-token>, or <}-token>,\n            case RightCurlyBracket:\n            case RightParenthesis:\n            case RightSquareBracket:\n                if (token.type !== balanceCloseType) {\n                    break scan;\n                }\n\n                balanceCloseType = balanceStash.pop();\n                break;\n\n            case FunctionToken:\n            case LeftParenthesis:\n            case LeftSquareBracket:\n            case LeftCurlyBracket:\n                balanceStash.push(balanceCloseType);\n                balanceCloseType = balancePair.get(token.type);\n                break;\n        }\n\n        length++;\n    } while (token = getNextToken(length));\n\n    return length;\n}\n\n// =========================\n// Dimensions\n//\n\nfunction dimension(type) {\n    if (type) {\n        type = new Set(type);\n    }\n\n    return function(token, getNextToken, opts) {\n        if (token === null || token.type !== Dimension) {\n            return 0;\n        }\n\n        const numberEnd = consumeNumber(token.value, 0);\n\n        // check unit\n        if (type !== null) {\n            // check for IE postfix hack, i.e. 123px\\0 or 123px\\9\n            const reverseSolidusOffset = token.value.indexOf('\\\\', numberEnd);\n            const unit = reverseSolidusOffset === -1 || !isPostfixIeHack(token.value, reverseSolidusOffset)\n                ? token.value.substr(numberEnd)\n                : token.value.substring(numberEnd, reverseSolidusOffset);\n\n            if (type.has(unit.toLowerCase()) === false) {\n                return 0;\n            }\n        }\n\n        // check range if specified\n        if (outOfRange(opts, token.value, numberEnd)) {\n            return 0;\n        }\n\n        return 1;\n    };\n}\n\n// =========================\n// Percentage\n//\n\n// §5.5. Percentages: the <percentage> type\n// https://drafts.csswg.org/css-values-4/#percentages\nfunction percentage(token, getNextToken, opts) {\n    // ... corresponds to the <percentage-token> production\n    if (token === null || token.type !== Percentage) {\n        return 0;\n    }\n\n    // check range if specified\n    if (outOfRange(opts, token.value, token.value.length - 1)) {\n        return 0;\n    }\n\n    return 1;\n}\n\n// =========================\n// Numeric\n//\n\n// https://drafts.csswg.org/css-values-4/#numbers\n// The value <zero> represents a literal number with the value 0. Expressions that merely\n// evaluate to a <number> with the value 0 (for example, calc(0)) do not match <zero>;\n// only literal <number-token>s do.\nfunction zero(next) {\n    if (typeof next !== 'function') {\n        next = function() {\n            return 0;\n        };\n    }\n\n    return function(token, getNextToken, opts) {\n        if (token !== null && token.type === NumberToken) {\n            if (Number(token.value) === 0) {\n                return 1;\n            }\n        }\n\n        return next(token, getNextToken, opts);\n    };\n}\n\n// § 5.3. Real Numbers: the <number> type\n// https://drafts.csswg.org/css-values-4/#numbers\n// Number values are denoted by <number>, and represent real numbers, possibly with a fractional component.\n// ... It corresponds to the <number-token> production\nfunction number(token, getNextToken, opts) {\n    if (token === null) {\n        return 0;\n    }\n\n    const numberEnd = consumeNumber(token.value, 0);\n    const isNumber = numberEnd === token.value.length;\n    if (!isNumber && !isPostfixIeHack(token.value, numberEnd)) {\n        return 0;\n    }\n\n    // check range if specified\n    if (outOfRange(opts, token.value, numberEnd)) {\n        return 0;\n    }\n\n    return 1;\n}\n\n// §5.2. Integers: the <integer> type\n// https://drafts.csswg.org/css-values-4/#integers\nfunction integer(token, getNextToken, opts) {\n    // ... corresponds to a subset of the <number-token> production\n    if (token === null || token.type !== NumberToken) {\n        return 0;\n    }\n\n    // The first digit of an integer may be immediately preceded by `-` or `+` to indicate the integer’s sign.\n    let i = charCodeAt(token.value, 0) === 0x002B ||       // U+002B PLUS SIGN (+)\n            charCodeAt(token.value, 0) === 0x002D ? 1 : 0; // U+002D HYPHEN-MINUS (-)\n\n    // When written literally, an integer is one or more decimal digits 0 through 9 ...\n    for (; i < token.value.length; i++) {\n        if (!isDigit(charCodeAt(token.value, i))) {\n            return 0;\n        }\n    }\n\n    // check range if specified\n    if (outOfRange(opts, token.value, i)) {\n        return 0;\n    }\n\n    return 1;\n}\n\n// token types\nexport const tokenTypes = {\n    'ident-token': tokenType(Ident),\n    'function-token': tokenType(FunctionToken),\n    'at-keyword-token': tokenType(AtKeyword),\n    'hash-token': tokenType(Hash),\n    'string-token': tokenType(StringToken),\n    'bad-string-token': tokenType(BadString),\n    'url-token': tokenType(Url),\n    'bad-url-token': tokenType(BadUrl),\n    'delim-token': tokenType(Delim),\n    'number-token': tokenType(NumberToken),\n    'percentage-token': tokenType(Percentage),\n    'dimension-token': tokenType(Dimension),\n    'whitespace-token': tokenType(WhiteSpace),\n    'CDO-token': tokenType(CDO),\n    'CDC-token': tokenType(CDC),\n    'colon-token': tokenType(Colon),\n    'semicolon-token': tokenType(Semicolon),\n    'comma-token': tokenType(Comma),\n    '[-token': tokenType(LeftSquareBracket),\n    ']-token': tokenType(RightSquareBracket),\n    '(-token': tokenType(LeftParenthesis),\n    ')-token': tokenType(RightParenthesis),\n    '{-token': tokenType(LeftCurlyBracket),\n    '}-token': tokenType(RightCurlyBracket)\n};\n\n// token production types\nexport const productionTypes = {\n    // token type aliases\n    'string': tokenType(StringToken),\n    'ident': tokenType(Ident),\n\n    // percentage\n    'percentage': calc(percentage),\n\n    // numeric\n    'zero': zero(),\n    'number': calc(number),\n    'integer': calc(integer),\n\n    // complex types\n    'custom-ident': customIdent,\n    'dashed-ident': dashedIdent,\n    'custom-property-name': customPropertyName,\n    'hex-color': hexColor,\n    'id-selector': idSelector, // element( <id-selector> )\n    'an-plus-b': anPlusB,\n    'urange': urange,\n    'declaration-value': declarationValue,\n    'any-value': anyValue\n};\n\nexport const unitGroups = [\n    'length',\n    'angle',\n    'time',\n    'frequency',\n    'resolution',\n    'flex',\n    'decibel',\n    'semitones'\n];\n\n// dimensions types depend on units set\nexport function createDemensionTypes(units) {\n    const {\n        angle,\n        decibel,\n        frequency,\n        flex,\n        length,\n        resolution,\n        semitones,\n        time\n    } = units || {};\n\n    return {\n        'dimension': calc(dimension(null)),\n        'angle': calc(dimension(angle)),\n        'decibel': calc(dimension(decibel)),\n        'frequency': calc(dimension(frequency)),\n        'flex': calc(dimension(flex)),\n        'length': calc(zero(dimension(length))),\n        'resolution': calc(dimension(resolution)),\n        'semitones': calc(dimension(semitones)),\n        'time': calc(dimension(time))\n    };\n}\n\nexport function createGenericTypes(units) {\n    return {\n        ...tokenTypes,\n        ...productionTypes,\n        ...createDemensionTypes(units)\n    };\n};\n","export const length = [\n    // absolute length units https://www.w3.org/TR/css-values-3/#lengths\n    'cm', 'mm', 'q', 'in', 'pt', 'pc', 'px',\n    // font-relative length units https://drafts.csswg.org/css-values-4/#font-relative-lengths\n    'em', 'rem',\n    'ex', 'rex',\n    'cap', 'rcap',\n    'ch', 'rch',\n    'ic', 'ric',\n    'lh', 'rlh',\n    // viewport-percentage lengths https://drafts.csswg.org/css-values-4/#viewport-relative-lengths\n    'vw', 'svw', 'lvw', 'dvw',\n    'vh', 'svh', 'lvh', 'dvh',\n    'vi', 'svi', 'lvi', 'dvi',\n    'vb', 'svb', 'lvb', 'dvb',\n    'vmin', 'svmin', 'lvmin', 'dvmin',\n    'vmax', 'svmax', 'lvmax', 'dvmax',\n    // container relative lengths https://drafts.csswg.org/css-contain-3/#container-lengths\n    'cqw', 'cqh', 'cqi', 'cqb', 'cqmin', 'cqmax'\n];\nexport const angle = ['deg', 'grad', 'rad', 'turn'];    // https://www.w3.org/TR/css-values-3/#angles\nexport const time = ['s', 'ms'];                        // https://www.w3.org/TR/css-values-3/#time\nexport const frequency = ['hz', 'khz'];                 // https://www.w3.org/TR/css-values-3/#frequency\nexport const resolution = ['dpi', 'dpcm', 'dppx', 'x']; // https://www.w3.org/TR/css-values-3/#resolution\nexport const flex = ['fr'];                             // https://drafts.csswg.org/css-grid/#fr-unit\nexport const decibel = ['db'];                          // https://www.w3.org/TR/css3-speech/#mixing-props-voice-volume\nexport const semitones = ['st'];                        // https://www.w3.org/TR/css3-speech/#voice-props-voice-pitch\n","import { createCustomError } from '../utils/create-custom-error.js';\n\nexport function SyntaxError(message, input, offset) {\n    return Object.assign(createCustomError('SyntaxError', message), {\n        input,\n        offset,\n        rawMessage: message,\n        message: message + '\\n' +\n            '  ' + input + '\\n' +\n            '--' + new Array((offset || input.length) + 1).join('-') + '^'\n    });\n};\n","import { SyntaxError } from './SyntaxError.js';\n\nconst TAB = 9;\nconst N = 10;\nconst F = 12;\nconst R = 13;\nconst SPACE = 32;\n\nexport class Tokenizer {\n    constructor(str) {\n        this.str = str;\n        this.pos = 0;\n    }\n    charCodeAt(pos) {\n        return pos < this.str.length ? this.str.charCodeAt(pos) : 0;\n    }\n    charCode() {\n        return this.charCodeAt(this.pos);\n    }\n    nextCharCode() {\n        return this.charCodeAt(this.pos + 1);\n    }\n    nextNonWsCode(pos) {\n        return this.charCodeAt(this.findWsEnd(pos));\n    }\n    findWsEnd(pos) {\n        for (; pos < this.str.length; pos++) {\n            const code = this.str.charCodeAt(pos);\n            if (code !== R && code !== N && code !== F && code !== SPACE && code !== TAB) {\n                break;\n            }\n        }\n\n        return pos;\n    }\n    substringToPos(end) {\n        return this.str.substring(this.pos, this.pos = end);\n    }\n    eat(code) {\n        if (this.charCode() !== code) {\n            this.error('Expect `' + String.fromCharCode(code) + '`');\n        }\n\n        this.pos++;\n    }\n    peek() {\n        return this.pos < this.str.length ? this.str.charAt(this.pos++) : '';\n    }\n    error(message) {\n        throw new SyntaxError(message, this.str, this.pos);\n    }\n};\n","import { Tokenizer } from './tokenizer.js';\n\nconst TAB = 9;\nconst N = 10;\nconst F = 12;\nconst R = 13;\nconst SPACE = 32;\nconst EXCLAMATIONMARK = 33;    // !\nconst NUMBERSIGN = 35;         // #\nconst AMPERSAND = 38;          // &\nconst APOSTROPHE = 39;         // '\nconst LEFTPARENTHESIS = 40;    // (\nconst RIGHTPARENTHESIS = 41;   // )\nconst ASTERISK = 42;           // *\nconst PLUSSIGN = 43;           // +\nconst COMMA = 44;              // ,\nconst HYPERMINUS = 45;         // -\nconst LESSTHANSIGN = 60;       // <\nconst GREATERTHANSIGN = 62;    // >\nconst QUESTIONMARK = 63;       // ?\nconst COMMERCIALAT = 64;       // @\nconst LEFTSQUAREBRACKET = 91;  // [\nconst RIGHTSQUAREBRACKET = 93; // ]\nconst LEFTCURLYBRACKET = 123;  // {\nconst VERTICALLINE = 124;      // |\nconst RIGHTCURLYBRACKET = 125; // }\nconst INFINITY = 8734;         // ∞\nconst NAME_CHAR = new Uint8Array(128).map((_, idx) =>\n    /[a-zA-Z0-9\\-]/.test(String.fromCharCode(idx)) ? 1 : 0\n);\nconst COMBINATOR_PRECEDENCE = {\n    ' ': 1,\n    '&&': 2,\n    '||': 3,\n    '|': 4\n};\n\nfunction scanSpaces(tokenizer) {\n    return tokenizer.substringToPos(\n        tokenizer.findWsEnd(tokenizer.pos)\n    );\n}\n\nfunction scanWord(tokenizer) {\n    let end = tokenizer.pos;\n\n    for (; end < tokenizer.str.length; end++) {\n        const code = tokenizer.str.charCodeAt(end);\n        if (code >= 128 || NAME_CHAR[code] === 0) {\n            break;\n        }\n    }\n\n    if (tokenizer.pos === end) {\n        tokenizer.error('Expect a keyword');\n    }\n\n    return tokenizer.substringToPos(end);\n}\n\nfunction scanNumber(tokenizer) {\n    let end = tokenizer.pos;\n\n    for (; end < tokenizer.str.length; end++) {\n        const code = tokenizer.str.charCodeAt(end);\n        if (code < 48 || code > 57) {\n            break;\n        }\n    }\n\n    if (tokenizer.pos === end) {\n        tokenizer.error('Expect a number');\n    }\n\n    return tokenizer.substringToPos(end);\n}\n\nfunction scanString(tokenizer) {\n    const end = tokenizer.str.indexOf('\\'', tokenizer.pos + 1);\n\n    if (end === -1) {\n        tokenizer.pos = tokenizer.str.length;\n        tokenizer.error('Expect an apostrophe');\n    }\n\n    return tokenizer.substringToPos(end + 1);\n}\n\nfunction readMultiplierRange(tokenizer) {\n    let min = null;\n    let max = null;\n\n    tokenizer.eat(LEFTCURLYBRACKET);\n\n    min = scanNumber(tokenizer);\n\n    if (tokenizer.charCode() === COMMA) {\n        tokenizer.pos++;\n        if (tokenizer.charCode() !== RIGHTCURLYBRACKET) {\n            max = scanNumber(tokenizer);\n        }\n    } else {\n        max = min;\n    }\n\n    tokenizer.eat(RIGHTCURLYBRACKET);\n\n    return {\n        min: Number(min),\n        max: max ? Number(max) : 0\n    };\n}\n\nfunction readMultiplier(tokenizer) {\n    let range = null;\n    let comma = false;\n\n    switch (tokenizer.charCode()) {\n        case ASTERISK:\n            tokenizer.pos++;\n\n            range = {\n                min: 0,\n                max: 0\n            };\n\n            break;\n\n        case PLUSSIGN:\n            tokenizer.pos++;\n\n            range = {\n                min: 1,\n                max: 0\n            };\n\n            break;\n\n        case QUESTIONMARK:\n            tokenizer.pos++;\n\n            range = {\n                min: 0,\n                max: 1\n            };\n\n            break;\n\n        case NUMBERSIGN:\n            tokenizer.pos++;\n\n            comma = true;\n\n            if (tokenizer.charCode() === LEFTCURLYBRACKET) {\n                range = readMultiplierRange(tokenizer);\n            } else if (tokenizer.charCode() === QUESTIONMARK) {\n                // https://www.w3.org/TR/css-values-4/#component-multipliers\n                // > the # and ? multipliers may be stacked as #?\n                // In this case just treat \"#?\" as a single multiplier\n                // { min: 0, max: 0, comma: true }\n                tokenizer.pos++;\n                range = {\n                    min: 0,\n                    max: 0\n                };\n            } else {\n                range = {\n                    min: 1,\n                    max: 0\n                };\n            }\n\n            break;\n\n        case LEFTCURLYBRACKET:\n            range = readMultiplierRange(tokenizer);\n            break;\n\n        default:\n            return null;\n    }\n\n    return {\n        type: 'Multiplier',\n        comma,\n        min: range.min,\n        max: range.max,\n        term: null\n    };\n}\n\nfunction maybeMultiplied(tokenizer, node) {\n    const multiplier = readMultiplier(tokenizer);\n\n    if (multiplier !== null) {\n        multiplier.term = node;\n\n        // https://www.w3.org/TR/css-values-4/#component-multipliers\n        // > The + and # multipliers may be stacked as +#;\n        // Represent \"+#\" as nested multipliers:\n        // { ...<multiplier #>,\n        //   term: {\n        //     ...<multipler +>,\n        //     term: node\n        //   }\n        // }\n        if (tokenizer.charCode() === NUMBERSIGN &&\n            tokenizer.charCodeAt(tokenizer.pos - 1) === PLUSSIGN) {\n            return maybeMultiplied(tokenizer, multiplier);\n        }\n\n        return multiplier;\n    }\n\n    return node;\n}\n\nfunction maybeToken(tokenizer) {\n    const ch = tokenizer.peek();\n\n    if (ch === '') {\n        return null;\n    }\n\n    return {\n        type: 'Token',\n        value: ch\n    };\n}\n\nfunction readProperty(tokenizer) {\n    let name;\n\n    tokenizer.eat(LESSTHANSIGN);\n    tokenizer.eat(APOSTROPHE);\n\n    name = scanWord(tokenizer);\n\n    tokenizer.eat(APOSTROPHE);\n    tokenizer.eat(GREATERTHANSIGN);\n\n    return maybeMultiplied(tokenizer, {\n        type: 'Property',\n        name\n    });\n}\n\n// https://drafts.csswg.org/css-values-3/#numeric-ranges\n// 4.1. Range Restrictions and Range Definition Notation\n//\n// Range restrictions can be annotated in the numeric type notation using CSS bracketed\n// range notation—[min,max]—within the angle brackets, after the identifying keyword,\n// indicating a closed range between (and including) min and max.\n// For example, <integer [0, 10]> indicates an integer between 0 and 10, inclusive.\nfunction readTypeRange(tokenizer) {\n    // use null for Infinity to make AST format JSON serializable/deserializable\n    let min = null; // -Infinity\n    let max = null; // Infinity\n    let sign = 1;\n\n    tokenizer.eat(LEFTSQUAREBRACKET);\n\n    if (tokenizer.charCode() === HYPERMINUS) {\n        tokenizer.peek();\n        sign = -1;\n    }\n\n    if (sign == -1 && tokenizer.charCode() === INFINITY) {\n        tokenizer.peek();\n    } else {\n        min = sign * Number(scanNumber(tokenizer));\n\n        if (NAME_CHAR[tokenizer.charCode()] !== 0) {\n            min += scanWord(tokenizer);\n        }\n    }\n\n    scanSpaces(tokenizer);\n    tokenizer.eat(COMMA);\n    scanSpaces(tokenizer);\n\n    if (tokenizer.charCode() === INFINITY) {\n        tokenizer.peek();\n    } else {\n        sign = 1;\n\n        if (tokenizer.charCode() === HYPERMINUS) {\n            tokenizer.peek();\n            sign = -1;\n        }\n\n        max = sign * Number(scanNumber(tokenizer));\n\n        if (NAME_CHAR[tokenizer.charCode()] !== 0) {\n            max += scanWord(tokenizer);\n        }\n    }\n\n    tokenizer.eat(RIGHTSQUAREBRACKET);\n\n    return {\n        type: 'Range',\n        min,\n        max\n    };\n}\n\nfunction readType(tokenizer) {\n    let name;\n    let opts = null;\n\n    tokenizer.eat(LESSTHANSIGN);\n    name = scanWord(tokenizer);\n\n    if (tokenizer.charCode() === LEFTPARENTHESIS &&\n        tokenizer.nextCharCode() === RIGHTPARENTHESIS) {\n        tokenizer.pos += 2;\n        name += '()';\n    }\n\n    if (tokenizer.charCodeAt(tokenizer.findWsEnd(tokenizer.pos)) === LEFTSQUAREBRACKET) {\n        scanSpaces(tokenizer);\n        opts = readTypeRange(tokenizer);\n    }\n\n    tokenizer.eat(GREATERTHANSIGN);\n\n    return maybeMultiplied(tokenizer, {\n        type: 'Type',\n        name,\n        opts\n    });\n}\n\nfunction readKeywordOrFunction(tokenizer) {\n    const name = scanWord(tokenizer);\n\n    if (tokenizer.charCode() === LEFTPARENTHESIS) {\n        tokenizer.pos++;\n\n        return {\n            type: 'Function',\n            name\n        };\n    }\n\n    return maybeMultiplied(tokenizer, {\n        type: 'Keyword',\n        name\n    });\n}\n\nfunction regroupTerms(terms, combinators) {\n    function createGroup(terms, combinator) {\n        return {\n            type: 'Group',\n            terms,\n            combinator,\n            disallowEmpty: false,\n            explicit: false\n        };\n    }\n\n    let combinator;\n\n    combinators = Object.keys(combinators)\n        .sort((a, b) => COMBINATOR_PRECEDENCE[a] - COMBINATOR_PRECEDENCE[b]);\n\n    while (combinators.length > 0) {\n        combinator = combinators.shift();\n\n        let i = 0;\n        let subgroupStart = 0;\n\n        for (; i < terms.length; i++) {\n            const term = terms[i];\n\n            if (term.type === 'Combinator') {\n                if (term.value === combinator) {\n                    if (subgroupStart === -1) {\n                        subgroupStart = i - 1;\n                    }\n                    terms.splice(i, 1);\n                    i--;\n                } else {\n                    if (subgroupStart !== -1 && i - subgroupStart > 1) {\n                        terms.splice(\n                            subgroupStart,\n                            i - subgroupStart,\n                            createGroup(terms.slice(subgroupStart, i), combinator)\n                        );\n                        i = subgroupStart + 1;\n                    }\n                    subgroupStart = -1;\n                }\n            }\n        }\n\n        if (subgroupStart !== -1 && combinators.length) {\n            terms.splice(\n                subgroupStart,\n                i - subgroupStart,\n                createGroup(terms.slice(subgroupStart, i), combinator)\n            );\n        }\n    }\n\n    return combinator;\n}\n\nfunction readImplicitGroup(tokenizer) {\n    const terms = [];\n    const combinators = {};\n    let token;\n    let prevToken = null;\n    let prevTokenPos = tokenizer.pos;\n\n    while (token = peek(tokenizer)) {\n        if (token.type !== 'Spaces') {\n            if (token.type === 'Combinator') {\n                // check for combinator in group beginning and double combinator sequence\n                if (prevToken === null || prevToken.type === 'Combinator') {\n                    tokenizer.pos = prevTokenPos;\n                    tokenizer.error('Unexpected combinator');\n                }\n\n                combinators[token.value] = true;\n            } else if (prevToken !== null && prevToken.type !== 'Combinator') {\n                combinators[' '] = true;  // a b\n                terms.push({\n                    type: 'Combinator',\n                    value: ' '\n                });\n            }\n\n            terms.push(token);\n            prevToken = token;\n            prevTokenPos = tokenizer.pos;\n        }\n    }\n\n    // check for combinator in group ending\n    if (prevToken !== null && prevToken.type === 'Combinator') {\n        tokenizer.pos -= prevTokenPos;\n        tokenizer.error('Unexpected combinator');\n    }\n\n    return {\n        type: 'Group',\n        terms,\n        combinator: regroupTerms(terms, combinators) || ' ',\n        disallowEmpty: false,\n        explicit: false\n    };\n}\n\nfunction readGroup(tokenizer) {\n    let result;\n\n    tokenizer.eat(LEFTSQUAREBRACKET);\n    result = readImplicitGroup(tokenizer);\n    tokenizer.eat(RIGHTSQUAREBRACKET);\n\n    result.explicit = true;\n\n    if (tokenizer.charCode() === EXCLAMATIONMARK) {\n        tokenizer.pos++;\n        result.disallowEmpty = true;\n    }\n\n    return result;\n}\n\nfunction peek(tokenizer) {\n    let code = tokenizer.charCode();\n\n    if (code < 128 && NAME_CHAR[code] === 1) {\n        return readKeywordOrFunction(tokenizer);\n    }\n\n    switch (code) {\n        case RIGHTSQUAREBRACKET:\n            // don't eat, stop scan a group\n            break;\n\n        case LEFTSQUAREBRACKET:\n            return maybeMultiplied(tokenizer, readGroup(tokenizer));\n\n        case LESSTHANSIGN:\n            return tokenizer.nextCharCode() === APOSTROPHE\n                ? readProperty(tokenizer)\n                : readType(tokenizer);\n\n        case VERTICALLINE:\n            return {\n                type: 'Combinator',\n                value: tokenizer.substringToPos(\n                    tokenizer.pos + (tokenizer.nextCharCode() === VERTICALLINE ? 2 : 1)\n                )\n            };\n\n        case AMPERSAND:\n            tokenizer.pos++;\n            tokenizer.eat(AMPERSAND);\n\n            return {\n                type: 'Combinator',\n                value: '&&'\n            };\n\n        case COMMA:\n            tokenizer.pos++;\n            return {\n                type: 'Comma'\n            };\n\n        case APOSTROPHE:\n            return maybeMultiplied(tokenizer, {\n                type: 'String',\n                value: scanString(tokenizer)\n            });\n\n        case SPACE:\n        case TAB:\n        case N:\n        case R:\n        case F:\n            return {\n                type: 'Spaces',\n                value: scanSpaces(tokenizer)\n            };\n\n        case COMMERCIALAT:\n            code = tokenizer.nextCharCode();\n\n            if (code < 128 && NAME_CHAR[code] === 1) {\n                tokenizer.pos++;\n                return {\n                    type: 'AtKeyword',\n                    name: scanWord(tokenizer)\n                };\n            }\n\n            return maybeToken(tokenizer);\n\n        case ASTERISK:\n        case PLUSSIGN:\n        case QUESTIONMARK:\n        case NUMBERSIGN:\n        case EXCLAMATIONMARK:\n            // prohibited tokens (used as a multiplier start)\n            break;\n\n        case LEFTCURLYBRACKET:\n            // LEFTCURLYBRACKET is allowed since mdn/data uses it w/o quoting\n            // check next char isn't a number, because it's likely a disjoined multiplier\n            code = tokenizer.nextCharCode();\n\n            if (code < 48 || code > 57) {\n                return maybeToken(tokenizer);\n            }\n\n            break;\n\n        default:\n            return maybeToken(tokenizer);\n    }\n}\n\nexport function parse(source) {\n    const tokenizer = new Tokenizer(source);\n    const result = readImplicitGroup(tokenizer);\n\n    if (tokenizer.pos !== source.length) {\n        tokenizer.error('Unexpected input');\n    }\n\n    // reduce redundant groups with single group term\n    if (result.terms.length === 1 && result.terms[0].type === 'Group') {\n        return result.terms[0];\n    }\n\n    return result;\n};\n","const noop = function() {};\n\nfunction ensureFunction(value) {\n    return typeof value === 'function' ? value : noop;\n}\n\nexport function walk(node, options, context) {\n    function walk(node) {\n        enter.call(context, node);\n\n        switch (node.type) {\n            case 'Group':\n                node.terms.forEach(walk);\n                break;\n\n            case 'Multiplier':\n                walk(node.term);\n                break;\n\n            case 'Type':\n            case 'Property':\n            case 'Keyword':\n            case 'AtKeyword':\n            case 'Function':\n            case 'String':\n            case 'Token':\n            case 'Comma':\n                break;\n\n            default:\n                throw new Error('Unknown type: ' + node.type);\n        }\n\n        leave.call(context, node);\n    }\n\n    let enter = noop;\n    let leave = noop;\n\n    if (typeof options === 'function') {\n        enter = options;\n    } else if (options) {\n        enter = ensureFunction(options.enter);\n        leave = ensureFunction(options.leave);\n    }\n\n    if (enter === noop && leave === noop) {\n        throw new Error('Neither `enter` nor `leave` walker handler is set or both aren\\'t a function');\n    }\n\n    walk(node, context);\n};\n","import { tokenize } from '../tokenizer/index.js';\n\nconst astToTokens = {\n    decorator(handlers) {\n        const tokens = [];\n        let curNode = null;\n\n        return {\n            ...handlers,\n            node(node) {\n                const tmp = curNode;\n                curNode = node;\n                handlers.node.call(this, node);\n                curNode = tmp;\n            },\n            emit(value, type, auto) {\n                tokens.push({\n                    type,\n                    value,\n                    node: auto ? null : curNode\n                });\n            },\n            result() {\n                return tokens;\n            }\n        };\n    }\n};\n\nfunction stringToTokens(str) {\n    const tokens = [];\n\n    tokenize(str, (type, start, end) =>\n        tokens.push({\n            type,\n            value: str.slice(start, end),\n            node: null\n        })\n    );\n\n    return tokens;\n}\n\nexport default function(value, syntax) {\n    if (typeof value === 'string') {\n        return stringToTokens(value);\n    }\n\n    return syntax.generate(value, astToTokens);\n};\n","import { parse } from '../definition-syntax/parse.js';\n\nexport const MATCH = { type: 'Match' };\nexport const MISMATCH = { type: 'Mismatch' };\nexport const DISALLOW_EMPTY = { type: 'DisallowEmpty' };\n\nconst LEFTPARENTHESIS = 40;  // (\nconst RIGHTPARENTHESIS = 41; // )\n\nfunction createCondition(match, thenBranch, elseBranch) {\n    // reduce node count\n    if (thenBranch === MATCH && elseBranch === MISMATCH) {\n        return match;\n    }\n\n    if (match === MATCH && thenBranch === MATCH && elseBranch === MATCH) {\n        return match;\n    }\n\n    if (match.type === 'If' && match.else === MISMATCH && thenBranch === MATCH) {\n        thenBranch = match.then;\n        match = match.match;\n    }\n\n    return {\n        type: 'If',\n        match,\n        then: thenBranch,\n        else: elseBranch\n    };\n}\n\nfunction isFunctionType(name) {\n    return (\n        name.length > 2 &&\n        name.charCodeAt(name.length - 2) === LEFTPARENTHESIS &&\n        name.charCodeAt(name.length - 1) === RIGHTPARENTHESIS\n    );\n}\n\nfunction isEnumCapatible(term) {\n    return (\n        term.type === 'Keyword' ||\n        term.type === 'AtKeyword' ||\n        term.type === 'Function' ||\n        term.type === 'Type' && isFunctionType(term.name)\n    );\n}\n\nfunction buildGroupMatchGraph(combinator, terms, atLeastOneTermMatched) {\n    switch (combinator) {\n        case ' ': {\n            // Juxtaposing components means that all of them must occur, in the given order.\n            //\n            // a b c\n            // =\n            // match a\n            //   then match b\n            //     then match c\n            //       then MATCH\n            //       else MISMATCH\n            //     else MISMATCH\n            //   else MISMATCH\n            let result = MATCH;\n\n            for (let i = terms.length - 1; i >= 0; i--) {\n                const term = terms[i];\n\n                result = createCondition(\n                    term,\n                    result,\n                    MISMATCH\n                );\n            };\n\n            return result;\n        }\n\n        case '|': {\n            // A bar (|) separates two or more alternatives: exactly one of them must occur.\n            //\n            // a | b | c\n            // =\n            // match a\n            //   then MATCH\n            //   else match b\n            //     then MATCH\n            //     else match c\n            //       then MATCH\n            //       else MISMATCH\n\n            let result = MISMATCH;\n            let map = null;\n\n            for (let i = terms.length - 1; i >= 0; i--) {\n                let term = terms[i];\n\n                // reduce sequence of keywords into a Enum\n                if (isEnumCapatible(term)) {\n                    if (map === null && i > 0 && isEnumCapatible(terms[i - 1])) {\n                        map = Object.create(null);\n                        result = createCondition(\n                            {\n                                type: 'Enum',\n                                map\n                            },\n                            MATCH,\n                            result\n                        );\n                    }\n\n                    if (map !== null) {\n                        const key = (isFunctionType(term.name) ? term.name.slice(0, -1) : term.name).toLowerCase();\n                        if (key in map === false) {\n                            map[key] = term;\n                            continue;\n                        }\n                    }\n                }\n\n                map = null;\n\n                // create a new conditonal node\n                result = createCondition(\n                    term,\n                    MATCH,\n                    result\n                );\n            };\n\n            return result;\n        }\n\n        case '&&': {\n            // A double ampersand (&&) separates two or more components,\n            // all of which must occur, in any order.\n\n            // Use MatchOnce for groups with a large number of terms,\n            // since &&-groups produces at least N!-node trees\n            if (terms.length > 5) {\n                return {\n                    type: 'MatchOnce',\n                    terms,\n                    all: true\n                };\n            }\n\n            // Use a combination tree for groups with small number of terms\n            //\n            // a && b && c\n            // =\n            // match a\n            //   then [b && c]\n            //   else match b\n            //     then [a && c]\n            //     else match c\n            //       then [a && b]\n            //       else MISMATCH\n            //\n            // a && b\n            // =\n            // match a\n            //   then match b\n            //     then MATCH\n            //     else MISMATCH\n            //   else match b\n            //     then match a\n            //       then MATCH\n            //       else MISMATCH\n            //     else MISMATCH\n            let result = MISMATCH;\n\n            for (let i = terms.length - 1; i >= 0; i--) {\n                const term = terms[i];\n                let thenClause;\n\n                if (terms.length > 1) {\n                    thenClause = buildGroupMatchGraph(\n                        combinator,\n                        terms.filter(function(newGroupTerm) {\n                            return newGroupTerm !== term;\n                        }),\n                        false\n                    );\n                } else {\n                    thenClause = MATCH;\n                }\n\n                result = createCondition(\n                    term,\n                    thenClause,\n                    result\n                );\n            };\n\n            return result;\n        }\n\n        case '||': {\n            // A double bar (||) separates two or more options:\n            // one or more of them must occur, in any order.\n\n            // Use MatchOnce for groups with a large number of terms,\n            // since ||-groups produces at least N!-node trees\n            if (terms.length > 5) {\n                return {\n                    type: 'MatchOnce',\n                    terms,\n                    all: false\n                };\n            }\n\n            // Use a combination tree for groups with small number of terms\n            //\n            // a || b || c\n            // =\n            // match a\n            //   then [b || c]\n            //   else match b\n            //     then [a || c]\n            //     else match c\n            //       then [a || b]\n            //       else MISMATCH\n            //\n            // a || b\n            // =\n            // match a\n            //   then match b\n            //     then MATCH\n            //     else MATCH\n            //   else match b\n            //     then match a\n            //       then MATCH\n            //       else MATCH\n            //     else MISMATCH\n            let result = atLeastOneTermMatched ? MATCH : MISMATCH;\n\n            for (let i = terms.length - 1; i >= 0; i--) {\n                const term = terms[i];\n                let thenClause;\n\n                if (terms.length > 1) {\n                    thenClause = buildGroupMatchGraph(\n                        combinator,\n                        terms.filter(function(newGroupTerm) {\n                            return newGroupTerm !== term;\n                        }),\n                        true\n                    );\n                } else {\n                    thenClause = MATCH;\n                }\n\n                result = createCondition(\n                    term,\n                    thenClause,\n                    result\n                );\n            };\n\n            return result;\n        }\n    }\n}\n\nfunction buildMultiplierMatchGraph(node) {\n    let result = MATCH;\n    let matchTerm = buildMatchGraphInternal(node.term);\n\n    if (node.max === 0) {\n        // disable repeating of empty match to prevent infinite loop\n        matchTerm = createCondition(\n            matchTerm,\n            DISALLOW_EMPTY,\n            MISMATCH\n        );\n\n        // an occurrence count is not limited, make a cycle;\n        // to collect more terms on each following matching mismatch\n        result = createCondition(\n            matchTerm,\n            null, // will be a loop\n            MISMATCH\n        );\n\n        result.then = createCondition(\n            MATCH,\n            MATCH,\n            result // make a loop\n        );\n\n        if (node.comma) {\n            result.then.else = createCondition(\n                { type: 'Comma', syntax: node },\n                result,\n                MISMATCH\n            );\n        }\n    } else {\n        // create a match node chain for [min .. max] interval with optional matches\n        for (let i = node.min || 1; i <= node.max; i++) {\n            if (node.comma && result !== MATCH) {\n                result = createCondition(\n                    { type: 'Comma', syntax: node },\n                    result,\n                    MISMATCH\n                );\n            }\n\n            result = createCondition(\n                matchTerm,\n                createCondition(\n                    MATCH,\n                    MATCH,\n                    result\n                ),\n                MISMATCH\n            );\n        }\n    }\n\n    if (node.min === 0) {\n        // allow zero match\n        result = createCondition(\n            MATCH,\n            MATCH,\n            result\n        );\n    } else {\n        // create a match node chain to collect [0 ... min - 1] required matches\n        for (let i = 0; i < node.min - 1; i++) {\n            if (node.comma && result !== MATCH) {\n                result = createCondition(\n                    { type: 'Comma', syntax: node },\n                    result,\n                    MISMATCH\n                );\n            }\n\n            result = createCondition(\n                matchTerm,\n                result,\n                MISMATCH\n            );\n        }\n    }\n\n    return result;\n}\n\nfunction buildMatchGraphInternal(node) {\n    if (typeof node === 'function') {\n        return {\n            type: 'Generic',\n            fn: node\n        };\n    }\n\n    switch (node.type) {\n        case 'Group': {\n            let result = buildGroupMatchGraph(\n                node.combinator,\n                node.terms.map(buildMatchGraphInternal),\n                false\n            );\n\n            if (node.disallowEmpty) {\n                result = createCondition(\n                    result,\n                    DISALLOW_EMPTY,\n                    MISMATCH\n                );\n            }\n\n            return result;\n        }\n\n        case 'Multiplier':\n            return buildMultiplierMatchGraph(node);\n\n        case 'Type':\n        case 'Property':\n            return {\n                type: node.type,\n                name: node.name,\n                syntax: node\n            };\n\n        case 'Keyword':\n            return {\n                type: node.type,\n                name: node.name.toLowerCase(),\n                syntax: node\n            };\n\n        case 'AtKeyword':\n            return {\n                type: node.type,\n                name: '@' + node.name.toLowerCase(),\n                syntax: node\n            };\n\n        case 'Function':\n            return {\n                type: node.type,\n                name: node.name.toLowerCase() + '(',\n                syntax: node\n            };\n\n        case 'String':\n            // convert a one char length String to a Token\n            if (node.value.length === 3) {\n                return {\n                    type: 'Token',\n                    value: node.value.charAt(1),\n                    syntax: node\n                };\n            }\n\n            // otherwise use it as is\n            return {\n                type: node.type,\n                value: node.value.substr(1, node.value.length - 2).replace(/\\\\'/g, '\\''),\n                syntax: node\n            };\n\n        case 'Token':\n            return {\n                type: node.type,\n                value: node.value,\n                syntax: node\n            };\n\n        case 'Comma':\n            return {\n                type: node.type,\n                syntax: node\n            };\n\n        default:\n            throw new Error('Unknown node type:', node.type);\n    }\n}\n\nexport function buildMatchGraph(syntaxTree, ref) {\n    if (typeof syntaxTree === 'string') {\n        syntaxTree = parse(syntaxTree);\n    }\n\n    return {\n        type: 'MatchGraph',\n        match: buildMatchGraphInternal(syntaxTree),\n        syntax: ref || null,\n        source: syntaxTree\n    };\n}\n","import { MATCH, MISMATCH, DISALLOW_EMPTY } from './match-graph.js';\nimport * as TYPE from '../tokenizer/types.js';\n\nconst { hasOwnProperty } = Object.prototype;\nconst STUB = 0;\nconst TOKEN = 1;\nconst OPEN_SYNTAX = 2;\nconst CLOSE_SYNTAX = 3;\n\nconst EXIT_REASON_MATCH = 'Match';\nconst EXIT_REASON_MISMATCH = 'Mismatch';\nconst EXIT_REASON_ITERATION_LIMIT = 'Maximum iteration number exceeded (please fill an issue on https://github.com/csstree/csstree/issues)';\n\nconst ITERATION_LIMIT = 15000;\nexport let totalIterationCount = 0;\n\nfunction reverseList(list) {\n    let prev = null;\n    let next = null;\n    let item = list;\n\n    while (item !== null) {\n        next = item.prev;\n        item.prev = prev;\n        prev = item;\n        item = next;\n    }\n\n    return prev;\n}\n\nfunction areStringsEqualCaseInsensitive(testStr, referenceStr) {\n    if (testStr.length !== referenceStr.length) {\n        return false;\n    }\n\n    for (let i = 0; i < testStr.length; i++) {\n        const referenceCode = referenceStr.charCodeAt(i);\n        let testCode = testStr.charCodeAt(i);\n\n        // testCode.toLowerCase() for U+0041 LATIN CAPITAL LETTER A (A) .. U+005A LATIN CAPITAL LETTER Z (Z).\n        if (testCode >= 0x0041 && testCode <= 0x005A) {\n            testCode = testCode | 32;\n        }\n\n        if (testCode !== referenceCode) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\nfunction isContextEdgeDelim(token) {\n    if (token.type !== TYPE.Delim) {\n        return false;\n    }\n\n    // Fix matching for unicode-range: U+30??, U+FF00-FF9F\n    // Probably we need to check out previous match instead\n    return token.value !== '?';\n}\n\nfunction isCommaContextStart(token) {\n    if (token === null) {\n        return true;\n    }\n\n    return (\n        token.type === TYPE.Comma ||\n        token.type === TYPE.Function ||\n        token.type === TYPE.LeftParenthesis ||\n        token.type === TYPE.LeftSquareBracket ||\n        token.type === TYPE.LeftCurlyBracket ||\n        isContextEdgeDelim(token)\n    );\n}\n\nfunction isCommaContextEnd(token) {\n    if (token === null) {\n        return true;\n    }\n\n    return (\n        token.type === TYPE.RightParenthesis ||\n        token.type === TYPE.RightSquareBracket ||\n        token.type === TYPE.RightCurlyBracket ||\n        (token.type === TYPE.Delim && token.value === '/')\n    );\n}\n\nfunction internalMatch(tokens, state, syntaxes) {\n    function moveToNextToken() {\n        do {\n            tokenIndex++;\n            token = tokenIndex < tokens.length ? tokens[tokenIndex] : null;\n        } while (token !== null && (token.type === TYPE.WhiteSpace || token.type === TYPE.Comment));\n    }\n\n    function getNextToken(offset) {\n        const nextIndex = tokenIndex + offset;\n\n        return nextIndex < tokens.length ? tokens[nextIndex] : null;\n    }\n\n    function stateSnapshotFromSyntax(nextState, prev) {\n        return {\n            nextState,\n            matchStack,\n            syntaxStack,\n            thenStack,\n            tokenIndex,\n            prev\n        };\n    }\n\n    function pushThenStack(nextState) {\n        thenStack = {\n            nextState,\n            matchStack,\n            syntaxStack,\n            prev: thenStack\n        };\n    }\n\n    function pushElseStack(nextState) {\n        elseStack = stateSnapshotFromSyntax(nextState, elseStack);\n    }\n\n    function addTokenToMatch() {\n        matchStack = {\n            type: TOKEN,\n            syntax: state.syntax,\n            token,\n            prev: matchStack\n        };\n\n        moveToNextToken();\n        syntaxStash = null;\n\n        if (tokenIndex > longestMatch) {\n            longestMatch = tokenIndex;\n        }\n    }\n\n    function openSyntax() {\n        syntaxStack = {\n            syntax: state.syntax,\n            opts: state.syntax.opts || (syntaxStack !== null && syntaxStack.opts) || null,\n            prev: syntaxStack\n        };\n\n        matchStack = {\n            type: OPEN_SYNTAX,\n            syntax: state.syntax,\n            token: matchStack.token,\n            prev: matchStack\n        };\n    }\n\n    function closeSyntax() {\n        if (matchStack.type === OPEN_SYNTAX) {\n            matchStack = matchStack.prev;\n        } else {\n            matchStack = {\n                type: CLOSE_SYNTAX,\n                syntax: syntaxStack.syntax,\n                token: matchStack.token,\n                prev: matchStack\n            };\n        }\n\n        syntaxStack = syntaxStack.prev;\n    }\n\n    let syntaxStack = null;\n    let thenStack = null;\n    let elseStack = null;\n\n    // null – stashing allowed, nothing stashed\n    // false – stashing disabled, nothing stashed\n    // anithing else – fail stashable syntaxes, some syntax stashed\n    let syntaxStash = null;\n\n    let iterationCount = 0; // count iterations and prevent infinite loop\n    let exitReason = null;\n\n    let token = null;\n    let tokenIndex = -1;\n    let longestMatch = 0;\n    let matchStack = {\n        type: STUB,\n        syntax: null,\n        token: null,\n        prev: null\n    };\n\n    moveToNextToken();\n\n    while (exitReason === null && ++iterationCount < ITERATION_LIMIT) {\n        // function mapList(list, fn) {\n        //     const result = [];\n        //     while (list) {\n        //         result.unshift(fn(list));\n        //         list = list.prev;\n        //     }\n        //     return result;\n        // }\n        // console.log('--\\n',\n        //     '#' + iterationCount,\n        //     require('util').inspect({\n        //         match: mapList(matchStack, x => x.type === TOKEN ? x.token && x.token.value : x.syntax ? ({ [OPEN_SYNTAX]: '<', [CLOSE_SYNTAX]: '</' }[x.type] || x.type) + '!' + x.syntax.name : null),\n        //         token: token && token.value,\n        //         tokenIndex,\n        //         syntax: syntax.type + (syntax.id ? ' #' + syntax.id : '')\n        //     }, { depth: null })\n        // );\n        switch (state.type) {\n            case 'Match':\n                if (thenStack === null) {\n                    // turn to MISMATCH when some tokens left unmatched\n                    if (token !== null) {\n                        // doesn't mismatch if just one token left and it's an IE hack\n                        if (tokenIndex !== tokens.length - 1 || (token.value !== '\\\\0' && token.value !== '\\\\9')) {\n                            state = MISMATCH;\n                            break;\n                        }\n                    }\n\n                    // break the main loop, return a result - MATCH\n                    exitReason = EXIT_REASON_MATCH;\n                    break;\n                }\n\n                // go to next syntax (`then` branch)\n                state = thenStack.nextState;\n\n                // check match is not empty\n                if (state === DISALLOW_EMPTY) {\n                    if (thenStack.matchStack === matchStack) {\n                        state = MISMATCH;\n                        break;\n                    } else {\n                        state = MATCH;\n                    }\n                }\n\n                // close syntax if needed\n                while (thenStack.syntaxStack !== syntaxStack) {\n                    closeSyntax();\n                }\n\n                // pop stack\n                thenStack = thenStack.prev;\n                break;\n\n            case 'Mismatch':\n                // when some syntax is stashed\n                if (syntaxStash !== null && syntaxStash !== false) {\n                    // there is no else branches or a branch reduce match stack\n                    if (elseStack === null || tokenIndex > elseStack.tokenIndex) {\n                        // restore state from the stash\n                        elseStack = syntaxStash;\n                        syntaxStash = false; // disable stashing\n                    }\n                } else if (elseStack === null) {\n                    // no else branches -> break the main loop\n                    // return a result - MISMATCH\n                    exitReason = EXIT_REASON_MISMATCH;\n                    break;\n                }\n\n                // go to next syntax (`else` branch)\n                state = elseStack.nextState;\n\n                // restore all the rest stack states\n                thenStack = elseStack.thenStack;\n                syntaxStack = elseStack.syntaxStack;\n                matchStack = elseStack.matchStack;\n                tokenIndex = elseStack.tokenIndex;\n                token = tokenIndex < tokens.length ? tokens[tokenIndex] : null;\n\n                // pop stack\n                elseStack = elseStack.prev;\n                break;\n\n            case 'MatchGraph':\n                state = state.match;\n                break;\n\n            case 'If':\n                // IMPORTANT: else stack push must go first,\n                // since it stores the state of thenStack before changes\n                if (state.else !== MISMATCH) {\n                    pushElseStack(state.else);\n                }\n\n                if (state.then !== MATCH) {\n                    pushThenStack(state.then);\n                }\n\n                state = state.match;\n                break;\n\n            case 'MatchOnce':\n                state = {\n                    type: 'MatchOnceBuffer',\n                    syntax: state,\n                    index: 0,\n                    mask: 0\n                };\n                break;\n\n            case 'MatchOnceBuffer': {\n                const terms = state.syntax.terms;\n\n                if (state.index === terms.length) {\n                    // no matches at all or it's required all terms to be matched\n                    if (state.mask === 0 || state.syntax.all) {\n                        state = MISMATCH;\n                        break;\n                    }\n\n                    // a partial match is ok\n                    state = MATCH;\n                    break;\n                }\n\n                // all terms are matched\n                if (state.mask === (1 << terms.length) - 1) {\n                    state = MATCH;\n                    break;\n                }\n\n                for (; state.index < terms.length; state.index++) {\n                    const matchFlag = 1 << state.index;\n\n                    if ((state.mask & matchFlag) === 0) {\n                        // IMPORTANT: else stack push must go first,\n                        // since it stores the state of thenStack before changes\n                        pushElseStack(state);\n                        pushThenStack({\n                            type: 'AddMatchOnce',\n                            syntax: state.syntax,\n                            mask: state.mask | matchFlag\n                        });\n\n                        // match\n                        state = terms[state.index++];\n                        break;\n                    }\n                }\n                break;\n            }\n\n            case 'AddMatchOnce':\n                state = {\n                    type: 'MatchOnceBuffer',\n                    syntax: state.syntax,\n                    index: 0,\n                    mask: state.mask\n                };\n                break;\n\n            case 'Enum':\n                if (token !== null) {\n                    let name = token.value.toLowerCase();\n\n                    // drop \\0 and \\9 hack from keyword name\n                    if (name.indexOf('\\\\') !== -1) {\n                        name = name.replace(/\\\\[09].*$/, '');\n                    }\n\n                    if (hasOwnProperty.call(state.map, name)) {\n                        state = state.map[name];\n                        break;\n                    }\n                }\n\n                state = MISMATCH;\n                break;\n\n            case 'Generic': {\n                const opts = syntaxStack !== null ? syntaxStack.opts : null;\n                const lastTokenIndex = tokenIndex + Math.floor(state.fn(token, getNextToken, opts));\n\n                if (!isNaN(lastTokenIndex) && lastTokenIndex > tokenIndex) {\n                    while (tokenIndex < lastTokenIndex) {\n                        addTokenToMatch();\n                    }\n\n                    state = MATCH;\n                } else {\n                    state = MISMATCH;\n                }\n\n                break;\n            }\n\n            case 'Type':\n            case 'Property': {\n                const syntaxDict = state.type === 'Type' ? 'types' : 'properties';\n                const dictSyntax = hasOwnProperty.call(syntaxes, syntaxDict) ? syntaxes[syntaxDict][state.name] : null;\n\n                if (!dictSyntax || !dictSyntax.match) {\n                    throw new Error(\n                        'Bad syntax reference: ' +\n                        (state.type === 'Type'\n                            ? '<' + state.name + '>'\n                            : '<\\'' + state.name + '\\'>')\n                    );\n                }\n\n                // stash a syntax for types with low priority\n                if (syntaxStash !== false && token !== null && state.type === 'Type') {\n                    const lowPriorityMatching =\n                        // https://drafts.csswg.org/css-values-4/#custom-idents\n                        // When parsing positionally-ambiguous keywords in a property value, a <custom-ident> production\n                        // can only claim the keyword if no other unfulfilled production can claim it.\n                        (state.name === 'custom-ident' && token.type === TYPE.Ident) ||\n\n                        // https://drafts.csswg.org/css-values-4/#lengths\n                        // ... if a `0` could be parsed as either a <number> or a <length> in a property (such as line-height),\n                        // it must parse as a <number>\n                        (state.name === 'length' && token.value === '0');\n\n                    if (lowPriorityMatching) {\n                        if (syntaxStash === null) {\n                            syntaxStash = stateSnapshotFromSyntax(state, elseStack);\n                        }\n\n                        state = MISMATCH;\n                        break;\n                    }\n                }\n\n                openSyntax();\n                state = dictSyntax.match;\n                break;\n            }\n\n            case 'Keyword': {\n                const name = state.name;\n\n                if (token !== null) {\n                    let keywordName = token.value;\n\n                    // drop \\0 and \\9 hack from keyword name\n                    if (keywordName.indexOf('\\\\') !== -1) {\n                        keywordName = keywordName.replace(/\\\\[09].*$/, '');\n                    }\n\n                    if (areStringsEqualCaseInsensitive(keywordName, name)) {\n                        addTokenToMatch();\n                        state = MATCH;\n                        break;\n                    }\n                }\n\n                state = MISMATCH;\n                break;\n            }\n\n            case 'AtKeyword':\n            case 'Function':\n                if (token !== null && areStringsEqualCaseInsensitive(token.value, state.name)) {\n                    addTokenToMatch();\n                    state = MATCH;\n                    break;\n                }\n\n                state = MISMATCH;\n                break;\n\n            case 'Token':\n                if (token !== null && token.value === state.value) {\n                    addTokenToMatch();\n                    state = MATCH;\n                    break;\n                }\n\n                state = MISMATCH;\n                break;\n\n            case 'Comma':\n                if (token !== null && token.type === TYPE.Comma) {\n                    if (isCommaContextStart(matchStack.token)) {\n                        state = MISMATCH;\n                    } else {\n                        addTokenToMatch();\n                        state = isCommaContextEnd(token) ? MISMATCH : MATCH;\n                    }\n                } else {\n                    state = isCommaContextStart(matchStack.token) || isCommaContextEnd(token) ? MATCH : MISMATCH;\n                }\n\n                break;\n\n            case 'String':\n                let string = '';\n                let lastTokenIndex = tokenIndex;\n\n                for (; lastTokenIndex < tokens.length && string.length < state.value.length; lastTokenIndex++) {\n                    string += tokens[lastTokenIndex].value;\n                }\n\n                if (areStringsEqualCaseInsensitive(string, state.value)) {\n                    while (tokenIndex < lastTokenIndex) {\n                        addTokenToMatch();\n                    }\n\n                    state = MATCH;\n                } else {\n                    state = MISMATCH;\n                }\n\n                break;\n\n            default:\n                throw new Error('Unknown node type: ' + state.type);\n        }\n    }\n\n    totalIterationCount += iterationCount;\n\n    switch (exitReason) {\n        case null:\n            console.warn('[csstree-match] BREAK after ' + ITERATION_LIMIT + ' iterations');\n            exitReason = EXIT_REASON_ITERATION_LIMIT;\n            matchStack = null;\n            break;\n\n        case EXIT_REASON_MATCH:\n            while (syntaxStack !== null) {\n                closeSyntax();\n            }\n            break;\n\n        default:\n            matchStack = null;\n    }\n\n    return {\n        tokens,\n        reason: exitReason,\n        iterations: iterationCount,\n        match: matchStack,\n        longestMatch\n    };\n}\n\nexport function matchAsList(tokens, matchGraph, syntaxes) {\n    const matchResult = internalMatch(tokens, matchGraph, syntaxes || {});\n\n    if (matchResult.match !== null) {\n        let item = reverseList(matchResult.match).prev;\n\n        matchResult.match = [];\n\n        while (item !== null) {\n            switch (item.type) {\n                case OPEN_SYNTAX:\n                case CLOSE_SYNTAX:\n                    matchResult.match.push({\n                        type: item.type,\n                        syntax: item.syntax\n                    });\n                    break;\n\n                default:\n                    matchResult.match.push({\n                        token: item.token.value,\n                        node: item.token.node\n                    });\n                    break;\n            }\n\n            item = item.prev;\n        }\n    }\n\n    return matchResult;\n}\n\nexport function matchAsTree(tokens, matchGraph, syntaxes) {\n    const matchResult = internalMatch(tokens, matchGraph, syntaxes || {});\n\n    if (matchResult.match === null) {\n        return matchResult;\n    }\n\n    let item = matchResult.match;\n    let host = matchResult.match = {\n        syntax: matchGraph.syntax || null,\n        match: []\n    };\n    const hostStack = [host];\n\n    // revert a list and start with 2nd item since 1st is a stub item\n    item = reverseList(item).prev;\n\n    // build a tree\n    while (item !== null) {\n        switch (item.type) {\n            case OPEN_SYNTAX:\n                host.match.push(host = {\n                    syntax: item.syntax,\n                    match: []\n                });\n                hostStack.push(host);\n                break;\n\n            case CLOSE_SYNTAX:\n                hostStack.pop();\n                host = hostStack[hostStack.length - 1];\n                break;\n\n            default:\n                host.match.push({\n                    syntax: item.syntax || null,\n                    token: item.token.value,\n                    node: item.token.node\n                });\n        }\n\n        item = item.prev;\n    }\n\n    return matchResult;\n}\n","export function getTrace(node) {\n    function shouldPutToTrace(syntax) {\n        if (syntax === null) {\n            return false;\n        }\n\n        return (\n            syntax.type === 'Type' ||\n            syntax.type === 'Property' ||\n            syntax.type === 'Keyword'\n        );\n    }\n\n    function hasMatch(matchNode) {\n        if (Array.isArray(matchNode.match)) {\n            // use for-loop for better perfomance\n            for (let i = 0; i < matchNode.match.length; i++) {\n                if (hasMatch(matchNode.match[i])) {\n                    if (shouldPutToTrace(matchNode.syntax)) {\n                        result.unshift(matchNode.syntax);\n                    }\n\n                    return true;\n                }\n            }\n        } else if (matchNode.node === node) {\n            result = shouldPutToTrace(matchNode.syntax)\n                ? [matchNode.syntax]\n                : [];\n\n            return true;\n        }\n\n        return false;\n    }\n\n    let result = null;\n\n    if (this.matched !== null) {\n        hasMatch(this.matched);\n    }\n\n    return result;\n}\n\nexport function isType(node, type) {\n    return testNode(this, node, match => match.type === 'Type' && match.name === type);\n}\n\nexport function isProperty(node, property) {\n    return testNode(this, node, match => match.type === 'Property' && match.name === property);\n}\n\nexport function isKeyword(node) {\n    return testNode(this, node, match => match.type === 'Keyword');\n}\n\nfunction testNode(match, node, fn) {\n    const trace = getTrace.call(match, node);\n\n    if (trace === null) {\n        return false;\n    }\n\n    return trace.some(fn);\n}\n","import { List } from '../utils/List.js';\n\nfunction getFirstMatchNode(matchNode) {\n    if ('node' in matchNode) {\n        return matchNode.node;\n    }\n\n    return getFirstMatchNode(matchNode.match[0]);\n}\n\nfunction getLastMatchNode(matchNode) {\n    if ('node' in matchNode) {\n        return matchNode.node;\n    }\n\n    return getLastMatchNode(matchNode.match[matchNode.match.length - 1]);\n}\n\nexport function matchFragments(lexer, ast, match, type, name) {\n    function findFragments(matchNode) {\n        if (matchNode.syntax !== null &&\n            matchNode.syntax.type === type &&\n            matchNode.syntax.name === name) {\n            const start = getFirstMatchNode(matchNode);\n            const end = getLastMatchNode(matchNode);\n\n            lexer.syntax.walk(ast, function(node, item, list) {\n                if (node === start) {\n                    const nodes = new List();\n\n                    do {\n                        nodes.appendData(item.data);\n\n                        if (item.data === end) {\n                            break;\n                        }\n\n                        item = item.next;\n                    } while (item !== null);\n\n                    fragments.push({\n                        parent: list,\n                        nodes\n                    });\n                }\n            });\n        }\n\n        if (Array.isArray(matchNode.match)) {\n            matchNode.match.forEach(findFragments);\n        }\n    }\n\n    const fragments = [];\n\n    if (match.matched !== null) {\n        findFragments(match.matched);\n    }\n\n    return fragments;\n}\n","import { List } from '../utils/List.js';\n\nconst { hasOwnProperty } = Object.prototype;\n\nfunction isValidNumber(value) {\n    // Number.isInteger(value) && value >= 0\n    return (\n        typeof value === 'number' &&\n        isFinite(value) &&\n        Math.floor(value) === value &&\n        value >= 0\n    );\n}\n\nfunction isValidLocation(loc) {\n    return (\n        Boolean(loc) &&\n        isValidNumber(loc.offset) &&\n        isValidNumber(loc.line) &&\n        isValidNumber(loc.column)\n    );\n}\n\nfunction createNodeStructureChecker(type, fields) {\n    return function checkNode(node, warn) {\n        if (!node || node.constructor !== Object) {\n            return warn(node, 'Type of node should be an Object');\n        }\n\n        for (let key in node) {\n            let valid = true;\n\n            if (hasOwnProperty.call(node, key) === false) {\n                continue;\n            }\n\n            if (key === 'type') {\n                if (node.type !== type) {\n                    warn(node, 'Wrong node type `' + node.type + '`, expected `' + type + '`');\n                }\n            } else if (key === 'loc') {\n                if (node.loc === null) {\n                    continue;\n                } else if (node.loc && node.loc.constructor === Object) {\n                    if (typeof node.loc.source !== 'string') {\n                        key += '.source';\n                    } else if (!isValidLocation(node.loc.start)) {\n                        key += '.start';\n                    } else if (!isValidLocation(node.loc.end)) {\n                        key += '.end';\n                    } else {\n                        continue;\n                    }\n                }\n\n                valid = false;\n            } else if (fields.hasOwnProperty(key)) {\n                valid = false;\n\n                for (let i = 0; !valid && i < fields[key].length; i++) {\n                    const fieldType = fields[key][i];\n\n                    switch (fieldType) {\n                        case String:\n                            valid = typeof node[key] === 'string';\n                            break;\n\n                        case Boolean:\n                            valid = typeof node[key] === 'boolean';\n                            break;\n\n                        case null:\n                            valid = node[key] === null;\n                            break;\n\n                        default:\n                            if (typeof fieldType === 'string') {\n                                valid = node[key] && node[key].type === fieldType;\n                            } else if (Array.isArray(fieldType)) {\n                                valid = node[key] instanceof List;\n                            }\n                    }\n                }\n            } else {\n                warn(node, 'Unknown field `' + key + '` for ' + type + ' node type');\n            }\n\n            if (!valid) {\n                warn(node, 'Bad value for `' + type + '.' + key + '`');\n            }\n        }\n\n        for (const key in fields) {\n            if (hasOwnProperty.call(fields, key) &&\n                hasOwnProperty.call(node, key) === false) {\n                warn(node, 'Field `' + type + '.' + key + '` is missed');\n            }\n        }\n    };\n}\n\nfunction processStructure(name, nodeType) {\n    const structure = nodeType.structure;\n    const fields = {\n        type: String,\n        loc: true\n    };\n    const docs = {\n        type: '\"' + name + '\"'\n    };\n\n    for (const key in structure) {\n        if (hasOwnProperty.call(structure, key) === false) {\n            continue;\n        }\n\n        const docsTypes = [];\n        const fieldTypes = fields[key] = Array.isArray(structure[key])\n            ? structure[key].slice()\n            : [structure[key]];\n\n        for (let i = 0; i < fieldTypes.length; i++) {\n            const fieldType = fieldTypes[i];\n            if (fieldType === String || fieldType === Boolean) {\n                docsTypes.push(fieldType.name);\n            } else if (fieldType === null) {\n                docsTypes.push('null');\n            } else if (typeof fieldType === 'string') {\n                docsTypes.push('<' + fieldType + '>');\n            } else if (Array.isArray(fieldType)) {\n                docsTypes.push('List'); // TODO: use type enum\n            } else {\n                throw new Error('Wrong value `' + fieldType + '` in `' + name + '.' + key + '` structure definition');\n            }\n        }\n\n        docs[key] = docsTypes.join(' | ');\n    }\n\n    return {\n        docs,\n        check: createNodeStructureChecker(name, fields)\n    };\n}\n\nexport function getStructureFromConfig(config) {\n    const structure = {};\n\n    if (config.node) {\n        for (const name in config.node) {\n            if (hasOwnProperty.call(config.node, name)) {\n                const nodeType = config.node[name];\n\n                if (nodeType.structure) {\n                    structure[name] = processStructure(name, nodeType);\n                } else {\n                    throw new Error('Missed `structure` field in `' + name + '` node type definition');\n                }\n            }\n        }\n    }\n\n    return structure;\n};\n","import { SyntaxReferenceError, SyntaxMatchError } from './error.js';\nimport * as names from '../utils/names.js';\nimport { cssWideKeywords } from './generic-const.js';\nimport { createGenericTypes } from './generic.js';\nimport * as units from './units.js';\nimport { parse, generate, walk } from '../definition-syntax/index.js';\nimport prepareTokens from './prepare-tokens.js';\nimport { buildMatchGraph } from './match-graph.js';\nimport { matchAsTree } from './match.js';\nimport * as trace from './trace.js';\nimport { matchFragments } from './search.js';\nimport { getStructureFromConfig } from './structure.js';\n\nconst cssWideKeywordsSyntax = buildMatchGraph(cssWideKeywords.join(' | '));\n\nfunction dumpMapSyntax(map, compact, syntaxAsAst) {\n    const result = {};\n\n    for (const name in map) {\n        if (map[name].syntax) {\n            result[name] = syntaxAsAst\n                ? map[name].syntax\n                : generate(map[name].syntax, { compact });\n        }\n    }\n\n    return result;\n}\n\nfunction dumpAtruleMapSyntax(map, compact, syntaxAsAst) {\n    const result = {};\n\n    for (const [name, atrule] of Object.entries(map)) {\n        result[name] = {\n            prelude: atrule.prelude && (\n                syntaxAsAst\n                    ? atrule.prelude.syntax\n                    : generate(atrule.prelude.syntax, { compact })\n            ),\n            descriptors: atrule.descriptors && dumpMapSyntax(atrule.descriptors, compact, syntaxAsAst)\n        };\n    }\n\n    return result;\n}\n\nfunction valueHasVar(tokens) {\n    for (let i = 0; i < tokens.length; i++) {\n        if (tokens[i].value.toLowerCase() === 'var(') {\n            return true;\n        }\n    }\n\n    return false;\n}\n\nfunction buildMatchResult(matched, error, iterations) {\n    return {\n        matched,\n        iterations,\n        error,\n        ...trace\n    };\n}\n\nfunction matchSyntax(lexer, syntax, value, useCssWideKeywords) {\n    const tokens = prepareTokens(value, lexer.syntax);\n    let result;\n\n    if (valueHasVar(tokens)) {\n        return buildMatchResult(null, new Error('Matching for a tree with var() is not supported'));\n    }\n\n    if (useCssWideKeywords) {\n        result = matchAsTree(tokens, lexer.cssWideKeywordsSyntax, lexer);\n    }\n\n    if (!useCssWideKeywords || !result.match) {\n        result = matchAsTree(tokens, syntax.match, lexer);\n        if (!result.match) {\n            return buildMatchResult(\n                null,\n                new SyntaxMatchError(result.reason, syntax.syntax, value, result),\n                result.iterations\n            );\n        }\n    }\n\n    return buildMatchResult(result.match, null, result.iterations);\n}\n\nexport class Lexer {\n    constructor(config, syntax, structure) {\n        this.cssWideKeywordsSyntax = cssWideKeywordsSyntax;\n        this.syntax = syntax;\n        this.generic = false;\n        this.units = { ...units };\n        this.atrules = Object.create(null);\n        this.properties = Object.create(null);\n        this.types = Object.create(null);\n        this.structure = structure || getStructureFromConfig(config);\n\n        if (config) {\n            if (config.units) {\n                for (const group of Object.keys(units)) {\n                    if (Array.isArray(config.units[group])) {\n                        this.units[group] = config.units[group];\n                    }\n                }\n            }\n\n            if (config.types) {\n                for (const [name, type] of Object.entries(config.types)) {\n                    this.addType_(name, type);\n                }\n            }\n\n            if (config.generic) {\n                this.generic = true;\n                for (const [name, value] of Object.entries(createGenericTypes(this.units))) {\n                    this.addType_(name, value);\n                }\n            }\n\n            if (config.atrules) {\n                for (const [name, atrule] of Object.entries(config.atrules)) {\n                    this.addAtrule_(name, atrule);\n                }\n            }\n\n            if (config.properties) {\n                for (const [name, property] of Object.entries(config.properties)) {\n                    this.addProperty_(name, property);\n                }\n            }\n        }\n    }\n\n    checkStructure(ast) {\n        function collectWarning(node, message) {\n            warns.push({ node, message });\n        }\n\n        const structure = this.structure;\n        const warns = [];\n\n        this.syntax.walk(ast, function(node) {\n            if (structure.hasOwnProperty(node.type)) {\n                structure[node.type].check(node, collectWarning);\n            } else {\n                collectWarning(node, 'Unknown node type `' + node.type + '`');\n            }\n        });\n\n        return warns.length ? warns : false;\n    }\n\n    createDescriptor(syntax, type, name, parent = null) {\n        const ref = {\n            type,\n            name\n        };\n        const descriptor = {\n            type,\n            name,\n            parent,\n            serializable: typeof syntax === 'string' || (syntax && typeof syntax.type === 'string'),\n            syntax: null,\n            match: null\n        };\n\n        if (typeof syntax === 'function') {\n            descriptor.match = buildMatchGraph(syntax, ref);\n        } else {\n            if (typeof syntax === 'string') {\n                // lazy parsing on first access\n                Object.defineProperty(descriptor, 'syntax', {\n                    get() {\n                        Object.defineProperty(descriptor, 'syntax', {\n                            value: parse(syntax)\n                        });\n\n                        return descriptor.syntax;\n                    }\n                });\n            } else {\n                descriptor.syntax = syntax;\n            }\n\n            // lazy graph build on first access\n            Object.defineProperty(descriptor, 'match', {\n                get() {\n                    Object.defineProperty(descriptor, 'match', {\n                        value: buildMatchGraph(descriptor.syntax, ref)\n                    });\n\n                    return descriptor.match;\n                }\n            });\n        }\n\n        return descriptor;\n    }\n    addAtrule_(name, syntax) {\n        if (!syntax) {\n            return;\n        }\n\n        this.atrules[name] = {\n            type: 'Atrule',\n            name: name,\n            prelude: syntax.prelude ? this.createDescriptor(syntax.prelude, 'AtrulePrelude', name) : null,\n            descriptors: syntax.descriptors\n                ? Object.keys(syntax.descriptors).reduce(\n                    (map, descName) => {\n                        map[descName] = this.createDescriptor(syntax.descriptors[descName], 'AtruleDescriptor', descName, name);\n                        return map;\n                    },\n                    Object.create(null)\n                )\n                : null\n        };\n    }\n    addProperty_(name, syntax) {\n        if (!syntax) {\n            return;\n        }\n\n        this.properties[name] = this.createDescriptor(syntax, 'Property', name);\n    }\n    addType_(name, syntax) {\n        if (!syntax) {\n            return;\n        }\n\n        this.types[name] = this.createDescriptor(syntax, 'Type', name);\n    }\n\n    checkAtruleName(atruleName) {\n        if (!this.getAtrule(atruleName)) {\n            return new SyntaxReferenceError('Unknown at-rule', '@' + atruleName);\n        }\n    }\n    checkAtrulePrelude(atruleName, prelude) {\n        const error = this.checkAtruleName(atruleName);\n\n        if (error) {\n            return error;\n        }\n\n        const atrule = this.getAtrule(atruleName);\n\n        if (!atrule.prelude && prelude) {\n            return new SyntaxError('At-rule `@' + atruleName + '` should not contain a prelude');\n        }\n\n        if (atrule.prelude && !prelude) {\n            if (!matchSyntax(this, atrule.prelude, '', false).matched) {\n                return new SyntaxError('At-rule `@' + atruleName + '` should contain a prelude');\n            }\n        }\n    }\n    checkAtruleDescriptorName(atruleName, descriptorName) {\n        const error = this.checkAtruleName(atruleName);\n\n        if (error) {\n            return error;\n        }\n\n        const atrule = this.getAtrule(atruleName);\n        const descriptor = names.keyword(descriptorName);\n\n        if (!atrule.descriptors) {\n            return new SyntaxError('At-rule `@' + atruleName + '` has no known descriptors');\n        }\n\n        if (!atrule.descriptors[descriptor.name] &&\n            !atrule.descriptors[descriptor.basename]) {\n            return new SyntaxReferenceError('Unknown at-rule descriptor', descriptorName);\n        }\n    }\n    checkPropertyName(propertyName) {\n        if (!this.getProperty(propertyName)) {\n            return new SyntaxReferenceError('Unknown property', propertyName);\n        }\n    }\n\n    matchAtrulePrelude(atruleName, prelude) {\n        const error = this.checkAtrulePrelude(atruleName, prelude);\n\n        if (error) {\n            return buildMatchResult(null, error);\n        }\n\n        const atrule = this.getAtrule(atruleName);\n\n        if (!atrule.prelude) {\n            return buildMatchResult(null, null);\n        }\n\n        return matchSyntax(this, atrule.prelude, prelude || '', false);\n    }\n    matchAtruleDescriptor(atruleName, descriptorName, value) {\n        const error = this.checkAtruleDescriptorName(atruleName, descriptorName);\n\n        if (error) {\n            return buildMatchResult(null, error);\n        }\n\n        const atrule = this.getAtrule(atruleName);\n        const descriptor = names.keyword(descriptorName);\n\n        return matchSyntax(this, atrule.descriptors[descriptor.name] || atrule.descriptors[descriptor.basename], value, false);\n    }\n    matchDeclaration(node) {\n        if (node.type !== 'Declaration') {\n            return buildMatchResult(null, new Error('Not a Declaration node'));\n        }\n\n        return this.matchProperty(node.property, node.value);\n    }\n    matchProperty(propertyName, value) {\n        // don't match syntax for a custom property at the moment\n        if (names.property(propertyName).custom) {\n            return buildMatchResult(null, new Error('Lexer matching doesn\\'t applicable for custom properties'));\n        }\n\n        const error = this.checkPropertyName(propertyName);\n\n        if (error) {\n            return buildMatchResult(null, error);\n        }\n\n        return matchSyntax(this, this.getProperty(propertyName), value, true);\n    }\n    matchType(typeName, value) {\n        const typeSyntax = this.getType(typeName);\n\n        if (!typeSyntax) {\n            return buildMatchResult(null, new SyntaxReferenceError('Unknown type', typeName));\n        }\n\n        return matchSyntax(this, typeSyntax, value, false);\n    }\n    match(syntax, value) {\n        if (typeof syntax !== 'string' && (!syntax || !syntax.type)) {\n            return buildMatchResult(null, new SyntaxReferenceError('Bad syntax'));\n        }\n\n        if (typeof syntax === 'string' || !syntax.match) {\n            syntax = this.createDescriptor(syntax, 'Type', 'anonymous');\n        }\n\n        return matchSyntax(this, syntax, value, false);\n    }\n\n    findValueFragments(propertyName, value, type, name) {\n        return matchFragments(this, value, this.matchProperty(propertyName, value), type, name);\n    }\n    findDeclarationValueFragments(declaration, type, name) {\n        return matchFragments(this, declaration.value, this.matchDeclaration(declaration), type, name);\n    }\n    findAllFragments(ast, type, name) {\n        const result = [];\n\n        this.syntax.walk(ast, {\n            visit: 'Declaration',\n            enter: (declaration) => {\n                result.push.apply(result, this.findDeclarationValueFragments(declaration, type, name));\n            }\n        });\n\n        return result;\n    }\n\n    getAtrule(atruleName, fallbackBasename = true) {\n        const atrule = names.keyword(atruleName);\n        const atruleEntry = atrule.vendor && fallbackBasename\n            ? this.atrules[atrule.name] || this.atrules[atrule.basename]\n            : this.atrules[atrule.name];\n\n        return atruleEntry || null;\n    }\n    getAtrulePrelude(atruleName, fallbackBasename = true) {\n        const atrule = this.getAtrule(atruleName, fallbackBasename);\n\n        return atrule && atrule.prelude || null;\n    }\n    getAtruleDescriptor(atruleName, name) {\n        return this.atrules.hasOwnProperty(atruleName) && this.atrules.declarators\n            ? this.atrules[atruleName].declarators[name] || null\n            : null;\n    }\n    getProperty(propertyName, fallbackBasename = true) {\n        const property = names.property(propertyName);\n        const propertyEntry = property.vendor && fallbackBasename\n            ? this.properties[property.name] || this.properties[property.basename]\n            : this.properties[property.name];\n\n        return propertyEntry || null;\n    }\n    getType(name) {\n        return hasOwnProperty.call(this.types, name) ? this.types[name] : null;\n    }\n\n    validate() {\n        function validate(syntax, name, broken, descriptor) {\n            if (broken.has(name)) {\n                return broken.get(name);\n            }\n\n            broken.set(name, false);\n            if (descriptor.syntax !== null) {\n                walk(descriptor.syntax, function(node) {\n                    if (node.type !== 'Type' && node.type !== 'Property') {\n                        return;\n                    }\n\n                    const map = node.type === 'Type' ? syntax.types : syntax.properties;\n                    const brokenMap = node.type === 'Type' ? brokenTypes : brokenProperties;\n\n                    if (!hasOwnProperty.call(map, node.name) || validate(syntax, node.name, brokenMap, map[node.name])) {\n                        broken.set(name, true);\n                    }\n                }, this);\n            }\n        }\n\n        let brokenTypes = new Map();\n        let brokenProperties = new Map();\n\n        for (const key in this.types) {\n            validate(this, key, brokenTypes, this.types[key]);\n        }\n\n        for (const key in this.properties) {\n            validate(this, key, brokenProperties, this.properties[key]);\n        }\n\n        brokenTypes = [...brokenTypes.keys()].filter(name => brokenTypes.get(name));\n        brokenProperties = [...brokenProperties.keys()].filter(name => brokenProperties.get(name));\n\n        if (brokenTypes.length || brokenProperties.length) {\n            return {\n                types: brokenTypes,\n                properties: brokenProperties\n            };\n        }\n\n        return null;\n    }\n    dump(syntaxAsAst, pretty) {\n        return {\n            generic: this.generic,\n            units: this.units,\n            types: dumpMapSyntax(this.types, !pretty, syntaxAsAst),\n            properties: dumpMapSyntax(this.properties, !pretty, syntaxAsAst),\n            atrules: dumpAtruleMapSyntax(this.atrules, !pretty, syntaxAsAst)\n        };\n    }\n    toString() {\n        return JSON.stringify(this.dump());\n    }\n};\n","function appendOrSet(a, b) {\n    if (typeof b === 'string' && /^\\s*\\|/.test(b)) {\n        return typeof a === 'string'\n            ? a + b\n            : b.replace(/^\\s*\\|\\s*/, '');\n    }\n\n    return b || null;\n}\n\nfunction sliceProps(obj, props) {\n    const result = Object.create(null);\n\n    for (const [key, value] of Object.entries(obj)) {\n        if (value) {\n            result[key] = {};\n            for (const prop of Object.keys(value)) {\n                if (props.includes(prop)) {\n                    result[key][prop] = value[prop];\n                }\n            }\n        }\n    }\n\n    return result;\n}\n\nexport default function mix(dest, src) {\n    const result = { ...dest };\n\n    for (const [prop, value] of Object.entries(src)) {\n        switch (prop) {\n            case 'generic':\n                result[prop] = Boolean(value);\n                break;\n\n            case 'units':\n                result[prop] = { ...dest[prop] };\n                for (const [name, patch] of Object.entries(value)) {\n                    result[prop][name] = Array.isArray(patch) ? patch : [];\n                }\n                break;\n\n            case 'atrules':\n                result[prop] = { ...dest[prop] };\n\n                for (const [name, atrule] of Object.entries(value)) {\n                    const exists = result[prop][name] || {};\n                    const current = result[prop][name] = {\n                        prelude: exists.prelude || null,\n                        descriptors: {\n                            ...exists.descriptors\n                        }\n                    };\n\n                    if (!atrule) {\n                        continue;\n                    }\n\n                    current.prelude = atrule.prelude\n                        ? appendOrSet(current.prelude, atrule.prelude)\n                        : current.prelude || null;\n\n                    for (const [descriptorName, descriptorValue] of Object.entries(atrule.descriptors || {})) {\n                        current.descriptors[descriptorName] = descriptorValue\n                            ? appendOrSet(current.descriptors[descriptorName], descriptorValue)\n                            : null;\n                    }\n\n                    if (!Object.keys(current.descriptors).length) {\n                        current.descriptors = null;\n                    }\n                }\n                break;\n\n            case 'types':\n            case 'properties':\n                result[prop] = { ...dest[prop] };\n                for (const [name, syntax] of Object.entries(value)) {\n                    result[prop][name] = appendOrSet(result[prop][name], syntax);\n                }\n                break;\n\n            case 'scope':\n            case 'features':\n                result[prop] = { ...dest[prop] };\n                for (const [name, props] of Object.entries(value)) {\n                    result[prop][name] = { ...result[prop][name], ...props };\n                }\n                break;\n\n            case 'parseContext':\n                result[prop] = {\n                    ...dest[prop],\n                    ...value\n                };\n                break;\n\n            case 'atrule':\n            case 'pseudo':\n                result[prop] = {\n                    ...dest[prop],\n                    ...sliceProps(value, ['parse'])\n                };\n                break;\n\n            case 'node':\n                result[prop] = {\n                    ...dest[prop],\n                    ...sliceProps(value, ['name', 'structure', 'parse', 'generate', 'walkContext'])\n                };\n                break;\n        }\n    }\n\n    return result;\n}\n","import { tokenize } from '../tokenizer/index.js';\nimport { createParser } from '../parser/create.js';\nimport { createGenerator } from '../generator/create.js';\nimport { createConvertor } from '../convertor/create.js';\nimport { createWalker } from '../walker/create.js';\nimport { Lexer } from '../lexer/Lexer.js';\nimport mix from './config/mix.js';\n\nfunction createSyntax(config) {\n    const parse = createParser(config);\n    const walk = createWalker(config);\n    const generate = createGenerator(config);\n    const { fromPlainObject, toPlainObject } = createConvertor(walk);\n\n    const syntax = {\n        lexer: null,\n        createLexer: config => new Lexer(config, syntax, syntax.lexer.structure),\n\n        tokenize,\n        parse,\n        generate,\n\n        walk,\n        find: walk.find,\n        findLast: walk.findLast,\n        findAll: walk.findAll,\n\n        fromPlainObject,\n        toPlainObject,\n\n        fork(extension) {\n            const base = mix({}, config); // copy of config\n\n            return createSyntax(\n                typeof extension === 'function'\n                    ? extension(base, Object.assign)\n                    : mix(base, extension)\n            );\n        }\n    };\n\n    syntax.lexer = new Lexer({\n        generic: true,\n        units: config.units,\n        types: config.types,\n        atrules: config.atrules,\n        properties: config.properties,\n        node: config.node\n    }, syntax);\n\n    return syntax;\n};\n\nexport default config => createSyntax(mix({}, config));\n","import { List } from '../utils/List.js';\n\nexport function createConvertor(walk) {\n    return {\n        fromPlainObject(ast) {\n            walk(ast, {\n                enter(node) {\n                    if (node.children && node.children instanceof List === false) {\n                        node.children = new List().fromArray(node.children);\n                    }\n                }\n            });\n\n            return ast;\n        },\n        toPlainObject(ast) {\n            walk(ast, {\n                leave(node) {\n                    if (node.children && node.children instanceof List) {\n                        node.children = node.children.toArray();\n                    }\n                }\n            });\n\n            return ast;\n        }\n    };\n};\n","import {\n    isDigit,\n    WhiteSpace,\n    Comment,\n    Ident,\n    Number,\n    Dimension\n} from '../../tokenizer/index.js';\n\nconst PLUSSIGN = 0x002B;    // U+002B PLUS SIGN (+)\nconst HYPHENMINUS = 0x002D; // U+002D HYPHEN-MINUS (-)\nconst N = 0x006E;           // U+006E LATIN SMALL LETTER N (n)\nconst DISALLOW_SIGN = true;\nconst ALLOW_SIGN = false;\n\nfunction checkInteger(offset, disallowSign) {\n    let pos = this.tokenStart + offset;\n    const code = this.charCodeAt(pos);\n\n    if (code === PLUSSIGN || code === HYPHENMINUS) {\n        if (disallowSign) {\n            this.error('Number sign is not allowed');\n        }\n        pos++;\n    }\n\n    for (; pos < this.tokenEnd; pos++) {\n        if (!isDigit(this.charCodeAt(pos))) {\n            this.error('Integer is expected', pos);\n        }\n    }\n}\n\nfunction checkTokenIsInteger(disallowSign) {\n    return checkInteger.call(this, 0, disallowSign);\n}\n\nfunction expectCharCode(offset, code) {\n    if (!this.cmpChar(this.tokenStart + offset, code)) {\n        let msg = '';\n\n        switch (code) {\n            case N:\n                msg = 'N is expected';\n                break;\n            case HYPHENMINUS:\n                msg = 'HyphenMinus is expected';\n                break;\n        }\n\n        this.error(msg, this.tokenStart + offset);\n    }\n}\n\n// ... <signed-integer>\n// ... ['+' | '-'] <signless-integer>\nfunction consumeB() {\n    let offset = 0;\n    let sign = 0;\n    let type = this.tokenType;\n\n    while (type === WhiteSpace || type === Comment) {\n        type = this.lookupType(++offset);\n    }\n\n    if (type !== Number) {\n        if (this.isDelim(PLUSSIGN, offset) ||\n            this.isDelim(HYPHENMINUS, offset)) {\n            sign = this.isDelim(PLUSSIGN, offset) ? PLUSSIGN : HYPHENMINUS;\n\n            do {\n                type = this.lookupType(++offset);\n            } while (type === WhiteSpace || type === Comment);\n\n            if (type !== Number) {\n                this.skip(offset);\n                checkTokenIsInteger.call(this, DISALLOW_SIGN);\n            }\n        } else {\n            return null;\n        }\n    }\n\n    if (offset > 0) {\n        this.skip(offset);\n    }\n\n    if (sign === 0) {\n        type = this.charCodeAt(this.tokenStart);\n        if (type !== PLUSSIGN && type !== HYPHENMINUS) {\n            this.error('Number sign is expected');\n        }\n    }\n\n    checkTokenIsInteger.call(this, sign !== 0);\n    return sign === HYPHENMINUS ? '-' + this.consume(Number) : this.consume(Number);\n}\n\n// An+B microsyntax https://www.w3.org/TR/css-syntax-3/#anb\nexport const name = 'AnPlusB';\nexport const structure = {\n    a: [String, null],\n    b: [String, null]\n};\n\nexport function parse() {\n    /* eslint-disable brace-style*/\n    const start = this.tokenStart;\n    let a = null;\n    let b = null;\n\n    // <integer>\n    if (this.tokenType === Number) {\n        checkTokenIsInteger.call(this, ALLOW_SIGN);\n        b = this.consume(Number);\n    }\n\n    // -n\n    // -n <signed-integer>\n    // -n ['+' | '-'] <signless-integer>\n    // -n- <signless-integer>\n    // <dashndashdigit-ident>\n    else if (this.tokenType === Ident && this.cmpChar(this.tokenStart, HYPHENMINUS)) {\n        a = '-1';\n\n        expectCharCode.call(this, 1, N);\n\n        switch (this.tokenEnd - this.tokenStart) {\n            // -n\n            // -n <signed-integer>\n            // -n ['+' | '-'] <signless-integer>\n            case 2:\n                this.next();\n                b = consumeB.call(this);\n                break;\n\n            // -n- <signless-integer>\n            case 3:\n                expectCharCode.call(this, 2, HYPHENMINUS);\n\n                this.next();\n                this.skipSC();\n\n                checkTokenIsInteger.call(this, DISALLOW_SIGN);\n\n                b = '-' + this.consume(Number);\n                break;\n\n            // <dashndashdigit-ident>\n            default:\n                expectCharCode.call(this, 2, HYPHENMINUS);\n                checkInteger.call(this, 3, DISALLOW_SIGN);\n                this.next();\n\n                b = this.substrToCursor(start + 2);\n        }\n    }\n\n    // '+'? n\n    // '+'? n <signed-integer>\n    // '+'? n ['+' | '-'] <signless-integer>\n    // '+'? n- <signless-integer>\n    // '+'? <ndashdigit-ident>\n    else if (this.tokenType === Ident || (this.isDelim(PLUSSIGN) && this.lookupType(1) === Ident)) {\n        let sign = 0;\n        a = '1';\n\n        // just ignore a plus\n        if (this.isDelim(PLUSSIGN)) {\n            sign = 1;\n            this.next();\n        }\n\n        expectCharCode.call(this, 0, N);\n\n        switch (this.tokenEnd - this.tokenStart) {\n            // '+'? n\n            // '+'? n <signed-integer>\n            // '+'? n ['+' | '-'] <signless-integer>\n            case 1:\n                this.next();\n                b = consumeB.call(this);\n                break;\n\n            // '+'? n- <signless-integer>\n            case 2:\n                expectCharCode.call(this, 1, HYPHENMINUS);\n\n                this.next();\n                this.skipSC();\n\n                checkTokenIsInteger.call(this, DISALLOW_SIGN);\n\n                b = '-' + this.consume(Number);\n                break;\n\n            // '+'? <ndashdigit-ident>\n            default:\n                expectCharCode.call(this, 1, HYPHENMINUS);\n                checkInteger.call(this, 2, DISALLOW_SIGN);\n                this.next();\n\n                b = this.substrToCursor(start + sign + 1);\n        }\n    }\n\n    // <ndashdigit-dimension>\n    // <ndash-dimension> <signless-integer>\n    // <n-dimension>\n    // <n-dimension> <signed-integer>\n    // <n-dimension> ['+' | '-'] <signless-integer>\n    else if (this.tokenType === Dimension) {\n        const code = this.charCodeAt(this.tokenStart);\n        const sign = code === PLUSSIGN || code === HYPHENMINUS;\n        let i = this.tokenStart + sign;\n\n        for (; i < this.tokenEnd; i++) {\n            if (!isDigit(this.charCodeAt(i))) {\n                break;\n            }\n        }\n\n        if (i === this.tokenStart + sign) {\n            this.error('Integer is expected', this.tokenStart + sign);\n        }\n\n        expectCharCode.call(this, i - this.tokenStart, N);\n        a = this.substring(start, i);\n\n        // <n-dimension>\n        // <n-dimension> <signed-integer>\n        // <n-dimension> ['+' | '-'] <signless-integer>\n        if (i + 1 === this.tokenEnd) {\n            this.next();\n            b = consumeB.call(this);\n        } else {\n            expectCharCode.call(this, i - this.tokenStart + 1, HYPHENMINUS);\n\n            // <ndash-dimension> <signless-integer>\n            if (i + 2 === this.tokenEnd) {\n                this.next();\n                this.skipSC();\n                checkTokenIsInteger.call(this, DISALLOW_SIGN);\n                b = '-' + this.consume(Number);\n            }\n            // <ndashdigit-dimension>\n            else {\n                checkInteger.call(this, i - this.tokenStart + 2, DISALLOW_SIGN);\n                this.next();\n                b = this.substrToCursor(i + 1);\n            }\n        }\n    } else {\n        this.error();\n    }\n\n    if (a !== null && a.charCodeAt(0) === PLUSSIGN) {\n        a = a.substr(1);\n    }\n\n    if (b !== null && b.charCodeAt(0) === PLUSSIGN) {\n        b = b.substr(1);\n    }\n\n    return {\n        type: 'AnPlusB',\n        loc: this.getLocation(start, this.tokenStart),\n        a,\n        b\n    };\n}\n\nexport function generate(node) {\n    if (node.a) {\n        const a =\n            node.a === '+1' && 'n' ||\n            node.a ===  '1' && 'n' ||\n            node.a === '-1' && '-n' ||\n            node.a + 'n';\n\n        if (node.b) {\n            const b = node.b[0] === '-' || node.b[0] === '+'\n                ? node.b\n                : '+' + node.b;\n            this.tokenize(a + b);\n        } else {\n            this.tokenize(a);\n        }\n    } else {\n        this.tokenize(node.b);\n    }\n}\n","import {\n    AtKeyword,\n    Semicolon,\n    LeftCurlyBracket,\n    RightCurlyBracket\n} from '../../tokenizer/index.js';\n\nfunction consumeRaw() {\n    return this.Raw(this.consumeUntilLeftCurlyBracketOrSemicolon, true);\n}\n\nfunction isDeclarationBlockAtrule() {\n    for (let offset = 1, type; type = this.lookupType(offset); offset++) {\n        if (type === RightCurlyBracket) {\n            return true;\n        }\n\n        if (type === LeftCurlyBracket ||\n            type === AtKeyword) {\n            return false;\n        }\n    }\n\n    return false;\n}\n\n\nexport const name = 'Atrule';\nexport const walkContext = 'atrule';\nexport const structure = {\n    name: String,\n    prelude: ['AtrulePrelude', 'Raw', null],\n    block: ['Block', null]\n};\n\nexport function parse(isDeclaration = false) {\n    const start = this.tokenStart;\n    let name;\n    let nameLowerCase;\n    let prelude = null;\n    let block = null;\n\n    this.eat(AtKeyword);\n\n    name = this.substrToCursor(start + 1);\n    nameLowerCase = name.toLowerCase();\n    this.skipSC();\n\n    // parse prelude\n    if (this.eof === false &&\n        this.tokenType !== LeftCurlyBracket &&\n        this.tokenType !== Semicolon) {\n        if (this.parseAtrulePrelude) {\n            prelude = this.parseWithFallback(this.AtrulePrelude.bind(this, name, isDeclaration), consumeRaw);\n        } else {\n            prelude = consumeRaw.call(this, this.tokenIndex);\n        }\n\n        this.skipSC();\n    }\n\n    switch (this.tokenType) {\n        case Semicolon:\n            this.next();\n            break;\n\n        case LeftCurlyBracket:\n            this.eat(LeftCurlyBracket);\n\n            if (hasOwnProperty.call(this.atrule, nameLowerCase) &&\n                typeof this.atrule[nameLowerCase].block === 'function') {\n                block = this.atrule[nameLowerCase].block.call(this, isDeclaration);\n            } else {\n                // TODO: should consume block content as Raw?\n                block = this.Block(isDeclarationBlockAtrule.call(this));\n            }\n\n            if (!this.eof) {\n                this.eat(RightCurlyBracket);\n            }\n\n            break;\n    }\n\n    return {\n        type: 'Atrule',\n        loc: this.getLocation(start, this.tokenStart),\n        name,\n        prelude,\n        block\n    };\n}\n\nexport function generate(node) {\n    this.token(AtKeyword, '@' + node.name);\n\n    if (node.prelude !== null) {\n        this.node(node.prelude);\n    }\n\n    if (node.block) {\n        this.token(LeftCurlyBracket, '{');\n        this.node(node.block);\n        this.token(RightCurlyBracket, '}');\n    } else {\n        this.token(Semicolon, ';');\n    }\n}\n","import {\n    Semicolon,\n    LeftCurlyBracket\n} from '../../tokenizer/index.js';\n\nexport const name = 'AtrulePrelude';\nexport const walkContext = 'atrulePrelude';\nexport const structure = {\n    children: [[]]\n};\n\nexport function parse(name) {\n    let children = null;\n\n    if (name !== null) {\n        name = name.toLowerCase();\n    }\n\n    this.skipSC();\n\n    if (hasOwnProperty.call(this.atrule, name) &&\n        typeof this.atrule[name].prelude === 'function') {\n        // custom consumer\n        children = this.atrule[name].prelude.call(this);\n    } else {\n        // default consumer\n        children = this.readSequence(this.scope.AtrulePrelude);\n    }\n\n    this.skipSC();\n\n    if (this.eof !== true &&\n        this.tokenType !== LeftCurlyBracket &&\n        this.tokenType !== Semicolon) {\n        this.error('Semicolon or block is expected');\n    }\n\n    return {\n        type: 'AtrulePrelude',\n        loc: this.getLocationFromList(children),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node);\n}\n","import {\n    Ident,\n    String as StringToken,\n    Delim,\n    LeftSquareBracket,\n    RightSquareBracket\n} from '../../tokenizer/index.js';\n\nconst DOLLARSIGN = 0x0024;       // U+0024 DOLLAR SIGN ($)\nconst ASTERISK = 0x002A;         // U+002A ASTERISK (*)\nconst EQUALSSIGN = 0x003D;       // U+003D EQUALS SIGN (=)\nconst CIRCUMFLEXACCENT = 0x005E; // U+005E (^)\nconst VERTICALLINE = 0x007C;     // U+007C VERTICAL LINE (|)\nconst TILDE = 0x007E;            // U+007E TILDE (~)\n\nfunction getAttributeName() {\n    if (this.eof) {\n        this.error('Unexpected end of input');\n    }\n\n    const start = this.tokenStart;\n    let expectIdent = false;\n\n    if (this.isDelim(ASTERISK)) {\n        expectIdent = true;\n        this.next();\n    } else if (!this.isDelim(VERTICALLINE)) {\n        this.eat(Ident);\n    }\n\n    if (this.isDelim(VERTICALLINE)) {\n        if (this.charCodeAt(this.tokenStart + 1) !== EQUALSSIGN) {\n            this.next();\n            this.eat(Ident);\n        } else if (expectIdent) {\n            this.error('Identifier is expected', this.tokenEnd);\n        }\n    } else if (expectIdent) {\n        this.error('Vertical line is expected');\n    }\n\n    return {\n        type: 'Identifier',\n        loc: this.getLocation(start, this.tokenStart),\n        name: this.substrToCursor(start)\n    };\n}\n\nfunction getOperator() {\n    const start = this.tokenStart;\n    const code = this.charCodeAt(start);\n\n    if (code !== EQUALSSIGN &&        // =\n        code !== TILDE &&             // ~=\n        code !== CIRCUMFLEXACCENT &&  // ^=\n        code !== DOLLARSIGN &&        // $=\n        code !== ASTERISK &&          // *=\n        code !== VERTICALLINE         // |=\n    ) {\n        this.error('Attribute selector (=, ~=, ^=, $=, *=, |=) is expected');\n    }\n\n    this.next();\n\n    if (code !== EQUALSSIGN) {\n        if (!this.isDelim(EQUALSSIGN)) {\n            this.error('Equal sign is expected');\n        }\n\n        this.next();\n    }\n\n    return this.substrToCursor(start);\n}\n\n// '[' <wq-name> ']'\n// '[' <wq-name> <attr-matcher> [ <string-token> | <ident-token> ] <attr-modifier>? ']'\nexport const name = 'AttributeSelector';\nexport const structure = {\n    name: 'Identifier',\n    matcher: [String, null],\n    value: ['String', 'Identifier', null],\n    flags: [String, null]\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n    let name;\n    let matcher = null;\n    let value = null;\n    let flags = null;\n\n    this.eat(LeftSquareBracket);\n    this.skipSC();\n\n    name = getAttributeName.call(this);\n    this.skipSC();\n\n    if (this.tokenType !== RightSquareBracket) {\n        // avoid case `[name i]`\n        if (this.tokenType !== Ident) {\n            matcher = getOperator.call(this);\n\n            this.skipSC();\n\n            value = this.tokenType === StringToken\n                ? this.String()\n                : this.Identifier();\n\n            this.skipSC();\n        }\n\n        // attribute flags\n        if (this.tokenType === Ident) {\n            flags = this.consume(Ident);\n\n            this.skipSC();\n        }\n    }\n\n    this.eat(RightSquareBracket);\n\n    return {\n        type: 'AttributeSelector',\n        loc: this.getLocation(start, this.tokenStart),\n        name,\n        matcher,\n        value,\n        flags\n    };\n}\n\nexport function generate(node) {\n    this.token(Delim, '[');\n    this.node(node.name);\n\n    if (node.matcher !== null) {\n        this.tokenize(node.matcher);\n        this.node(node.value);\n    }\n\n    if (node.flags !== null) {\n        this.token(Ident, node.flags);\n    }\n\n    this.token(Delim, ']');\n}\n","import {\n    WhiteSpace,\n    Comment,\n    Semicolon,\n    AtKeyword,\n    RightCurlyBracket\n} from '../../tokenizer/index.js';\n\nconst AMPERSAND = 0x0026;       // U+0026 AMPERSAND (&)\n\nfunction consumeRaw() {\n    return this.Raw(null, true);\n}\nfunction consumeRule() {\n    return this.parseWithFallback(this.Rule, consumeRaw);\n}\nfunction consumeRawDeclaration() {\n    return this.Raw(this.consumeUntilSemicolonIncluded, true);\n}\nfunction consumeDeclaration() {\n    if (this.tokenType === Semicolon) {\n        return consumeRawDeclaration.call(this, this.tokenIndex);\n    }\n\n    const node = this.parseWithFallback(this.Declaration, consumeRawDeclaration);\n\n    if (this.tokenType === Semicolon) {\n        this.next();\n    }\n\n    return node;\n}\n\nexport const name = 'Block';\nexport const walkContext = 'block';\nexport const structure = {\n    children: [[\n        'Atrule',\n        'Rule',\n        'Declaration'\n    ]]\n};\n\nexport function parse(isStyleBlock) {\n    const consumer = isStyleBlock ? consumeDeclaration : consumeRule;\n    const start = this.tokenStart;\n    let children = this.createList();\n\n    scan:\n    while (!this.eof) {\n        switch (this.tokenType) {\n            case RightCurlyBracket:\n                break scan;\n\n            case WhiteSpace:\n            case Comment:\n                this.next();\n                break;\n\n            case AtKeyword:\n                children.push(this.parseWithFallback(this.Atrule.bind(this, isStyleBlock), consumeRaw));\n                break;\n\n            default:\n                if (isStyleBlock && this.isDelim(AMPERSAND))  {\n                    children.push(consumeRule.call(this));\n                } else {\n                    children.push(consumer.call(this));\n                }\n        }\n    }\n\n    return {\n        type: 'Block',\n        loc: this.getLocation(start, this.tokenStart),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node, prev => {\n        if (prev.type === 'Declaration') {\n            this.token(Semicolon, ';');\n        }\n    });\n}\n","import {\n    Delim,\n    LeftSquareBracket,\n    RightSquareBracket\n} from '../../tokenizer/index.js';\n\nexport const name = 'Brackets';\nexport const structure = {\n    children: [[]]\n};\n\nexport function parse(readSequence, recognizer) {\n    const start = this.tokenStart;\n    let children = null;\n\n    this.eat(LeftSquareBracket);\n\n    children = readSequence.call(this, recognizer);\n\n    if (!this.eof) {\n        this.eat(RightSquareBracket);\n    }\n\n    return {\n        type: 'Brackets',\n        loc: this.getLocation(start, this.tokenStart),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.token(Delim, '[');\n    this.children(node);\n    this.token(Delim, ']');\n}\n","import { CDC } from '../../tokenizer/index.js';\n\nexport const name = 'CDC';\nexport const structure = [];\n\nexport function parse() {\n    const start = this.tokenStart;\n\n    this.eat(CDC); // -->\n\n    return {\n        type: 'CDC',\n        loc: this.getLocation(start, this.tokenStart)\n    };\n}\n\nexport function generate() {\n    this.token(CDC, '-->');\n}\n","import { CDO } from '../../tokenizer/index.js';\n\nexport const name = 'CDO';\nexport const structure = [];\n\nexport function parse() {\n    const start = this.tokenStart;\n\n    this.eat(CDO); // <!--\n\n    return {\n        type: 'CDO',\n        loc: this.getLocation(start, this.tokenStart)\n    };\n}\n\nexport function generate() {\n    this.token(CDO, '<!--');\n}\n","import { Delim, Ident } from '../../tokenizer/index.js';\n\nconst FULLSTOP = 0x002E; // U+002E FULL STOP (.)\n\n// '.' ident\nexport const name = 'ClassSelector';\nexport const structure = {\n    name: String\n};\n\nexport function parse() {\n    this.eatDelim(FULLSTOP);\n\n    return {\n        type: 'ClassSelector',\n        loc: this.getLocation(this.tokenStart - 1, this.tokenEnd),\n        name: this.consume(Ident)\n    };\n}\n\nexport function generate(node) {\n    this.token(Delim, '.');\n    this.token(Ident, node.name);\n}\n","import { WhiteSpace, Delim } from '../../tokenizer/index.js';\n\nconst PLUSSIGN = 0x002B;        // U+002B PLUS SIGN (+)\nconst SOLIDUS = 0x002F;         // U+002F SOLIDUS (/)\nconst GREATERTHANSIGN = 0x003E; // U+003E GREATER-THAN SIGN (>)\nconst TILDE = 0x007E;           // U+007E TILDE (~)\n\nexport const name = 'Combinator';\nexport const structure = {\n    name: String\n};\n\n// + | > | ~ | /deep/\nexport function parse() {\n    const start = this.tokenStart;\n    let name;\n\n    switch (this.tokenType) {\n        case WhiteSpace:\n            name = ' ';\n            break;\n\n        case Delim:\n            switch (this.charCodeAt(this.tokenStart)) {\n                case GREATERTHANSIGN:\n                case PLUSSIGN:\n                case TILDE:\n                    this.next();\n                    break;\n\n                case SOLIDUS:\n                    this.next();\n                    this.eatIdent('deep');\n                    this.eatDelim(SOLIDUS);\n                    break;\n\n                default:\n                    this.error('Combinator is expected');\n            }\n\n            name = this.substrToCursor(start);\n            break;\n    }\n\n    return {\n        type: 'Combinator',\n        loc: this.getLocation(start, this.tokenStart),\n        name\n    };\n}\n\nexport function generate(node) {\n    this.tokenize(node.name);\n}\n","import { Comment } from '../../tokenizer/index.js';\n\nconst ASTERISK = 0x002A;        // U+002A ASTERISK (*)\nconst SOLIDUS = 0x002F;         // U+002F SOLIDUS (/)\n\n\nexport const name = 'Comment';\nexport const structure = {\n    value: String\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n    let end = this.tokenEnd;\n\n    this.eat(Comment);\n\n    if ((end - start + 2) >= 2 &&\n        this.charCodeAt(end - 2) === ASTERISK &&\n        this.charCodeAt(end - 1) === SOLIDUS) {\n        end -= 2;\n    }\n\n    return {\n        type: 'Comment',\n        loc: this.getLocation(start, this.tokenStart),\n        value: this.substring(start + 2, end)\n    };\n}\n\nexport function generate(node) {\n    this.token(Comment, '/*' + node.value + '*/');\n}\n","import {\n    WhiteSpace,\n    Comment,\n    Ident,\n    LeftParenthesis,\n    RightParenthesis,\n    Function as FunctionToken,\n    Colon,\n    EOF\n} from '../../tokenizer/index.js';\n\nconst likelyFeatureToken = new Set([Colon, RightParenthesis, EOF]);\n\nexport const name = 'Condition';\nexport const structure = {\n    kind: String,\n    children: [[\n        'Identifier',\n        'Feature',\n        'FeatureFunction',\n        'FeatureRange',\n        'SupportsDeclaration'\n    ]]\n};\n\nfunction featureOrRange(kind) {\n    if (this.lookupTypeNonSC(1) === Ident &&\n        likelyFeatureToken.has(this.lookupTypeNonSC(2))) {\n        return this.Feature(kind);\n    }\n\n    return this.FeatureRange(kind);\n}\n\nconst parentheses = {\n    media: featureOrRange,\n    container: featureOrRange,\n    supports() {\n        return this.SupportsDeclaration();\n    }\n};\n\nexport function parse(kind = 'media') {\n    const children = this.createList();\n\n    scan: while (!this.eof) {\n        switch (this.tokenType) {\n            case Comment:\n            case WhiteSpace:\n                this.next();\n                continue;\n\n            case Ident:\n                children.push(this.Identifier());\n                break;\n\n            case LeftParenthesis: {\n                let term = this.parseWithFallback(\n                    () => parentheses[kind].call(this, kind),\n                    () => null\n                );\n\n                if (!term) {\n                    term = this.parseWithFallback(\n                        () => {\n                            this.eat(LeftParenthesis);\n                            const res = this.Condition(kind);\n                            this.eat(RightParenthesis);\n                            return res;\n                        },\n                        () => {\n                            return this.GeneralEnclosed(kind);\n                        }\n                    );\n                }\n\n                children.push(term);\n                break;\n            }\n\n            case FunctionToken: {\n                let term = this.parseWithFallback(\n                    () => this.FeatureFunction(kind),\n                    () => null\n                );\n\n                if (!term) {\n                    term = this.GeneralEnclosed(kind);\n                }\n\n                children.push(term);\n                break;\n            }\n\n            default:\n                break scan;\n        }\n    }\n\n    if (children.isEmpty) {\n        this.error('Condition is expected');\n    }\n\n    return {\n        type: 'Condition',\n        loc: this.getLocationFromList(children),\n        kind,\n        children\n    };\n}\n\nexport function generate(node) {\n    node.children.forEach(child => {\n        if (child.type === 'Condition') {\n            this.token(LeftParenthesis, '(');\n            this.node(child);\n            this.token(RightParenthesis, ')');\n        } else {\n            this.node(child);\n        }\n    });\n}\n\n","import { isCustomProperty } from '../../utils/names.js';\nimport {\n    Ident,\n    Hash,\n    Colon,\n    Semicolon,\n    Delim,\n    WhiteSpace\n} from '../../tokenizer/index.js';\n\nconst EXCLAMATIONMARK = 0x0021; // U+0021 EXCLAMATION MARK (!)\nconst NUMBERSIGN = 0x0023;      // U+0023 NUMBER SIGN (#)\nconst DOLLARSIGN = 0x0024;      // U+0024 DOLLAR SIGN ($)\nconst AMPERSAND = 0x0026;       // U+0026 AMPERSAND (&)\nconst ASTERISK = 0x002A;        // U+002A ASTERISK (*)\nconst PLUSSIGN = 0x002B;        // U+002B PLUS SIGN (+)\nconst SOLIDUS = 0x002F;         // U+002F SOLIDUS (/)\n\nfunction consumeValueRaw() {\n    return this.Raw(this.consumeUntilExclamationMarkOrSemicolon, true);\n}\n\nfunction consumeCustomPropertyRaw() {\n    return this.Raw(this.consumeUntilExclamationMarkOrSemicolon, false);\n}\n\nfunction consumeValue() {\n    const startValueToken = this.tokenIndex;\n    const value = this.Value();\n\n    if (value.type !== 'Raw' &&\n        this.eof === false &&\n        this.tokenType !== Semicolon &&\n        this.isDelim(EXCLAMATIONMARK) === false &&\n        this.isBalanceEdge(startValueToken) === false) {\n        this.error();\n    }\n\n    return value;\n}\n\nexport const name = 'Declaration';\nexport const walkContext = 'declaration';\nexport const structure = {\n    important: [Boolean, String],\n    property: String,\n    value: ['Value', 'Raw']\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n    const startToken = this.tokenIndex;\n    const property = readProperty.call(this);\n    const customProperty = isCustomProperty(property);\n    const parseValue = customProperty ? this.parseCustomProperty : this.parseValue;\n    const consumeRaw = customProperty ? consumeCustomPropertyRaw : consumeValueRaw;\n    let important = false;\n    let value;\n\n    this.skipSC();\n    this.eat(Colon);\n\n    const valueStart = this.tokenIndex;\n\n    if (!customProperty) {\n        this.skipSC();\n    }\n\n    if (parseValue) {\n        value = this.parseWithFallback(consumeValue, consumeRaw);\n    } else {\n        value = consumeRaw.call(this, this.tokenIndex);\n    }\n\n    if (customProperty && value.type === 'Value' && value.children.isEmpty) {\n        for (let offset = valueStart - this.tokenIndex; offset <= 0; offset++) {\n            if (this.lookupType(offset) === WhiteSpace) {\n                value.children.appendData({\n                    type: 'WhiteSpace',\n                    loc: null,\n                    value: ' '\n                });\n                break;\n            }\n        }\n    }\n\n    if (this.isDelim(EXCLAMATIONMARK)) {\n        important = getImportant.call(this);\n        this.skipSC();\n    }\n\n    // Do not include semicolon to range per spec\n    // https://drafts.csswg.org/css-syntax/#declaration-diagram\n\n    if (this.eof === false &&\n        this.tokenType !== Semicolon &&\n        this.isBalanceEdge(startToken) === false) {\n        this.error();\n    }\n\n    return {\n        type: 'Declaration',\n        loc: this.getLocation(start, this.tokenStart),\n        important,\n        property,\n        value\n    };\n}\n\nexport function generate(node) {\n    this.token(Ident, node.property);\n    this.token(Colon, ':');\n    this.node(node.value);\n\n    if (node.important) {\n        this.token(Delim, '!');\n        this.token(Ident, node.important === true ? 'important' : node.important);\n    }\n}\n\nfunction readProperty() {\n    const start = this.tokenStart;\n\n    // hacks\n    if (this.tokenType === Delim) {\n        switch (this.charCodeAt(this.tokenStart)) {\n            case ASTERISK:\n            case DOLLARSIGN:\n            case PLUSSIGN:\n            case NUMBERSIGN:\n            case AMPERSAND:\n                this.next();\n                break;\n\n            // TODO: not sure we should support this hack\n            case SOLIDUS:\n                this.next();\n                if (this.isDelim(SOLIDUS)) {\n                    this.next();\n                }\n                break;\n        }\n    }\n\n    if (this.tokenType === Hash) {\n        this.eat(Hash);\n    } else {\n        this.eat(Ident);\n    }\n\n    return this.substrToCursor(start);\n}\n\n// ! ws* important\nfunction getImportant() {\n    this.eat(Delim);\n    this.skipSC();\n\n    const important = this.consume(Ident);\n\n    // store original value in case it differ from `important`\n    // for better original source restoring and hacks like `!ie` support\n    return important === 'important' ? true : important;\n}\n","import {\n    WhiteSpace,\n    Comment,\n    Semicolon,\n    AtKeyword\n} from '../../tokenizer/index.js';\n\nconst AMPERSAND = 0x0026;       // U+0026 AMPERSAND (&)\n\nfunction consumeRaw() {\n    return this.Raw(this.consumeUntilSemicolonIncluded, true);\n}\n\nexport const name = 'DeclarationList';\nexport const structure = {\n    children: [[\n        'Declaration',\n        'Atrule',\n        'Rule'\n    ]]\n};\n\nexport function parse() {\n    const children = this.createList();\n\n    scan:\n    while (!this.eof) {\n        switch (this.tokenType) {\n            case WhiteSpace:\n            case Comment:\n            case Semicolon:\n                this.next();\n                break;\n\n            case AtKeyword:\n                children.push(this.parseWithFallback(this.Atrule.bind(this, true), consumeRaw));\n                break;\n\n            default:\n                if (this.isDelim(AMPERSAND))  {\n                    children.push(this.parseWithFallback(this.Rule, consumeRaw));\n                } else {\n                    children.push(this.parseWithFallback(this.Declaration, consumeRaw));\n                }\n        }\n    }\n\n    return {\n        type: 'DeclarationList',\n        loc: this.getLocationFromList(children),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node, prev => {\n        if (prev.type === 'Declaration') {\n            this.token(Semicolon, ';');\n        }\n    });\n}\n\n","import { Dimension } from '../../tokenizer/index.js';\n\nexport const name = 'Dimension';\nexport const structure = {\n    value: String,\n    unit: String\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n    const value = this.consumeNumber(Dimension);\n\n    return {\n        type: 'Dimension',\n        loc: this.getLocation(start, this.tokenStart),\n        value,\n        unit: this.substring(start + value.length, this.tokenStart)\n    };\n}\n\nexport function generate(node) {\n    this.token(Dimension, node.value + node.unit);\n}\n","import {\n    Ident,\n    Number,\n    Dimension,\n    Function as FunctionToken,\n    LeftParenthesis,\n    RightParenthesis,\n    Colon,\n    Delim\n} from '../../tokenizer/index.js';\n\nconst SOLIDUS = 0x002F;  // U+002F SOLIDUS (/)\n\nexport const name = 'Feature';\nexport const structure = {\n    kind: String,\n    name: String,\n    value: ['Identifier', 'Number', 'Dimension', 'Ratio', 'Function', null]\n};\n\nexport function parse(kind) {\n    const start = this.tokenStart;\n    let name;\n    let value = null;\n\n    this.eat(LeftParenthesis);\n    this.skipSC();\n\n    name = this.consume(Ident);\n    this.skipSC();\n\n    if (this.tokenType !== RightParenthesis) {\n        this.eat(Colon);\n        this.skipSC();\n\n        switch (this.tokenType) {\n            case Number:\n                if (this.lookupNonWSType(1) === Delim) {\n                    value = this.Ratio();\n                } else {\n                    value = this.Number();\n                }\n\n                break;\n\n            case Dimension:\n                value = this.Dimension();\n                break;\n\n            case Ident:\n                value = this.Identifier();\n                break;\n\n            case FunctionToken:\n                value = this.parseWithFallback(\n                    () => {\n                        const res = this.Function(this.readSequence, this.scope.Value);\n\n                        this.skipSC();\n\n                        if (this.isDelim(SOLIDUS)) {\n                            this.error();\n                        }\n\n                        return res;\n                    },\n                    () => {\n                        return this.Ratio();\n                    }\n                );\n                break;\n\n            default:\n                this.error('Number, dimension, ratio or identifier is expected');\n        }\n\n        this.skipSC();\n    }\n\n    if (!this.eof) {\n        this.eat(RightParenthesis);\n    }\n\n    return {\n        type: 'Feature',\n        loc: this.getLocation(start, this.tokenStart),\n        kind,\n        name,\n        value\n    };\n}\n\nexport function generate(node) {\n    this.token(LeftParenthesis, '(');\n    this.token(Ident, node.name);\n\n    if (node.value !== null) {\n        this.token(Colon, ':');\n        this.node(node.value);\n    }\n\n    this.token(RightParenthesis, ')');\n}\n","import {\n    Function as FunctionToken,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nexport const name = 'FeatureFunction';\nexport const structure = {\n    kind: String,\n    feature: String,\n    value: ['Declaration', 'Selector']\n};\n\nfunction getFeatureParser(kind, name) {\n    const featuresOfKind = this.features[kind] || {};\n    const parser = featuresOfKind[name];\n\n    if (typeof parser !== 'function') {\n        this.error(`Unknown feature ${name}()`);\n    }\n\n    return parser;\n}\n\nexport function parse(kind = 'unknown') {\n    const start = this.tokenStart;\n    const functionName = this.consumeFunctionName();\n    const valueParser = getFeatureParser.call(this, kind, functionName.toLowerCase());\n\n    this.skipSC();\n\n    const value = this.parseWithFallback(\n        () => {\n            const startValueToken = this.tokenIndex;\n            const value = valueParser.call(this);\n\n            if (this.eof === false &&\n                this.isBalanceEdge(startValueToken) === false) {\n                this.error();\n            }\n\n            return value;\n        },\n        () => this.Raw(null, false)\n    );\n\n    if (!this.eof) {\n        this.eat(RightParenthesis);\n    }\n\n    return {\n        type: 'FeatureFunction',\n        loc: this.getLocation(start, this.tokenStart),\n        kind,\n        feature: functionName,\n        value\n    };\n}\n\nexport function generate(node) {\n    this.token(FunctionToken, node.feature + '(');\n    this.node(node.value);\n    this.token(RightParenthesis, ')');\n}\n","import {\n    Ident,\n    Number,\n    Dimension,\n    Function as FunctionToken,\n    LeftParenthesis,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nconst SOLIDUS = 0x002F;         // U+002F SOLIDUS (/)\nconst LESSTHANSIGN = 0x003C;    // U+003C LESS-THAN SIGN (<)\nconst EQUALSSIGN = 0x003D;      // U+003D EQUALS SIGN (=)\nconst GREATERTHANSIGN = 0x003E; // U+003E GREATER-THAN SIGN (>)\n\nexport const name = 'FeatureRange';\nexport const structure = {\n    kind: String,\n    left: ['Identifier', 'Number', 'Dimension', 'Ratio', 'Function'],\n    leftComparison: String,\n    middle: ['Identifier', 'Number', 'Dimension', 'Ratio', 'Function'],\n    rightComparison: [String, null],\n    right: ['Identifier', 'Number', 'Dimension', 'Ratio', 'Function', null]\n};\n\nfunction readTerm() {\n    this.skipSC();\n\n    switch (this.tokenType) {\n        case Number:\n            if (this.isDelim(SOLIDUS, this.lookupOffsetNonSC(1))) {\n                return this.Ratio();\n            } else {\n                return this.Number();\n            }\n\n        case Dimension:\n            return this.Dimension();\n\n        case Ident:\n            return this.Identifier();\n\n        case FunctionToken:\n            return this.parseWithFallback(\n                () => {\n                    const res = this.Function(this.readSequence, this.scope.Value);\n\n                    this.skipSC();\n\n                    if (this.isDelim(SOLIDUS)) {\n                        this.error();\n                    }\n\n                    return res;\n                },\n                () => {\n                    return this.Ratio();\n                }\n            );\n\n        default:\n            this.error('Number, dimension, ratio or identifier is expected');\n    }\n}\n\nfunction readComparison(expectColon) {\n    this.skipSC();\n\n    if (this.isDelim(LESSTHANSIGN) ||\n        this.isDelim(GREATERTHANSIGN)) {\n        const value = this.source[this.tokenStart];\n\n        this.next();\n\n        if (this.isDelim(EQUALSSIGN)) {\n            this.next();\n            return value + '=';\n        }\n\n        return value;\n    }\n\n    if (this.isDelim(EQUALSSIGN)) {\n        return '=';\n    }\n\n    this.error(`Expected ${expectColon ? '\":\", ' : ''}\"<\", \">\", \"=\" or \")\"`);\n}\n\nexport function parse(kind = 'unknown') {\n    const start = this.tokenStart;\n\n    this.skipSC();\n    this.eat(LeftParenthesis);\n\n    const left = readTerm.call(this);\n    const leftComparison = readComparison.call(this, left.type === 'Identifier');\n    const middle = readTerm.call(this);\n    let rightComparison = null;\n    let right = null;\n\n    if (this.lookupNonWSType(0) !== RightParenthesis) {\n        rightComparison = readComparison.call(this);\n        right = readTerm.call(this);\n    }\n\n    this.skipSC();\n    this.eat(RightParenthesis);\n\n    return {\n        type: 'FeatureRange',\n        loc: this.getLocation(start, this.tokenStart),\n        kind,\n        left,\n        leftComparison,\n        middle,\n        rightComparison,\n        right\n    };\n}\n\nexport function generate(node) {\n    this.token(LeftParenthesis, '(');\n    this.node(node.left);\n    this.tokenize(node.leftComparison);\n    this.node(node.middle);\n\n    if (node.right) {\n        this.tokenize(node.rightComparison);\n        this.node(node.right);\n    }\n\n    this.token(RightParenthesis, ')');\n}\n","import {\n    Function as FunctionToken,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\n\nexport const name = 'Function';\nexport const walkContext = 'function';\nexport const structure = {\n    name: String,\n    children: [[]]\n};\n\n// <function-token> <sequence> )\nexport function parse(readSequence, recognizer) {\n    const start = this.tokenStart;\n    const name = this.consumeFunctionName();\n    const nameLowerCase = name.toLowerCase();\n    let children;\n\n    children = recognizer.hasOwnProperty(nameLowerCase)\n        ? recognizer[nameLowerCase].call(this, recognizer)\n        : readSequence.call(this, recognizer);\n\n    if (!this.eof) {\n        this.eat(RightParenthesis);\n    }\n\n    return {\n        type: 'Function',\n        loc: this.getLocation(start, this.tokenStart),\n        name,\n        children\n    };\n}\n\nexport function generate(node) {\n    this.token(FunctionToken, node.name + '(');\n    this.children(node);\n    this.token(RightParenthesis, ')');\n}\n","import {\n    Function as FunctionToken,\n    LeftParenthesis,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\n\nexport const name = 'GeneralEnclosed';\nexport const structure = {\n    kind: String,\n    function: [String, null],\n    children: [[]]\n};\n\n// <function-token> <any-value> )\n// ( <any-value> )\nexport function parse(kind) {\n    const start = this.tokenStart;\n    let functionName = null;\n\n    if (this.tokenType === FunctionToken) {\n        functionName = this.consumeFunctionName();\n    } else {\n        this.eat(LeftParenthesis);\n    }\n\n    const children = this.parseWithFallback(\n        () => {\n            const startValueToken = this.tokenIndex;\n            const children = this.readSequence(this.scope.Value);\n\n            if (this.eof === false &&\n                this.isBalanceEdge(startValueToken) === false) {\n                this.error();\n            }\n\n            return children;\n        },\n        () => this.createSingleNodeList(\n            this.Raw(null, false)\n        )\n    );\n\n    if (!this.eof) {\n        this.eat(RightParenthesis);\n    }\n\n    return {\n        type: 'GeneralEnclosed',\n        loc: this.getLocation(start, this.tokenStart),\n        kind,\n        function: functionName,\n        children\n    };\n}\n\nexport function generate(node) {\n    if (node.function) {\n        this.token(FunctionToken, node.function + '(');\n    } else {\n        this.token(LeftParenthesis, '(');\n    }\n\n    this.children(node);\n    this.token(RightParenthesis, ')');\n}\n","import { Hash } from '../../tokenizer/index.js';\n\n// '#' ident\nexport const xxx = 'XXX';\nexport const name = 'Hash';\nexport const structure = {\n    value: String\n};\nexport function parse() {\n    const start = this.tokenStart;\n\n    this.eat(Hash);\n\n    return {\n        type: 'Hash',\n        loc: this.getLocation(start, this.tokenStart),\n        value: this.substrToCursor(start + 1)\n    };\n}\nexport function generate(node) {\n    this.token(Hash, '#' + node.value);\n}\n\n","import { Ident } from '../../tokenizer/index.js';\n\nexport const name = 'Identifier';\nexport const structure = {\n    name: String\n};\n\nexport function parse() {\n    return {\n        type: 'Identifier',\n        loc: this.getLocation(this.tokenStart, this.tokenEnd),\n        name: this.consume(Ident)\n    };\n}\n\nexport function generate(node) {\n    this.token(Ident, node.name);\n}\n","import { Hash, Delim } from '../../tokenizer/index.js';\n\nexport const name = 'IdSelector';\nexport const structure = {\n    name: String\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n\n    // TODO: check value is an ident\n    this.eat(Hash);\n\n    return {\n        type: 'IdSelector',\n        loc: this.getLocation(start, this.tokenStart),\n        name: this.substrToCursor(start + 1)\n    };\n}\n\nexport function generate(node) {\n    // Using Delim instead of Hash is a hack to avoid for a whitespace between ident and id-selector\n    // in safe mode (e.g. \"a#id\"), because IE11 doesn't allow a sequence <ident-token> <hash-token>\n    // without a whitespace in values (e.g. \"1px solid#000\")\n    this.token(Delim, '#' + node.name);\n}\n","import { Ident, Delim } from '../../tokenizer/index.js';\n\nconst FULLSTOP = 0x002E; // U+002E FULL STOP (.)\n\nexport const name = 'Layer';\nexport const structure = {\n    name: String\n};\n\nexport function parse() {\n    let name = this.consume(Ident);\n\n    while (this.isDelim(FULLSTOP)) {\n        this.eat(Delim);\n        name += '.' + this.consume(Ident);\n    }\n\n    return {\n        type: 'Layer',\n        loc: this.getLocation(this.tokenStart, this.tokenEnd),\n        name\n    };\n}\n\nexport function generate(node) {\n    this.tokenize(node.name);\n}\n","import { Comma } from '../../tokenizer/index.js';\n\nexport const name = 'LayerList';\nexport const structure = {\n    children: [[\n        'MediaQuery'\n    ]]\n};\n\nexport function parse() {\n    const children = this.createList();\n\n    this.skipSC();\n\n    while (!this.eof) {\n        children.push(this.Layer());\n\n        if (this.tokenType !== Comma) {\n            break;\n        }\n\n        this.next();\n        this.skipSC();\n    }\n\n    return {\n        type: 'LayerList',\n        loc: this.getLocationFromList(children),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node, () => this.token(Comma, ','));\n}\n","import {\n    Comma,\n    EOF,\n    Ident,\n    LeftCurlyBracket,\n    LeftParenthesis,\n    Function as FunctionToken,\n    Semicolon\n} from '../../tokenizer/index.js';\n\nexport const name = 'MediaQuery';\nexport const structure = {\n    modifier: [String, null],\n    mediaType: [String, null],\n    condition: ['Condition', null]\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n    let modifier = null;\n    let mediaType = null;\n    let condition = null;\n\n    this.skipSC();\n\n    if (this.tokenType === Ident && this.lookupTypeNonSC(1) !== LeftParenthesis) {\n        // [ not | only ]? <media-type>\n        const ident = this.consume(Ident);\n        const identLowerCase = ident.toLowerCase();\n\n        if (identLowerCase === 'not' || identLowerCase === 'only') {\n            this.skipSC();\n            modifier = identLowerCase;\n            mediaType = this.consume(Ident);\n        } else {\n            mediaType = ident;\n        }\n\n        switch (this.lookupTypeNonSC(0)) {\n            case Ident: {\n                // and <media-condition-without-or>\n                this.skipSC();\n                this.eatIdent('and');\n                condition = this.Condition('media');\n                break;\n            }\n\n            case LeftCurlyBracket:\n            case Semicolon:\n            case Comma:\n            case EOF:\n                break;\n\n            default:\n                this.error('Identifier or parenthesis is expected');\n        }\n    } else {\n        switch (this.tokenType) {\n            case Ident:\n            case LeftParenthesis:\n            case FunctionToken: {\n                // <media-condition>\n                condition = this.Condition('media');\n                break;\n            }\n\n            case LeftCurlyBracket:\n            case Semicolon:\n            case EOF:\n                break;\n\n            default:\n                this.error('Identifier or parenthesis is expected');\n        }\n    }\n\n    return {\n        type: 'MediaQuery',\n        loc: this.getLocation(start, this.tokenStart),\n        modifier,\n        mediaType,\n        condition\n    };\n}\n\nexport function generate(node) {\n    if (node.mediaType) {\n        if (node.modifier) {\n            this.token(Ident, node.modifier);\n        }\n\n        this.token(Ident, node.mediaType);\n\n        if (node.condition) {\n            this.token(Ident, 'and');\n            this.node(node.condition);\n        }\n    } else if (node.condition) {\n        this.node(node.condition);\n    }\n}\n\n","import { Comma } from '../../tokenizer/index.js';\n\nexport const name = 'MediaQueryList';\nexport const structure = {\n    children: [[\n        'MediaQuery'\n    ]]\n};\n\nexport function parse() {\n    const children = this.createList();\n\n    this.skipSC();\n\n    while (!this.eof) {\n        children.push(this.MediaQuery());\n\n        if (this.tokenType !== Comma) {\n            break;\n        }\n\n        this.next();\n    }\n\n    return {\n        type: 'MediaQueryList',\n        loc: this.getLocationFromList(children),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node, () => this.token(Comma, ','));\n}\n","import { Delim } from '../../tokenizer/index.js';\n\nconst AMPERSAND = 0x0026;       // U+0026 AMPERSAND (&)\n\nexport const name = 'NestingSelector';\nexport const structure = {\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n\n    this.eatDelim(AMPERSAND);\n\n    return {\n        type: 'NestingSelector',\n        loc: this.getLocation(start, this.tokenStart)\n    };\n}\n\nexport function generate() {\n    this.token(Delim, '&');\n}\n","import { Ident } from '../../tokenizer/index.js';\n\nexport const name = 'Nth';\nexport const structure = {\n    nth: ['AnPlusB', 'Identifier'],\n    selector: ['SelectorList', null]\n};\n\nexport function parse() {\n    this.skipSC();\n\n    const start = this.tokenStart;\n    let end = start;\n    let selector = null;\n    let nth;\n\n    if (this.lookupValue(0, 'odd') || this.lookupValue(0, 'even')) {\n        nth = this.Identifier();\n    } else {\n        nth = this.AnPlusB();\n    }\n\n    end = this.tokenStart;\n    this.skipSC();\n\n    if (this.lookupValue(0, 'of')) {\n        this.next();\n\n        selector = this.SelectorList();\n        end = this.tokenStart;\n    }\n\n    return {\n        type: 'Nth',\n        loc: this.getLocation(start, end),\n        nth,\n        selector\n    };\n}\n\nexport function generate(node) {\n    this.node(node.nth);\n    if (node.selector !== null) {\n        this.token(Ident, 'of');\n        this.node(node.selector);\n    }\n}\n","import { Number as NumberToken } from '../../tokenizer/index.js';\n\nexport const name = 'Number';\nexport const structure = {\n    value: String\n};\n\nexport function parse() {\n    return {\n        type: 'Number',\n        loc: this.getLocation(this.tokenStart, this.tokenEnd),\n        value: this.consume(NumberToken)\n    };\n}\n\nexport function generate(node) {\n    this.token(NumberToken, node.value);\n}\n","// '/' | '*' | ',' | ':' | '+' | '-'\nexport const name = 'Operator';\nexport const structure = {\n    value: String\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n\n    this.next();\n\n    return {\n        type: 'Operator',\n        loc: this.getLocation(start, this.tokenStart),\n        value: this.substrToCursor(start)\n    };\n}\n\nexport function generate(node) {\n    this.tokenize(node.value);\n}\n","import {\n    LeftParenthesis,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nexport const name = 'Parentheses';\nexport const structure = {\n    children: [[]]\n};\n\nexport function parse(readSequence, recognizer) {\n    const start = this.tokenStart;\n    let children = null;\n\n    this.eat(LeftParenthesis);\n\n    children = readSequence.call(this, recognizer);\n\n    if (!this.eof) {\n        this.eat(RightParenthesis);\n    }\n\n    return {\n        type: 'Parentheses',\n        loc: this.getLocation(start, this.tokenStart),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.token(LeftParenthesis, '(');\n    this.children(node);\n    this.token(RightParenthesis, ')');\n}\n","import { Percentage } from '../../tokenizer/index.js';\n\nexport const name = 'Percentage';\nexport const structure = {\n    value: String\n};\n\nexport function parse() {\n    return {\n        type: 'Percentage',\n        loc: this.getLocation(this.tokenStart, this.tokenEnd),\n        value: this.consumeNumber(Percentage)\n    };\n}\n\nexport function generate(node) {\n    this.token(Percentage, node.value + '%');\n}\n","import {\n    Ident,\n    Function as FunctionToken,\n    Colon,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\n\nexport const name = 'PseudoClassSelector';\nexport const walkContext = 'function';\nexport const structure = {\n    name: String,\n    children: [['Raw'], null]\n};\n\n// : [ <ident> | <function-token> <any-value>? ) ]\nexport function parse() {\n    const start = this.tokenStart;\n    let children = null;\n    let name;\n    let nameLowerCase;\n\n    this.eat(Colon);\n\n    if (this.tokenType === FunctionToken) {\n        name = this.consumeFunctionName();\n        nameLowerCase = name.toLowerCase();\n\n        if (this.lookupNonWSType(0) == RightParenthesis) {\n            children = this.createList();\n        } else if (hasOwnProperty.call(this.pseudo, nameLowerCase)) {\n            this.skipSC();\n            children = this.pseudo[nameLowerCase].call(this);\n            this.skipSC();\n        } else {\n            children = this.createList();\n            children.push(\n                this.Raw(null, false)\n            );\n        }\n\n        this.eat(RightParenthesis);\n    } else {\n        name = this.consume(Ident);\n    }\n\n    return {\n        type: 'PseudoClassSelector',\n        loc: this.getLocation(start, this.tokenStart),\n        name,\n        children\n    };\n}\n\nexport function generate(node) {\n    this.token(Colon, ':');\n\n    if (node.children === null) {\n        this.token(Ident, node.name);\n    } else {\n        this.token(FunctionToken, node.name + '(');\n        this.children(node);\n        this.token(RightParenthesis, ')');\n    }\n}\n","import {\n    Ident,\n    Function as FunctionToken,\n    Colon,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nexport const name = 'PseudoElementSelector';\nexport const walkContext = 'function';\nexport const structure = {\n    name: String,\n    children: [['Raw'], null]\n};\n\n// :: [ <ident> | <function-token> <any-value>? ) ]\nexport function parse() {\n    const start = this.tokenStart;\n    let children = null;\n    let name;\n    let nameLowerCase;\n\n    this.eat(Colon);\n    this.eat(Colon);\n\n    if (this.tokenType === FunctionToken) {\n        name = this.consumeFunctionName();\n        nameLowerCase = name.toLowerCase();\n\n        if (this.lookupNonWSType(0) == RightParenthesis) {\n            children = this.createList();\n        } else if (hasOwnProperty.call(this.pseudo, nameLowerCase)) {\n            this.skipSC();\n            children = this.pseudo[nameLowerCase].call(this);\n            this.skipSC();\n        } else {\n            children = this.createList();\n            children.push(\n                this.Raw(null, false)\n            );\n        }\n\n        this.eat(RightParenthesis);\n    } else {\n        name = this.consume(Ident);\n    }\n\n    return {\n        type: 'PseudoElementSelector',\n        loc: this.getLocation(start, this.tokenStart),\n        name,\n        children\n    };\n}\n\nexport function generate(node) {\n    this.token(Colon, ':');\n    this.token(Colon, ':');\n\n    if (node.children === null) {\n        this.token(Ident, node.name);\n    } else {\n        this.token(FunctionToken, node.name + '(');\n        this.children(node);\n        this.token(RightParenthesis, ')');\n    }\n}\n","import {\n    Delim,\n    Number as NumberToken,\n    Function as FunctionToken\n} from '../../tokenizer/index.js';\n\nconst SOLIDUS = 0x002F;  // U+002F SOLIDUS (/)\n\n// Media Queries Level 3 defines terms of <ratio> as a positive (not zero or negative)\n// integers (see https://drafts.csswg.org/mediaqueries-3/#values)\n// However, Media Queries Level 4 removes any definition of values\n// (see https://drafts.csswg.org/mediaqueries-4/#values) and refers to\n// CSS Values and Units for detail. In CSS Values and Units Level 4 a <ratio>\n// definition was added (see https://drafts.csswg.org/css-values-4/#ratios) which\n// defines ratio as \"<number [0,∞]> [ / <number [0,∞]> ]?\" and based on it\n// any constrains on terms were removed. Parser also doesn't test numbers\n// in any way to make possible for linting and fixing them by the tools using CSSTree.\n// An additional syntax examination may be applied by a lexer.\nfunction consumeTerm() {\n    this.skipSC();\n\n    switch (this.tokenType) {\n        case NumberToken:\n            return this.Number();\n\n        case FunctionToken:\n            return this.Function(this.readSequence, this.scope.Value);\n\n        default:\n            this.error('Number of function is expected');\n    }\n}\n\nexport const name = 'Ratio';\nexport const structure = {\n    left: ['Number', 'Function'],\n    right: ['Number', 'Function', null]\n};\n\n// <number [0,∞]> [ / <number [0,∞]> ]?\nexport function parse() {\n    const start = this.tokenStart;\n    const left = consumeTerm.call(this);\n    let right = null;\n\n    this.skipSC();\n    if (this.isDelim(SOLIDUS)) {\n        this.eatDelim(SOLIDUS);\n        right = consumeTerm.call(this);\n    }\n\n    return {\n        type: 'Ratio',\n        loc: this.getLocation(start, this.tokenStart),\n        left,\n        right\n    };\n}\n\nexport function generate(node) {\n    this.node(node.left);\n    this.token(Delim, '/');\n    if (node.right) {\n        this.node(node.right);\n    } else {\n        this.node(NumberToken, 1);\n    }\n}\n","import { WhiteSpace } from '../../tokenizer/index.js';\n\nfunction getOffsetExcludeWS() {\n    if (this.tokenIndex > 0) {\n        if (this.lookupType(-1) === WhiteSpace) {\n            return this.tokenIndex > 1\n                ? this.getTokenStart(this.tokenIndex - 1)\n                : this.firstCharOffset;\n        }\n    }\n\n    return this.tokenStart;\n}\n\nexport const name = 'Raw';\nexport const structure = {\n    value: String\n};\n\nexport function parse(consumeUntil, excludeWhiteSpace) {\n    const startOffset = this.getTokenStart(this.tokenIndex);\n    let endOffset;\n\n    this.skipUntilBalanced(this.tokenIndex, consumeUntil || this.consumeUntilBalanceEnd);\n\n    if (excludeWhiteSpace && this.tokenStart > startOffset) {\n        endOffset = getOffsetExcludeWS.call(this);\n    } else {\n        endOffset = this.tokenStart;\n    }\n\n    return {\n        type: 'Raw',\n        loc: this.getLocation(startOffset, endOffset),\n        value: this.substring(startOffset, endOffset)\n    };\n}\n\nexport function generate(node) {\n    this.tokenize(node.value);\n}\n","import { LeftCurlyBracket, RightCurlyBracket } from '../../tokenizer/index.js';\n\nfunction consumeRaw() {\n    return this.Raw(this.consumeUntilLeftCurlyBracket, true);\n}\n\nfunction consumePrelude() {\n    const prelude = this.SelectorList();\n\n    if (prelude.type !== 'Raw' &&\n        this.eof === false &&\n        this.tokenType !== LeftCurlyBracket) {\n        this.error();\n    }\n\n    return prelude;\n}\n\nexport const name = 'Rule';\nexport const walkContext = 'rule';\nexport const structure = {\n    prelude: ['SelectorList', 'Raw'],\n    block: ['Block']\n};\n\nexport function parse() {\n    const startToken = this.tokenIndex;\n    const startOffset = this.tokenStart;\n    let prelude;\n    let block;\n\n    if (this.parseRulePrelude) {\n        prelude = this.parseWithFallback(consumePrelude, consumeRaw);\n    } else {\n        prelude = consumeRaw.call(this, startToken);\n    }\n\n    this.skipSC();\n    this.eat(LeftCurlyBracket);\n\n    block = this.Block(true);\n\n    if (!this.eof) {\n        this.eat(RightCurlyBracket);\n    }\n\n    return {\n        type: 'Rule',\n        loc: this.getLocation(startOffset, this.tokenStart),\n        prelude,\n        block\n    };\n}\nexport function generate(node) {\n    this.node(node.prelude);\n    this.token(LeftCurlyBracket, '{');\n    this.node(node.block);\n    this.token(RightCurlyBracket, '}');\n}\n\n","import {\n    Ident,\n    LeftParenthesis,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nexport const name = 'Scope';\nexport const structure = {\n    root: ['SelectorList', 'Raw', null],\n    limit: ['SelectorList', 'Raw', null]\n};\n\nexport function parse() {\n    let root = null;\n    let limit = null;\n\n    this.skipSC();\n\n    const startOffset = this.tokenStart;\n    if (this.tokenType === LeftParenthesis) {\n        this.next();\n        this.skipSC();\n        root = this.parseWithFallback(\n            this.SelectorList,\n            () => this.Raw(false, true)\n        );\n        this.skipSC();\n        this.eat(RightParenthesis);\n    }\n\n    if (this.lookupNonWSType(0) === Ident) {\n        this.skipSC();\n        this.eatIdent('to');\n        this.skipSC();\n        this.eat(LeftParenthesis);\n        this.skipSC();\n        limit = this.parseWithFallback(\n            this.SelectorList,\n            () => this.Raw(false, true)\n        );\n        this.skipSC();\n        this.eat(RightParenthesis);\n    }\n\n    return {\n        type: 'Scope',\n        loc: this.getLocation(startOffset, this.tokenStart),\n        root,\n        limit\n    };\n}\n\nexport function generate(node) {\n    if (node.root) {\n        this.token(LeftParenthesis, '(');\n        this.node(node.root);\n        this.token(RightParenthesis, ')');\n    }\n\n    if (node.limit) {\n        this.token(Ident, 'to');\n        this.token(LeftParenthesis, '(');\n        this.node(node.limit);\n        this.token(RightParenthesis, ')');\n    }\n}\n","export const name = 'Selector';\nexport const structure = {\n    children: [[\n        'TypeSelector',\n        'IdSelector',\n        'ClassSelector',\n        'AttributeSelector',\n        'PseudoClassSelector',\n        'PseudoElementSelector',\n        'Combinator'\n    ]]\n};\n\nexport function parse() {\n    const children = this.readSequence(this.scope.Selector);\n\n    // nothing were consumed\n    if (this.getFirstListNode(children) === null) {\n        this.error('Selector is expected');\n    }\n\n    return {\n        type: 'Selector',\n        loc: this.getLocationFromList(children),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node);\n}\n","import { Comma } from '../../tokenizer/index.js';\n\nexport const name = 'SelectorList';\nexport const walkContext = 'selector';\nexport const structure = {\n    children: [[\n        'Selector',\n        'Raw'\n    ]]\n};\n\nexport function parse() {\n    const children = this.createList();\n\n    while (!this.eof) {\n        children.push(this.Selector());\n\n        if (this.tokenType === Comma) {\n            this.next();\n            continue;\n        }\n\n        break;\n    }\n\n    return {\n        type: 'SelectorList',\n        loc: this.getLocationFromList(children),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node, () => this.token(Comma, ','));\n}\n","import {\n    isHexDigit,\n    isWhiteSpace,\n    isValidEscape,\n    consumeEscaped,\n    decodeEscaped\n} from '../tokenizer/index.js';\n\nconst REVERSE_SOLIDUS = 0x005c; // U+005C REVERSE SOLIDUS (\\)\nconst QUOTATION_MARK = 0x0022;  // \"\nconst APOSTROPHE = 0x0027;      // '\n\nexport function decode(str) {\n    const len = str.length;\n    const firstChar = str.charCodeAt(0);\n    const start = firstChar === QUOTATION_MARK || firstChar === APOSTROPHE ? 1 : 0;\n    const end = start === 1 && len > 1 && str.charCodeAt(len - 1) === firstChar ? len - 2 : len - 1;\n    let decoded = '';\n\n    for (let i = start; i <= end; i++) {\n        let code = str.charCodeAt(i);\n\n        if (code === REVERSE_SOLIDUS) {\n            // special case at the ending\n            if (i === end) {\n                // if the next input code point is EOF, do nothing\n                // otherwise include last quote as escaped\n                if (i !== len - 1) {\n                    decoded = str.substr(i + 1);\n                }\n                break;\n            }\n\n            code = str.charCodeAt(++i);\n\n            // consume escaped\n            if (isValidEscape(REVERSE_SOLIDUS, code)) {\n                const escapeStart = i - 1;\n                const escapeEnd = consumeEscaped(str, escapeStart);\n\n                i = escapeEnd - 1;\n                decoded += decodeEscaped(str.substring(escapeStart + 1, escapeEnd));\n            } else {\n                // \\r\\n\n                if (code === 0x000d && str.charCodeAt(i + 1) === 0x000a) {\n                    i++;\n                }\n            }\n        } else {\n            decoded += str[i];\n        }\n    }\n\n    return decoded;\n}\n\n// https://drafts.csswg.org/cssom/#serialize-a-string\n// § 2.1. Common Serializing Idioms\nexport function encode(str, apostrophe) {\n    const quote = apostrophe ? '\\'' : '\"';\n    const quoteCode = apostrophe ? APOSTROPHE : QUOTATION_MARK;\n    let encoded = '';\n    let wsBeforeHexIsNeeded = false;\n\n    for (let i = 0; i < str.length; i++) {\n        const code = str.charCodeAt(i);\n\n        // If the character is NULL (U+0000), then the REPLACEMENT CHARACTER (U+FFFD).\n        if (code === 0x0000) {\n            encoded += '\\uFFFD';\n            continue;\n        }\n\n        // If the character is in the range [\\1-\\1f] (U+0001 to U+001F) or is U+007F,\n        // the character escaped as code point.\n        // Note: Do not compare with 0x0001 since 0x0000 is precessed before\n        if (code <= 0x001f || code === 0x007F) {\n            encoded += '\\\\' + code.toString(16);\n            wsBeforeHexIsNeeded = true;\n            continue;\n        }\n\n        // If the character is '\"' (U+0022) or \"\\\" (U+005C), the escaped character.\n        if (code === quoteCode || code === REVERSE_SOLIDUS) {\n            encoded += '\\\\' + str.charAt(i);\n            wsBeforeHexIsNeeded = false;\n        } else {\n            if (wsBeforeHexIsNeeded && (isHexDigit(code) || isWhiteSpace(code))) {\n                encoded += ' ';\n            }\n\n            // Otherwise, the character itself.\n            encoded += str.charAt(i);\n            wsBeforeHexIsNeeded = false;\n        }\n    }\n\n    return quote + encoded + quote;\n}\n","import { String as StringToken } from '../../tokenizer/index.js';\nimport { decode, encode } from '../../utils/string.js';\n\nexport const name = 'String';\nexport const structure = {\n    value: String\n};\n\nexport function parse() {\n    return {\n        type: 'String',\n        loc: this.getLocation(this.tokenStart, this.tokenEnd),\n        value: decode(this.consume(StringToken))\n    };\n}\n\nexport function generate(node) {\n    this.token(StringToken, encode(node.value));\n}\n","import {\n    WhiteSpace,\n    Comment,\n    AtKeyword,\n    CDO,\n    CDC\n} from '../../tokenizer/index.js';\n\nconst EXCLAMATIONMARK = 0x0021; // U+0021 EXCLAMATION MARK (!)\n\nfunction consumeRaw() {\n    return this.Raw(null, false);\n}\n\nexport const name = 'StyleSheet';\nexport const walkContext = 'stylesheet';\nexport const structure = {\n    children: [[\n        'Comment',\n        'CDO',\n        'CDC',\n        'Atrule',\n        'Rule',\n        'Raw'\n    ]]\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n    const children = this.createList();\n    let child;\n\n    scan:\n    while (!this.eof) {\n        switch (this.tokenType) {\n            case WhiteSpace:\n                this.next();\n                continue;\n\n            case Comment:\n                // ignore comments except exclamation comments (i.e. /*! .. */) on top level\n                if (this.charCodeAt(this.tokenStart + 2) !== EXCLAMATIONMARK) {\n                    this.next();\n                    continue;\n                }\n\n                child = this.Comment();\n                break;\n\n            case CDO: // <!--\n                child = this.CDO();\n                break;\n\n            case CDC: // -->\n                child = this.CDC();\n                break;\n\n            // CSS Syntax Module Level 3\n            // §2.2 Error handling\n            // At the \"top level\" of a stylesheet, an <at-keyword-token> starts an at-rule.\n            case AtKeyword:\n                child = this.parseWithFallback(this.Atrule, consumeRaw);\n                break;\n\n            // Anything else starts a qualified rule ...\n            default:\n                child = this.parseWithFallback(this.Rule, consumeRaw);\n        }\n\n        children.push(child);\n    }\n\n    return {\n        type: 'StyleSheet',\n        loc: this.getLocation(start, this.tokenStart),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node);\n}\n","import {\n    LeftParenthesis,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nexport const name = 'SupportsDeclaration';\nexport const structure = {\n    declaration: 'Declaration'\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n\n    this.eat(LeftParenthesis);\n    this.skipSC();\n\n    const declaration = this.Declaration();\n\n    if (!this.eof) {\n        this.eat(RightParenthesis);\n    }\n\n    return {\n        type: 'SupportsDeclaration',\n        loc: this.getLocation(start, this.tokenStart),\n        declaration\n    };\n}\n\nexport function generate(node) {\n    this.token(LeftParenthesis, '(');\n    this.node(node.declaration);\n    this.token(RightParenthesis, ')');\n}\n","import { Ident } from '../../tokenizer/index.js';\n\nconst ASTERISK = 0x002A;     // U+002A ASTERISK (*)\nconst VERTICALLINE = 0x007C; // U+007C VERTICAL LINE (|)\n\nfunction eatIdentifierOrAsterisk() {\n    if (this.tokenType !== Ident &&\n        this.isDelim(ASTERISK) === false) {\n        this.error('Identifier or asterisk is expected');\n    }\n\n    this.next();\n}\n\nexport const name = 'TypeSelector';\nexport const structure = {\n    name: String\n};\n\n// ident\n// ident|ident\n// ident|*\n// *\n// *|ident\n// *|*\n// |ident\n// |*\nexport function parse() {\n    const start = this.tokenStart;\n\n    if (this.isDelim(VERTICALLINE)) {\n        this.next();\n        eatIdentifierOrAsterisk.call(this);\n    } else {\n        eatIdentifierOrAsterisk.call(this);\n\n        if (this.isDelim(VERTICALLINE)) {\n            this.next();\n            eatIdentifierOrAsterisk.call(this);\n        }\n    }\n\n    return {\n        type: 'TypeSelector',\n        loc: this.getLocation(start, this.tokenStart),\n        name: this.substrToCursor(start)\n    };\n}\n\nexport function generate(node) {\n    this.tokenize(node.name);\n}\n","import {\n    isHexDigit,\n    Ident,\n    Number,\n    Dimension\n} from '../../tokenizer/index.js';\n\nconst PLUSSIGN = 0x002B;     // U+002B PLUS SIGN (+)\nconst HYPHENMINUS = 0x002D;  // U+002D HYPHEN-MINUS (-)\nconst QUESTIONMARK = 0x003F; // U+003F QUESTION MARK (?)\n\nfunction eatHexSequence(offset, allowDash) {\n    let len = 0;\n\n    for (let pos = this.tokenStart + offset; pos < this.tokenEnd; pos++) {\n        const code = this.charCodeAt(pos);\n\n        if (code === HYPHENMINUS && allowDash && len !== 0) {\n            eatHexSequence.call(this, offset + len + 1, false);\n            return -1;\n        }\n\n        if (!isHexDigit(code)) {\n            this.error(\n                allowDash && len !== 0\n                    ? 'Hyphen minus' + (len < 6 ? ' or hex digit' : '') + ' is expected'\n                    : (len < 6 ? 'Hex digit is expected' : 'Unexpected input'),\n                pos\n            );\n        }\n\n        if (++len > 6) {\n            this.error('Too many hex digits', pos);\n        };\n    }\n\n    this.next();\n    return len;\n}\n\nfunction eatQuestionMarkSequence(max) {\n    let count = 0;\n\n    while (this.isDelim(QUESTIONMARK)) {\n        if (++count > max) {\n            this.error('Too many question marks');\n        }\n\n        this.next();\n    }\n}\n\nfunction startsWith(code) {\n    if (this.charCodeAt(this.tokenStart) !== code) {\n        this.error((code === PLUSSIGN ? 'Plus sign' : 'Hyphen minus') + ' is expected');\n    }\n}\n\n// https://drafts.csswg.org/css-syntax/#urange\n// Informally, the <urange> production has three forms:\n// U+0001\n//      Defines a range consisting of a single code point, in this case the code point \"1\".\n// U+0001-00ff\n//      Defines a range of codepoints between the first and the second value, in this case\n//      the range between \"1\" and \"ff\" (255 in decimal) inclusive.\n// U+00??\n//      Defines a range of codepoints where the \"?\" characters range over all hex digits,\n//      in this case defining the same as the value U+0000-00ff.\n// In each form, a maximum of 6 digits is allowed for each hexadecimal number (if you treat \"?\" as a hexadecimal digit).\n//\n// <urange> =\n//   u '+' <ident-token> '?'* |\n//   u <dimension-token> '?'* |\n//   u <number-token> '?'* |\n//   u <number-token> <dimension-token> |\n//   u <number-token> <number-token> |\n//   u '+' '?'+\nfunction scanUnicodeRange() {\n    let hexLength = 0;\n\n    switch (this.tokenType) {\n        case Number:\n            // u <number-token> '?'*\n            // u <number-token> <dimension-token>\n            // u <number-token> <number-token>\n            hexLength = eatHexSequence.call(this, 1, true);\n\n            if (this.isDelim(QUESTIONMARK)) {\n                eatQuestionMarkSequence.call(this, 6 - hexLength);\n                break;\n            }\n\n            if (this.tokenType === Dimension ||\n                this.tokenType === Number) {\n                startsWith.call(this, HYPHENMINUS);\n                eatHexSequence.call(this, 1, false);\n                break;\n            }\n\n            break;\n\n        case Dimension:\n            // u <dimension-token> '?'*\n            hexLength = eatHexSequence.call(this, 1, true);\n\n            if (hexLength > 0) {\n                eatQuestionMarkSequence.call(this, 6 - hexLength);\n            }\n\n            break;\n\n        default:\n            // u '+' <ident-token> '?'*\n            // u '+' '?'+\n            this.eatDelim(PLUSSIGN);\n\n            if (this.tokenType === Ident) {\n                hexLength = eatHexSequence.call(this, 0, true);\n                if (hexLength > 0) {\n                    eatQuestionMarkSequence.call(this, 6 - hexLength);\n                }\n                break;\n            }\n\n            if (this.isDelim(QUESTIONMARK)) {\n                this.next();\n                eatQuestionMarkSequence.call(this, 5);\n                break;\n            }\n\n            this.error('Hex digit or question mark is expected');\n    }\n}\n\nexport const name = 'UnicodeRange';\nexport const structure = {\n    value: String\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n\n    // U or u\n    this.eatIdent('u');\n    scanUnicodeRange.call(this);\n\n    return {\n        type: 'UnicodeRange',\n        loc: this.getLocation(start, this.tokenStart),\n        value: this.substrToCursor(start)\n    };\n}\n\nexport function generate(node) {\n    this.tokenize(node.value);\n}\n","import {\n    isHexDigit,\n    isWhiteSpace,\n    isValidEscape,\n    consumeEscaped,\n    decodeEscaped\n} from '../tokenizer/index.js';\n\nconst SPACE = 0x0020;            // U+0020 SPACE\nconst REVERSE_SOLIDUS = 0x005c;  // U+005C REVERSE SOLIDUS (\\)\nconst QUOTATION_MARK = 0x0022;   // \"\nconst APOSTROPHE = 0x0027;       // '\nconst LEFTPARENTHESIS = 0x0028;  // U+0028 LEFT PARENTHESIS (()\nconst RIGHTPARENTHESIS = 0x0029; // U+0029 RIGHT PARENTHESIS ())\n\nexport function decode(str) {\n    const len = str.length;\n    let start = 4; // length of \"url(\"\n    let end = str.charCodeAt(len - 1) === RIGHTPARENTHESIS ? len - 2 : len - 1;\n    let decoded = '';\n\n    while (start < end && isWhiteSpace(str.charCodeAt(start))) {\n        start++;\n    }\n\n    while (start < end && isWhiteSpace(str.charCodeAt(end))) {\n        end--;\n    }\n\n    for (let i = start; i <= end; i++) {\n        let code = str.charCodeAt(i);\n\n        if (code === REVERSE_SOLIDUS) {\n            // special case at the ending\n            if (i === end) {\n                // if the next input code point is EOF, do nothing\n                // otherwise include last left parenthesis as escaped\n                if (i !== len - 1) {\n                    decoded = str.substr(i + 1);\n                }\n                break;\n            }\n\n            code = str.charCodeAt(++i);\n\n            // consume escaped\n            if (isValidEscape(REVERSE_SOLIDUS, code)) {\n                const escapeStart = i - 1;\n                const escapeEnd = consumeEscaped(str, escapeStart);\n\n                i = escapeEnd - 1;\n                decoded += decodeEscaped(str.substring(escapeStart + 1, escapeEnd));\n            } else {\n                // \\r\\n\n                if (code === 0x000d && str.charCodeAt(i + 1) === 0x000a) {\n                    i++;\n                }\n            }\n        } else {\n            decoded += str[i];\n        }\n    }\n\n    return decoded;\n}\n\nexport function encode(str) {\n    let encoded = '';\n    let wsBeforeHexIsNeeded = false;\n\n    for (let i = 0; i < str.length; i++) {\n        const code = str.charCodeAt(i);\n\n        // If the character is NULL (U+0000), then the REPLACEMENT CHARACTER (U+FFFD).\n        if (code === 0x0000) {\n            encoded += '\\uFFFD';\n            continue;\n        }\n\n        // If the character is in the range [\\1-\\1f] (U+0001 to U+001F) or is U+007F,\n        // the character escaped as code point.\n        // Note: Do not compare with 0x0001 since 0x0000 is precessed before\n        if (code <= 0x001f || code === 0x007F) {\n            encoded += '\\\\' + code.toString(16);\n            wsBeforeHexIsNeeded = true;\n            continue;\n        }\n\n        if (code === SPACE ||\n            code === REVERSE_SOLIDUS ||\n            code === QUOTATION_MARK ||\n            code === APOSTROPHE ||\n            code === LEFTPARENTHESIS ||\n            code === RIGHTPARENTHESIS) {\n            encoded += '\\\\' + str.charAt(i);\n            wsBeforeHexIsNeeded = false;\n        } else {\n            if (wsBeforeHexIsNeeded && isHexDigit(code)) {\n                encoded += ' ';\n            }\n\n            encoded += str.charAt(i);\n            wsBeforeHexIsNeeded = false;\n        }\n    }\n\n    return 'url(' + encoded + ')';\n}\n","import * as url from '../../utils/url.js';\nimport * as string from '../../utils/string.js';\nimport {\n    Function as FunctionToken,\n    String as StringToken,\n    Url,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nexport const name = 'Url';\nexport const structure = {\n    value: String\n};\n\n// <url-token> | <function-token> <string> )\nexport function parse() {\n    const start = this.tokenStart;\n    let value;\n\n    switch (this.tokenType) {\n        case Url:\n            value = url.decode(this.consume(Url));\n            break;\n\n        case FunctionToken:\n            if (!this.cmpStr(this.tokenStart, this.tokenEnd, 'url(')) {\n                this.error('Function name must be `url`');\n            }\n\n            this.eat(FunctionToken);\n            this.skipSC();\n            value = string.decode(this.consume(StringToken));\n            this.skipSC();\n            if (!this.eof) {\n                this.eat(RightParenthesis);\n            }\n            break;\n\n        default:\n            this.error('Url or Function is expected');\n    }\n\n    return {\n        type: 'Url',\n        loc: this.getLocation(start, this.tokenStart),\n        value\n    };\n}\n\nexport function generate(node) {\n    this.token(Url, url.encode(node.value));\n}\n","export const name = 'Value';\nexport const structure = {\n    children: [[]]\n};\n\nexport function parse() {\n    const start = this.tokenStart;\n    const children = this.readSequence(this.scope.Value);\n\n    return {\n        type: 'Value',\n        loc: this.getLocation(start, this.tokenStart),\n        children\n    };\n}\n\nexport function generate(node) {\n    this.children(node);\n}\n","import { WhiteSpace } from '../../tokenizer/index.js';\n\nconst SPACE = Object.freeze({\n    type: 'WhiteSpace',\n    loc: null,\n    value: ' '\n});\n\nexport const name = 'WhiteSpace';\nexport const structure = {\n    value: String\n};\n\nexport function parse() {\n    this.eat(WhiteSpace);\n    return SPACE;\n\n    // return {\n    //     type: 'WhiteSpace',\n    //     loc: this.getLocation(this.tokenStart, this.tokenEnd),\n    //     value: this.consume(WHITESPACE)\n    // };\n}\n\nexport function generate(node) {\n    this.token(WhiteSpace, node.value);\n}\n","import definitions from '../../data.js';\nimport * as node from '../node/index.js';\n\nexport default {\n    generic: true,\n    ...definitions,\n    node\n};\n","export default {\n    \"generic\": true,\n    \"units\": {\n        \"angle\": [\n            \"deg\",\n            \"grad\",\n            \"rad\",\n            \"turn\"\n        ],\n        \"decibel\": [\n            \"db\"\n        ],\n        \"flex\": [\n            \"fr\"\n        ],\n        \"frequency\": [\n            \"hz\",\n            \"khz\"\n        ],\n        \"length\": [\n            \"cm\",\n            \"mm\",\n            \"q\",\n            \"in\",\n            \"pt\",\n            \"pc\",\n            \"px\",\n            \"em\",\n            \"rem\",\n            \"ex\",\n            \"rex\",\n            \"cap\",\n            \"rcap\",\n            \"ch\",\n            \"rch\",\n            \"ic\",\n            \"ric\",\n            \"lh\",\n            \"rlh\",\n            \"vw\",\n            \"svw\",\n            \"lvw\",\n            \"dvw\",\n            \"vh\",\n            \"svh\",\n            \"lvh\",\n            \"dvh\",\n            \"vi\",\n            \"svi\",\n            \"lvi\",\n            \"dvi\",\n            \"vb\",\n            \"svb\",\n            \"lvb\",\n            \"dvb\",\n            \"vmin\",\n            \"svmin\",\n            \"lvmin\",\n            \"dvmin\",\n            \"vmax\",\n            \"svmax\",\n            \"lvmax\",\n            \"dvmax\",\n            \"cqw\",\n            \"cqh\",\n            \"cqi\",\n            \"cqb\",\n            \"cqmin\",\n            \"cqmax\"\n        ],\n        \"resolution\": [\n            \"dpi\",\n            \"dpcm\",\n            \"dppx\",\n            \"x\"\n        ],\n        \"semitones\": [\n            \"st\"\n        ],\n        \"time\": [\n            \"s\",\n            \"ms\"\n        ]\n    },\n    \"types\": {\n        \"abs()\": \"abs( <calc-sum> )\",\n        \"absolute-size\": \"xx-small|x-small|small|medium|large|x-large|xx-large|xxx-large\",\n        \"acos()\": \"acos( <calc-sum> )\",\n        \"alpha-value\": \"<number>|<percentage>\",\n        \"angle-percentage\": \"<angle>|<percentage>\",\n        \"angular-color-hint\": \"<angle-percentage>\",\n        \"angular-color-stop\": \"<color>&&<color-stop-angle>?\",\n        \"angular-color-stop-list\": \"[<angular-color-stop> [, <angular-color-hint>]?]# , <angular-color-stop>\",\n        \"animateable-feature\": \"scroll-position|contents|<custom-ident>\",\n        \"asin()\": \"asin( <calc-sum> )\",\n        \"atan()\": \"atan( <calc-sum> )\",\n        \"atan2()\": \"atan2( <calc-sum> , <calc-sum> )\",\n        \"attachment\": \"scroll|fixed|local\",\n        \"attr()\": \"attr( <attr-name> <type-or-unit>? [, <attr-fallback>]? )\",\n        \"attr-matcher\": \"['~'|'|'|'^'|'$'|'*']? '='\",\n        \"attr-modifier\": \"i|s\",\n        \"attribute-selector\": \"'[' <wq-name> ']'|'[' <wq-name> <attr-matcher> [<string-token>|<ident-token>] <attr-modifier>? ']'\",\n        \"auto-repeat\": \"repeat( [auto-fill|auto-fit] , [<line-names>? <fixed-size>]+ <line-names>? )\",\n        \"auto-track-list\": \"[<line-names>? [<fixed-size>|<fixed-repeat>]]* <line-names>? <auto-repeat> [<line-names>? [<fixed-size>|<fixed-repeat>]]* <line-names>?\",\n        \"axis\": \"block|inline|vertical|horizontal\",\n        \"baseline-position\": \"[first|last]? baseline\",\n        \"basic-shape\": \"<inset()>|<circle()>|<ellipse()>|<polygon()>|<path()>\",\n        \"bg-image\": \"none|<image>\",\n        \"bg-layer\": \"<bg-image>||<bg-position> [/ <bg-size>]?||<repeat-style>||<attachment>||<box>||<box>\",\n        \"bg-position\": \"[[left|center|right|top|bottom|<length-percentage>]|[left|center|right|<length-percentage>] [top|center|bottom|<length-percentage>]|[center|[left|right] <length-percentage>?]&&[center|[top|bottom] <length-percentage>?]]\",\n        \"bg-size\": \"[<length-percentage>|auto]{1,2}|cover|contain\",\n        \"blur()\": \"blur( <length> )\",\n        \"blend-mode\": \"normal|multiply|screen|overlay|darken|lighten|color-dodge|color-burn|hard-light|soft-light|difference|exclusion|hue|saturation|color|luminosity\",\n        \"box\": \"border-box|padding-box|content-box\",\n        \"brightness()\": \"brightness( <number-percentage> )\",\n        \"calc()\": \"calc( <calc-sum> )\",\n        \"calc-sum\": \"<calc-product> [['+'|'-'] <calc-product>]*\",\n        \"calc-product\": \"<calc-value> ['*' <calc-value>|'/' <number>]*\",\n        \"calc-value\": \"<number>|<dimension>|<percentage>|<calc-constant>|( <calc-sum> )\",\n        \"calc-constant\": \"e|pi|infinity|-infinity|NaN\",\n        \"cf-final-image\": \"<image>|<color>\",\n        \"cf-mixing-image\": \"<percentage>?&&<image>\",\n        \"circle()\": \"circle( [<shape-radius>]? [at <position>]? )\",\n        \"clamp()\": \"clamp( <calc-sum>#{3} )\",\n        \"class-selector\": \"'.' <ident-token>\",\n        \"clip-source\": \"<url>\",\n        \"color\": \"<rgb()>|<rgba()>|<hsl()>|<hsla()>|<hwb()>|<lab()>|<lch()>|<hex-color>|<named-color>|currentcolor|<deprecated-system-color>|<-non-standard-color>\",\n        \"color-stop\": \"<color-stop-length>|<color-stop-angle>\",\n        \"color-stop-angle\": \"<angle-percentage>{1,2}\",\n        \"color-stop-length\": \"<length-percentage>{1,2}\",\n        \"color-stop-list\": \"[<linear-color-stop> [, <linear-color-hint>]?]# , <linear-color-stop>\",\n        \"combinator\": \"'>'|'+'|'~'|['|' '|']\",\n        \"common-lig-values\": \"[common-ligatures|no-common-ligatures]\",\n        \"compat-auto\": \"searchfield|textarea|push-button|slider-horizontal|checkbox|radio|square-button|menulist|listbox|meter|progress-bar|button\",\n        \"composite-style\": \"clear|copy|source-over|source-in|source-out|source-atop|destination-over|destination-in|destination-out|destination-atop|xor\",\n        \"compositing-operator\": \"add|subtract|intersect|exclude\",\n        \"compound-selector\": \"[<type-selector>? <subclass-selector>*]!\",\n        \"compound-selector-list\": \"<compound-selector>#\",\n        \"complex-selector\": \"<complex-selector-unit> [<combinator>? <complex-selector-unit>]*\",\n        \"complex-selector-list\": \"<complex-selector>#\",\n        \"conic-gradient()\": \"conic-gradient( [from <angle>]? [at <position>]? , <angular-color-stop-list> )\",\n        \"contextual-alt-values\": \"[contextual|no-contextual]\",\n        \"content-distribution\": \"space-between|space-around|space-evenly|stretch\",\n        \"content-list\": \"[<string>|contents|<image>|<counter>|<quote>|<target>|<leader()>|<attr()>]+\",\n        \"content-position\": \"center|start|end|flex-start|flex-end\",\n        \"content-replacement\": \"<image>\",\n        \"contrast()\": \"contrast( [<number-percentage>] )\",\n        \"cos()\": \"cos( <calc-sum> )\",\n        \"counter\": \"<counter()>|<counters()>\",\n        \"counter()\": \"counter( <counter-name> , <counter-style>? )\",\n        \"counter-name\": \"<custom-ident>\",\n        \"counter-style\": \"<counter-style-name>|symbols( )\",\n        \"counter-style-name\": \"<custom-ident>\",\n        \"counters()\": \"counters( <counter-name> , <string> , <counter-style>? )\",\n        \"cross-fade()\": \"cross-fade( <cf-mixing-image> , <cf-final-image>? )\",\n        \"cubic-bezier-timing-function\": \"ease|ease-in|ease-out|ease-in-out|cubic-bezier( <number [0,1]> , <number> , <number [0,1]> , <number> )\",\n        \"deprecated-system-color\": \"ActiveBorder|ActiveCaption|AppWorkspace|Background|ButtonFace|ButtonHighlight|ButtonShadow|ButtonText|CaptionText|GrayText|Highlight|HighlightText|InactiveBorder|InactiveCaption|InactiveCaptionText|InfoBackground|InfoText|Menu|MenuText|Scrollbar|ThreeDDarkShadow|ThreeDFace|ThreeDHighlight|ThreeDLightShadow|ThreeDShadow|Window|WindowFrame|WindowText\",\n        \"discretionary-lig-values\": \"[discretionary-ligatures|no-discretionary-ligatures]\",\n        \"display-box\": \"contents|none\",\n        \"display-inside\": \"flow|flow-root|table|flex|grid|ruby\",\n        \"display-internal\": \"table-row-group|table-header-group|table-footer-group|table-row|table-cell|table-column-group|table-column|table-caption|ruby-base|ruby-text|ruby-base-container|ruby-text-container\",\n        \"display-legacy\": \"inline-block|inline-list-item|inline-table|inline-flex|inline-grid\",\n        \"display-listitem\": \"<display-outside>?&&[flow|flow-root]?&&list-item\",\n        \"display-outside\": \"block|inline|run-in\",\n        \"drop-shadow()\": \"drop-shadow( <length>{2,3} <color>? )\",\n        \"east-asian-variant-values\": \"[jis78|jis83|jis90|jis04|simplified|traditional]\",\n        \"east-asian-width-values\": \"[full-width|proportional-width]\",\n        \"element()\": \"element( <custom-ident> , [first|start|last|first-except]? )|element( <id-selector> )\",\n        \"ellipse()\": \"ellipse( [<shape-radius>{2}]? [at <position>]? )\",\n        \"ending-shape\": \"circle|ellipse\",\n        \"env()\": \"env( <custom-ident> , <declaration-value>? )\",\n        \"exp()\": \"exp( <calc-sum> )\",\n        \"explicit-track-list\": \"[<line-names>? <track-size>]+ <line-names>?\",\n        \"family-name\": \"<string>|<custom-ident>+\",\n        \"feature-tag-value\": \"<string> [<integer>|on|off]?\",\n        \"feature-type\": \"@stylistic|@historical-forms|@styleset|@character-variant|@swash|@ornaments|@annotation\",\n        \"feature-value-block\": \"<feature-type> '{' <feature-value-declaration-list> '}'\",\n        \"feature-value-block-list\": \"<feature-value-block>+\",\n        \"feature-value-declaration\": \"<custom-ident> : <integer>+ ;\",\n        \"feature-value-declaration-list\": \"<feature-value-declaration>\",\n        \"feature-value-name\": \"<custom-ident>\",\n        \"fill-rule\": \"nonzero|evenodd\",\n        \"filter-function\": \"<blur()>|<brightness()>|<contrast()>|<drop-shadow()>|<grayscale()>|<hue-rotate()>|<invert()>|<opacity()>|<saturate()>|<sepia()>\",\n        \"filter-function-list\": \"[<filter-function>|<url>]+\",\n        \"final-bg-layer\": \"<'background-color'>||<bg-image>||<bg-position> [/ <bg-size>]?||<repeat-style>||<attachment>||<box>||<box>\",\n        \"fixed-breadth\": \"<length-percentage>\",\n        \"fixed-repeat\": \"repeat( [<integer [1,∞]>] , [<line-names>? <fixed-size>]+ <line-names>? )\",\n        \"fixed-size\": \"<fixed-breadth>|minmax( <fixed-breadth> , <track-breadth> )|minmax( <inflexible-breadth> , <fixed-breadth> )\",\n        \"font-stretch-absolute\": \"normal|ultra-condensed|extra-condensed|condensed|semi-condensed|semi-expanded|expanded|extra-expanded|ultra-expanded|<percentage>\",\n        \"font-variant-css21\": \"[normal|small-caps]\",\n        \"font-weight-absolute\": \"normal|bold|<number [1,1000]>\",\n        \"frequency-percentage\": \"<frequency>|<percentage>\",\n        \"general-enclosed\": \"[<function-token> <any-value>? )]|[( <any-value>? )]\",\n        \"generic-family\": \"serif|sans-serif|cursive|fantasy|monospace|-apple-system\",\n        \"generic-name\": \"serif|sans-serif|cursive|fantasy|monospace\",\n        \"geometry-box\": \"<shape-box>|fill-box|stroke-box|view-box\",\n        \"gradient\": \"<linear-gradient()>|<repeating-linear-gradient()>|<radial-gradient()>|<repeating-radial-gradient()>|<conic-gradient()>|<repeating-conic-gradient()>|<-legacy-gradient>\",\n        \"grayscale()\": \"grayscale( <number-percentage> )\",\n        \"grid-line\": \"auto|<custom-ident>|[<integer>&&<custom-ident>?]|[span&&[<integer>||<custom-ident>]]\",\n        \"historical-lig-values\": \"[historical-ligatures|no-historical-ligatures]\",\n        \"hsl()\": \"hsl( <hue> <percentage> <percentage> [/ <alpha-value>]? )|hsl( <hue> , <percentage> , <percentage> , <alpha-value>? )\",\n        \"hsla()\": \"hsla( <hue> <percentage> <percentage> [/ <alpha-value>]? )|hsla( <hue> , <percentage> , <percentage> , <alpha-value>? )\",\n        \"hue\": \"<number>|<angle>\",\n        \"hue-rotate()\": \"hue-rotate( <angle> )\",\n        \"hwb()\": \"hwb( [<hue>|none] [<percentage>|none] [<percentage>|none] [/ [<alpha-value>|none]]? )\",\n        \"hypot()\": \"hypot( <calc-sum># )\",\n        \"image\": \"<url>|<image()>|<image-set()>|<element()>|<paint()>|<cross-fade()>|<gradient>\",\n        \"image()\": \"image( <image-tags>? [<image-src>? , <color>?]! )\",\n        \"image-set()\": \"image-set( <image-set-option># )\",\n        \"image-set-option\": \"[<image>|<string>] [<resolution>||type( <string> )]\",\n        \"image-src\": \"<url>|<string>\",\n        \"image-tags\": \"ltr|rtl\",\n        \"inflexible-breadth\": \"<length-percentage>|min-content|max-content|auto\",\n        \"inset()\": \"inset( <length-percentage>{1,4} [round <'border-radius'>]? )\",\n        \"invert()\": \"invert( <number-percentage> )\",\n        \"keyframes-name\": \"<custom-ident>|<string>\",\n        \"keyframe-block\": \"<keyframe-selector># { <declaration-list> }\",\n        \"keyframe-block-list\": \"<keyframe-block>+\",\n        \"keyframe-selector\": \"from|to|<percentage>|<timeline-range-name> <percentage>\",\n        \"lab()\": \"lab( [<percentage>|<number>|none] [<percentage>|<number>|none] [<percentage>|<number>|none] [/ [<alpha-value>|none]]? )\",\n        \"layer()\": \"layer( <layer-name> )\",\n        \"layer-name\": \"<ident> ['.' <ident>]*\",\n        \"lch()\": \"lch( [<percentage>|<number>|none] [<percentage>|<number>|none] [<hue>|none] [/ [<alpha-value>|none]]? )\",\n        \"leader()\": \"leader( <leader-type> )\",\n        \"leader-type\": \"dotted|solid|space|<string>\",\n        \"length-percentage\": \"<length>|<percentage>\",\n        \"line-names\": \"'[' <custom-ident>* ']'\",\n        \"line-name-list\": \"[<line-names>|<name-repeat>]+\",\n        \"line-style\": \"none|hidden|dotted|dashed|solid|double|groove|ridge|inset|outset\",\n        \"line-width\": \"<length>|thin|medium|thick\",\n        \"linear-color-hint\": \"<length-percentage>\",\n        \"linear-color-stop\": \"<color> <color-stop-length>?\",\n        \"linear-gradient()\": \"linear-gradient( [<angle>|to <side-or-corner>]? , <color-stop-list> )\",\n        \"log()\": \"log( <calc-sum> , <calc-sum>? )\",\n        \"mask-layer\": \"<mask-reference>||<position> [/ <bg-size>]?||<repeat-style>||<geometry-box>||[<geometry-box>|no-clip]||<compositing-operator>||<masking-mode>\",\n        \"mask-position\": \"[<length-percentage>|left|center|right] [<length-percentage>|top|center|bottom]?\",\n        \"mask-reference\": \"none|<image>|<mask-source>\",\n        \"mask-source\": \"<url>\",\n        \"masking-mode\": \"alpha|luminance|match-source\",\n        \"matrix()\": \"matrix( <number>#{6} )\",\n        \"matrix3d()\": \"matrix3d( <number>#{16} )\",\n        \"max()\": \"max( <calc-sum># )\",\n        \"media-and\": \"<media-in-parens> [and <media-in-parens>]+\",\n        \"media-condition\": \"<media-not>|<media-and>|<media-or>|<media-in-parens>\",\n        \"media-condition-without-or\": \"<media-not>|<media-and>|<media-in-parens>\",\n        \"media-feature\": \"( [<mf-plain>|<mf-boolean>|<mf-range>] )\",\n        \"media-in-parens\": \"( <media-condition> )|<media-feature>|<general-enclosed>\",\n        \"media-not\": \"not <media-in-parens>\",\n        \"media-or\": \"<media-in-parens> [or <media-in-parens>]+\",\n        \"media-query\": \"<media-condition>|[not|only]? <media-type> [and <media-condition-without-or>]?\",\n        \"media-query-list\": \"<media-query>#\",\n        \"media-type\": \"<ident>\",\n        \"mf-boolean\": \"<mf-name>\",\n        \"mf-name\": \"<ident>\",\n        \"mf-plain\": \"<mf-name> : <mf-value>\",\n        \"mf-range\": \"<mf-name> ['<'|'>']? '='? <mf-value>|<mf-value> ['<'|'>']? '='? <mf-name>|<mf-value> '<' '='? <mf-name> '<' '='? <mf-value>|<mf-value> '>' '='? <mf-name> '>' '='? <mf-value>\",\n        \"mf-value\": \"<number>|<dimension>|<ident>|<ratio>\",\n        \"min()\": \"min( <calc-sum># )\",\n        \"minmax()\": \"minmax( [<length-percentage>|min-content|max-content|auto] , [<length-percentage>|<flex>|min-content|max-content|auto] )\",\n        \"mod()\": \"mod( <calc-sum> , <calc-sum> )\",\n        \"name-repeat\": \"repeat( [<integer [1,∞]>|auto-fill] , <line-names>+ )\",\n        \"named-color\": \"transparent|aliceblue|antiquewhite|aqua|aquamarine|azure|beige|bisque|black|blanchedalmond|blue|blueviolet|brown|burlywood|cadetblue|chartreuse|chocolate|coral|cornflowerblue|cornsilk|crimson|cyan|darkblue|darkcyan|darkgoldenrod|darkgray|darkgreen|darkgrey|darkkhaki|darkmagenta|darkolivegreen|darkorange|darkorchid|darkred|darksalmon|darkseagreen|darkslateblue|darkslategray|darkslategrey|darkturquoise|darkviolet|deeppink|deepskyblue|dimgray|dimgrey|dodgerblue|firebrick|floralwhite|forestgreen|fuchsia|gainsboro|ghostwhite|gold|goldenrod|gray|green|greenyellow|grey|honeydew|hotpink|indianred|indigo|ivory|khaki|lavender|lavenderblush|lawngreen|lemonchiffon|lightblue|lightcoral|lightcyan|lightgoldenrodyellow|lightgray|lightgreen|lightgrey|lightpink|lightsalmon|lightseagreen|lightskyblue|lightslategray|lightslategrey|lightsteelblue|lightyellow|lime|limegreen|linen|magenta|maroon|mediumaquamarine|mediumblue|mediumorchid|mediumpurple|mediumseagreen|mediumslateblue|mediumspringgreen|mediumturquoise|mediumvioletred|midnightblue|mintcream|mistyrose|moccasin|navajowhite|navy|oldlace|olive|olivedrab|orange|orangered|orchid|palegoldenrod|palegreen|paleturquoise|palevioletred|papayawhip|peachpuff|peru|pink|plum|powderblue|purple|rebeccapurple|red|rosybrown|royalblue|saddlebrown|salmon|sandybrown|seagreen|seashell|sienna|silver|skyblue|slateblue|slategray|slategrey|snow|springgreen|steelblue|tan|teal|thistle|tomato|turquoise|violet|wheat|white|whitesmoke|yellow|yellowgreen\",\n        \"namespace-prefix\": \"<ident>\",\n        \"ns-prefix\": \"[<ident-token>|'*']? '|'\",\n        \"number-percentage\": \"<number>|<percentage>\",\n        \"numeric-figure-values\": \"[lining-nums|oldstyle-nums]\",\n        \"numeric-fraction-values\": \"[diagonal-fractions|stacked-fractions]\",\n        \"numeric-spacing-values\": \"[proportional-nums|tabular-nums]\",\n        \"nth\": \"<an-plus-b>|even|odd\",\n        \"opacity()\": \"opacity( [<number-percentage>] )\",\n        \"overflow-position\": \"unsafe|safe\",\n        \"outline-radius\": \"<length>|<percentage>\",\n        \"page-body\": \"<declaration>? [; <page-body>]?|<page-margin-box> <page-body>\",\n        \"page-margin-box\": \"<page-margin-box-type> '{' <declaration-list> '}'\",\n        \"page-margin-box-type\": \"@top-left-corner|@top-left|@top-center|@top-right|@top-right-corner|@bottom-left-corner|@bottom-left|@bottom-center|@bottom-right|@bottom-right-corner|@left-top|@left-middle|@left-bottom|@right-top|@right-middle|@right-bottom\",\n        \"page-selector-list\": \"[<page-selector>#]?\",\n        \"page-selector\": \"<pseudo-page>+|<ident> <pseudo-page>*\",\n        \"page-size\": \"A5|A4|A3|B5|B4|JIS-B5|JIS-B4|letter|legal|ledger\",\n        \"path()\": \"path( [<fill-rule> ,]? <string> )\",\n        \"paint()\": \"paint( <ident> , <declaration-value>? )\",\n        \"perspective()\": \"perspective( [<length [0,∞]>|none] )\",\n        \"polygon()\": \"polygon( <fill-rule>? , [<length-percentage> <length-percentage>]# )\",\n        \"position\": \"[[left|center|right]||[top|center|bottom]|[left|center|right|<length-percentage>] [top|center|bottom|<length-percentage>]?|[[left|right] <length-percentage>]&&[[top|bottom] <length-percentage>]]\",\n        \"pow()\": \"pow( <calc-sum> , <calc-sum> )\",\n        \"pseudo-class-selector\": \"':' <ident-token>|':' <function-token> <any-value> ')'\",\n        \"pseudo-element-selector\": \"':' <pseudo-class-selector>|<legacy-pseudo-element-selector>\",\n        \"pseudo-page\": \": [left|right|first|blank]\",\n        \"quote\": \"open-quote|close-quote|no-open-quote|no-close-quote\",\n        \"radial-gradient()\": \"radial-gradient( [<ending-shape>||<size>]? [at <position>]? , <color-stop-list> )\",\n        \"ratio\": \"<number [0,∞]> [/ <number [0,∞]>]?\",\n        \"ray()\": \"ray( <angle>&&<ray-size>?&&contain?&&[at <position>]? )\",\n        \"relative-selector\": \"<combinator>? <complex-selector>\",\n        \"relative-selector-list\": \"<relative-selector>#\",\n        \"relative-size\": \"larger|smaller\",\n        \"rem()\": \"rem( <calc-sum> , <calc-sum> )\",\n        \"repeat-style\": \"repeat-x|repeat-y|[repeat|space|round|no-repeat]{1,2}\",\n        \"repeating-conic-gradient()\": \"repeating-conic-gradient( [from <angle>]? [at <position>]? , <angular-color-stop-list> )\",\n        \"repeating-linear-gradient()\": \"repeating-linear-gradient( [<angle>|to <side-or-corner>]? , <color-stop-list> )\",\n        \"repeating-radial-gradient()\": \"repeating-radial-gradient( [<ending-shape>||<size>]? [at <position>]? , <color-stop-list> )\",\n        \"reversed-counter-name\": \"reversed( <counter-name> )\",\n        \"rgb()\": \"rgb( <percentage>{3} [/ <alpha-value>]? )|rgb( <number>{3} [/ <alpha-value>]? )|rgb( <percentage>#{3} , <alpha-value>? )|rgb( <number>#{3} , <alpha-value>? )\",\n        \"rgba()\": \"rgba( <percentage>{3} [/ <alpha-value>]? )|rgba( <number>{3} [/ <alpha-value>]? )|rgba( <percentage>#{3} , <alpha-value>? )|rgba( <number>#{3} , <alpha-value>? )\",\n        \"rotate()\": \"rotate( [<angle>|<zero>] )\",\n        \"rotate3d()\": \"rotate3d( <number> , <number> , <number> , [<angle>|<zero>] )\",\n        \"rotateX()\": \"rotateX( [<angle>|<zero>] )\",\n        \"rotateY()\": \"rotateY( [<angle>|<zero>] )\",\n        \"rotateZ()\": \"rotateZ( [<angle>|<zero>] )\",\n        \"round()\": \"round( <rounding-strategy>? , <calc-sum> , <calc-sum> )\",\n        \"rounding-strategy\": \"nearest|up|down|to-zero\",\n        \"saturate()\": \"saturate( <number-percentage> )\",\n        \"scale()\": \"scale( [<number>|<percentage>]#{1,2} )\",\n        \"scale3d()\": \"scale3d( [<number>|<percentage>]#{3} )\",\n        \"scaleX()\": \"scaleX( [<number>|<percentage>] )\",\n        \"scaleY()\": \"scaleY( [<number>|<percentage>] )\",\n        \"scaleZ()\": \"scaleZ( [<number>|<percentage>] )\",\n        \"scroll()\": \"scroll( [<axis>||<scroller>]? )\",\n        \"scroller\": \"root|nearest\",\n        \"self-position\": \"center|start|end|self-start|self-end|flex-start|flex-end\",\n        \"shape-radius\": \"<length-percentage>|closest-side|farthest-side\",\n        \"sign()\": \"sign( <calc-sum> )\",\n        \"skew()\": \"skew( [<angle>|<zero>] , [<angle>|<zero>]? )\",\n        \"skewX()\": \"skewX( [<angle>|<zero>] )\",\n        \"skewY()\": \"skewY( [<angle>|<zero>] )\",\n        \"sepia()\": \"sepia( <number-percentage> )\",\n        \"shadow\": \"inset?&&<length>{2,4}&&<color>?\",\n        \"shadow-t\": \"[<length>{2,3}&&<color>?]\",\n        \"shape\": \"rect( <top> , <right> , <bottom> , <left> )|rect( <top> <right> <bottom> <left> )\",\n        \"shape-box\": \"<box>|margin-box\",\n        \"side-or-corner\": \"[left|right]||[top|bottom]\",\n        \"sin()\": \"sin( <calc-sum> )\",\n        \"single-animation\": \"<'animation-duration'>||<easing-function>||<'animation-delay'>||<single-animation-iteration-count>||<single-animation-direction>||<single-animation-fill-mode>||<single-animation-play-state>||[none|<keyframes-name>]||<single-animation-timeline>\",\n        \"single-animation-direction\": \"normal|reverse|alternate|alternate-reverse\",\n        \"single-animation-fill-mode\": \"none|forwards|backwards|both\",\n        \"single-animation-iteration-count\": \"infinite|<number>\",\n        \"single-animation-play-state\": \"running|paused\",\n        \"single-animation-timeline\": \"auto|none|<dashed-ident>|<scroll()>|<view()>\",\n        \"single-transition\": \"[none|<single-transition-property>]||<time>||<easing-function>||<time>\",\n        \"single-transition-property\": \"all|<custom-ident>\",\n        \"size\": \"closest-side|farthest-side|closest-corner|farthest-corner|<length>|<length-percentage>{2}\",\n        \"sqrt()\": \"sqrt( <calc-sum> )\",\n        \"step-position\": \"jump-start|jump-end|jump-none|jump-both|start|end\",\n        \"step-timing-function\": \"step-start|step-end|steps( <integer> [, <step-position>]? )\",\n        \"subclass-selector\": \"<id-selector>|<class-selector>|<attribute-selector>|<pseudo-class-selector>\",\n        \"supports-condition\": \"not <supports-in-parens>|<supports-in-parens> [and <supports-in-parens>]*|<supports-in-parens> [or <supports-in-parens>]*\",\n        \"supports-in-parens\": \"( <supports-condition> )|<supports-feature>|<general-enclosed>\",\n        \"supports-feature\": \"<supports-decl>|<supports-selector-fn>\",\n        \"supports-decl\": \"( <declaration> )\",\n        \"supports-selector-fn\": \"selector( <complex-selector> )\",\n        \"symbol\": \"<string>|<image>|<custom-ident>\",\n        \"tan()\": \"tan( <calc-sum> )\",\n        \"target\": \"<target-counter()>|<target-counters()>|<target-text()>\",\n        \"target-counter()\": \"target-counter( [<string>|<url>] , <custom-ident> , <counter-style>? )\",\n        \"target-counters()\": \"target-counters( [<string>|<url>] , <custom-ident> , <string> , <counter-style>? )\",\n        \"target-text()\": \"target-text( [<string>|<url>] , [content|before|after|first-letter]? )\",\n        \"time-percentage\": \"<time>|<percentage>\",\n        \"timeline-range-name\": \"cover|contain|entry|exit|entry-crossing|exit-crossing\",\n        \"easing-function\": \"linear|<cubic-bezier-timing-function>|<step-timing-function>\",\n        \"track-breadth\": \"<length-percentage>|<flex>|min-content|max-content|auto\",\n        \"track-list\": \"[<line-names>? [<track-size>|<track-repeat>]]+ <line-names>?\",\n        \"track-repeat\": \"repeat( [<integer [1,∞]>] , [<line-names>? <track-size>]+ <line-names>? )\",\n        \"track-size\": \"<track-breadth>|minmax( <inflexible-breadth> , <track-breadth> )|fit-content( <length-percentage> )\",\n        \"transform-function\": \"<matrix()>|<translate()>|<translateX()>|<translateY()>|<scale()>|<scaleX()>|<scaleY()>|<rotate()>|<skew()>|<skewX()>|<skewY()>|<matrix3d()>|<translate3d()>|<translateZ()>|<scale3d()>|<scaleZ()>|<rotate3d()>|<rotateX()>|<rotateY()>|<rotateZ()>|<perspective()>\",\n        \"transform-list\": \"<transform-function>+\",\n        \"translate()\": \"translate( <length-percentage> , <length-percentage>? )\",\n        \"translate3d()\": \"translate3d( <length-percentage> , <length-percentage> , <length> )\",\n        \"translateX()\": \"translateX( <length-percentage> )\",\n        \"translateY()\": \"translateY( <length-percentage> )\",\n        \"translateZ()\": \"translateZ( <length> )\",\n        \"type-or-unit\": \"string|color|url|integer|number|length|angle|time|frequency|cap|ch|em|ex|ic|lh|rlh|rem|vb|vi|vw|vh|vmin|vmax|mm|Q|cm|in|pt|pc|px|deg|grad|rad|turn|ms|s|Hz|kHz|%\",\n        \"type-selector\": \"<wq-name>|<ns-prefix>? '*'\",\n        \"var()\": \"var( <custom-property-name> , <declaration-value>? )\",\n        \"view()\": \"view( [<axis>||<'view-timeline-inset'>]? )\",\n        \"viewport-length\": \"auto|<length-percentage>\",\n        \"visual-box\": \"content-box|padding-box|border-box\",\n        \"wq-name\": \"<ns-prefix>? <ident-token>\",\n        \"-legacy-gradient\": \"<-webkit-gradient()>|<-legacy-linear-gradient>|<-legacy-repeating-linear-gradient>|<-legacy-radial-gradient>|<-legacy-repeating-radial-gradient>\",\n        \"-legacy-linear-gradient\": \"-moz-linear-gradient( <-legacy-linear-gradient-arguments> )|-webkit-linear-gradient( <-legacy-linear-gradient-arguments> )|-o-linear-gradient( <-legacy-linear-gradient-arguments> )\",\n        \"-legacy-repeating-linear-gradient\": \"-moz-repeating-linear-gradient( <-legacy-linear-gradient-arguments> )|-webkit-repeating-linear-gradient( <-legacy-linear-gradient-arguments> )|-o-repeating-linear-gradient( <-legacy-linear-gradient-arguments> )\",\n        \"-legacy-linear-gradient-arguments\": \"[<angle>|<side-or-corner>]? , <color-stop-list>\",\n        \"-legacy-radial-gradient\": \"-moz-radial-gradient( <-legacy-radial-gradient-arguments> )|-webkit-radial-gradient( <-legacy-radial-gradient-arguments> )|-o-radial-gradient( <-legacy-radial-gradient-arguments> )\",\n        \"-legacy-repeating-radial-gradient\": \"-moz-repeating-radial-gradient( <-legacy-radial-gradient-arguments> )|-webkit-repeating-radial-gradient( <-legacy-radial-gradient-arguments> )|-o-repeating-radial-gradient( <-legacy-radial-gradient-arguments> )\",\n        \"-legacy-radial-gradient-arguments\": \"[<position> ,]? [[[<-legacy-radial-gradient-shape>||<-legacy-radial-gradient-size>]|[<length>|<percentage>]{2}] ,]? <color-stop-list>\",\n        \"-legacy-radial-gradient-size\": \"closest-side|closest-corner|farthest-side|farthest-corner|contain|cover\",\n        \"-legacy-radial-gradient-shape\": \"circle|ellipse\",\n        \"-non-standard-font\": \"-apple-system-body|-apple-system-headline|-apple-system-subheadline|-apple-system-caption1|-apple-system-caption2|-apple-system-footnote|-apple-system-short-body|-apple-system-short-headline|-apple-system-short-subheadline|-apple-system-short-caption1|-apple-system-short-footnote|-apple-system-tall-body\",\n        \"-non-standard-color\": \"-moz-ButtonDefault|-moz-ButtonHoverFace|-moz-ButtonHoverText|-moz-CellHighlight|-moz-CellHighlightText|-moz-Combobox|-moz-ComboboxText|-moz-Dialog|-moz-DialogText|-moz-dragtargetzone|-moz-EvenTreeRow|-moz-Field|-moz-FieldText|-moz-html-CellHighlight|-moz-html-CellHighlightText|-moz-mac-accentdarkestshadow|-moz-mac-accentdarkshadow|-moz-mac-accentface|-moz-mac-accentlightesthighlight|-moz-mac-accentlightshadow|-moz-mac-accentregularhighlight|-moz-mac-accentregularshadow|-moz-mac-chrome-active|-moz-mac-chrome-inactive|-moz-mac-focusring|-moz-mac-menuselect|-moz-mac-menushadow|-moz-mac-menutextselect|-moz-MenuHover|-moz-MenuHoverText|-moz-MenuBarText|-moz-MenuBarHoverText|-moz-nativehyperlinktext|-moz-OddTreeRow|-moz-win-communicationstext|-moz-win-mediatext|-moz-activehyperlinktext|-moz-default-background-color|-moz-default-color|-moz-hyperlinktext|-moz-visitedhyperlinktext|-webkit-activelink|-webkit-focus-ring-color|-webkit-link|-webkit-text\",\n        \"-non-standard-image-rendering\": \"optimize-contrast|-moz-crisp-edges|-o-crisp-edges|-webkit-optimize-contrast\",\n        \"-non-standard-overflow\": \"overlay|-moz-scrollbars-none|-moz-scrollbars-horizontal|-moz-scrollbars-vertical|-moz-hidden-unscrollable\",\n        \"-non-standard-size\": \"intrinsic|min-intrinsic|-webkit-fill-available|-webkit-fit-content|-webkit-min-content|-webkit-max-content|-moz-available|-moz-fit-content|-moz-min-content|-moz-max-content\",\n        \"-webkit-gradient()\": \"-webkit-gradient( <-webkit-gradient-type> , <-webkit-gradient-point> [, <-webkit-gradient-point>|, <-webkit-gradient-radius> , <-webkit-gradient-point>] [, <-webkit-gradient-radius>]? [, <-webkit-gradient-color-stop>]* )\",\n        \"-webkit-gradient-color-stop\": \"from( <color> )|color-stop( [<number-zero-one>|<percentage>] , <color> )|to( <color> )\",\n        \"-webkit-gradient-point\": \"[left|center|right|<length-percentage>] [top|center|bottom|<length-percentage>]\",\n        \"-webkit-gradient-radius\": \"<length>|<percentage>\",\n        \"-webkit-gradient-type\": \"linear|radial\",\n        \"-webkit-mask-box-repeat\": \"repeat|stretch|round\",\n        \"-ms-filter-function-list\": \"<-ms-filter-function>+\",\n        \"-ms-filter-function\": \"<-ms-filter-function-progid>|<-ms-filter-function-legacy>\",\n        \"-ms-filter-function-progid\": \"'progid:' [<ident-token> '.']* [<ident-token>|<function-token> <any-value>? )]\",\n        \"-ms-filter-function-legacy\": \"<ident-token>|<function-token> <any-value>? )\",\n        \"absolute-color-base\": \"<hex-color>|<absolute-color-function>|<named-color>|transparent\",\n        \"absolute-color-function\": \"rgb( ) >|<rgba()>|<hsl()>|<hsla()>|<hwb()>|<lab()>|<lch()>|<oklab()>|<oklch()>|<color()>\",\n        \"age\": \"child|young|old\",\n        \"attr-name\": \"<wq-name>\",\n        \"attr-fallback\": \"<any-value>\",\n        \"bg-clip\": \"<box>|border|text\",\n        \"bottom\": \"<length>|auto\",\n        \"container-name\": \"<custom-ident>\",\n        \"container-condition\": \"not <query-in-parens>|<query-in-parens> [[and <query-in-parens>]*|[or <query-in-parens>]*]\",\n        \"coord-box\": \"content-box|padding-box|border-box|fill-box|stroke-box|view-box\",\n        \"generic-voice\": \"[<age>? <gender> <integer>?]\",\n        \"gender\": \"male|female|neutral\",\n        \"left\": \"<length>|auto\",\n        \"paint\": \"none|<color>|<url> [none|<color>]?|context-fill|context-stroke\",\n        \"palette-identifier\": \"<dashed-ident>\",\n        \"right\": \"<length>|auto\",\n        \"scope-start\": \"<forgiving-selector-list>\",\n        \"scope-end\": \"<forgiving-selector-list>\",\n        \"forgiving-selector-list\": \"<complex-real-selector-list>\",\n        \"forgiving-relative-selector-list\": \"<relative-real-selector-list>\",\n        \"selector-list\": \"<complex-selector-list>\",\n        \"complex-real-selector-list\": \"<complex-real-selector>#\",\n        \"simple-selector-list\": \"<simple-selector>#\",\n        \"relative-real-selector-list\": \"<relative-real-selector>#\",\n        \"complex-selector-unit\": \"[<compound-selector>? <pseudo-compound-selector>*]!\",\n        \"complex-real-selector\": \"<compound-selector> [<combinator>? <compound-selector>]*\",\n        \"relative-real-selector\": \"<combinator>? <complex-real-selector>\",\n        \"pseudo-compound-selector\": \"<pseudo-element-selector> <pseudo-class-selector>*\",\n        \"simple-selector\": \"<type-selector>|<subclass-selector>\",\n        \"legacy-pseudo-element-selector\": \"':' [before|after|first-line|first-letter]\",\n        \"single-animation-composition\": \"replace|add|accumulate\",\n        \"svg-length\": \"<percentage>|<length>|<number>\",\n        \"svg-writing-mode\": \"lr-tb|rl-tb|tb-rl|lr|rl|tb\",\n        \"top\": \"<length>|auto\",\n        \"x\": \"<number>\",\n        \"y\": \"<number>\",\n        \"declaration\": \"<ident-token> : <declaration-value>? ['!' important]?\",\n        \"declaration-list\": \"[<declaration>? ';']* <declaration>?\",\n        \"url\": \"url( <string> <url-modifier>* )|<url-token>\",\n        \"url-modifier\": \"<ident>|<function-token> <any-value> )\",\n        \"number-zero-one\": \"<number [0,1]>\",\n        \"number-one-or-greater\": \"<number [1,∞]>\",\n        \"color()\": \"color( <colorspace-params> [/ [<alpha-value>|none]]? )\",\n        \"colorspace-params\": \"[<predefined-rgb-params>|<xyz-params>]\",\n        \"predefined-rgb-params\": \"<predefined-rgb> [<number>|<percentage>|none]{3}\",\n        \"predefined-rgb\": \"srgb|srgb-linear|display-p3|a98-rgb|prophoto-rgb|rec2020\",\n        \"xyz-params\": \"<xyz-space> [<number>|<percentage>|none]{3}\",\n        \"xyz-space\": \"xyz|xyz-d50|xyz-d65\",\n        \"oklab()\": \"oklab( [<percentage>|<number>|none] [<percentage>|<number>|none] [<percentage>|<number>|none] [/ [<alpha-value>|none]]? )\",\n        \"oklch()\": \"oklch( [<percentage>|<number>|none] [<percentage>|<number>|none] [<hue>|none] [/ [<alpha-value>|none]]? )\",\n        \"offset-path\": \"<ray()>|<url>|<basic-shape>\",\n        \"ray-size\": \"closest-side|closest-corner|farthest-side|farthest-corner|sides\",\n        \"query-in-parens\": \"( <container-condition> )|( <size-feature> )|style( <style-query> )|<general-enclosed>\",\n        \"size-feature\": \"<mf-plain>|<mf-boolean>|<mf-range>\",\n        \"style-feature\": \"<declaration>\",\n        \"style-query\": \"<style-condition>|<style-feature>\",\n        \"style-condition\": \"not <style-in-parens>|<style-in-parens> [[and <style-in-parens>]*|[or <style-in-parens>]*]\",\n        \"style-in-parens\": \"( <style-condition> )|( <style-feature> )|<general-enclosed>\",\n        \"-non-standard-display\": \"-ms-inline-flexbox|-ms-grid|-ms-inline-grid|-webkit-flex|-webkit-inline-flex|-webkit-box|-webkit-inline-box|-moz-inline-stack|-moz-box|-moz-inline-box\"\n    },\n    \"properties\": {\n        \"--*\": \"<declaration-value>\",\n        \"-ms-accelerator\": \"false|true\",\n        \"-ms-block-progression\": \"tb|rl|bt|lr\",\n        \"-ms-content-zoom-chaining\": \"none|chained\",\n        \"-ms-content-zooming\": \"none|zoom\",\n        \"-ms-content-zoom-limit\": \"<'-ms-content-zoom-limit-min'> <'-ms-content-zoom-limit-max'>\",\n        \"-ms-content-zoom-limit-max\": \"<percentage>\",\n        \"-ms-content-zoom-limit-min\": \"<percentage>\",\n        \"-ms-content-zoom-snap\": \"<'-ms-content-zoom-snap-type'>||<'-ms-content-zoom-snap-points'>\",\n        \"-ms-content-zoom-snap-points\": \"snapInterval( <percentage> , <percentage> )|snapList( <percentage># )\",\n        \"-ms-content-zoom-snap-type\": \"none|proximity|mandatory\",\n        \"-ms-filter\": \"<string>\",\n        \"-ms-flow-from\": \"[none|<custom-ident>]#\",\n        \"-ms-flow-into\": \"[none|<custom-ident>]#\",\n        \"-ms-grid-columns\": \"none|<track-list>|<auto-track-list>\",\n        \"-ms-grid-rows\": \"none|<track-list>|<auto-track-list>\",\n        \"-ms-high-contrast-adjust\": \"auto|none\",\n        \"-ms-hyphenate-limit-chars\": \"auto|<integer>{1,3}\",\n        \"-ms-hyphenate-limit-lines\": \"no-limit|<integer>\",\n        \"-ms-hyphenate-limit-zone\": \"<percentage>|<length>\",\n        \"-ms-ime-align\": \"auto|after\",\n        \"-ms-overflow-style\": \"auto|none|scrollbar|-ms-autohiding-scrollbar\",\n        \"-ms-scrollbar-3dlight-color\": \"<color>\",\n        \"-ms-scrollbar-arrow-color\": \"<color>\",\n        \"-ms-scrollbar-base-color\": \"<color>\",\n        \"-ms-scrollbar-darkshadow-color\": \"<color>\",\n        \"-ms-scrollbar-face-color\": \"<color>\",\n        \"-ms-scrollbar-highlight-color\": \"<color>\",\n        \"-ms-scrollbar-shadow-color\": \"<color>\",\n        \"-ms-scrollbar-track-color\": \"<color>\",\n        \"-ms-scroll-chaining\": \"chained|none\",\n        \"-ms-scroll-limit\": \"<'-ms-scroll-limit-x-min'> <'-ms-scroll-limit-y-min'> <'-ms-scroll-limit-x-max'> <'-ms-scroll-limit-y-max'>\",\n        \"-ms-scroll-limit-x-max\": \"auto|<length>\",\n        \"-ms-scroll-limit-x-min\": \"<length>\",\n        \"-ms-scroll-limit-y-max\": \"auto|<length>\",\n        \"-ms-scroll-limit-y-min\": \"<length>\",\n        \"-ms-scroll-rails\": \"none|railed\",\n        \"-ms-scroll-snap-points-x\": \"snapInterval( <length-percentage> , <length-percentage> )|snapList( <length-percentage># )\",\n        \"-ms-scroll-snap-points-y\": \"snapInterval( <length-percentage> , <length-percentage> )|snapList( <length-percentage># )\",\n        \"-ms-scroll-snap-type\": \"none|proximity|mandatory\",\n        \"-ms-scroll-snap-x\": \"<'-ms-scroll-snap-type'> <'-ms-scroll-snap-points-x'>\",\n        \"-ms-scroll-snap-y\": \"<'-ms-scroll-snap-type'> <'-ms-scroll-snap-points-y'>\",\n        \"-ms-scroll-translation\": \"none|vertical-to-horizontal\",\n        \"-ms-text-autospace\": \"none|ideograph-alpha|ideograph-numeric|ideograph-parenthesis|ideograph-space\",\n        \"-ms-touch-select\": \"grippers|none\",\n        \"-ms-user-select\": \"none|element|text\",\n        \"-ms-wrap-flow\": \"auto|both|start|end|maximum|clear\",\n        \"-ms-wrap-margin\": \"<length>\",\n        \"-ms-wrap-through\": \"wrap|none\",\n        \"-moz-appearance\": \"none|button|button-arrow-down|button-arrow-next|button-arrow-previous|button-arrow-up|button-bevel|button-focus|caret|checkbox|checkbox-container|checkbox-label|checkmenuitem|dualbutton|groupbox|listbox|listitem|menuarrow|menubar|menucheckbox|menuimage|menuitem|menuitemtext|menulist|menulist-button|menulist-text|menulist-textfield|menupopup|menuradio|menuseparator|meterbar|meterchunk|progressbar|progressbar-vertical|progresschunk|progresschunk-vertical|radio|radio-container|radio-label|radiomenuitem|range|range-thumb|resizer|resizerpanel|scale-horizontal|scalethumbend|scalethumb-horizontal|scalethumbstart|scalethumbtick|scalethumb-vertical|scale-vertical|scrollbarbutton-down|scrollbarbutton-left|scrollbarbutton-right|scrollbarbutton-up|scrollbarthumb-horizontal|scrollbarthumb-vertical|scrollbartrack-horizontal|scrollbartrack-vertical|searchfield|separator|sheet|spinner|spinner-downbutton|spinner-textfield|spinner-upbutton|splitter|statusbar|statusbarpanel|tab|tabpanel|tabpanels|tab-scroll-arrow-back|tab-scroll-arrow-forward|textfield|textfield-multiline|toolbar|toolbarbutton|toolbarbutton-dropdown|toolbargripper|toolbox|tooltip|treeheader|treeheadercell|treeheadersortarrow|treeitem|treeline|treetwisty|treetwistyopen|treeview|-moz-mac-unified-toolbar|-moz-win-borderless-glass|-moz-win-browsertabbar-toolbox|-moz-win-communicationstext|-moz-win-communications-toolbox|-moz-win-exclude-glass|-moz-win-glass|-moz-win-mediatext|-moz-win-media-toolbox|-moz-window-button-box|-moz-window-button-box-maximized|-moz-window-button-close|-moz-window-button-maximize|-moz-window-button-minimize|-moz-window-button-restore|-moz-window-frame-bottom|-moz-window-frame-left|-moz-window-frame-right|-moz-window-titlebar|-moz-window-titlebar-maximized\",\n        \"-moz-binding\": \"<url>|none\",\n        \"-moz-border-bottom-colors\": \"<color>+|none\",\n        \"-moz-border-left-colors\": \"<color>+|none\",\n        \"-moz-border-right-colors\": \"<color>+|none\",\n        \"-moz-border-top-colors\": \"<color>+|none\",\n        \"-moz-context-properties\": \"none|[fill|fill-opacity|stroke|stroke-opacity]#\",\n        \"-moz-float-edge\": \"border-box|content-box|margin-box|padding-box\",\n        \"-moz-force-broken-image-icon\": \"0|1\",\n        \"-moz-image-region\": \"<shape>|auto\",\n        \"-moz-orient\": \"inline|block|horizontal|vertical\",\n        \"-moz-outline-radius\": \"<outline-radius>{1,4} [/ <outline-radius>{1,4}]?\",\n        \"-moz-outline-radius-bottomleft\": \"<outline-radius>\",\n        \"-moz-outline-radius-bottomright\": \"<outline-radius>\",\n        \"-moz-outline-radius-topleft\": \"<outline-radius>\",\n        \"-moz-outline-radius-topright\": \"<outline-radius>\",\n        \"-moz-stack-sizing\": \"ignore|stretch-to-fit\",\n        \"-moz-text-blink\": \"none|blink\",\n        \"-moz-user-focus\": \"ignore|normal|select-after|select-before|select-menu|select-same|select-all|none\",\n        \"-moz-user-input\": \"auto|none|enabled|disabled\",\n        \"-moz-user-modify\": \"read-only|read-write|write-only\",\n        \"-moz-window-dragging\": \"drag|no-drag\",\n        \"-moz-window-shadow\": \"default|menu|tooltip|sheet|none\",\n        \"-webkit-appearance\": \"none|button|button-bevel|caps-lock-indicator|caret|checkbox|default-button|inner-spin-button|listbox|listitem|media-controls-background|media-controls-fullscreen-background|media-current-time-display|media-enter-fullscreen-button|media-exit-fullscreen-button|media-fullscreen-button|media-mute-button|media-overlay-play-button|media-play-button|media-seek-back-button|media-seek-forward-button|media-slider|media-sliderthumb|media-time-remaining-display|media-toggle-closed-captions-button|media-volume-slider|media-volume-slider-container|media-volume-sliderthumb|menulist|menulist-button|menulist-text|menulist-textfield|meter|progress-bar|progress-bar-value|push-button|radio|scrollbarbutton-down|scrollbarbutton-left|scrollbarbutton-right|scrollbarbutton-up|scrollbargripper-horizontal|scrollbargripper-vertical|scrollbarthumb-horizontal|scrollbarthumb-vertical|scrollbartrack-horizontal|scrollbartrack-vertical|searchfield|searchfield-cancel-button|searchfield-decoration|searchfield-results-button|searchfield-results-decoration|slider-horizontal|slider-vertical|sliderthumb-horizontal|sliderthumb-vertical|square-button|textarea|textfield|-apple-pay-button\",\n        \"-webkit-border-before\": \"<'border-width'>||<'border-style'>||<color>\",\n        \"-webkit-border-before-color\": \"<color>\",\n        \"-webkit-border-before-style\": \"<'border-style'>\",\n        \"-webkit-border-before-width\": \"<'border-width'>\",\n        \"-webkit-box-reflect\": \"[above|below|right|left]? <length>? <image>?\",\n        \"-webkit-line-clamp\": \"none|<integer>\",\n        \"-webkit-mask\": \"[<mask-reference>||<position> [/ <bg-size>]?||<repeat-style>||[<box>|border|padding|content|text]||[<box>|border|padding|content]]#\",\n        \"-webkit-mask-attachment\": \"<attachment>#\",\n        \"-webkit-mask-clip\": \"[<box>|border|padding|content|text]#\",\n        \"-webkit-mask-composite\": \"<composite-style>#\",\n        \"-webkit-mask-image\": \"<mask-reference>#\",\n        \"-webkit-mask-origin\": \"[<box>|border|padding|content]#\",\n        \"-webkit-mask-position\": \"<position>#\",\n        \"-webkit-mask-position-x\": \"[<length-percentage>|left|center|right]#\",\n        \"-webkit-mask-position-y\": \"[<length-percentage>|top|center|bottom]#\",\n        \"-webkit-mask-repeat\": \"<repeat-style>#\",\n        \"-webkit-mask-repeat-x\": \"repeat|no-repeat|space|round\",\n        \"-webkit-mask-repeat-y\": \"repeat|no-repeat|space|round\",\n        \"-webkit-mask-size\": \"<bg-size>#\",\n        \"-webkit-overflow-scrolling\": \"auto|touch\",\n        \"-webkit-tap-highlight-color\": \"<color>\",\n        \"-webkit-text-fill-color\": \"<color>\",\n        \"-webkit-text-stroke\": \"<length>||<color>\",\n        \"-webkit-text-stroke-color\": \"<color>\",\n        \"-webkit-text-stroke-width\": \"<length>\",\n        \"-webkit-touch-callout\": \"default|none\",\n        \"-webkit-user-modify\": \"read-only|read-write|read-write-plaintext-only\",\n        \"accent-color\": \"auto|<color>\",\n        \"align-content\": \"normal|<baseline-position>|<content-distribution>|<overflow-position>? <content-position>\",\n        \"align-items\": \"normal|stretch|<baseline-position>|[<overflow-position>? <self-position>]\",\n        \"align-self\": \"auto|normal|stretch|<baseline-position>|<overflow-position>? <self-position>\",\n        \"align-tracks\": \"[normal|<baseline-position>|<content-distribution>|<overflow-position>? <content-position>]#\",\n        \"all\": \"initial|inherit|unset|revert|revert-layer\",\n        \"animation\": \"<single-animation>#\",\n        \"animation-composition\": \"<single-animation-composition>#\",\n        \"animation-delay\": \"<time>#\",\n        \"animation-direction\": \"<single-animation-direction>#\",\n        \"animation-duration\": \"<time>#\",\n        \"animation-fill-mode\": \"<single-animation-fill-mode>#\",\n        \"animation-iteration-count\": \"<single-animation-iteration-count>#\",\n        \"animation-name\": \"[none|<keyframes-name>]#\",\n        \"animation-play-state\": \"<single-animation-play-state>#\",\n        \"animation-range\": \"[<'animation-range-start'> <'animation-range-end'>?]#\",\n        \"animation-range-end\": \"[normal|<length-percentage>|<timeline-range-name> <length-percentage>?]#\",\n        \"animation-range-start\": \"[normal|<length-percentage>|<timeline-range-name> <length-percentage>?]#\",\n        \"animation-timing-function\": \"<easing-function>#\",\n        \"animation-timeline\": \"<single-animation-timeline>#\",\n        \"appearance\": \"none|auto|textfield|menulist-button|<compat-auto>\",\n        \"aspect-ratio\": \"auto|<ratio>\",\n        \"azimuth\": \"<angle>|[[left-side|far-left|left|center-left|center|center-right|right|far-right|right-side]||behind]|leftwards|rightwards\",\n        \"backdrop-filter\": \"none|<filter-function-list>\",\n        \"backface-visibility\": \"visible|hidden\",\n        \"background\": \"[<bg-layer> ,]* <final-bg-layer>\",\n        \"background-attachment\": \"<attachment>#\",\n        \"background-blend-mode\": \"<blend-mode>#\",\n        \"background-clip\": \"<bg-clip>#\",\n        \"background-color\": \"<color>\",\n        \"background-image\": \"<bg-image>#\",\n        \"background-origin\": \"<box>#\",\n        \"background-position\": \"<bg-position>#\",\n        \"background-position-x\": \"[center|[[left|right|x-start|x-end]? <length-percentage>?]!]#\",\n        \"background-position-y\": \"[center|[[top|bottom|y-start|y-end]? <length-percentage>?]!]#\",\n        \"background-repeat\": \"<repeat-style>#\",\n        \"background-size\": \"<bg-size>#\",\n        \"block-overflow\": \"clip|ellipsis|<string>\",\n        \"block-size\": \"<'width'>\",\n        \"border\": \"<line-width>||<line-style>||<color>\",\n        \"border-block\": \"<'border-top-width'>||<'border-top-style'>||<color>\",\n        \"border-block-color\": \"<'border-top-color'>{1,2}\",\n        \"border-block-style\": \"<'border-top-style'>\",\n        \"border-block-width\": \"<'border-top-width'>\",\n        \"border-block-end\": \"<'border-top-width'>||<'border-top-style'>||<color>\",\n        \"border-block-end-color\": \"<'border-top-color'>\",\n        \"border-block-end-style\": \"<'border-top-style'>\",\n        \"border-block-end-width\": \"<'border-top-width'>\",\n        \"border-block-start\": \"<'border-top-width'>||<'border-top-style'>||<color>\",\n        \"border-block-start-color\": \"<'border-top-color'>\",\n        \"border-block-start-style\": \"<'border-top-style'>\",\n        \"border-block-start-width\": \"<'border-top-width'>\",\n        \"border-bottom\": \"<line-width>||<line-style>||<color>\",\n        \"border-bottom-color\": \"<'border-top-color'>\",\n        \"border-bottom-left-radius\": \"<length-percentage>{1,2}\",\n        \"border-bottom-right-radius\": \"<length-percentage>{1,2}\",\n        \"border-bottom-style\": \"<line-style>\",\n        \"border-bottom-width\": \"<line-width>\",\n        \"border-collapse\": \"collapse|separate\",\n        \"border-color\": \"<color>{1,4}\",\n        \"border-end-end-radius\": \"<length-percentage>{1,2}\",\n        \"border-end-start-radius\": \"<length-percentage>{1,2}\",\n        \"border-image\": \"<'border-image-source'>||<'border-image-slice'> [/ <'border-image-width'>|/ <'border-image-width'>? / <'border-image-outset'>]?||<'border-image-repeat'>\",\n        \"border-image-outset\": \"[<length>|<number>]{1,4}\",\n        \"border-image-repeat\": \"[stretch|repeat|round|space]{1,2}\",\n        \"border-image-slice\": \"<number-percentage>{1,4}&&fill?\",\n        \"border-image-source\": \"none|<image>\",\n        \"border-image-width\": \"[<length-percentage>|<number>|auto]{1,4}\",\n        \"border-inline\": \"<'border-top-width'>||<'border-top-style'>||<color>\",\n        \"border-inline-end\": \"<'border-top-width'>||<'border-top-style'>||<color>\",\n        \"border-inline-color\": \"<'border-top-color'>{1,2}\",\n        \"border-inline-style\": \"<'border-top-style'>\",\n        \"border-inline-width\": \"<'border-top-width'>\",\n        \"border-inline-end-color\": \"<'border-top-color'>\",\n        \"border-inline-end-style\": \"<'border-top-style'>\",\n        \"border-inline-end-width\": \"<'border-top-width'>\",\n        \"border-inline-start\": \"<'border-top-width'>||<'border-top-style'>||<color>\",\n        \"border-inline-start-color\": \"<'border-top-color'>\",\n        \"border-inline-start-style\": \"<'border-top-style'>\",\n        \"border-inline-start-width\": \"<'border-top-width'>\",\n        \"border-left\": \"<line-width>||<line-style>||<color>\",\n        \"border-left-color\": \"<color>\",\n        \"border-left-style\": \"<line-style>\",\n        \"border-left-width\": \"<line-width>\",\n        \"border-radius\": \"<length-percentage>{1,4} [/ <length-percentage>{1,4}]?\",\n        \"border-right\": \"<line-width>||<line-style>||<color>\",\n        \"border-right-color\": \"<color>\",\n        \"border-right-style\": \"<line-style>\",\n        \"border-right-width\": \"<line-width>\",\n        \"border-spacing\": \"<length> <length>?\",\n        \"border-start-end-radius\": \"<length-percentage>{1,2}\",\n        \"border-start-start-radius\": \"<length-percentage>{1,2}\",\n        \"border-style\": \"<line-style>{1,4}\",\n        \"border-top\": \"<line-width>||<line-style>||<color>\",\n        \"border-top-color\": \"<color>\",\n        \"border-top-left-radius\": \"<length-percentage>{1,2}\",\n        \"border-top-right-radius\": \"<length-percentage>{1,2}\",\n        \"border-top-style\": \"<line-style>\",\n        \"border-top-width\": \"<line-width>\",\n        \"border-width\": \"<line-width>{1,4}\",\n        \"bottom\": \"<length>|<percentage>|auto\",\n        \"box-align\": \"start|center|end|baseline|stretch\",\n        \"box-decoration-break\": \"slice|clone\",\n        \"box-direction\": \"normal|reverse|inherit\",\n        \"box-flex\": \"<number>\",\n        \"box-flex-group\": \"<integer>\",\n        \"box-lines\": \"single|multiple\",\n        \"box-ordinal-group\": \"<integer>\",\n        \"box-orient\": \"horizontal|vertical|inline-axis|block-axis|inherit\",\n        \"box-pack\": \"start|center|end|justify\",\n        \"box-shadow\": \"none|<shadow>#\",\n        \"box-sizing\": \"content-box|border-box\",\n        \"break-after\": \"auto|avoid|always|all|avoid-page|page|left|right|recto|verso|avoid-column|column|avoid-region|region\",\n        \"break-before\": \"auto|avoid|always|all|avoid-page|page|left|right|recto|verso|avoid-column|column|avoid-region|region\",\n        \"break-inside\": \"auto|avoid|avoid-page|avoid-column|avoid-region\",\n        \"caption-side\": \"top|bottom|block-start|block-end|inline-start|inline-end\",\n        \"caret\": \"<'caret-color'>||<'caret-shape'>\",\n        \"caret-color\": \"auto|<color>\",\n        \"caret-shape\": \"auto|bar|block|underscore\",\n        \"clear\": \"none|left|right|both|inline-start|inline-end\",\n        \"clip\": \"<shape>|auto\",\n        \"clip-path\": \"<clip-source>|[<basic-shape>||<geometry-box>]|none\",\n        \"color\": \"<color>\",\n        \"color-scheme\": \"normal|[light|dark|<custom-ident>]+&&only?\",\n        \"column-count\": \"<integer>|auto\",\n        \"column-fill\": \"auto|balance|balance-all\",\n        \"column-gap\": \"normal|<length-percentage>\",\n        \"column-rule\": \"<'column-rule-width'>||<'column-rule-style'>||<'column-rule-color'>\",\n        \"column-rule-color\": \"<color>\",\n        \"column-rule-style\": \"<'border-style'>\",\n        \"column-rule-width\": \"<'border-width'>\",\n        \"column-span\": \"none|all\",\n        \"column-width\": \"<length>|auto\",\n        \"columns\": \"<'column-width'>||<'column-count'>\",\n        \"contain\": \"none|strict|content|[[size||inline-size]||layout||style||paint]\",\n        \"contain-intrinsic-size\": \"[auto? [none|<length>]]{1,2}\",\n        \"contain-intrinsic-block-size\": \"auto? [none|<length>]\",\n        \"contain-intrinsic-height\": \"auto? [none|<length>]\",\n        \"contain-intrinsic-inline-size\": \"auto? [none|<length>]\",\n        \"contain-intrinsic-width\": \"auto? [none|<length>]\",\n        \"container\": \"<'container-name'> [/ <'container-type'>]?\",\n        \"container-name\": \"none|<custom-ident>+\",\n        \"container-type\": \"normal||[size|inline-size]\",\n        \"content\": \"normal|none|[<content-replacement>|<content-list>] [/ [<string>|<counter>]+]?\",\n        \"content-visibility\": \"visible|auto|hidden\",\n        \"counter-increment\": \"[<counter-name> <integer>?]+|none\",\n        \"counter-reset\": \"[<counter-name> <integer>?|<reversed-counter-name> <integer>?]+|none\",\n        \"counter-set\": \"[<counter-name> <integer>?]+|none\",\n        \"cursor\": \"[[<url> [<x> <y>]? ,]* [auto|default|none|context-menu|help|pointer|progress|wait|cell|crosshair|text|vertical-text|alias|copy|move|no-drop|not-allowed|e-resize|n-resize|ne-resize|nw-resize|s-resize|se-resize|sw-resize|w-resize|ew-resize|ns-resize|nesw-resize|nwse-resize|col-resize|row-resize|all-scroll|zoom-in|zoom-out|grab|grabbing|hand|-webkit-grab|-webkit-grabbing|-webkit-zoom-in|-webkit-zoom-out|-moz-grab|-moz-grabbing|-moz-zoom-in|-moz-zoom-out]]\",\n        \"direction\": \"ltr|rtl\",\n        \"display\": \"[<display-outside>||<display-inside>]|<display-listitem>|<display-internal>|<display-box>|<display-legacy>|<-non-standard-display>\",\n        \"empty-cells\": \"show|hide\",\n        \"filter\": \"none|<filter-function-list>|<-ms-filter-function-list>\",\n        \"flex\": \"none|[<'flex-grow'> <'flex-shrink'>?||<'flex-basis'>]\",\n        \"flex-basis\": \"content|<'width'>\",\n        \"flex-direction\": \"row|row-reverse|column|column-reverse\",\n        \"flex-flow\": \"<'flex-direction'>||<'flex-wrap'>\",\n        \"flex-grow\": \"<number>\",\n        \"flex-shrink\": \"<number>\",\n        \"flex-wrap\": \"nowrap|wrap|wrap-reverse\",\n        \"float\": \"left|right|none|inline-start|inline-end\",\n        \"font\": \"[[<'font-style'>||<font-variant-css21>||<'font-weight'>||<'font-stretch'>]? <'font-size'> [/ <'line-height'>]? <'font-family'>]|caption|icon|menu|message-box|small-caption|status-bar|<-non-standard-font>\",\n        \"font-family\": \"[<family-name>|<generic-family>]#\",\n        \"font-feature-settings\": \"normal|<feature-tag-value>#\",\n        \"font-kerning\": \"auto|normal|none\",\n        \"font-language-override\": \"normal|<string>\",\n        \"font-optical-sizing\": \"auto|none\",\n        \"font-palette\": \"normal|light|dark|<palette-identifier>\",\n        \"font-variation-settings\": \"normal|[<string> <number>]#\",\n        \"font-size\": \"<absolute-size>|<relative-size>|<length-percentage>\",\n        \"font-size-adjust\": \"none|[ex-height|cap-height|ch-width|ic-width|ic-height]? [from-font|<number>]\",\n        \"font-smooth\": \"auto|never|always|<absolute-size>|<length>\",\n        \"font-stretch\": \"<font-stretch-absolute>\",\n        \"font-style\": \"normal|italic|oblique <angle>?\",\n        \"font-synthesis\": \"none|[weight||style||small-caps]\",\n        \"font-synthesis-small-caps\": \"auto|none\",\n        \"font-synthesis-style\": \"auto|none\",\n        \"font-synthesis-weight\": \"auto|none\",\n        \"font-variant\": \"normal|none|[<common-lig-values>||<discretionary-lig-values>||<historical-lig-values>||<contextual-alt-values>||stylistic( <feature-value-name> )||historical-forms||styleset( <feature-value-name># )||character-variant( <feature-value-name># )||swash( <feature-value-name> )||ornaments( <feature-value-name> )||annotation( <feature-value-name> )||[small-caps|all-small-caps|petite-caps|all-petite-caps|unicase|titling-caps]||<numeric-figure-values>||<numeric-spacing-values>||<numeric-fraction-values>||ordinal||slashed-zero||<east-asian-variant-values>||<east-asian-width-values>||ruby]\",\n        \"font-variant-alternates\": \"normal|[stylistic( <feature-value-name> )||historical-forms||styleset( <feature-value-name># )||character-variant( <feature-value-name># )||swash( <feature-value-name> )||ornaments( <feature-value-name> )||annotation( <feature-value-name> )]\",\n        \"font-variant-caps\": \"normal|small-caps|all-small-caps|petite-caps|all-petite-caps|unicase|titling-caps\",\n        \"font-variant-east-asian\": \"normal|[<east-asian-variant-values>||<east-asian-width-values>||ruby]\",\n        \"font-variant-emoji\": \"normal|text|emoji|unicode\",\n        \"font-variant-ligatures\": \"normal|none|[<common-lig-values>||<discretionary-lig-values>||<historical-lig-values>||<contextual-alt-values>]\",\n        \"font-variant-numeric\": \"normal|[<numeric-figure-values>||<numeric-spacing-values>||<numeric-fraction-values>||ordinal||slashed-zero]\",\n        \"font-variant-position\": \"normal|sub|super\",\n        \"font-weight\": \"<font-weight-absolute>|bolder|lighter\",\n        \"forced-color-adjust\": \"auto|none\",\n        \"gap\": \"<'row-gap'> <'column-gap'>?\",\n        \"grid\": \"<'grid-template'>|<'grid-template-rows'> / [auto-flow&&dense?] <'grid-auto-columns'>?|[auto-flow&&dense?] <'grid-auto-rows'>? / <'grid-template-columns'>\",\n        \"grid-area\": \"<grid-line> [/ <grid-line>]{0,3}\",\n        \"grid-auto-columns\": \"<track-size>+\",\n        \"grid-auto-flow\": \"[row|column]||dense\",\n        \"grid-auto-rows\": \"<track-size>+\",\n        \"grid-column\": \"<grid-line> [/ <grid-line>]?\",\n        \"grid-column-end\": \"<grid-line>\",\n        \"grid-column-gap\": \"<length-percentage>\",\n        \"grid-column-start\": \"<grid-line>\",\n        \"grid-gap\": \"<'grid-row-gap'> <'grid-column-gap'>?\",\n        \"grid-row\": \"<grid-line> [/ <grid-line>]?\",\n        \"grid-row-end\": \"<grid-line>\",\n        \"grid-row-gap\": \"<length-percentage>\",\n        \"grid-row-start\": \"<grid-line>\",\n        \"grid-template\": \"none|[<'grid-template-rows'> / <'grid-template-columns'>]|[<line-names>? <string> <track-size>? <line-names>?]+ [/ <explicit-track-list>]?\",\n        \"grid-template-areas\": \"none|<string>+\",\n        \"grid-template-columns\": \"none|<track-list>|<auto-track-list>|subgrid <line-name-list>?\",\n        \"grid-template-rows\": \"none|<track-list>|<auto-track-list>|subgrid <line-name-list>?\",\n        \"hanging-punctuation\": \"none|[first||[force-end|allow-end]||last]\",\n        \"height\": \"auto|<length>|<percentage>|min-content|max-content|fit-content|fit-content( <length-percentage> )|stretch|<-non-standard-size>\",\n        \"hyphenate-character\": \"auto|<string>\",\n        \"hyphenate-limit-chars\": \"[auto|<integer>]{1,3}\",\n        \"hyphens\": \"none|manual|auto\",\n        \"image-orientation\": \"from-image|<angle>|[<angle>? flip]\",\n        \"image-rendering\": \"auto|crisp-edges|pixelated|optimizeSpeed|optimizeQuality|<-non-standard-image-rendering>\",\n        \"image-resolution\": \"[from-image||<resolution>]&&snap?\",\n        \"ime-mode\": \"auto|normal|active|inactive|disabled\",\n        \"initial-letter\": \"normal|[<number> <integer>?]\",\n        \"initial-letter-align\": \"[auto|alphabetic|hanging|ideographic]\",\n        \"inline-size\": \"<'width'>\",\n        \"input-security\": \"auto|none\",\n        \"inset\": \"<'top'>{1,4}\",\n        \"inset-block\": \"<'top'>{1,2}\",\n        \"inset-block-end\": \"<'top'>\",\n        \"inset-block-start\": \"<'top'>\",\n        \"inset-inline\": \"<'top'>{1,2}\",\n        \"inset-inline-end\": \"<'top'>\",\n        \"inset-inline-start\": \"<'top'>\",\n        \"isolation\": \"auto|isolate\",\n        \"justify-content\": \"normal|<content-distribution>|<overflow-position>? [<content-position>|left|right]\",\n        \"justify-items\": \"normal|stretch|<baseline-position>|<overflow-position>? [<self-position>|left|right]|legacy|legacy&&[left|right|center]\",\n        \"justify-self\": \"auto|normal|stretch|<baseline-position>|<overflow-position>? [<self-position>|left|right]\",\n        \"justify-tracks\": \"[normal|<content-distribution>|<overflow-position>? [<content-position>|left|right]]#\",\n        \"left\": \"<length>|<percentage>|auto\",\n        \"letter-spacing\": \"normal|<length-percentage>\",\n        \"line-break\": \"auto|loose|normal|strict|anywhere\",\n        \"line-clamp\": \"none|<integer>\",\n        \"line-height\": \"normal|<number>|<length>|<percentage>\",\n        \"line-height-step\": \"<length>\",\n        \"list-style\": \"<'list-style-type'>||<'list-style-position'>||<'list-style-image'>\",\n        \"list-style-image\": \"<image>|none\",\n        \"list-style-position\": \"inside|outside\",\n        \"list-style-type\": \"<counter-style>|<string>|none\",\n        \"margin\": \"[<length>|<percentage>|auto]{1,4}\",\n        \"margin-block\": \"<'margin-left'>{1,2}\",\n        \"margin-block-end\": \"<'margin-left'>\",\n        \"margin-block-start\": \"<'margin-left'>\",\n        \"margin-bottom\": \"<length>|<percentage>|auto\",\n        \"margin-inline\": \"<'margin-left'>{1,2}\",\n        \"margin-inline-end\": \"<'margin-left'>\",\n        \"margin-inline-start\": \"<'margin-left'>\",\n        \"margin-left\": \"<length>|<percentage>|auto\",\n        \"margin-right\": \"<length>|<percentage>|auto\",\n        \"margin-top\": \"<length>|<percentage>|auto\",\n        \"margin-trim\": \"none|in-flow|all\",\n        \"mask\": \"<mask-layer>#\",\n        \"mask-border\": \"<'mask-border-source'>||<'mask-border-slice'> [/ <'mask-border-width'>? [/ <'mask-border-outset'>]?]?||<'mask-border-repeat'>||<'mask-border-mode'>\",\n        \"mask-border-mode\": \"luminance|alpha\",\n        \"mask-border-outset\": \"[<length>|<number>]{1,4}\",\n        \"mask-border-repeat\": \"[stretch|repeat|round|space]{1,2}\",\n        \"mask-border-slice\": \"<number-percentage>{1,4} fill?\",\n        \"mask-border-source\": \"none|<image>\",\n        \"mask-border-width\": \"[<length-percentage>|<number>|auto]{1,4}\",\n        \"mask-clip\": \"[<geometry-box>|no-clip]#\",\n        \"mask-composite\": \"<compositing-operator>#\",\n        \"mask-image\": \"<mask-reference>#\",\n        \"mask-mode\": \"<masking-mode>#\",\n        \"mask-origin\": \"<geometry-box>#\",\n        \"mask-position\": \"<position>#\",\n        \"mask-repeat\": \"<repeat-style>#\",\n        \"mask-size\": \"<bg-size>#\",\n        \"mask-type\": \"luminance|alpha\",\n        \"masonry-auto-flow\": \"[pack|next]||[definite-first|ordered]\",\n        \"math-depth\": \"auto-add|add( <integer> )|<integer>\",\n        \"math-shift\": \"normal|compact\",\n        \"math-style\": \"normal|compact\",\n        \"max-block-size\": \"<'max-width'>\",\n        \"max-height\": \"none|<length-percentage>|min-content|max-content|fit-content|fit-content( <length-percentage> )|stretch|<-non-standard-size>\",\n        \"max-inline-size\": \"<'max-width'>\",\n        \"max-lines\": \"none|<integer>\",\n        \"max-width\": \"none|<length-percentage>|min-content|max-content|fit-content|fit-content( <length-percentage> )|stretch|<-non-standard-size>\",\n        \"min-block-size\": \"<'min-width'>\",\n        \"min-height\": \"auto|<length>|<percentage>|min-content|max-content|fit-content|fit-content( <length-percentage> )|stretch|<-non-standard-size>\",\n        \"min-inline-size\": \"<'min-width'>\",\n        \"min-width\": \"auto|<length>|<percentage>|min-content|max-content|fit-content|fit-content( <length-percentage> )|stretch|<-non-standard-size>\",\n        \"mix-blend-mode\": \"<blend-mode>|plus-lighter\",\n        \"object-fit\": \"fill|contain|cover|none|scale-down\",\n        \"object-position\": \"<position>\",\n        \"offset\": \"[<'offset-position'>? [<'offset-path'> [<'offset-distance'>||<'offset-rotate'>]?]?]! [/ <'offset-anchor'>]?\",\n        \"offset-anchor\": \"auto|<position>\",\n        \"offset-distance\": \"<length-percentage>\",\n        \"offset-path\": \"none|<offset-path>||<coord-box>\",\n        \"offset-position\": \"normal|auto|<position>\",\n        \"offset-rotate\": \"[auto|reverse]||<angle>\",\n        \"opacity\": \"<alpha-value>\",\n        \"order\": \"<integer>\",\n        \"orphans\": \"<integer>\",\n        \"outline\": \"[<'outline-color'>||<'outline-style'>||<'outline-width'>]\",\n        \"outline-color\": \"<color>|invert\",\n        \"outline-offset\": \"<length>\",\n        \"outline-style\": \"auto|<'border-style'>\",\n        \"outline-width\": \"<line-width>\",\n        \"overflow\": \"[visible|hidden|clip|scroll|auto]{1,2}|<-non-standard-overflow>\",\n        \"overflow-anchor\": \"auto|none\",\n        \"overflow-block\": \"visible|hidden|clip|scroll|auto\",\n        \"overflow-clip-box\": \"padding-box|content-box\",\n        \"overflow-clip-margin\": \"<visual-box>||<length [0,∞]>\",\n        \"overflow-inline\": \"visible|hidden|clip|scroll|auto\",\n        \"overflow-wrap\": \"normal|break-word|anywhere\",\n        \"overflow-x\": \"visible|hidden|clip|scroll|auto\",\n        \"overflow-y\": \"visible|hidden|clip|scroll|auto\",\n        \"overscroll-behavior\": \"[contain|none|auto]{1,2}\",\n        \"overscroll-behavior-block\": \"contain|none|auto\",\n        \"overscroll-behavior-inline\": \"contain|none|auto\",\n        \"overscroll-behavior-x\": \"contain|none|auto\",\n        \"overscroll-behavior-y\": \"contain|none|auto\",\n        \"padding\": \"[<length>|<percentage>]{1,4}\",\n        \"padding-block\": \"<'padding-left'>{1,2}\",\n        \"padding-block-end\": \"<'padding-left'>\",\n        \"padding-block-start\": \"<'padding-left'>\",\n        \"padding-bottom\": \"<length>|<percentage>\",\n        \"padding-inline\": \"<'padding-left'>{1,2}\",\n        \"padding-inline-end\": \"<'padding-left'>\",\n        \"padding-inline-start\": \"<'padding-left'>\",\n        \"padding-left\": \"<length>|<percentage>\",\n        \"padding-right\": \"<length>|<percentage>\",\n        \"padding-top\": \"<length>|<percentage>\",\n        \"page\": \"auto|<custom-ident>\",\n        \"page-break-after\": \"auto|always|avoid|left|right|recto|verso\",\n        \"page-break-before\": \"auto|always|avoid|left|right|recto|verso\",\n        \"page-break-inside\": \"auto|avoid\",\n        \"paint-order\": \"normal|[fill||stroke||markers]\",\n        \"perspective\": \"none|<length>\",\n        \"perspective-origin\": \"<position>\",\n        \"place-content\": \"<'align-content'> <'justify-content'>?\",\n        \"place-items\": \"<'align-items'> <'justify-items'>?\",\n        \"place-self\": \"<'align-self'> <'justify-self'>?\",\n        \"pointer-events\": \"auto|none|visiblePainted|visibleFill|visibleStroke|visible|painted|fill|stroke|all|inherit\",\n        \"position\": \"static|relative|absolute|sticky|fixed|-webkit-sticky\",\n        \"print-color-adjust\": \"economy|exact\",\n        \"quotes\": \"none|auto|[<string> <string>]+\",\n        \"resize\": \"none|both|horizontal|vertical|block|inline\",\n        \"right\": \"<length>|<percentage>|auto\",\n        \"rotate\": \"none|<angle>|[x|y|z|<number>{3}]&&<angle>\",\n        \"row-gap\": \"normal|<length-percentage>\",\n        \"ruby-align\": \"start|center|space-between|space-around\",\n        \"ruby-merge\": \"separate|collapse|auto\",\n        \"ruby-position\": \"[alternate||[over|under]]|inter-character\",\n        \"scale\": \"none|<number>{1,3}\",\n        \"scrollbar-color\": \"auto|<color>{2}\",\n        \"scrollbar-gutter\": \"auto|stable&&both-edges?\",\n        \"scrollbar-width\": \"auto|thin|none\",\n        \"scroll-behavior\": \"auto|smooth\",\n        \"scroll-margin\": \"<length>{1,4}\",\n        \"scroll-margin-block\": \"<length>{1,2}\",\n        \"scroll-margin-block-start\": \"<length>\",\n        \"scroll-margin-block-end\": \"<length>\",\n        \"scroll-margin-bottom\": \"<length>\",\n        \"scroll-margin-inline\": \"<length>{1,2}\",\n        \"scroll-margin-inline-start\": \"<length>\",\n        \"scroll-margin-inline-end\": \"<length>\",\n        \"scroll-margin-left\": \"<length>\",\n        \"scroll-margin-right\": \"<length>\",\n        \"scroll-margin-top\": \"<length>\",\n        \"scroll-padding\": \"[auto|<length-percentage>]{1,4}\",\n        \"scroll-padding-block\": \"[auto|<length-percentage>]{1,2}\",\n        \"scroll-padding-block-start\": \"auto|<length-percentage>\",\n        \"scroll-padding-block-end\": \"auto|<length-percentage>\",\n        \"scroll-padding-bottom\": \"auto|<length-percentage>\",\n        \"scroll-padding-inline\": \"[auto|<length-percentage>]{1,2}\",\n        \"scroll-padding-inline-start\": \"auto|<length-percentage>\",\n        \"scroll-padding-inline-end\": \"auto|<length-percentage>\",\n        \"scroll-padding-left\": \"auto|<length-percentage>\",\n        \"scroll-padding-right\": \"auto|<length-percentage>\",\n        \"scroll-padding-top\": \"auto|<length-percentage>\",\n        \"scroll-snap-align\": \"[none|start|end|center]{1,2}\",\n        \"scroll-snap-coordinate\": \"none|<position>#\",\n        \"scroll-snap-destination\": \"<position>\",\n        \"scroll-snap-points-x\": \"none|repeat( <length-percentage> )\",\n        \"scroll-snap-points-y\": \"none|repeat( <length-percentage> )\",\n        \"scroll-snap-stop\": \"normal|always\",\n        \"scroll-snap-type\": \"none|[x|y|block|inline|both] [mandatory|proximity]?\",\n        \"scroll-snap-type-x\": \"none|mandatory|proximity\",\n        \"scroll-snap-type-y\": \"none|mandatory|proximity\",\n        \"scroll-timeline\": \"[<'scroll-timeline-name'>||<'scroll-timeline-axis'>]#\",\n        \"scroll-timeline-axis\": \"[block|inline|vertical|horizontal]#\",\n        \"scroll-timeline-name\": \"none|<custom-ident>#\",\n        \"shape-image-threshold\": \"<alpha-value>\",\n        \"shape-margin\": \"<length-percentage>\",\n        \"shape-outside\": \"none|[<shape-box>||<basic-shape>]|<image>\",\n        \"tab-size\": \"<integer>|<length>\",\n        \"table-layout\": \"auto|fixed\",\n        \"text-align\": \"start|end|left|right|center|justify|match-parent\",\n        \"text-align-last\": \"auto|start|end|left|right|center|justify\",\n        \"text-combine-upright\": \"none|all|[digits <integer>?]\",\n        \"text-decoration\": \"<'text-decoration-line'>||<'text-decoration-style'>||<'text-decoration-color'>||<'text-decoration-thickness'>\",\n        \"text-decoration-color\": \"<color>\",\n        \"text-decoration-line\": \"none|[underline||overline||line-through||blink]|spelling-error|grammar-error\",\n        \"text-decoration-skip\": \"none|[objects||[spaces|[leading-spaces||trailing-spaces]]||edges||box-decoration]\",\n        \"text-decoration-skip-ink\": \"auto|all|none\",\n        \"text-decoration-style\": \"solid|double|dotted|dashed|wavy\",\n        \"text-decoration-thickness\": \"auto|from-font|<length>|<percentage>\",\n        \"text-emphasis\": \"<'text-emphasis-style'>||<'text-emphasis-color'>\",\n        \"text-emphasis-color\": \"<color>\",\n        \"text-emphasis-position\": \"[over|under]&&[right|left]\",\n        \"text-emphasis-style\": \"none|[[filled|open]||[dot|circle|double-circle|triangle|sesame]]|<string>\",\n        \"text-indent\": \"<length-percentage>&&hanging?&&each-line?\",\n        \"text-justify\": \"auto|inter-character|inter-word|none\",\n        \"text-orientation\": \"mixed|upright|sideways\",\n        \"text-overflow\": \"[clip|ellipsis|<string>]{1,2}\",\n        \"text-rendering\": \"auto|optimizeSpeed|optimizeLegibility|geometricPrecision\",\n        \"text-shadow\": \"none|<shadow-t>#\",\n        \"text-size-adjust\": \"none|auto|<percentage>\",\n        \"text-transform\": \"none|capitalize|uppercase|lowercase|full-width|full-size-kana\",\n        \"text-underline-offset\": \"auto|<length>|<percentage>\",\n        \"text-underline-position\": \"auto|from-font|[under||[left|right]]\",\n        \"text-wrap\": \"wrap|nowrap|balance|stable|pretty\",\n        \"timeline-scope\": \"none|<dashed-ident>#\",\n        \"top\": \"<length>|<percentage>|auto\",\n        \"touch-action\": \"auto|none|[[pan-x|pan-left|pan-right]||[pan-y|pan-up|pan-down]||pinch-zoom]|manipulation\",\n        \"transform\": \"none|<transform-list>\",\n        \"transform-box\": \"content-box|border-box|fill-box|stroke-box|view-box\",\n        \"transform-origin\": \"[<length-percentage>|left|center|right|top|bottom]|[[<length-percentage>|left|center|right]&&[<length-percentage>|top|center|bottom]] <length>?\",\n        \"transform-style\": \"flat|preserve-3d\",\n        \"transition\": \"<single-transition>#\",\n        \"transition-delay\": \"<time>#\",\n        \"transition-duration\": \"<time>#\",\n        \"transition-property\": \"none|<single-transition-property>#\",\n        \"transition-timing-function\": \"<easing-function>#\",\n        \"translate\": \"none|<length-percentage> [<length-percentage> <length>?]?\",\n        \"unicode-bidi\": \"normal|embed|isolate|bidi-override|isolate-override|plaintext|-moz-isolate|-moz-isolate-override|-moz-plaintext|-webkit-isolate|-webkit-isolate-override|-webkit-plaintext\",\n        \"user-select\": \"auto|text|none|contain|all\",\n        \"vertical-align\": \"baseline|sub|super|text-top|text-bottom|middle|top|bottom|<percentage>|<length>\",\n        \"view-timeline\": \"[<'view-timeline-name'> <'view-timeline-axis'>?]#\",\n        \"view-timeline-axis\": \"[block|inline|x|y]#\",\n        \"view-timeline-inset\": \"[[auto|<length-percentage>]{1,2}]#\",\n        \"view-timeline-name\": \"none|<dashed-ident>#\",\n        \"view-transition-name\": \"none|<custom-ident>\",\n        \"visibility\": \"visible|hidden|collapse\",\n        \"white-space\": \"normal|pre|nowrap|pre-wrap|pre-line|break-spaces|[<'white-space-collapse'>||<'text-wrap'>||<'white-space-trim'>]\",\n        \"white-space-collapse\": \"collapse|discard|preserve|preserve-breaks|preserve-spaces|break-spaces\",\n        \"white-space-trim\": \"none|discard-before||discard-after||discard-inner\",\n        \"widows\": \"<integer>\",\n        \"width\": \"auto|<length>|<percentage>|min-content|max-content|fit-content|fit-content( <length-percentage> )|stretch|<-non-standard-size>\",\n        \"will-change\": \"auto|<animateable-feature>#\",\n        \"word-break\": \"normal|break-all|keep-all|break-word\",\n        \"word-spacing\": \"normal|<length>\",\n        \"word-wrap\": \"normal|break-word\",\n        \"writing-mode\": \"horizontal-tb|vertical-rl|vertical-lr|sideways-rl|sideways-lr|<svg-writing-mode>\",\n        \"z-index\": \"auto|<integer>\",\n        \"zoom\": \"normal|reset|<number>|<percentage>\",\n        \"-moz-background-clip\": \"padding|border\",\n        \"-moz-border-radius-bottomleft\": \"<'border-bottom-left-radius'>\",\n        \"-moz-border-radius-bottomright\": \"<'border-bottom-right-radius'>\",\n        \"-moz-border-radius-topleft\": \"<'border-top-left-radius'>\",\n        \"-moz-border-radius-topright\": \"<'border-bottom-right-radius'>\",\n        \"-moz-control-character-visibility\": \"visible|hidden\",\n        \"-moz-osx-font-smoothing\": \"auto|grayscale\",\n        \"-moz-user-select\": \"none|text|all|-moz-none\",\n        \"-ms-flex-align\": \"start|end|center|baseline|stretch\",\n        \"-ms-flex-item-align\": \"auto|start|end|center|baseline|stretch\",\n        \"-ms-flex-line-pack\": \"start|end|center|justify|distribute|stretch\",\n        \"-ms-flex-negative\": \"<'flex-shrink'>\",\n        \"-ms-flex-pack\": \"start|end|center|justify|distribute\",\n        \"-ms-flex-order\": \"<integer>\",\n        \"-ms-flex-positive\": \"<'flex-grow'>\",\n        \"-ms-flex-preferred-size\": \"<'flex-basis'>\",\n        \"-ms-interpolation-mode\": \"nearest-neighbor|bicubic\",\n        \"-ms-grid-column-align\": \"start|end|center|stretch\",\n        \"-ms-grid-row-align\": \"start|end|center|stretch\",\n        \"-ms-hyphenate-limit-last\": \"none|always|column|page|spread\",\n        \"-webkit-background-clip\": \"[<box>|border|padding|content|text]#\",\n        \"-webkit-column-break-after\": \"always|auto|avoid\",\n        \"-webkit-column-break-before\": \"always|auto|avoid\",\n        \"-webkit-column-break-inside\": \"always|auto|avoid\",\n        \"-webkit-font-smoothing\": \"auto|none|antialiased|subpixel-antialiased\",\n        \"-webkit-mask-box-image\": \"[<url>|<gradient>|none] [<length-percentage>{4} <-webkit-mask-box-repeat>{2}]?\",\n        \"-webkit-print-color-adjust\": \"economy|exact\",\n        \"-webkit-text-security\": \"none|circle|disc|square\",\n        \"-webkit-user-drag\": \"none|element|auto\",\n        \"-webkit-user-select\": \"auto|none|text|all\",\n        \"alignment-baseline\": \"auto|baseline|before-edge|text-before-edge|middle|central|after-edge|text-after-edge|ideographic|alphabetic|hanging|mathematical\",\n        \"baseline-shift\": \"baseline|sub|super|<svg-length>\",\n        \"behavior\": \"<url>+\",\n        \"clip-rule\": \"nonzero|evenodd\",\n        \"cue\": \"<'cue-before'> <'cue-after'>?\",\n        \"cue-after\": \"<url> <decibel>?|none\",\n        \"cue-before\": \"<url> <decibel>?|none\",\n        \"dominant-baseline\": \"auto|use-script|no-change|reset-size|ideographic|alphabetic|hanging|mathematical|central|middle|text-after-edge|text-before-edge\",\n        \"fill\": \"<paint>\",\n        \"fill-opacity\": \"<number-zero-one>\",\n        \"fill-rule\": \"nonzero|evenodd\",\n        \"glyph-orientation-horizontal\": \"<angle>\",\n        \"glyph-orientation-vertical\": \"<angle>\",\n        \"kerning\": \"auto|<svg-length>\",\n        \"marker\": \"none|<url>\",\n        \"marker-end\": \"none|<url>\",\n        \"marker-mid\": \"none|<url>\",\n        \"marker-start\": \"none|<url>\",\n        \"pause\": \"<'pause-before'> <'pause-after'>?\",\n        \"pause-after\": \"<time>|none|x-weak|weak|medium|strong|x-strong\",\n        \"pause-before\": \"<time>|none|x-weak|weak|medium|strong|x-strong\",\n        \"rest\": \"<'rest-before'> <'rest-after'>?\",\n        \"rest-after\": \"<time>|none|x-weak|weak|medium|strong|x-strong\",\n        \"rest-before\": \"<time>|none|x-weak|weak|medium|strong|x-strong\",\n        \"shape-rendering\": \"auto|optimizeSpeed|crispEdges|geometricPrecision\",\n        \"src\": \"[<url> [format( <string># )]?|local( <family-name> )]#\",\n        \"speak\": \"auto|never|always\",\n        \"speak-as\": \"normal|spell-out||digits||[literal-punctuation|no-punctuation]\",\n        \"stroke\": \"<paint>\",\n        \"stroke-dasharray\": \"none|[<svg-length>+]#\",\n        \"stroke-dashoffset\": \"<svg-length>\",\n        \"stroke-linecap\": \"butt|round|square\",\n        \"stroke-linejoin\": \"miter|round|bevel\",\n        \"stroke-miterlimit\": \"<number-one-or-greater>\",\n        \"stroke-opacity\": \"<number-zero-one>\",\n        \"stroke-width\": \"<svg-length>\",\n        \"text-anchor\": \"start|middle|end\",\n        \"unicode-range\": \"<urange>#\",\n        \"voice-balance\": \"<number>|left|center|right|leftwards|rightwards\",\n        \"voice-duration\": \"auto|<time>\",\n        \"voice-family\": \"[[<family-name>|<generic-voice>] ,]* [<family-name>|<generic-voice>]|preserve\",\n        \"voice-pitch\": \"<frequency>&&absolute|[[x-low|low|medium|high|x-high]||[<frequency>|<semitones>|<percentage>]]\",\n        \"voice-range\": \"<frequency>&&absolute|[[x-low|low|medium|high|x-high]||[<frequency>|<semitones>|<percentage>]]\",\n        \"voice-rate\": \"[normal|x-slow|slow|medium|fast|x-fast]||<percentage>\",\n        \"voice-stress\": \"normal|strong|moderate|none|reduced\",\n        \"voice-volume\": \"silent|[[x-soft|soft|medium|loud|x-loud]||<decibel>]\"\n    },\n    \"atrules\": {\n        \"charset\": {\n            \"prelude\": \"<string>\",\n            \"descriptors\": null\n        },\n        \"counter-style\": {\n            \"prelude\": \"<counter-style-name>\",\n            \"descriptors\": {\n                \"additive-symbols\": \"[<integer>&&<symbol>]#\",\n                \"fallback\": \"<counter-style-name>\",\n                \"negative\": \"<symbol> <symbol>?\",\n                \"pad\": \"<integer>&&<symbol>\",\n                \"prefix\": \"<symbol>\",\n                \"range\": \"[[<integer>|infinite]{2}]#|auto\",\n                \"speak-as\": \"auto|bullets|numbers|words|spell-out|<counter-style-name>\",\n                \"suffix\": \"<symbol>\",\n                \"symbols\": \"<symbol>+\",\n                \"system\": \"cyclic|numeric|alphabetic|symbolic|additive|[fixed <integer>?]|[extends <counter-style-name>]\"\n            }\n        },\n        \"document\": {\n            \"prelude\": \"[<url>|url-prefix( <string> )|domain( <string> )|media-document( <string> )|regexp( <string> )]#\",\n            \"descriptors\": null\n        },\n        \"font-palette-values\": {\n            \"prelude\": \"<dashed-ident>\",\n            \"descriptors\": {\n                \"base-palette\": \"light|dark|<integer [0,∞]>\",\n                \"font-family\": \"<family-name>#\",\n                \"override-colors\": \"[<integer [0,∞]> <absolute-color-base>]#\"\n            }\n        },\n        \"font-face\": {\n            \"prelude\": null,\n            \"descriptors\": {\n                \"ascent-override\": \"normal|<percentage>\",\n                \"descent-override\": \"normal|<percentage>\",\n                \"font-display\": \"[auto|block|swap|fallback|optional]\",\n                \"font-family\": \"<family-name>\",\n                \"font-feature-settings\": \"normal|<feature-tag-value>#\",\n                \"font-variation-settings\": \"normal|[<string> <number>]#\",\n                \"font-stretch\": \"<font-stretch-absolute>{1,2}\",\n                \"font-style\": \"normal|italic|oblique <angle>{0,2}\",\n                \"font-weight\": \"<font-weight-absolute>{1,2}\",\n                \"font-variant\": \"normal|none|[<common-lig-values>||<discretionary-lig-values>||<historical-lig-values>||<contextual-alt-values>||stylistic( <feature-value-name> )||historical-forms||styleset( <feature-value-name># )||character-variant( <feature-value-name># )||swash( <feature-value-name> )||ornaments( <feature-value-name> )||annotation( <feature-value-name> )||[small-caps|all-small-caps|petite-caps|all-petite-caps|unicase|titling-caps]||<numeric-figure-values>||<numeric-spacing-values>||<numeric-fraction-values>||ordinal||slashed-zero||<east-asian-variant-values>||<east-asian-width-values>||ruby]\",\n                \"line-gap-override\": \"normal|<percentage>\",\n                \"size-adjust\": \"<percentage>\",\n                \"src\": \"[<url> [format( <string># )]?|local( <family-name> )]#\",\n                \"unicode-range\": \"<urange>#\"\n            }\n        },\n        \"font-feature-values\": {\n            \"prelude\": \"<family-name>#\",\n            \"descriptors\": null\n        },\n        \"import\": {\n            \"prelude\": \"[<string>|<url>] [layer|layer( <layer-name> )]? [supports( [<supports-condition>|<declaration>] )]? <media-query-list>?\",\n            \"descriptors\": null\n        },\n        \"keyframes\": {\n            \"prelude\": \"<keyframes-name>\",\n            \"descriptors\": null\n        },\n        \"layer\": {\n            \"prelude\": \"[<layer-name>#|<layer-name>?]\",\n            \"descriptors\": null\n        },\n        \"media\": {\n            \"prelude\": \"<media-query-list>\",\n            \"descriptors\": null\n        },\n        \"namespace\": {\n            \"prelude\": \"<namespace-prefix>? [<string>|<url>]\",\n            \"descriptors\": null\n        },\n        \"page\": {\n            \"prelude\": \"<page-selector-list>\",\n            \"descriptors\": {\n                \"bleed\": \"auto|<length>\",\n                \"marks\": \"none|[crop||cross]\",\n                \"page-orientation\": \"upright|rotate-left|rotate-right\",\n                \"size\": \"<length>{1,2}|auto|[<page-size>||[portrait|landscape]]\"\n            }\n        },\n        \"property\": {\n            \"prelude\": \"<custom-property-name>\",\n            \"descriptors\": {\n                \"syntax\": \"<string>\",\n                \"inherits\": \"true|false\",\n                \"initial-value\": \"<string>\"\n            }\n        },\n        \"supports\": {\n            \"prelude\": \"<supports-condition>\",\n            \"descriptors\": null\n        },\n        \"viewport\": {\n            \"prelude\": null,\n            \"descriptors\": {\n                \"height\": \"<viewport-length>{1,2}\",\n                \"max-height\": \"<viewport-length>\",\n                \"max-width\": \"<viewport-length>\",\n                \"max-zoom\": \"auto|<number>|<percentage>\",\n                \"min-height\": \"<viewport-length>\",\n                \"min-width\": \"<viewport-length>\",\n                \"min-zoom\": \"auto|<number>|<percentage>\",\n                \"orientation\": \"auto|portrait|landscape\",\n                \"user-zoom\": \"zoom|fixed\",\n                \"viewport-fit\": \"auto|contain|cover\",\n                \"width\": \"<viewport-length>{1,2}\",\n                \"zoom\": \"auto|<number>|<percentage>\"\n            }\n        },\n        \"container\": {\n            \"prelude\": \"[<container-name>]? <container-condition>\",\n            \"descriptors\": null\n        },\n        \"nest\": {\n            \"prelude\": \"<complex-selector-list>\",\n            \"descriptors\": null\n        },\n        \"scope\": {\n            \"prelude\": \"[( <scope-start> )]? [to ( <scope-end> )]?\",\n            \"descriptors\": null\n        }\n    }\n};","import {\n    Ident,\n    String as StringToken,\n    Number as NumberToken,\n    Function as FunctionToken,\n    Url,\n    Hash,\n    Dimension,\n    Percentage,\n    LeftParenthesis,\n    LeftSquareBracket,\n    Comma,\n    Delim\n} from '../../tokenizer/index.js';\n\nconst NUMBERSIGN = 0x0023;  // U+0023 NUMBER SIGN (#)\nconst ASTERISK = 0x002A;    // U+002A ASTERISK (*)\nconst PLUSSIGN = 0x002B;    // U+002B PLUS SIGN (+)\nconst HYPHENMINUS = 0x002D; // U+002D HYPHEN-MINUS (-)\nconst SOLIDUS = 0x002F;     // U+002F SOLIDUS (/)\nconst U = 0x0075;           // U+0075 LATIN SMALL LETTER U (u)\n\nexport default function defaultRecognizer(context) {\n    switch (this.tokenType) {\n        case Hash:\n            return this.Hash();\n\n        case Comma:\n            return this.Operator();\n\n        case LeftParenthesis:\n            return this.Parentheses(this.readSequence, context.recognizer);\n\n        case LeftSquareBracket:\n            return this.Brackets(this.readSequence, context.recognizer);\n\n        case StringToken:\n            return this.String();\n\n        case Dimension:\n            return this.Dimension();\n\n        case Percentage:\n            return this.Percentage();\n\n        case NumberToken:\n            return this.Number();\n\n        case FunctionToken:\n            return this.cmpStr(this.tokenStart, this.tokenEnd, 'url(')\n                ? this.Url()\n                : this.Function(this.readSequence, context.recognizer);\n\n        case Url:\n            return this.Url();\n\n        case Ident:\n            // check for unicode range, it should start with u+ or U+\n            if (this.cmpChar(this.tokenStart, U) &&\n                this.cmpChar(this.tokenStart + 1, PLUSSIGN)) {\n                return this.UnicodeRange();\n            } else {\n                return this.Identifier();\n            }\n\n        case Delim: {\n            const code = this.charCodeAt(this.tokenStart);\n\n            if (code === SOLIDUS ||\n                code === ASTERISK ||\n                code === PLUSSIGN ||\n                code === HYPHENMINUS) {\n                return this.Operator(); // TODO: replace with Delim\n            }\n\n            // TODO: produce a node with Delim node type\n\n            if (code === NUMBERSIGN) {\n                this.error('Hex or identifier is expected', this.tokenStart + 1);\n            }\n\n            break;\n        }\n    }\n};\n","import getNode from './default.js';\n\nexport default {\n    getNode\n};\n","import {\n    Delim,\n    Ident,\n    Dimension,\n    Percentage,\n    Number as NumberToken,\n    Hash,\n    Colon,\n    LeftSquareBracket\n} from '../../tokenizer/index.js';\n\nconst NUMBERSIGN = 0x0023;      // U+0023 NUMBER SIGN (#)\nconst AMPERSAND = 0x0026;       // U+0026 AMPERSAND (&)\nconst ASTERISK = 0x002A;        // U+002A ASTERISK (*)\nconst PLUSSIGN = 0x002B;        // U+002B PLUS SIGN (+)\nconst SOLIDUS = 0x002F;         // U+002F SOLIDUS (/)\nconst FULLSTOP = 0x002E;        // U+002E FULL STOP (.)\nconst GREATERTHANSIGN = 0x003E; // U+003E GREATER-THAN SIGN (>)\nconst VERTICALLINE = 0x007C;    // U+007C VERTICAL LINE (|)\nconst TILDE = 0x007E;           // U+007E TILDE (~)\n\nfunction onWhiteSpace(next, children) {\n    if (children.last !== null && children.last.type !== 'Combinator' &&\n        next !== null && next.type !== 'Combinator') {\n        children.push({  // FIXME: this.Combinator() should be used instead\n            type: 'Combinator',\n            loc: null,\n            name: ' '\n        });\n    }\n}\n\nfunction getNode() {\n    switch (this.tokenType) {\n        case LeftSquareBracket:\n            return this.AttributeSelector();\n\n        case Hash:\n            return this.IdSelector();\n\n        case Colon:\n            if (this.lookupType(1) === Colon) {\n                return this.PseudoElementSelector();\n            } else {\n                return this.PseudoClassSelector();\n            }\n\n        case Ident:\n            return this.TypeSelector();\n\n        case NumberToken:\n        case Percentage:\n            return this.Percentage();\n\n        case Dimension:\n            // throws when .123ident\n            if (this.charCodeAt(this.tokenStart) === FULLSTOP) {\n                this.error('Identifier is expected', this.tokenStart + 1);\n            }\n            break;\n\n        case Delim: {\n            const code = this.charCodeAt(this.tokenStart);\n\n            switch (code) {\n                case PLUSSIGN:\n                case GREATERTHANSIGN:\n                case TILDE:\n                case SOLIDUS:  // /deep/\n                    return this.Combinator();\n\n                case FULLSTOP:\n                    return this.ClassSelector();\n\n                case ASTERISK:\n                case VERTICALLINE:\n                    return this.TypeSelector();\n\n                case NUMBERSIGN:\n                    return this.IdSelector();\n\n                case AMPERSAND:\n                    return this.NestingSelector();\n            }\n\n            break;\n        }\n    }\n};\n\nexport default {\n    onWhiteSpace,\n    getNode\n};\n","import getNode from './default.js';\nimport expressionFn from '../function/expression.js';\nimport varFn from '../function/var.js';\n\nfunction isPlusMinusOperator(node) {\n    return (\n        node !== null &&\n        node.type === 'Operator' &&\n        (node.value[node.value.length - 1] === '-' || node.value[node.value.length - 1] === '+')\n    );\n}\n\nexport default {\n    getNode,\n    onWhiteSpace(next, children) {\n        if (isPlusMinusOperator(next)) {\n            next.value = ' ' + next.value;\n        }\n        if (isPlusMinusOperator(children.last)) {\n            children.last.value += ' ';\n        }\n    },\n    'expression': expressionFn,\n    'var': varFn\n};\n","// legacy IE function\n// expression( <any-value> )\nexport default function() {\n    return this.createSingleNodeList(\n        this.Raw(null, false)\n    );\n}\n","import { Comma, WhiteSpace } from '../../tokenizer/index.js';\n\n// var( <ident> , <value>? )\nexport default function() {\n    const children = this.createList();\n\n    this.skipSC();\n\n    // NOTE: Don't check more than a first argument is an ident, rest checks are for lexer\n    children.push(this.Identifier());\n\n    this.skipSC();\n\n    if (this.tokenType === Comma) {\n        children.push(this.Operator());\n\n        const startIndex = this.tokenIndex;\n        const value = this.parseCustomProperty\n            ? this.Value(null)\n            : this.Raw(this.consumeUntilExclamationMarkOrSemicolon, false);\n\n        if (value.type === 'Value' && value.children.isEmpty) {\n            for (let offset = startIndex - this.tokenIndex; offset <= 0; offset++) {\n                if (this.lookupType(offset) === WhiteSpace) {\n                    value.children.appendData({\n                        type: 'WhiteSpace',\n                        loc: null,\n                        value: ' '\n                    });\n                    break;\n                }\n            }\n        }\n\n        children.push(value);\n    }\n\n    return children;\n};\n","import { Ident } from '../../tokenizer/index.js';\n\n// https://drafts.csswg.org/css-contain-3/#container-rule\n// The keywords `none`, `and`, `not`, and `or` are excluded from the <custom-ident> above.\nconst nonContainerNameKeywords = new Set(['none', 'and', 'not', 'or']);\n\nexport default {\n    parse: {\n        prelude() {\n            const children = this.createList();\n\n            if (this.tokenType === Ident) {\n                const name = this.substring(this.tokenStart, this.tokenEnd);\n\n                if (!nonContainerNameKeywords.has(name.toLowerCase())) {\n                    children.push(this.Identifier());\n                }\n            }\n\n            children.push(this.Condition('container'));\n\n            return children;\n        },\n        block(nested = false) {\n            return this.Block(nested);\n        }\n    }\n};\n","import {\n    String as StringToken,\n    Ident,\n    Url,\n    Function as FunctionToken,\n    LeftParenthesis,\n    RightParenthesis\n} from '../../tokenizer/index.js';\n\nfunction parseWithFallback(parse, fallback) {\n    return this.parseWithFallback(\n        () => {\n            try {\n                return parse.call(this);\n            } finally {\n                this.skipSC();\n                if (this.lookupNonWSType(0) !== RightParenthesis) {\n                    this.error();\n                }\n            }\n        },\n        fallback || (() => this.Raw(null, true))\n    );\n}\n\nconst parseFunctions = {\n    layer() {\n        this.skipSC();\n\n        const children = this.createList();\n        const node = parseWithFallback.call(this, this.Layer);\n\n        if (node.type !== 'Raw' || node.value !== '') {\n            children.push(node);\n        }\n\n        return children;\n    },\n    supports() {\n        this.skipSC();\n\n        const children = this.createList();\n        const node = parseWithFallback.call(\n            this,\n            this.Declaration,\n            () => parseWithFallback.call(this, () => this.Condition('supports'))\n        );\n\n        if (node.type !== 'Raw' || node.value !== '') {\n            children.push(node);\n        }\n\n        return children;\n    }\n};\n\nexport default {\n    parse: {\n        prelude() {\n            const children = this.createList();\n\n            switch (this.tokenType) {\n                case StringToken:\n                    children.push(this.String());\n                    break;\n\n                case Url:\n                case FunctionToken:\n                    children.push(this.Url());\n                    break;\n\n                default:\n                    this.error('String or url() is expected');\n            }\n\n            this.skipSC();\n\n            if (this.tokenType === Ident &&\n                this.cmpStr(this.tokenStart, this.tokenEnd, 'layer')) {\n                children.push(this.Identifier());\n            } else if (\n                this.tokenType === FunctionToken &&\n                this.cmpStr(this.tokenStart, this.tokenEnd, 'layer(')\n            ) {\n                children.push(this.Function(null, parseFunctions));\n            }\n\n            this.skipSC();\n\n            if (this.tokenType === FunctionToken &&\n                this.cmpStr(this.tokenStart, this.tokenEnd, 'supports(')) {\n                children.push(this.Function(null, parseFunctions));\n            }\n\n            if (this.lookupNonWSType(0) === Ident ||\n                this.lookupNonWSType(0) === LeftParenthesis) {\n                children.push(this.MediaQueryList());\n            }\n\n            return children;\n        },\n        block: null\n    }\n};\n","const selectorList = {\n    parse() {\n        return this.createSingleNodeList(\n            this.SelectorList()\n        );\n    }\n};\n\nconst selector = {\n    parse() {\n        return this.createSingleNodeList(\n            this.Selector()\n        );\n    }\n};\n\nconst identList = {\n    parse() {\n        return this.createSingleNodeList(\n            this.Identifier()\n        );\n    }\n};\n\nconst nth = {\n    parse() {\n        return this.createSingleNodeList(\n            this.Nth()\n        );\n    }\n};\n\nexport default {\n    'dir': identList,\n    'has': selectorList,\n    'lang': identList,\n    'matches': selectorList,\n    'is': selectorList,\n    '-moz-any': selectorList,\n    '-webkit-any': selectorList,\n    'where': selectorList,\n    'not': selectorList,\n    'nth-child': nth,\n    'nth-last-child': nth,\n    'nth-last-of-type': nth,\n    'nth-of-type': nth,\n    'slotted': selector,\n    'host': selector,\n    'host-context': selector\n};\n","import createSyntax from './create.js';\nimport lexerConfig from './config/lexer.js';\nimport parserConfig from './config/parser.js';\nimport walkerConfig from './config/walker.js';\n\nexport default createSyntax({\n    ...lexerConfig,\n    ...parserConfig,\n    ...walkerConfig\n});\n","import * as scope from '../scope/index.js';\nimport atrule from '../atrule/index.js';\nimport pseudo from '../pseudo/index.js';\nimport * as node from '../node/index-parse.js';\n\nexport default {\n    parseContext: {\n        default: 'StyleSheet',\n        stylesheet: 'StyleSheet',\n        atrule: 'Atrule',\n        atrulePrelude(options) {\n            return this.AtrulePrelude(options.atrule ? String(options.atrule) : null);\n        },\n        mediaQueryList: 'MediaQueryList',\n        mediaQuery: 'MediaQuery',\n        condition(options) {\n            return this.Condition(options.kind);\n        },\n        rule: 'Rule',\n        selectorList: 'SelectorList',\n        selector: 'Selector',\n        block() {\n            return this.Block(true);\n        },\n        declarationList: 'DeclarationList',\n        declaration: 'Declaration',\n        value: 'Value'\n    },\n    features: {\n        supports: {\n            selector() {\n                return this.Selector();\n            }\n        },\n        container: {\n            style() {\n                return this.Declaration();\n            }\n        }\n    },\n    scope,\n    atrule,\n    pseudo,\n    node\n};\n","import container from './container.js';\nimport fontFace from './font-face.js';\nimport importAtrule from './import.js';\nimport layer from './layer.js';\nimport media from './media.js';\nimport nest from './nest.js';\nimport page from './page.js';\nimport scope from './scope.js';\nimport startingStyle from './starting-style.js';\nimport supports from './supports.js';\n\nexport default {\n    container,\n    'font-face': fontFace,\n    import: importAtrule,\n    layer,\n    media,\n    nest,\n    page,\n    scope,\n    'starting-style': startingStyle,\n    supports\n};\n","export default {\n    parse: {\n        prelude: null,\n        block() {\n            return this.Block(true);\n        }\n    }\n};\n","export default {\n    parse: {\n        prelude() {\n            return this.createSingleNodeList(\n                this.LayerList()\n            );\n        },\n        block() {\n            return this.Block(false);\n        }\n    }\n};\n","export default {\n    parse: {\n        prelude() {\n            return this.createSingleNodeList(\n                this.MediaQueryList()\n            );\n        },\n        block(nested = false) {\n            return this.Block(nested);\n        }\n    }\n};\n","export default {\n    parse: {\n        prelude() {\n            return this.createSingleNodeList(\n                this.SelectorList()\n            );\n        },\n        block() {\n            return this.Block(true);\n        }\n    }\n};\n","export default {\n    parse: {\n        prelude() {\n            return this.createSingleNodeList(\n                this.SelectorList()\n            );\n        },\n        block() {\n            return this.Block(true);\n        }\n    }\n};\n","export default {\n    parse: {\n        prelude() {\n            return this.createSingleNodeList(\n                this.Scope()\n            );\n        },\n        block(nested = false) {\n            return this.Block(nested);\n        }\n    }\n};\n","export default {\n    parse: {\n        prelude: null,\n        block(nested = false) {\n            return this.Block(nested);\n        }\n    }\n};\n","export default {\n    parse: {\n        prelude() {\n            return this.createSingleNodeList(\n                this.Condition('supports')\n            );\n        },\n        block(nested = false) {\n            return this.Block(nested);\n        }\n    }\n};\n","import * as node from '../node/index.js';\n\nexport default {\n    node\n};\n","import syntax from './syntax/index.js';\n\nexport * from './version.js';\nexport { default as createSyntax } from './syntax/create.js';\nexport { List } from './utils/List.js';\nexport { Lexer } from './lexer/Lexer.js';\nexport { tokenTypes, tokenNames, TokenStream } from './tokenizer/index.js';\nexport * as definitionSyntax from './definition-syntax/index.js';\nexport { clone } from './utils/clone.js';\nexport * from './utils/names.js';\nexport * as ident from './utils/ident.js';\nexport * as string from './utils/string.js';\nexport * as url from './utils/url.js';\nexport const {\n    tokenize,\n    parse,\n    generate,\n    lexer,\n    createLexer,\n\n    walk,\n    find,\n    findLast,\n    findAll,\n\n    toPlainObject,\n    fromPlainObject,\n\n    fork\n} = syntax;\n",null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,"'use strict';\n\n\nvar TYPED_OK =  (typeof Uint8Array !== 'undefined') &&\n                (typeof Uint16Array !== 'undefined') &&\n                (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n  var sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    var source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (var p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n  if (buf.length === size) { return buf; }\n  if (buf.subarray) { return buf.subarray(0, size); }\n  buf.length = size;\n  return buf;\n};\n\n\nvar fnTyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    if (src.subarray && dest.subarray) {\n      dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n      return;\n    }\n    // Fallback to ordinary array\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    var i, l, len, pos, chunk, result;\n\n    // calculate data length\n    len = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      len += chunks[i].length;\n    }\n\n    // join chunks\n    result = new Uint8Array(len);\n    pos = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      chunk = chunks[i];\n      result.set(chunk, pos);\n      pos += chunk.length;\n    }\n\n    return result;\n  }\n};\n\nvar fnUntyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    return [].concat.apply([], chunks);\n  }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n  if (on) {\n    exports.Buf8  = Uint8Array;\n    exports.Buf16 = Uint16Array;\n    exports.Buf32 = Int32Array;\n    exports.assign(exports, fnTyped);\n  } else {\n    exports.Buf8  = Array;\n    exports.Buf16 = Array;\n    exports.Buf32 = Array;\n    exports.assign(exports, fnUntyped);\n  }\n};\n\nexports.setTyped(TYPED_OK);\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED          = 1;\n//var Z_HUFFMAN_ONLY      = 2;\n//var Z_RLE               = 3;\nvar Z_FIXED               = 4;\n//var Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY              = 0;\nvar Z_TEXT                = 1;\n//var Z_ASCII             = 1; // = Z_TEXT\nvar Z_UNKNOWN             = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES    = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH    = 3;\nvar MAX_MATCH    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS      = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES       = 30;\n/* number of distance codes */\n\nvar BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK   = 256;\n/* end of block literal code */\n\nvar REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits =   /* extra bits for each length code */\n  [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];\n\nvar extra_dbits =   /* extra bits for each distance code */\n  [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];\n\nvar extra_blbits =  /* extra bits for each bit length code */\n  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n  [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree  = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nvar static_dtree  = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code    = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nvar _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length   = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist     = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction put_short(s, w) {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n}\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction send_bits(s, value, length) {\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n}\n\n\nfunction send_code(s, c, tree) {\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction bi_reverse(code, len) {\n  var res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction bi_flush(s) {\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n}\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nfunction gen_bitlen(s, desc)\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n{\n  var tree            = desc.dyn_tree;\n  var max_code        = desc.max_code;\n  var stree           = desc.stat_desc.static_tree;\n  var has_stree       = desc.stat_desc.has_stree;\n  var extra           = desc.stat_desc.extra_bits;\n  var base            = desc.stat_desc.extra_base;\n  var max_length      = desc.stat_desc.max_length;\n  var h;              /* heap index */\n  var n, m;           /* iterate over the tree elements */\n  var bits;           /* bit length */\n  var xbits;          /* extra bits */\n  var f;              /* frequency */\n  var overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Trace((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n}\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nfunction gen_codes(tree, max_code, bl_count)\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n{\n  var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n  var code = 0;              /* running code value */\n  var bits;                  /* bit index */\n  var n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS; bits++) {\n    next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    var len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n  var n;        /* iterates over tree elements */\n  var bits;     /* bit counter */\n  var length;   /* length value */\n  var code;     /* code value */\n  var dist;     /* distance index */\n  var bl_count = new Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES, MAX_BL_BITS);\n\n  //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n  var n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf    *buf;    /* the input data */\n//unsigned len;     /* its length */\n//int      header;  /* true if block header must be written */\n{\n  bi_windup(s);        /* align on byte boundary */\n\n  if (header) {\n    put_short(s, len);\n    put_short(s, ~len);\n  }\n//  while (len--) {\n//    put_byte(s, *buf++);\n//  }\n  utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n  s.pending += len;\n}\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction smaller(tree, n, m, depth) {\n  var _n2 = n * 2;\n  var _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction pqdownheap(s, tree, k)\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n{\n  var v = s.heap[k];\n  var j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n{\n  var dist;           /* distance of matched string */\n  var lc;             /* match length or unmatched char (if dist == 0) */\n  var lx = 0;         /* running index in l_buf */\n  var code;           /* the code to send */\n  var extra;          /* number of extra bits to send */\n\n  if (s.last_lit !== 0) {\n    do {\n      dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n      lc = s.pending_buf[s.l_buf + lx];\n      lx++;\n\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n      //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n      //       \"pendingBuf overflow\");\n\n    } while (lx < s.last_lit);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n}\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nfunction build_tree(s, desc)\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n{\n  var tree     = desc.dyn_tree;\n  var stree    = desc.stat_desc.static_tree;\n  var has_stree = desc.stat_desc.has_stree;\n  var elems    = desc.stat_desc.elems;\n  var n, m;          /* iterate over heap elements */\n  var max_code = -1; /* largest code with non zero frequency */\n  var node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n{\n  var n;                     /* iterates over all tree elements */\n  var prevlen = -1;          /* last emitted length */\n  var curlen;                /* length of current code */\n\n  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  var count = 0;             /* repeat count of the current code */\n  var max_count = 7;         /* max repeat count */\n  var min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n{\n  var n;                     /* iterates over all tree elements */\n  var prevlen = -1;          /* last emitted length */\n  var curlen;                /* length of current code */\n\n  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  var count = 0;             /* repeat count of the current code */\n  var max_count = 7;         /* max repeat count */\n  var min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n}\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction build_bl_tree(s) {\n  var max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n}\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n  var rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"black list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nfunction detect_data_type(s) {\n  /* black_mask is the bit mask of black-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  var black_mask = 0xf3ffc07f;\n  var n;\n\n  /* Check for non-textual (\"black-listed\") bytes. */\n  for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n    if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"white-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"black-listed\" or \"white-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  copy_block(s, buf, stored_len, true); /* with header */\n}\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nfunction _tr_align(s) {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n}\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  var opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  var max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->last_lit));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n}\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction _tr_tally(s, dist, lc)\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n  //var out_length, in_length, dcode;\n\n  s.pending_buf[s.d_buf + s.last_lit * 2]     = (dist >>> 8) & 0xff;\n  s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n  s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n  s.last_lit++;\n\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n//  /* Try to guess if it is profitable to stop the current block here */\n//  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n//    /* Compute an upper bound for the compressed length */\n//    out_length = s.last_lit*8;\n//    in_length = s.strstart - s.block_start;\n//\n//    for (dcode = 0; dcode < D_CODES; dcode++) {\n//      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n//    }\n//    out_length >>>= 3;\n//    //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n//    //       s->last_lit, in_length, out_length,\n//    //       100L - out_length*100L/in_length));\n//    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n//      return true;\n//    }\n//  }\n//#endif\n\n  return (s.last_lit === s.lit_bufsize - 1);\n  /* We avoid equality with lit_bufsize because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n}\n\nexports._tr_init  = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block  = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n  var s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n","'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n  var c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n  var t = crcTable,\n      end = pos + len;\n\n  crc ^= -1;\n\n  for (var i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils   = require('../utils/common');\nvar trees   = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32   = require('./crc32');\nvar msg     = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH      = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH    = 2;\nvar Z_FULL_FLUSH    = 3;\nvar Z_FINISH        = 4;\nvar Z_BLOCK         = 5;\n//var Z_TREES         = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\n//var Z_NEED_DICT     = 2;\n//var Z_ERRNO         = -1;\nvar Z_STREAM_ERROR  = -2;\nvar Z_DATA_ERROR    = -3;\n//var Z_MEM_ERROR     = -4;\nvar Z_BUF_ERROR     = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION      = 0;\n//var Z_BEST_SPEED          = 1;\n//var Z_BEST_COMPRESSION    = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED            = 1;\nvar Z_HUFFMAN_ONLY        = 2;\nvar Z_RLE                 = 3;\nvar Z_FIXED               = 4;\nvar Z_DEFAULT_STRATEGY    = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY              = 0;\n//var Z_TEXT                = 1;\n//var Z_ASCII               = 1; // = Z_TEXT\nvar Z_UNKNOWN             = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED  = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS      = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES       = 30;\n/* number of distance codes */\nvar BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE     = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n  strm.msg = msg[errorCode];\n  return errorCode;\n}\n\nfunction rank(f) {\n  return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n  var s = strm.state;\n\n  //_tr_flush_bits(s);\n  var len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n  strm.next_out += len;\n  s.pending_out += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n}\n\n\nfunction flush_block_only(s, last) {\n  trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n  s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n//  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n  var len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  utils.arraySet(buf, strm.input, strm.next_in, len, start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n  var chain_length = s.max_chain_length;      /* max hash chain length */\n  var scan = s.strstart; /* current string */\n  var match;                       /* matched string */\n  var len;                           /* length of current match */\n  var best_len = s.prev_length;              /* best match length so far */\n  var nice_match = s.nice_match;             /* stop if match long enough */\n  var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  var _win = s.window; // shortcut\n\n  var wmask = s.w_mask;\n  var prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  var strend = s.strstart + MAX_MATCH;\n  var scan_end1  = _win[scan + best_len - 1];\n  var scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nfunction fill_window(s) {\n  var _w_size = s.w_size;\n  var p, n, m, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n\n      /* Slide the hash table (could be avoided with 32 bit values\n       at the expense of memory usage). We slide even when level == 0\n       to keep the hash table consistent if we switch back to level > 0\n       later. (Using level 0 permanently is not an optimal usage of\n       zlib, so we don't care about this pathological case.)\n       */\n\n      n = s.hash_size;\n      p = n;\n      do {\n        m = s.head[--p];\n        s.head[p] = (m >= _w_size ? m - _w_size : 0);\n      } while (--n);\n\n      n = _w_size;\n      p = n;\n      do {\n        m = s.prev[--p];\n        s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n        /* If n is not on any hash chain, prev[n] is garbage but\n         * its value will never be used.\n         */\n      } while (--n);\n\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    var curr = s.strstart + s.lookahead;\n//    var init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n  /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n   * to pending_buf_size, and each stored block has a 5 byte header:\n   */\n  var max_block_size = 0xffff;\n\n  if (max_block_size > s.pending_buf_size - 5) {\n    max_block_size = s.pending_buf_size - 5;\n  }\n\n  /* Copy as much as possible from input to output: */\n  for (;;) {\n    /* Fill the window as much as possible: */\n    if (s.lookahead <= 1) {\n\n      //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n      //  s->block_start >= (long)s->w_size, \"slide too late\");\n//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n//        s.block_start >= s.w_size)) {\n//        throw  new Error(\"slide too late\");\n//      }\n\n      fill_window(s);\n      if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n\n      if (s.lookahead === 0) {\n        break;\n      }\n      /* flush the current block */\n    }\n    //Assert(s->block_start >= 0L, \"block gone\");\n//    if (s.block_start < 0) throw new Error(\"block gone\");\n\n    s.strstart += s.lookahead;\n    s.lookahead = 0;\n\n    /* Emit a stored block if pending_buf will be full: */\n    var max_start = s.block_start + max_block_size;\n\n    if (s.strstart === 0 || s.strstart >= max_start) {\n      /* strstart == 0 is possible when wraparound on 16-bit machine */\n      s.lookahead = s.strstart - max_start;\n      s.strstart = max_start;\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n\n\n    }\n    /* Flush if we may have to slide, otherwise block_start may become\n     * negative and the data will be gone:\n     */\n    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n\n  s.insert = 0;\n\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n\n  if (s.strstart > s.block_start) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n  var hash_head;        /* head of the hash chain */\n  var bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n  var hash_head;          /* head of hash chain */\n  var bflush;              /* set if current block must be flushed */\n\n  var max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n  var bflush;            /* set if current block must be flushed */\n  var prev;              /* byte at distance one to match */\n  var scan, strend;      /* scan goes up to strend for length of run */\n\n  var _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n  var bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nvar configuration_table;\n\nconfiguration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new utils.Buf16(HEAP_SIZE * 2);\n  this.dyn_dtree  = new utils.Buf16((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new utils.Buf16((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new utils.Buf16(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new utils.Buf16(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.l_buf = 0;          /* buffer index for literals or lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.last_lit = 0;      /* running index in l_buf */\n\n  this.d_buf = 0;\n  /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n   * the same number of elements. To use different lengths, an extra flag\n   * array would be necessary.\n   */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\nfunction deflateResetKeep(strm) {\n  var s;\n\n  if (!strm || !strm.state) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = Z_NO_FLUSH;\n  trees._tr_init(s);\n  return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n  var ret = deflateResetKeep(strm);\n  if (ret === Z_OK) {\n    lm_init(strm.state);\n  }\n  return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n  strm.state.gzhead = head;\n  return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR;\n  }\n  var wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  var s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new utils.Buf8(s.w_size * 2);\n  s.head = new utils.Buf16(s.hash_size);\n  s.prev = new utils.Buf16(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n\n  //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n  //s->pending_buf = (uchf *) overlay;\n  s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n  s.d_buf = 1 * s.lit_bufsize;\n\n  //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n  s.l_buf = (1 + 2) * s.lit_bufsize;\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n  var old_flush, s;\n  var beg, val; // for gzip header write only\n\n  if (!strm || !strm.state ||\n    flush > Z_BLOCK || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n\n  if (!strm.output ||\n      (!strm.input && strm.avail_in !== 0) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n  }\n\n  s.strm = strm; /* just in case */\n  old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Write the header */\n  if (s.status === INIT_STATE) {\n\n    if (s.wrap === 2) { // GZIP header\n      strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n      put_byte(s, 31);\n      put_byte(s, 139);\n      put_byte(s, 8);\n      if (!s.gzhead) { // s->gzhead == Z_NULL\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, OS_CODE);\n        s.status = BUSY_STATE;\n      }\n      else {\n        put_byte(s, (s.gzhead.text ? 1 : 0) +\n                    (s.gzhead.hcrc ? 2 : 0) +\n                    (!s.gzhead.extra ? 0 : 4) +\n                    (!s.gzhead.name ? 0 : 8) +\n                    (!s.gzhead.comment ? 0 : 16)\n        );\n        put_byte(s, s.gzhead.time & 0xff);\n        put_byte(s, (s.gzhead.time >> 8) & 0xff);\n        put_byte(s, (s.gzhead.time >> 16) & 0xff);\n        put_byte(s, (s.gzhead.time >> 24) & 0xff);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, s.gzhead.os & 0xff);\n        if (s.gzhead.extra && s.gzhead.extra.length) {\n          put_byte(s, s.gzhead.extra.length & 0xff);\n          put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n        }\n        if (s.gzhead.hcrc) {\n          strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n        }\n        s.gzindex = 0;\n        s.status = EXTRA_STATE;\n      }\n    }\n    else // DEFLATE header\n    {\n      var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n      var level_flags = -1;\n\n      if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n        level_flags = 0;\n      } else if (s.level < 6) {\n        level_flags = 1;\n      } else if (s.level === 6) {\n        level_flags = 2;\n      } else {\n        level_flags = 3;\n      }\n      header |= (level_flags << 6);\n      if (s.strstart !== 0) { header |= PRESET_DICT; }\n      header += 31 - (header % 31);\n\n      s.status = BUSY_STATE;\n      putShortMSB(s, header);\n\n      /* Save the adler32 of the preset dictionary: */\n      if (s.strstart !== 0) {\n        putShortMSB(s, strm.adler >>> 16);\n        putShortMSB(s, strm.adler & 0xffff);\n      }\n      strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    }\n  }\n\n//#ifdef GZIP\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n\n      while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            break;\n          }\n        }\n        put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n        s.gzindex++;\n      }\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (s.gzindex === s.gzhead.extra.length) {\n        s.gzindex = 0;\n        s.status = NAME_STATE;\n      }\n    }\n    else {\n      s.status = NAME_STATE;\n    }\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.gzindex = 0;\n        s.status = COMMENT_STATE;\n      }\n    }\n    else {\n      s.status = COMMENT_STATE;\n    }\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.status = HCRC_STATE;\n      }\n    }\n    else {\n      s.status = HCRC_STATE;\n    }\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n      }\n      if (s.pending + 2 <= s.pending_buf_size) {\n        put_byte(s, strm.adler & 0xff);\n        put_byte(s, (strm.adler >> 8) & 0xff);\n        strm.adler = 0; //crc32(0L, Z_NULL, 0);\n        s.status = BUSY_STATE;\n      }\n    }\n    else {\n      s.status = BUSY_STATE;\n    }\n  }\n//#endif\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n    var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n      (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n        configuration_table[s.level].func(s, flush));\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        trees._tr_align(s);\n      }\n      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        trees._tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK;\n      }\n    }\n  }\n  //Assert(strm->avail_out > 0, \"bug2\");\n  //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n  if (flush !== Z_FINISH) { return Z_OK; }\n  if (s.wrap <= 0) { return Z_STREAM_END; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n  var status;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  status = strm.state.status;\n  if (status !== INIT_STATE &&\n    status !== EXTRA_STATE &&\n    status !== NAME_STATE &&\n    status !== COMMENT_STATE &&\n    status !== HCRC_STATE &&\n    status !== BUSY_STATE &&\n    status !== FINISH_STATE\n  ) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n  var dictLength = dictionary.length;\n\n  var s;\n  var str, n;\n  var wrap;\n  var avail;\n  var next;\n  var input;\n  var tmpDict;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n  wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    tmpDict = new utils.Buf8(s.w_size);\n    utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  avail = strm.avail_in;\n  next = strm.next_in;\n  input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    str = s.strstart;\n    n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","// String encode/decode helpers\n'use strict';\n\n\nvar utils = require('./common');\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nvar _utf8len = new utils.Buf8(256);\nfor (var q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nexports.string2buf = function (str) {\n  var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new utils.Buf8(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper (used in 2 places)\nfunction buf2binstring(buf, len) {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\n      return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n    }\n  }\n\n  var result = '';\n  for (var i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n}\n\n\n// Convert byte array to binary string\nexports.buf2binstring = function (buf) {\n  return buf2binstring(buf, buf.length);\n};\n\n\n// Convert binary string (typed, when possible)\nexports.binstring2buf = function (str) {\n  var buf = new utils.Buf8(str.length);\n  for (var i = 0, len = buf.length; i < len; i++) {\n    buf[i] = str.charCodeAt(i);\n  }\n  return buf;\n};\n\n\n// convert array to string\nexports.buf2string = function (buf, max) {\n  var i, out, c, c_len;\n  var len = max || buf.length;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  var utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nexports.utf8border = function (buf, max) {\n  var pos;\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","'use strict';\n\n\nvar zlib_deflate = require('./zlib/deflate');\nvar utils        = require('./utils/common');\nvar strings      = require('./utils/strings');\nvar msg          = require('./zlib/messages');\nvar ZStream      = require('./zlib/zstream');\n\nvar toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nvar Z_NO_FLUSH      = 0;\nvar Z_FINISH        = 4;\n\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\nvar Z_SYNC_FLUSH    = 2;\n\nvar Z_DEFAULT_COMPRESSION = -1;\n\nvar Z_DEFAULT_STRATEGY    = 0;\n\nvar Z_DEFLATED  = 8;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param)  or if you\n * push a chunk with explicit flush (call [[Deflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n *    (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n  if (!(this instanceof Deflate)) return new Deflate(options);\n\n  this.options = utils.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY,\n    to: ''\n  }, options || {});\n\n  var opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new ZStream();\n  this.strm.avail_out = 0;\n\n  var status = zlib_deflate.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  if (opt.header) {\n    zlib_deflate.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    var dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK) {\n      throw new Error(msg[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the compression context.\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, mode) {\n  var strm = this.strm;\n  var chunkSize = this.options.chunkSize;\n  var status, _mode;\n\n  if (this.ended) { return false; }\n\n  _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  do {\n    if (strm.avail_out === 0) {\n      strm.output = new utils.Buf8(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n    status = zlib_deflate.deflate(strm, _mode);    /* no bad return value */\n\n    if (status !== Z_STREAM_END && status !== Z_OK) {\n      this.onEnd(status);\n      this.ended = true;\n      return false;\n    }\n    if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {\n      if (this.options.to === 'string') {\n        this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n      } else {\n        this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n      }\n    }\n  } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);\n\n  // Finalize on the last chunk.\n  if (_mode === Z_FINISH) {\n    status = zlib_deflate.deflateEnd(this.strm);\n    this.onEnd(status);\n    this.ended = true;\n    return status === Z_OK;\n  }\n\n  // callback interim results if Z_SYNC_FLUSH.\n  if (_mode === Z_SYNC_FLUSH) {\n    this.onEnd(Z_OK);\n    strm.avail_out = 0;\n    return true;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n *   on js engine support. When string output requested, each chunk\n *   will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = utils.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n *    (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n  var deflator = new Deflate(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate(input, options);\n}\n\n\nexports.Deflate = Deflate;\nexports.deflate = deflate;\nexports.deflateRaw = deflateRaw;\nexports.gzip = gzip;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n  var bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  var len = 0;               /* a code's length in bits */\n  var sym = 0;               /* index of code symbols */\n  var min = 0, max = 0;          /* minimum and maximum code lengths */\n  var root = 0;              /* number of index bits for root table */\n  var curr = 0;              /* number of index bits for current table */\n  var drop = 0;              /* code bits to drop for sub-table */\n  var left = 0;                   /* number of prefix codes available */\n  var used = 0;              /* code entries in table used */\n  var huff = 0;              /* Huffman code */\n  var incr;              /* for incrementing code, index */\n  var fill;              /* index for replicating entries */\n  var low;               /* low bits for current root entry */\n  var mask;              /* mask for low root bits */\n  var next;             /* next available space in table */\n  var base = null;     /* base value table to use */\n  var base_index = 0;\n//  var shoextra;    /* extra bits table to use */\n  var end;                    /* use base and extra for symbol > end */\n  var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  var extra = null;\n  var extra_index = 0;\n\n  var here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES) {\n    base = extra = work;    /* dummy value--not used */\n    end = 19;\n\n  } else if (type === LENS) {\n    base = lbase;\n    base_index -= 257;\n    extra = lext;\n    extra_index -= 257;\n    end = 256;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    end = -1;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS && used > ENOUGH_LENS) ||\n    (type === DISTS && used > ENOUGH_DISTS)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] < end) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] > end) {\n      here_op = extra[extra_index + work[sym]];\n      here_val = base[base_index + work[sym]];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS && used > ENOUGH_LENS) ||\n        (type === DISTS && used > ENOUGH_DISTS)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils         = require('../utils/common');\nvar adler32       = require('./adler32');\nvar crc32         = require('./crc32');\nvar inflate_fast  = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH      = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH    = 2;\n//var Z_FULL_FLUSH    = 3;\nvar Z_FINISH        = 4;\nvar Z_BLOCK         = 5;\nvar Z_TREES         = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\nvar Z_NEED_DICT     = 2;\n//var Z_ERRNO         = -1;\nvar Z_STREAM_ERROR  = -2;\nvar Z_DATA_ERROR    = -3;\nvar Z_MEM_ERROR     = -4;\nvar Z_BUF_ERROR     = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED  = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar    HEAD = 1;       /* i: waiting for magic header */\nvar    FLAGS = 2;      /* i: waiting for method and flags (gzip) */\nvar    TIME = 3;       /* i: waiting for modification time (gzip) */\nvar    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */\nvar    EXLEN = 5;      /* i: waiting for extra length (gzip) */\nvar    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */\nvar    NAME = 7;       /* i: waiting for end of file name (gzip) */\nvar    COMMENT = 8;    /* i: waiting for end of comment (gzip) */\nvar    HCRC = 9;       /* i: waiting for header crc (gzip) */\nvar    DICTID = 10;    /* i: waiting for dictionary check value */\nvar    DICT = 11;      /* waiting for inflateSetDictionary() call */\nvar        TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\nvar        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */\nvar        STORED = 14;    /* i: waiting for stored size (length and complement) */\nvar        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */\nvar        COPY = 16;      /* i/o: waiting for input or output to copy stored block */\nvar        TABLE = 17;     /* i: waiting for dynamic block table lengths */\nvar        LENLENS = 18;   /* i: waiting for code length code lengths */\nvar        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */\nvar            LEN_ = 20;      /* i: same as LEN below, but only first time in */\nvar            LEN = 21;       /* i: waiting for length/lit/eob code */\nvar            LENEXT = 22;    /* i: waiting for length extra bits */\nvar            DIST = 23;      /* i: waiting for distance code */\nvar            DISTEXT = 24;   /* i: waiting for distance extra bits */\nvar            MATCH = 25;     /* o: waiting for output space to copy string */\nvar            LIT = 26;       /* o: waiting for output space to write literal */\nvar    CHECK = 27;     /* i: waiting for 32-bit check value */\nvar    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */\nvar    DONE = 29;      /* finished check, done -- remain here until reset */\nvar    BAD = 30;       /* got a data error -- remain here until reset */\nvar    MEM = 31;       /* got an inflate() memory error -- remain here until reset */\nvar    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n  this.mode = 0;             /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib) */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n  this.work = new utils.Buf16(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new utils.Buf32(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n  var state;\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n  state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK;\n}\n\nfunction inflateReset(strm) {\n  var state;\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n  var wrap;\n  var state;\n\n  /* get the state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 1;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n  var ret;\n  var state;\n\n  if (!strm) { return Z_STREAM_ERROR; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.window = null/*Z_NULL*/;\n  ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n}\n\nfunction inflateInit(strm) {\n  return inflateInit2(strm, DEF_WBITS);\n}\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    var sym;\n\n    lenfix = new utils.Buf32(512);\n    distfix = new utils.Buf32(32);\n\n    /* literal/length table */\n    sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inflate_table(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inflate_table(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n}\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nfunction updatewindow(strm, src, end, copy) {\n  var dist;\n  var state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new utils.Buf8(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      utils.arraySet(state.window, src, end - copy, copy, 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n}\n\nfunction inflate(strm, flush) {\n  var state;\n  var input, output;          // input/output buffers\n  var next;                   /* next input INDEX */\n  var put;                    /* next output INDEX */\n  var have, left;             /* available input and output */\n  var hold;                   /* bit buffer */\n  var bits;                   /* bits in bit buffer */\n  var _in, _out;              /* save starting available input and output */\n  var copy;                   /* number of stored or match bytes to copy */\n  var from;                   /* where to copy match bytes from */\n  var from_source;\n  var here = 0;               /* current decoding table entry */\n  var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //var last;                   /* parent table entry */\n  var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  var len;                    /* length to copy for repeats, bits to drop */\n  var ret;                    /* return code */\n  var hbuf = new utils.Buf8(4);    /* buffer for gzip header crc calculation */\n  var opts;\n\n  var n; // temporary var for NEED_BITS\n\n  var order = /* permutation of code lengths */\n    [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\n\n\n  if (!strm || !strm.state || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        state.flags = 0;           /* expect zlib header */\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        else if (len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n        state.dmax = 1 << len;\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if (state.flags & 0x0200) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Array(state.head.extra_len);\n              }\n              utils.arraySet(\n                state.head.extra,\n                input,\n                next,\n                // extra field is limited to 65536 bytes\n                // - no need for additional size check\n                copy,\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if (state.flags & 0x0200) {\n              state.check = crc32(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if (state.flags & 0x0200) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if (state.flags & 0x0200) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          utils.arraySet(output, input, next, copy, put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inflate_fast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if (_out) {\n            strm.adler = state.check =\n                /*UPDATE(state.check, put - _out, _out);*/\n                (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n      state.mode = MEM;\n      return Z_MEM_ERROR;\n    }\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if (state.wrap && _out) {\n    strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n}\n\nfunction inflateEnd(strm) {\n\n  if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  var state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n  var state;\n\n  /* check state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n  var dictLength = dictionary.length;\n\n  var state;\n  var dictid;\n  var ret;\n\n  /* check state */\n  if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30;       /* got a data error -- remain here until reset */\nvar TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n  var state;\n  var _in;                    /* local strm.input */\n  var last;                   /* have enough input while in < last */\n  var _out;                   /* local strm.output */\n  var beg;                    /* inflate()'s initial strm.output */\n  var end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  var dmax;                   /* maximum distance from zlib header */\n//#endif\n  var wsize;                  /* window size or zero if not using window */\n  var whave;                  /* valid bytes in the window */\n  var wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  var s_window;               /* allocated sliding window, if wsize != 0 */\n  var hold;                   /* local strm.hold */\n  var bits;                   /* local strm.bits */\n  var lcode;                  /* local strm.lencode */\n  var dcode;                  /* local strm.distcode */\n  var lmask;                  /* mask for first level of length codes */\n  var dmask;                  /* mask for first level of distance codes */\n  var here;                   /* retrieved table entry */\n  var op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  var len;                    /* match length, unused bytes */\n  var dist;                   /* match distance */\n  var from;                   /* where to copy match from */\n  var from_source;\n\n\n  var input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  //Z_MEM_ERROR:     -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nmodule.exports = GZheader;\n","'use strict';\n\n\nvar zlib_inflate = require('./zlib/inflate');\nvar utils        = require('./utils/common');\nvar strings      = require('./utils/strings');\nvar c            = require('./zlib/constants');\nvar msg          = require('./zlib/messages');\nvar ZStream      = require('./zlib/zstream');\nvar GZheader     = require('./zlib/gzheader');\n\nvar toString = Object.prototype.toString;\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Inflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n  if (!(this instanceof Inflate)) return new Inflate(options);\n\n  this.options = utils.assign({\n    chunkSize: 16384,\n    windowBits: 0,\n    to: ''\n  }, options || {});\n\n  var opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new ZStream();\n  this.strm.avail_out = 0;\n\n  var status  = zlib_inflate.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== c.Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  this.header = new GZheader();\n\n  zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== c.Z_OK) {\n        throw new Error(msg[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, mode) {\n  var strm = this.strm;\n  var chunkSize = this.options.chunkSize;\n  var dictionary = this.options.dictionary;\n  var status, _mode;\n  var next_out_utf8, tail, utf8str;\n\n  // Flag to properly process Z_BUF_ERROR on testing inflate call\n  // when we check that all output data was flushed.\n  var allowBufError = false;\n\n  if (this.ended) { return false; }\n  _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // Only binary strings can be decompressed on practice\n    strm.input = strings.binstring2buf(data);\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  do {\n    if (strm.avail_out === 0) {\n      strm.output = new utils.Buf8(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);    /* no bad return value */\n\n    if (status === c.Z_NEED_DICT && dictionary) {\n      status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);\n    }\n\n    if (status === c.Z_BUF_ERROR && allowBufError === true) {\n      status = c.Z_OK;\n      allowBufError = false;\n    }\n\n    if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n      this.onEnd(status);\n      this.ended = true;\n      return false;\n    }\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\n\n        if (this.options.to === 'string') {\n\n          next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          tail = strm.next_out - next_out_utf8;\n          utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n        }\n      }\n    }\n\n    // When no more input data, we should check that internal inflate buffers\n    // are flushed. The only way to do it when avail_out = 0 - run one more\n    // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\n    // Here we set flag to process this error properly.\n    //\n    // NOTE. Deflate does not return error in this case and does not needs such\n    // logic.\n    if (strm.avail_in === 0 && strm.avail_out === 0) {\n      allowBufError = true;\n    }\n\n  } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\n\n  if (status === c.Z_STREAM_END) {\n    _mode = c.Z_FINISH;\n  }\n\n  // Finalize on the last chunk.\n  if (_mode === c.Z_FINISH) {\n    status = zlib_inflate.inflateEnd(this.strm);\n    this.onEnd(status);\n    this.ended = true;\n    return status === c.Z_OK;\n  }\n\n  // callback interim results if Z_SYNC_FLUSH.\n  if (_mode === c.Z_SYNC_FLUSH) {\n    this.onEnd(c.Z_OK);\n    strm.avail_out = 0;\n    return true;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n *   on js engine support. When string output requested, each chunk\n *   will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === c.Z_OK) {\n    if (this.options.to === 'string') {\n      // Glue & convert here, until we teach pako to send\n      // utf8 aligned strings to onData\n      this.result = this.chunks.join('');\n    } else {\n      this.result = utils.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n *   , output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err)\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n  var inflator = new Inflate(options);\n\n  inflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) { throw inflator.msg || msg[inflator.err]; }\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nexports.Inflate = Inflate;\nexports.inflate = inflate;\nexports.inflateRaw = inflateRaw;\nexports.ungzip  = inflate;\n","// Top level file is just a mixin of submodules & constants\n'use strict';\n\nvar assign    = require('./lib/utils/common').assign;\n\nvar deflate   = require('./lib/deflate');\nvar inflate   = require('./lib/inflate');\nvar constants = require('./lib/zlib/constants');\n\nvar pako = {};\n\nassign(pako, deflate, inflate, constants);\n\nmodule.exports = pako;\n",null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"names":["charCodeAt","string","index","code","chunkify_1","chunkByteLength","chunks","currChunkByteLength","length","charByteLength","push","mod","__esModule","default","__importDefault","require$$0","STATUSES","WIP","SUCCESS","SUCCESS_CHUNKED","ERROR","poll_1","context","key","options","result","state","value","stringified","JSON","stringify","from","e","status","error","message","substring","shift","done","createPollResponse","poll","pollify_1","script","args","Promise","resolve","then","catch","err","stack","absolutizeUrl_1","url","baseUrl","URL","isAbsoluteUrl","isEncoded","decodeURI","absoluteUrl","href","isInlineFrame_1","frame","contentDocument","location","test","protocol","isAccessibleFrame_1","doc","Boolean","defaultView","frameElement","Object","defineProperty","dist","isAccessibleFrame","isInlineFrame","absolutizeUrl","pollify","chunkify","require$$1","require$$2","require$$3","require$$4","require$$5","EYES_NAMESPACE","addElementIds","arg","s","t","window","Node","prototype","isConnected","document","documentElement","contains","ownerDocument","r","o","hasAttribute","Error","attributes","tagName","children","n","slice","call","map","name","join","setAttribute","nodeType","ELEMENT_NODE","toLowerCase","parentNode","indexOf","unshift","a","getAttribute","l","querySelectorAll","i","u","c","hasOwnProperty","getRootNode","constructor","host","removeBasicAuthFromUrl","username","password","hasBasicAuth","uuid","crypto","getRandomValues","Uint32Array","Ident","Function","AtKeyword","Hash","String","BadString","Url","BadUrl","Delim","Number","Percentage","Dimension","WhiteSpace","CDO","CDC","Colon","Semicolon","Comma","LeftSquareBracket","RightSquareBracket","LeftParenthesis","RightParenthesis","LeftCurlyBracket","RightCurlyBracket","Comment","EOF","isDigit","isHexDigit","isUppercaseLetter","isNameStart","isLowercaseLetter","isLetter","isNonAscii","isName","isNonPrintable","isNewline","isWhiteSpace","isValidEscape","first","second","isIdentifierStart","third","isNumberStart","isBOM","CATEGORY","Array","WhiteSpaceCategory","DigitCategory","NameStartCategory","NonPrintableCategory","charCodeCategory","getCharCode","source","offset","getNewlineLength","cmpChar","testStr","referenceCode","cmpStr","start","end","referenceStr","testCode","findWhiteSpaceEnd","findDecimalNumberEnd","consumeEscaped","maxOffset","Math","min","consumeName","consumeNumber","sign","consumeBadUrlRemnants","decodeEscaped","escaped","parseInt","fromCodePoint","tokenNames","MIN_SIZE","adoptBuffer","buffer","size","max","computeLinesAndColumns","sourceLength","startOffset","lines","columns","line","startLine","column","startColumn","computed","OffsetToLocation","this","setSource","getLocation","filename","getLocationRange","OFFSET_MASK","TYPE_SHIFT","balancePair","Map","FunctionToken","TokenStream","tokenize","reset","eof","tokenIndex","tokenType","tokenStart","firstCharOffset","tokenEnd","offsetAndType","balance","tokenCount","balanceCloseType","balanceStart","type","balancePrev","get","next","lookupType","lookupTypeNonSC","idx","lookupOffset","lookupOffsetNonSC","lookupValue","getTokenStart","substrToCursor","isBalanceEdge","pos","isDelim","skip","skipSC","skipUntilBalanced","startToken","stopConsume","balanceEnd","cursor","loop","forEachToken","fn","item","dump","tokens","chunk","onToken","consumeNumericToken","TYPE","consumeIdentLikeToken","nameStartOffset","consumeUrlToken","consumeStringToken","endingCodePoint","nextCode","releasedCursors","List","createItem","data","prev","head","tail","allocateCursor","releaseCursor","updateCursors","prevOld","prevNew","nextOld","nextNew","Symbol","iterator","isEmpty","last","fromArray","array","toArray","toJSON","forEach","thisArg","forEachRight","reduce","initialValue","acc","reduceRight","some","appendData","filter","nextUntil","prevUntil","clear","copy","prepend","prependData","append","insert","before","insertData","remove","pop","prependList","list","insertList","appendList","replace","oldItem","newItemOrList","createCustomError","create","SyntaxError","errorStack","assign","MAX_LINE_LENGTH","OFFSET_CORRECTION","TAB_REPLACEMENT","sourceFragment","baseLine","baseColumn","extraLines","processLines","padStart","maxNumLength","repeat","split","endLine","cutLeft","substr","match","isNaN","formattedMessage","readSequence","recognizer","createList","space","child","getNode","undefined","onWhiteSpace","NOOP","EXCLAMATIONMARK","NUMBERSIGN","SEMICOLON","LEFTCURLYBRACKET","NULL","createParseContext","fetchParseValues","dict","keys","parse","createParser","config","needPositions","onParseError","onParseErrorThrow","locationMap","parser","parseConfig","features","scope","atrule","pseudo","node","entries","parseContext","processConfig","parseAtrulePrelude","parseRulePrelude","parseValue","parseCustomProperty","consumeUntilBalanceEnd","consumeUntilLeftCurlyBracket","consumeUntilLeftCurlyBracketOrSemicolon","consumeUntilExclamationMarkOrSemicolon","consumeUntilSemicolonIncluded","createSingleNodeList","getFirstListNode","getLastListNode","parseWithFallback","consumer","fallback","startIndex","fallbackNode","lookupNonWSType","offsetStart","offsetEnd","charCode","str","consume","eat","consumeFunctionName","number","tokenName","m","toUpperCase","NumberToken","eatIdent","eatDelim","fromCharCode","getLocationFromList","loc","findWhiteSpaceStart","source_","positions","onComment","ast","intToCharMap","base64","encode","TypeError","decode","base64Vlq","aValue","digit","encoded","vlq","toVLQSigned","VLQ_BASE","aStr","aIndex","aOutParam","continuation","shifted","strLen","charAt","rest","exports","getArg","aArgs","aName","aDefaultValue","arguments","urlRegexp","dataUrlRegexp","urlParse","aUrl","scheme","auth","port","path","urlGenerate","aParsedUrl","f","cache","normalize","aPath","isAbsolute","parts","part","up","splice","input","temp","aRoot","aPathUrl","aRootUrl","joined","relative","level","lastIndexOf","supportsNullProto","identity","isProtoString","strcmp","aStr1","aStr2","toSetString","fromSetString","compareByOriginalPositions","mappingA","mappingB","onlyCompareOriginal","cmp","originalLine","originalColumn","generatedColumn","generatedLine","compareByOriginalPositionsNoSource","compareByGeneratedPositionsDeflated","onlyCompareGenerated","compareByGeneratedPositionsDeflatedNoLine","compareByGeneratedPositionsInflated","parseSourceMapInput","computeSourceURL","sourceRoot","sourceURL","sourceMapURL","parsed","util","has","hasNativeMap","ArraySet","_array","_set","ArraySet$1","aArray","aAllowDuplicates","set","len","add","getOwnPropertyNames","sStr","isDuplicate","at","aIdx","arraySet","MappingList","_sorted","_last","MappingList$1","unsortedForEach","aCallback","aThisArg","aMapping","lineA","lineB","columnA","columnB","sort","mappingList","base64VLQ","SourceMapGenerator","_file","_sourceRoot","_skipValidation","_sources","_names","_mappings","_sourcesContents","_version","fromSourceMap","aSourceMapConsumer","generator","file","eachMapping","mapping","newMapping","generated","original","addMapping","sources","sourceFile","sourceRelative","content","sourceContentFor","setSourceContent","_validateMapping","aSourceFile","aSourceContent","applySourceMap","aSourceMapPath","newSources","newNames","originalPositionFor","aGenerated","aOriginal","aSource","_serializeMappings","nameIdx","sourceIdx","previousGeneratedColumn","previousGeneratedLine","previousOriginalColumn","previousOriginalLine","previousName","previousSource","mappings","_generateSourcesContent","aSources","aSourceRoot","version","names","sourcesContent","toString","SourceMapGenerator_1","trackNodes","Set","specPairs","safePairs","concat","StringToken","createMap","pairs","isWhiteSpaceRequired","prevCode","nextCharCode","emit","spec","safe","REVERSESOLIDUS","processChildren","delimeter","processChunk","token","createGenerator","types","generate","handlers","publicApi","tokenBefore","decorator","sourceMap","activatedGenerated","activatedMapping","sourceMappingActive","origHandlersNode","nodeLine","nodeColumn","origHandlersEmit","auto","origHandlersResult","css","generateSourceMap","mode","noop","ensureFunction","invokeForType","getWalkersFromStructure","structure","walkers","fieldTypes","walker","nullable","isArray","fieldType","walkContext","fields","createTypeIterator","reverse","contextName","useContext","walk","walkReducer","prevContextValue","field","ref","createFastTraveralMap","StyleSheet","Atrule","Rule","Block","DeclarationList","Declaration","createWalker","getTypesFromConfig","iteratorsNatural","iteratorsReverse","breakWalk","skipNode","fastTraversalIteratorsNatural","fastTraversalIteratorsReverse","root","walkNode","enterRet","enter","iterators","leave","ret","break","stylesheet","atrulePrelude","rule","selector","block","declaration","function","visit","find","found","findLast","findAll","internalGenerate","decorate","forceBraces","compact","combinator","terms","term","explicit","generateSequence","disallowEmpty","multiplier","comma","generateMultiplier","opts","generateTypeOpts","defaultLoc","fromLoc","point","buildLoc","extra","SyntaxReferenceError","referenceName","reference","SyntaxMatchError","syntax","matchResult","mismatchOffset","mismatchLength","longestMatch","mismatchNode","badNode","locateMismatch","rawMessage","keywords","properties","HYPHENMINUS","keyword","descriptor","custom","isCustomProperty","vendor","getVendorPrefix","freeze","basename","prefix","property","hack","secondDashIndex","cssWideKeywords","PLUSSIGN","DISALLOW_SIGN","getNextToken","checkInteger","valueOffset","disallowSign","consumeB","offset_","QUESTIONMARK","hexSequence","allowDash","hexlen","withQuestionMarkSequence","consumed","calcFunctionNames","eqStr","actual","expected","eqStrAny","isPostfixIeHack","outOfRange","numEnd","num","calc","balanceStash","scan","consumeFunction","expectedTokenType","dashedIdent","dimension","numberEnd","reverseSolidusOffset","unit","zero","tokenTypes","productionTypes","ident","percentage","integer","urange","consumedHexLength","startsWith","createDemensionTypes","units","angle","decibel","frequency","flex","resolution","semitones","time","Tokenizer","nextNonWsCode","findWsEnd","substringToPos","peek","TAB","N","F","R","SPACE","AMPERSAND","APOSTROPHE","LEFTPARENTHESIS","RIGHTPARENTHESIS","ASTERISK","COMMA","HYPERMINUS","LESSTHANSIGN","GREATERTHANSIGN","COMMERCIALAT","LEFTSQUAREBRACKET","RIGHTSQUAREBRACKET","VERTICALLINE","RIGHTCURLYBRACKET","INFINITY","NAME_CHAR","Uint8Array","_","COMBINATOR_PRECEDENCE","scanSpaces","tokenizer","scanWord","scanNumber","scanString","readMultiplierRange","maybeMultiplied","range","readMultiplier","maybeToken","ch","readType","readTypeRange","regroupTerms","combinators","createGroup","b","subgroupStart","readImplicitGroup","prevToken","prevTokenPos","readKeywordOrFunction","readGroup","readProperty","astToTokens","curNode","tmp","prepareTokens","stringToTokens","MATCH","MISMATCH","DISALLOW_EMPTY","createCondition","thenBranch","elseBranch","else","isFunctionType","isEnumCapatible","buildGroupMatchGraph","atLeastOneTermMatched","all","thenClause","newGroupTerm","buildMatchGraphInternal","matchTerm","buildMultiplierMatchGraph","buildMatchGraph","syntaxTree","STUB","TOKEN","OPEN_SYNTAX","CLOSE_SYNTAX","EXIT_REASON_MATCH","EXIT_REASON_MISMATCH","EXIT_REASON_ITERATION_LIMIT","ITERATION_LIMIT","areStringsEqualCaseInsensitive","isCommaContextStart","isContextEdgeDelim","isCommaContextEnd","matchAsTree","matchGraph","syntaxes","moveToNextToken","nextIndex","stateSnapshotFromSyntax","nextState","matchStack","syntaxStack","thenStack","pushThenStack","pushElseStack","elseStack","addTokenToMatch","syntaxStash","closeSyntax","iterationCount","exitReason","mask","matchFlag","lastTokenIndex","floor","syntaxDict","dictSyntax","keywordName","console","warn","reason","iterations","internalMatch","hostStack","reverseList","getTrace","shouldPutToTrace","matched","hasMatch","matchNode","testNode","trace","getFirstMatchNode","getLastMatchNode","matchFragments","lexer","fragments","findFragments","nodes","parent","isValidNumber","isFinite","isValidLocation","createNodeStructureChecker","valid","processStructure","docs","docsTypes","check","cssWideKeywordsSyntax","dumpMapSyntax","syntaxAsAst","dumpAtruleMapSyntax","prelude","descriptors","buildMatchResult","matchSyntax","useCssWideKeywords","valueHasVar","Lexer","generic","atrules","getStructureFromConfig","group","addType_","createGenericTypes","addAtrule_","addProperty_","checkStructure","collectWarning","warns","createDescriptor","serializable","descName","checkAtruleName","atruleName","getAtrule","checkAtrulePrelude","checkAtruleDescriptorName","descriptorName","checkPropertyName","propertyName","getProperty","matchAtrulePrelude","matchAtruleDescriptor","matchDeclaration","matchProperty","matchType","typeName","typeSyntax","getType","findValueFragments","findDeclarationValueFragments","findAllFragments","apply","fallbackBasename","getAtrulePrelude","getAtruleDescriptor","declarators","validate","broken","brokenMap","brokenTypes","brokenProperties","pretty","appendOrSet","sliceProps","obj","props","prop","includes","mix","dest","src","patch","exists","current","descriptorValue","createSyntax","fromPlainObject","toPlainObject","createConvertor","createLexer","fork","extension","base","checkTokenIsInteger","expectCharCode","msg","consumeRaw","Raw","isDeclarationBlockAtrule","isDeclaration","nameLowerCase","AtrulePrelude","bind","DOLLARSIGN","EQUALSSIGN","CIRCUMFLEXACCENT","TILDE","getAttributeName","expectIdent","getOperator","matcher","flags","Identifier","consumeRule","consumeRawDeclaration","consumeDeclaration","isStyleBlock","likelyFeatureToken","kind","featureOrRange","Feature","FeatureRange","parentheses","media","container","supports","SupportsDeclaration","res","Condition","GeneralEnclosed","FeatureFunction","SOLIDUS","consumeValueRaw","consumeCustomPropertyRaw","consumeValue","startValueToken","Value","important","customProperty","valueStart","getImportant","Ratio","feature","getFeatureParser","functionName","valueParser","left","leftComparison","middle","rightComparison","right","readTerm","readComparison","expectColon","Layer","modifier","mediaType","condition","identLowerCase","MediaQuery","nth","AnPlusB","SelectorList","consumeTerm","getOffsetExcludeWS","consumeUntil","excludeWhiteSpace","endOffset","consumePrelude","limit","Selector","REVERSE_SOLIDUS","QUOTATION_MARK","firstChar","decoded","escapeStart","escapeEnd","apostrophe","quote","quoteCode","wsBeforeHexIsNeeded","eatIdentifierOrAsterisk","eatHexSequence","eatQuestionMarkSequence","count","scanUnicodeRange","hexLength","lexerConfig","attachment","axis","box","color","counter","gradient","hue","image","position","ratio","scroller","shadow","shape","symbol","target","age","bottom","gender","paint","top","x","y","animation","appearance","azimuth","background","border","caret","clip","contain","direction","display","float","font","gap","grid","height","hyphens","inset","isolation","margin","opacity","order","orphans","outline","overflow","padding","page","perspective","quotes","resize","rotate","scale","transform","transition","translate","visibility","widows","width","zoom","behavior","cue","fill","kerning","marker","pause","speak","stroke","charset","negative","pad","suffix","symbols","system","import","keyframes","layer","namespace","bleed","marks","inherits","viewport","orientation","nest","defaultRecognizer","Operator","Parentheses","Brackets","UnicodeRange","selector$1","AttributeSelector","IdSelector","PseudoElementSelector","PseudoClassSelector","TypeSelector","Combinator","ClassSelector","NestingSelector","isPlusMinusOperator","expression","var","nonContainerNameKeywords","nested","parseFunctions","selectorList","identList","Nth","mediaQueryList","mediaQuery","declarationList","style","MediaQueryList","LayerList","Scope","dir","lang","matches","is","where","not","slotted","shorthandProperties","mozShorthandProperties","withVendor","webkitShorthandProperties","preferredShorthandProperties","longhandSet","shorthand","longhandProperties","longhands","longhand","isShorthandFor","createAstFromDeclaration","cssomDeclaration","preferredShorthand","createProperty","shorthandsForLonghand","getShorthands","getPropertyValue","delete","values","getPropertyPriority","RULE_PROPS","createAstFromCssom","cssomRules","cssomRule","_a","_b","cssText","RegExp","cssomPrelude","selectorText","keyText","conditionText","mediaText","namespaceURI","encoding","nameList","parseOptions","csstree.toPlainObject","csstree.parse","_c","cssRules","pseudoElementSelectorNames","PROPERTY_ALIASES","mergeRules","textRules","mergedRules","textRule","ruleSet","baseRule","comparator","findIndex","leftPrelude","rightPrelude","compareChildren","isStyleRule","leftStyles","rightStyles","relevantPropsCount","rightDeclaration","isVendorProperty","leftDeclaration","leftProperty","rightProperty","explicifiedLeftProperty","explicifiedRightProperty","compareProperties","findRule","isNestedRule","mergeStyles","textDeclarations","cssomDeclarations","allDeclarations","textDeclaration","matchedPropertyDeclarations","matchedValueDeclaration","leftChildren","rightChildren","every","leftChild","rightChild","leftName","rightName","leftValue","rightValue","indexFrom","indexTo","callback","_args","getElementAttrSelector","el","attrString","attr","classList","nodeName","processInlineCss","styleNode","log","textContentAst","textContent","textAst","csstree.walk","urlIndex","filteredChildren","cssNode","nextSibling","pseudoClassOrElement","createAstFromTextContent","cssomAst","sheet","csstree.generate","csstree.fromPlainObject","md5cycle","k","d","ff","gg","hh","ii","add32","cmn","q","md5blk","md5blks","hex_chr","rhex","j","md5","md51","getUrlFromCssText","removeReverseProxyURLPrefixes","re","exec","extractResourcesFromStyle","rv","propertyValue","trim","urls","srcsetRegexp","extractLinksFromElement","msMatchesSelector","srcset","regexp","mapper","clonedRegexp","isGlobal","global","execAll","parsedBaseUrl","parsedUrl","origin","pathname","hash","isIdUrl","poster","styleAttrUrls","extractResourceUrlsFromStyleAttrs","styleSheetToCssText","isInvisibleElement","element","getComputedStyle","getBoundingClientRect","isScreenMediaQuery","mediaQueryAst","conditionRules","extractConditionRules","rules","rawGetter","wrapHTMLElement","ctor","findConstructor","instance","proto","Proxy","_target","proxy","Reflect","unwrap","wrapper","NEED_MAP_INPUT_TYPES","ON_EVENT_REGEX","domNodesToCdt","docNode","cdt","DOCUMENT_NODE","docRoots","canvasElements","inlineFrames","frames","crossFrames","linkUrls","imageBlobs","videoBlobs","childNodeIndexes","childrenFactory","childNodes","adoptedStyleSheets","exp_adoptedStyleSheets","getAdoptedStyleSheets","elementNodes","childIndexes","elementNode","elementNodeFactory","elementNodeRaw","DOCUMENT_FRAGMENT_NODE","nodeAttributes","getScriptNode","isCustomShadowRoot","shadowRoot","declarationAst","processInlineStyleCss","getNamedItem","checked","indeterminate","hasValueAttr","attrValue","propValue","addOrUpdateAttribute","parentElement","selectedOptions","disabled","getBasicNode","cacheKey","__dsNodeCache","TEXT_NODE","nodeValue","getCssRulesNode","getTextContentNode","assignedNodes","shadowRootIndex","dummyUrl","cdtNode","uniqueId","frameUrl","linkUrlsFromElement","srcObject","getTextNode","DOCUMENT_TYPE_NODE","getDocNode","nodeAttr","uniq","arr","v","aggregateResourceUrlsAndBlobs","resourceUrlsAndBlobsArr","resourceUrls","allResourceUrls","blobsObj","allBlobsObj","TYPED_OK","Uint16Array","Int32Array","_has","p","shrinkBuf","buf","subarray","fnTyped","src_offs","dest_offs","flattenChunks","fnUntyped","setTyped","on","Buf8","Buf16","Buf32","utils","Z_BINARY","Z_TEXT","STORED_BLOCK","LENGTH_CODES","LITERALS","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MAX_BITS","Buf_size","MAX_BL_BITS","END_BLOCK","REP_3_6","REPZ_3_10","REPZ_11_138","extra_lbits","extra_dbits","extra_blbits","bl_order","static_ltree","zero$1","static_dtree","_dist_code","_length_code","MAX_MATCH","base_length","static_l_desc","static_d_desc","static_bl_desc","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","TreeDesc","dyn_tree","stat_desc","max_code","d_code","put_short","w","pending_buf","pending","send_bits","bi_valid","bi_buf","send_code","tree","bi_reverse","gen_codes","bl_count","bits","next_code","init_block","dyn_ltree","dyn_dtree","bl_tree","opt_len","static_len","last_lit","bi_windup","smaller","depth","_n2","_m2","pqdownheap","heap","heap_len","compress_block","ltree","dtree","lc","lx","d_buf","l_buf","build_tree","desc","stree","heap_max","h","xbits","gen_bitlen","scan_tree","curlen","prevlen","nextlen","max_count","min_count","send_tree","static_init_done","_tr_stored_block","stored_len","header","copy_block","trees$1","_tr_init","tr_static_init","l_desc","d_desc","bl_desc","_tr_flush_block","opt_lenb","static_lenb","max_blindex","strm","data_type","black_mask","detect_data_type","build_bl_tree","strategy","lcodes","dcodes","blcodes","rank","send_all_trees","_tr_tally","lit_bufsize","_tr_align","STATIC_TREES","bi_flush","adler32_1","adler","s1","s2","crcTable","table","makeTable","configuration_table","crc32_1","crc","messages","trees","adler32","crc32","Z_NO_FLUSH","Z_FINISH","Z_OK","Z_STREAM_ERROR","Z_DEFAULT_COMPRESSION","Z_FIXED","Z_UNKNOWN","Z_DEFLATED","MAX_MEM_LEVEL","MIN_MATCH","MIN_LOOKAHEAD","INIT_STATE","HCRC_STATE","BUSY_STATE","FINISH_STATE","BS_NEED_MORE","BS_BLOCK_DONE","BS_FINISH_STARTED","BS_FINISH_DONE","errorCode","flush_pending","avail_out","output","pending_out","next_out","total_out","flush_block_only","block_start","strstart","put_byte","putShortMSB","longest_match","cur_match","chain_length","max_chain_length","best_len","prev_length","nice_match","w_size","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","more","_w_size","window_size","hash_size","avail_in","next_in","wrap","total_in","ins_h","hash_shift","hash_mask","deflate_fast","flush","hash_head","bflush","match_length","max_lazy_match","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","func","DeflateState","pending_buf_size","gzhead","gzindex","method","last_flush","w_bits","hash_bits","deflateResetKeep","deflateReset","deflateInit2","windowBits","memLevel","max_block_size","max_start","deflate$3","deflateInit","deflateSetHeader","deflate","old_flush","beg","val","text","hcrc","comment","os","bstate","deflate_huff","deflate_rle","deflateEnd","deflateSetDictionary","dictionary","avail","tmpDict","dictLength","deflateInfo","STR_APPLY_OK","STR_APPLY_UIA_OK","__","_utf8len","buf2binstring","strings","string2buf","c2","m_pos","str_len","buf_len","binstring2buf","buf2string","out","c_len","utf16buf","utf8border","zstream","zlib_deflate","ZStream","Z_DEFAULT_STRATEGY","Deflate","chunkSize","to","opt","raw","gzip","ended","_dict_set","deflator","_mode","onEnd","onData","deflate$4","deflateRaw","MAXBITS","lbase","lext","dbase","dext","inflate_fast","_in","_out","dmax","wsize","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","op","from_source","lencode","distcode","lenbits","distbits","dolen","dodist","sane","inflate_table","lens","lens_index","codes","table_index","work","incr","low","here_bits","here_op","here_val","sym","curr","drop","used","huff","base_index","offs","extra_index","LENS","DISTS","HEAD","BAD","ENOUGH_LENS","ENOUGH_DISTS","zswap32","InflateState","havedict","total","wbits","ncode","nlen","ndist","have","lendyn","distdyn","back","was","inflateResetKeep","inflateReset","inflateReset2","inflateInit2","lenfix","distfix","virgin","fixedtables","updatewindow","inflate$3","inflateInit","inflate","put","last_bits","last_op","last_val","hbuf","inf_leave","xflags","extra_len","inflateEnd","inflateGetHeader","inflateSetDictionary","inflateInfo","constants","Z_PARTIAL_FLUSH","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_BLOCK","Z_TREES","Z_STREAM_END","Z_NEED_DICT","Z_ERRNO","Z_DATA_ERROR","Z_BUF_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","zlib_inflate","GZheader","Inflate","inflator","next_out_utf8","utf8str","allowBufError","inflate$4","inflateRaw","ungzip","pako","pako_1","createBlob","compress","serialize","resource","compressed","ab","lookup","uint8","extraBytes","maxChunkLength","len2","encodeChunk","arrayBufferToBase64","filterInlineUrl","toUnAnchoredUri","flat","flatArr","makeExtractResourcesFromSvg","decoder","extractResourceUrlsFromStyleTags","svgArrayBuffer","svgStr","TextDecoder","DOMParser","parseFromString","srcsetUrls","srcsetEl","srcUrls","srcEl","fromHref","fromObjects","getElementsByTagName","fromStyleTags","fromStyleAttrs","urlsFromStyleAttrOfDoc","makeFindStyleSheetByUrl","styleSheetCache","documents","allStylesheets","styleSheets","_e","styleSheet","styleUrl","urlStr","sanitizeAuthUrl","createTempStylsheet","cssArrayBuffer","createElement","appendChild","createTextNode","getCorsFreeStyleSheet","corsFreeStyleSheet","createTempStyleSheet","cleanStyleSheet","ownerNode","removeChild","buildCanvasBlobs","async","blobs","bufferPromise","dataDataUrl","dataURL","fetch","arrayBuffer","dataURLToArrayBuffer","toBlob","blob","resetNodeAndResolve","RESOURCE_STORAGE_KEY","filterInlineUrlsIfExisting","polling","showLogs","useSessionCache","dontFetchResources","fetchTimeout","skipResources","compressResources","serializeResources","elements","Document","referenceTime","Date","now","logArgs","sessionCache","sessionStorage","sessionStorageCache","storage","sessionStorageCacheStr","getItem","ex","setItem","persist","makeSessionCache","extractResourcesFromStyleSheet","CSSRule","getRuleUrls","IMPORT_RULE","importRule","FONT_FACE_RULE","SUPPORTS_RULE","MEDIA_RULE","STYLE_RULE","makeExtractResourcesFromStyleSheet","findStyleSheetByUrl","onlyDocStylesheet","styleEl","makeExtractResourceUrlsFromStyleTags","extractResourceUrlsFromAdoptedStyleSheets","makeExtractResourceUrlsFromAdoptedStyleSheets","extractResourcesFromSvg","fetchUrl","AbortController","timeout","mediaDownloadTimeout","reject","controller","timeoutReject","isTimeout","abort","timeoutId","setTimeout","credentials","signal","resp","clearTimeout","contentType","headers","errorStatusCode","makeFetchUrl","processResource","getResourceUrlsAndBlobs","forceCreateStyle","getDependencies","dependentUrls","probablyCORS","byteLength","thisBlob","absoluteDependentUrls","resourceUrl","dependencies","clearFromSessionStorage","doProcessResource","dep","makeProcessResource","makeGetResourceUrlsAndBlobs","doProcessPage","pageUrl","getBaseUrl","safeSelectors","elementsWithIds","elementsForElement","random","generatedSelectors","safeSelector","generateSafeSelectors","styleTagUrls","docRoot","adoptedStyleSheetUrls","absolutizeThisUrl","someUrl","encodedUri","int","toUriEncoding","resourceUrlsAndBlobsPromise","canvasBlobsPromise","imageBlobsPromise","resourceUrlsAndBlobs","fetchedBlobs","body","fetchedBlobsSet","canvasElement","naturalWidth","naturalHeight","getContext","drawImage","canvasResults","buildBlobImages","videoBlobsPromise","stream","captureStream","getVideoTracks","mediaRecorder","MediaRecorder","mimeType","addEventListener","stop","once","play","requestData","buildBlobVideos","processFramesPromise","processInlineFramesPromise","resultsWithFrameResults","canvasBlobs","framesResults","srcAttr","getElementAttribute","selectorAttr","blobUrl","blobsObjToArray","warnings","blobsWithoutHangingErrors","snapshot","baseUri","removeAttribute","attribute","scriptVersion"],"mappings":"wDACA,SAASA,EAAWC,EAAQC,EAAQ,GAChC,MAAMC,EAAOF,EAAOD,WAAWE,GAE/B,GAAIC,GAAQ,OAAUA,EAAO,MAAQ,CAIjC,OAAyB,MAHZA,EAGE,QAFHF,EAAOD,WAAWE,EAAQ,GAEE,OAAU,KACrD,CAED,OAAI,OAAUC,GAAQA,GAAQ,OAClB,EACLA,CACX,CA+BA,IAAAC,EA9BA,SAAkBH,EAAQI,GACtB,MAAMC,EAAS,GACf,IAAIC,EAAsB,EAC1B,IAAK,IAAIL,EAAQ,EAAGA,EAAQD,EAAOO,SAAUN,EAAO,CAChD,MAAMC,EAAOH,EAAWC,EAAQC,GAChC,IAAIO,EAAiB,EACjBN,EAAO,IAEHM,EADAN,EAAO,IACU,EACZA,EAAO,KACK,EACZA,EAAO,MACK,EACZA,EAAO,QACK,EACZA,EAAO,SACK,EAEA,GAErBI,EAAsBE,EAAiBJ,GACvCC,EAAOI,KAAKR,GACZK,EAAsBE,GAGtBF,GAAuBE,CAE9B,CACD,OAAOH,CACX,ECxCA,MAAMF,EAHkD,SAAUO,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAEE,QAAWF,EACxD,CACmBG,CAAgBC,GAC7BC,EAAW,CACbC,IAAK,MACLC,QAAS,UACTC,gBAAiB,kBACjBC,MAAO,SAoDX,IAAAC,EAVA,SAAcC,EAASC,EAAKC,EAAU,CAAA,GAElC,MAAMC,EAzCV,SAA4BC,GAAOrB,gBAAEA,EAAkB,GAAM,IACzD,GAAKqB,EAMA,IAAIA,EAAMC,MAAO,CAClB,GAAItB,EAAiB,CACjB,IAAKqB,EAAMpB,OACP,IACI,MAAMsB,EAAcC,KAAKC,UAAUJ,EAAMC,OACzCD,EAAMpB,QAAS,EAAIF,EAAWS,SAASe,EAAavB,GAChDqB,EAAMpB,OAAOE,OAAS,IACtBkB,EAAMK,KAAO,EACbL,EAAMC,MAAQC,EAErB,CACD,MAAOI,GACH,MAAO,CAAEC,OAAQjB,EAASI,MAAOc,MAAOF,EAAEG,QAC7C,CAEL,GAAIT,EAAMK,MAAQ,EACd,MAAO,CACHE,OAAQjB,EAASG,gBACjBQ,MAAOD,EAAMC,MAAMS,UAAUV,EAAMK,KAAOL,EAAMK,KAAOL,EAAMpB,OAAO+B,SACpEC,MAAOZ,EAAMK,KAGxB,CACD,MAAO,CAAEE,OAAQjB,EAASE,QAASS,MAAOD,EAAMC,MACnD,CACI,OAAID,EAAMQ,MACJ,CAAED,OAAQjB,EAASI,MAAOc,MAAOR,EAAMQ,OAGvC,CAAED,OAAQjB,EAASC,IAC7B,CAnCG,MAAO,CACHgB,OAAQjB,EAASI,MACjBc,MAAO,4EAkCnB,CAGmBK,EADfjB,EAAUA,GAAW,IACqBC,GAAMC,GAMhD,OALIC,EAAOQ,SAAWjB,EAASE,SAC3BO,EAAOQ,SAAWjB,EAASI,OAC1BK,EAAOQ,SAAWjB,EAASG,iBAAmBM,EAAOa,cAC/ChB,EAAQC,GAEZE,CACX,EC3DA,MAAMe,EAAOzB,EAab,IAAA0B,EAZA,SAAiBC,EAAQpB,EAASC,GAC9B,OAAQC,GAAY,YAAamB,GAQ7B,OAPKrB,EAAQC,KACTD,EAAQC,GAAO,GACfqB,QAAQC,UACHC,MAAK,IAAMJ,KAAUC,KACrBG,MAAKnB,GAAUL,EAAQC,GAAKI,MAAQA,IACpCoB,OAAMC,GAAQ1B,EAAQC,GAAKW,MAAQc,EAAIb,QAAU,WAAaa,EAAIC,SAEpET,EAAKlB,EAASC,EAAKC,GAElC,ECeA,IAAA0B,EAlBA,SAAuBC,EAAKC,GACxB,GAVJ,SAAuBD,GACnB,IAEI,OADA,IAAIE,IAAIF,IACD,CACV,CACD,MAAOH,GACH,OAAO,CACV,CACL,CAEQM,CAAcH,GACd,OAAOA,EACX,IAAII,GAAY,EAChB,IACIA,EAAYJ,IAAQK,UAAUL,EACjC,CACD,MAAOH,GACHO,GAAY,CACf,CACD,IACI,MAAME,EAAc,IAAIJ,IAAIF,EAAKC,GAASM,KAC1C,OAAQH,EAAqCE,EAAzBD,UAAUC,EACjC,CACD,MAAOT,GACH,OAAQO,EAA6BJ,EAAjBK,UAAUL,EACjC,CACL,ECrBA,IAAAQ,EALA,SAAuBC,GACnB,OAAQA,EAAMC,iBACVD,EAAMC,gBAAgBC,WACrB,YAAYC,KAAKH,EAAMC,gBAAgBC,SAASE,SACzD,ECKA,IAAAC,EATA,SAA2BL,GACvB,IACI,MAAMM,EAAMN,EAAMC,gBAClB,OAAOM,QAAQD,GAAOA,EAAIE,aAAeF,EAAIE,YAAYC,aAC5D,CACD,MAAOrB,GACH,OAAO,CACV,CACL,ECRIlC,EAAoD,SAAUH,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAEE,QAAWF,EACxD,EACA2D,OAAOC,eAAeC,EAAS,aAAc,CAAE7C,OAAO,IACtD,IAAA8C,EAAAD,EAAAC,kBAA4BC,EAAAF,EAAAE,cAAwBC,EAAAH,EAAAG,cAAwBH,EAAAhC,KAAeoC,EAAAJ,EAAAI,QAAkBJ,EAAAK,cAAmB,EAChI,MAAMzE,EAAaU,EAAgBC,GACnCyD,EAAAK,SAAmBzE,EAAWS,QAC9B,MAAM4B,EAAY3B,EAAgBgE,GAClC,IAAAF,EAAAJ,EAAAI,QAAkBnC,EAAU5B,QAC5B,MAAMQ,EAASP,EAAgBiE,GAC/BP,EAAAhC,KAAenB,EAAOR,QACtB,MAAMqC,EAAkBpC,EAAgBkE,GACxC,IAAAL,EAAAH,EAAAG,cAAwBzB,EAAgBrC,QACxC,MAAM8C,EAAkB7C,EAAgBmE,GACxC,IAAAP,EAAAF,EAAAE,cAAwBf,EAAgB9C,QACxC,MAAMoD,EAAsBnD,EAAgBoE,GAC5CT,EAAyBD,EAAAC,kBAAGR,EAAoBpD,QCjBzC,MAAMsE,EAAiB,uBCA9B,IAAqBC,EAAC,SAASC,GAC/B,IAAIC,EAAE,WAA4H,IAAItD,EAAE,SAASuD,GAAG,IAAIvD,EAAEuD,GAAGA,EAAE,IAAI,KAAK,QAAOvD,IAAI,gBAAgBwD,OAAOC,KAAKC,UAAW1D,EAAE2D,YAAYC,SAASC,gBAAgBC,SAAUF,SAASC,gBAAgBC,SAAS9D,GAAIA,EAAE+D,cAAcF,gBAAgBC,SAAS9D,IAAI,EAACgE,EAAEhE,EAAMiE,EAAE,SAASV,GAAG,IAAIA,EAAEW,aAAa,qCAAqC,CAAC,GAAGF,EAAE,CAACT,IAAI,MAAM,IAAIY,MAAM,4CAA4C,SAASZ,GAAG,IAAIvD,EAAEuD,EAAEa,WAAWJ,EAAET,EAAEc,QAAQJ,EAAEV,EAAEe,SAAS9F,OAAO+F,EAAE,GAAGC,MAAMC,KAAKzE,GAAG0E,KAAK,SAASnB,GAAG,OAAOA,EAAEoB,KAAK,KAAKpB,EAAE5D,MAAM,GAAG,IAAIiF,KAAK,KAAK,MAAM,IAAIZ,EAAE,IAAIO,GAAGN,EAAE,IAAI,MAAxK,CAA+KV,IAAIA,EAAEsB,aAAa,oCAAoC,SAAStB,GAAY,IAAT,IAAIvD,EAAE,GAAQuD,GAAGA,EAAEuB,WAAWrB,KAAKsB,cAAc,IAAI,IAAIf,EAAEC,EAAEV,EAAEc,QAAQW,cAAcT,EAAE,GAAGC,MAAMC,MAAM,OAAOT,EAAET,EAAE0B,iBAAY,EAAOjB,EAAEM,WAAW,IAAIY,QAAQ3B,GAAGgB,GAAG,IAAIN,GAAG,eAAeM,EAAE,GAAG,KAAKvE,EAAEmF,QAAQlB,GAAGV,EAAEA,EAAE0B,UAAW,CAAA,MAAM1B,GAAG,KAAK,CAAC,OAAOvD,EAAExB,OAAOwB,EAAE4E,KAAK,OAAO,OAAxR,CAAgSrB,GAAG,CAAE,EAACgB,EAAEvE,EAAE,SAASoF,EAAE7B,EAAEvD,GAAG,GAAGuE,EAAE,CAAChB,IAAI,CAAC,IAAIS,EAAE,SAAST,GAAG,OAAG,MAAMA,GAAIA,EAAE8B,aAAuE9B,EAAE8B,aAAa,qCAAnE,CAACnF,MAAM,oBAAoBL,KAAKC,UAAUyD,GAAuE,CAA/J,CAAgKA,GAAG,IAAIS,EAAE,MAAM,CAAC9D,MAAM,wCAAwC,GAAG8D,EAAE9D,MAAM,OAAO8D,EAAE,IAAIsB,EAAE1B,SAAS2B,iBAAiBvB,GAAG,IAAIsB,GAAG,IAAIA,EAAE9G,OAAO,MAAM,CAAC0B,MAAM,0DAA0D8D,GAAG,IAAIwB,EAAEF,EAAE,GAAG,OAAOE,EAAEX,aAAa,2BAA2B7E,GAAGwF,EAAEX,aAAa,6BAA4B,GAAIO,EAAEI,EAAExF,EAAE,CAACiE,EAAEV,GAAG,IAAIkC,EAAElC,EAAE8B,aAAa,4BAA4BK,EAAED,EAAEA,EAAE,IAAIzF,EAAEA,EAAE,OAAOuD,EAAEsB,aAAa,2BAA2Ba,GAAG,+BAA+B1F,EAAE,IAAI,CAAC,OAA7oD,SAAWuD,GAAG,OAAOA,GAAGA,EAAE3E,YAAY0D,OAAOoB,UAAUiC,eAAelB,KAAKlB,EAAE,WAAWA,EAAE1E,QAAQ0E,CAAC,CAAijDA,EAAG,SAASA,GAAG,OAAOA,EAAEmB,KAAK,SAASnB,GAAG,IAAIvD,EAAEuD,EAAE,GAAGS,EAAET,EAAE,GAAG,OAAOvD,EAAE0E,KAAK,SAASnB,GAAG,IAAIvD,EAAE,SAASuD,GAAG,IAAIvD,EAAE,CAACuD,GAAG,GAAGA,EAAEqC,YAAY,IAAI,IAAI5B,EAAET,EAAEqC,cAAc5B,IAAIJ,UAAUI,EAAE6B,aAAa,eAAe7B,EAAE6B,YAAYlB,KAAKX,EAAEA,EAAE8B,KAAKF,cAAc5F,EAAEtB,KAAKsF,EAAE8B,MAAM,OAAO9F,CAAE,CAA/K,CAAgLuD,GAAG,OAAOvD,EAAE0E,KAAK,SAASnB,GAAG,OAAO6B,EAAE7B,EAAES,EAAE,GAAG,GAAG,GAAG,GAAG,CAA7+D,GACN,OAAOV,EAAED,EACT,ECMA,SAAS0C,EAAuB5E,GAC9B,IAVF,SAAsBA,GACpB,IACE,MAAMsE,EAAI,IAAIpE,IAAIF,GAClB,OAAOgB,QAAQsD,EAAEO,UAAYP,EAAEQ,SAChC,CAAC,MAAOjF,GACP,OAAO,CACR,CACH,CAGOkF,CAAa/E,GAAM,OAAOA,EAC/B,IAAII,GAAY,EAChB,IACEA,EAAYJ,IAAQK,UAAUL,EAC/B,CAAC,MAAOH,GACPO,GAAY,CACb,CACD,MAAMkE,EAAI,IAAIpE,IAAIF,GAGlB,OAFAsE,EAAEO,SAAW,GACbP,EAAEQ,SAAW,GACL1E,EAAgCkE,EAAE/D,KAAtBF,UAAUiE,EAAE/D,KAClC,CCrBA,SAASyE,IACP,OAAO3C,OAAO4C,OAAOC,gBAAgB,IAAIC,YAAY,IAAI,EAC3D,CCAO,MACMC,EAAQ,EACRC,EAAW,EACXC,EAAY,EACZC,EAAO,EACPC,EAAS,EACTC,EAAY,EACZC,EAAM,EACNC,EAAS,EACTC,EAAQ,EACRC,EAAS,GACTC,EAAa,GACbC,EAAY,GACZC,EAAa,GACbC,EAAM,GACNC,EAAM,GACNC,EAAQ,GACRC,EAAY,GACZC,EAAQ,GACRC,EAAoB,GACpBC,EAAqB,GACrBC,EAAkB,GAClBC,EAAmB,GACnBC,EAAmB,GACnBC,EAAoB,GACpBC,EAAU,GC3BjBC,EAAM,EAOL,SAASC,EAAQ9J,GACpB,OAAOA,GAAQ,IAAUA,GAAQ,EACrC,CAKO,SAAS+J,EAAW/J,GACvB,OACI8J,EAAQ9J,IACPA,GAAQ,IAAUA,GAAQ,IAC1BA,GAAQ,IAAUA,GAAQ,GAEnC,CAIO,SAASgK,GAAkBhK,GAC9B,OAAOA,GAAQ,IAAUA,GAAQ,EACrC,CAsBO,SAASiK,GAAYjK,GACxB,OAbG,SAAkBA,GACrB,OAAOgK,GAAkBhK,IAPtB,SAA2BA,GAC9B,OAAOA,GAAQ,IAAUA,GAAQ,GACrC,CAKsCkK,CAAkBlK,EACxD,CAWWmK,CAASnK,IAPb,SAAoBA,GACvB,OAAOA,GAAQ,GACnB,CAK6BoK,CAAWpK,IAAkB,KAATA,CACjD,CAIO,SAASqK,GAAOrK,GACnB,OAAOiK,GAAYjK,IAAS8J,EAAQ9J,IAAkB,KAATA,CACjD,CAKO,SAASsK,GAAetK,GAC3B,OACKA,GAAQ,GAAUA,GAAQ,GACjB,KAATA,GACAA,GAAQ,IAAUA,GAAQ,IACjB,MAATA,CAET,CAMO,SAASuK,GAAUvK,GACtB,OAAgB,KAATA,GAA4B,KAATA,GAA4B,KAATA,CACjD,CAIO,SAASwK,GAAaxK,GACzB,OAAOuK,GAAUvK,IAAkB,KAATA,GAA4B,IAATA,CACjD,CAGO,SAASyK,GAAcC,EAAOC,GAEjC,OAAc,KAAVD,KAKAH,GAAUI,IAAWA,IAAWd,EAMxC,CAGO,SAASe,GAAkBF,EAAOC,EAAQE,GAI7C,OAAc,KAAVH,EAIIT,GAAYU,IACD,KAAXA,GACAF,GAAcE,EAAQE,KAK1BZ,GAAYS,IAMF,KAAVA,GAEOD,GAAcC,EAAOC,EAMpC,CAGO,SAASG,GAAcJ,EAAOC,EAAQE,GAKzC,OAAc,KAAVH,GAA8B,KAAVA,EAEhBZ,EAAQa,GACD,EAMO,KAAXA,GAAqBb,EAAQe,GAAS,EAAI,EAIvC,KAAVH,EAEOZ,EAAQa,GAAU,EAAI,EAI7Bb,EAAQY,GAED,EAKJ,CACX,CAOO,SAASK,GAAM/K,GAElB,OAAa,QAATA,GAKS,QAATA,EAJO,EAQJ,CACX,CAIA,MAAMgL,GAAW,IAAIC,MAAM,KAEdC,GAAqB,IACrBC,GAAgB,IAChBC,GAAoB,IACpBC,GAAuB,IAEpC,IAAK,IAAIhE,EAAI,EAAGA,EAAI2D,GAAS3K,OAAQgH,IACjC2D,GAAS3D,GACLmD,GAAanD,IAAM6D,IACnBpB,EAAQzC,IAAM8D,IACdlB,GAAY5C,IAAM+D,IAClBd,GAAejD,IAAMgE,IACrBhE,GAZmB,IAepB,SAASiE,GAAiBtL,GAC7B,OAAOA,EAAO,IAAOgL,GAAShL,GAAQoL,EAC1C,CCrMA,SAASG,GAAYC,EAAQC,GACzB,OAAOA,EAASD,EAAOnL,OAASmL,EAAO3L,WAAW4L,GAAU,CAChE,CAEO,SAASC,GAAiBF,EAAQC,EAAQzL,GAC7C,OAAa,KAATA,GAA4D,KAApCuL,GAAYC,EAAQC,EAAS,GAC9C,EAGJ,CACX,CAEO,SAASE,GAAQC,EAASH,EAAQI,GACrC,IAAI7L,EAAO4L,EAAQ/L,WAAW4L,GAO9B,OAJIzB,GAAkBhK,KAClBA,GAAc,IAGXA,IAAS6L,CACpB,CAEO,SAASC,GAAOF,EAASG,EAAOC,EAAKC,GACxC,GAAID,EAAMD,IAAUE,EAAa5L,OAC7B,OAAO,EAGX,GAAI0L,EAAQ,GAAKC,EAAMJ,EAAQvL,OAC3B,OAAO,EAGX,IAAK,IAAIgH,EAAI0E,EAAO1E,EAAI2E,EAAK3E,IAAK,CAC9B,MAAMwE,EAAgBI,EAAapM,WAAWwH,EAAI0E,GAClD,IAAIG,EAAWN,EAAQ/L,WAAWwH,GAOlC,GAJI2C,GAAkBkC,KAClBA,GAAsB,IAGtBA,IAAaL,EACb,OAAO,CAEf,CAEA,OAAO,CACX,CAYO,SAASM,GAAkBX,EAAQC,GACtC,KAAOA,EAASD,EAAOnL,QACdmK,GAAagB,EAAO3L,WAAW4L,IADTA,KAM/B,OAAOA,CACX,CAEO,SAASW,GAAqBZ,EAAQC,GACzC,KAAOA,EAASD,EAAOnL,QACdyJ,EAAQ0B,EAAO3L,WAAW4L,IADJA,KAM/B,OAAOA,CACX,CAGO,SAASY,GAAeb,EAAQC,GAMnC,GAAI1B,EAAWwB,GAAYC,GAH3BC,GAAU,GAGkC,IAAK,CAG7C,IAAK,MAAMa,EAAYC,KAAKC,IAAIhB,EAAOnL,OAAQoL,EAAS,GAAIA,EAASa,GAC5DvC,EAAWwB,GAAYC,EAAQC,IADwCA,KAOhF,MAAMzL,EAAOuL,GAAYC,EAAQC,GAC7BjB,GAAaxK,KACbyL,GAAUC,GAAiBF,EAAQC,EAAQzL,GAEnD,CAEA,OAAOyL,CACX,CAMO,SAASgB,GAAYjB,EAAQC,GAGhC,KAAOA,EAASD,EAAOnL,OAAQoL,IAAU,CACrC,MAAMzL,EAAOwL,EAAO3L,WAAW4L,GAG/B,IAAIpB,GAAOrK,GAAX,CAMA,IAAIyK,GAAczK,EAAMuL,GAAYC,EAAQC,EAAS,IAQrD,MANIA,EAASY,GAAeb,EAAQC,GAAU,CAL9C,CAYJ,CAEA,OAAOA,CACX,CAGO,SAASiB,GAAclB,EAAQC,GAClC,IAAIzL,EAAOwL,EAAO3L,WAAW4L,GA8B7B,GA1Ba,KAATzL,GAA4B,KAATA,IACnBA,EAAOwL,EAAO3L,WAAW4L,GAAU,IAInC3B,EAAQ9J,KACRyL,EAASW,GAAqBZ,EAAQC,EAAS,GAC/CzL,EAAOwL,EAAO3L,WAAW4L,IAIhB,KAATzL,GAAmB8J,EAAQ0B,EAAO3L,WAAW4L,EAAS,MAUtDA,EAASW,GAAqBZ,EAP9BC,GAAU,IAYVE,GAAQH,EAAQC,EAAQ,KAAc,CACtC,IAAIkB,EAAO,EACX3M,EAAOwL,EAAO3L,WAAW4L,EAAS,GAGrB,KAATzL,GAA4B,KAATA,IACnB2M,EAAO,EACP3M,EAAOwL,EAAO3L,WAAW4L,EAAS,IAIlC3B,EAAQ9J,KAQRyL,EAASW,GAAqBZ,EAAQC,EAAS,EAAIkB,EAAO,GAElE,CAEA,OAAOlB,CACX,CAKO,SAASmB,GAAsBpB,EAAQC,GAE1C,KAAOA,EAASD,EAAOnL,OAAQoL,IAAU,CACrC,MAAMzL,EAAOwL,EAAO3L,WAAW4L,GAI/B,GAAa,KAATzL,EAAiB,CAEjByL,IACA,KACJ,CAEIhB,GAAczK,EAAMuL,GAAYC,EAAQC,EAAS,MAKjDA,EAASY,GAAeb,EAAQC,GAExC,CAEA,OAAOA,CACX,CAIO,SAASoB,GAAcC,GAE1B,GAAuB,IAAnBA,EAAQzM,SAAiB0J,EAAW+C,EAAQjN,WAAW,IACvD,OAAOiN,EAAQ,GAInB,IAAI9M,EAAO+M,SAASD,EAAS,IAY7B,OATc,IAAT9M,GACAA,GAAQ,OAAUA,GAAQ,OAC1BA,EAAO,WAGRA,EAAO,OAIJwI,OAAOwE,cAAchN,EAChC,CC7Pe,IAAAiN,GAAA,CACX,YACA,cACA,iBACA,mBACA,aACA,eACA,mBACA,YACA,gBACA,cACA,eACA,mBACA,kBACA,mBACA,YACA,YACA,cACA,kBACA,cACA,UACA,UACA,UACA,UACA,UACA,UACA,iBC1BJ,MAAMC,GAAW,MAEV,SAASC,GAAYC,EAAS,KAAMC,GACvC,OAAe,OAAXD,GAAmBA,EAAO/M,OAASgN,EAC5B,IAAIlF,YAAYoE,KAAKe,IAAID,EAAO,KAAMH,KAG1CE,CACX,CCDA,SAASG,GAAuB5F,GAC5B,MAAM6D,EAAS7D,EAAK6D,OACdgC,EAAehC,EAAOnL,OACtBoN,EAAcjC,EAAOnL,OAAS,EAAI0K,GAAMS,EAAO3L,WAAW,IAAM,EAChE6N,EAAQP,GAAYxF,EAAK+F,MAAOF,GAChCG,EAAUR,GAAYxF,EAAKgG,QAASH,GAC1C,IAAII,EAAOjG,EAAKkG,UACZC,EAASnG,EAAKoG,YAElB,IAAK,IAAI1G,EAAIoG,EAAapG,EAAImG,EAAcnG,IAAK,CAC7C,MAAMrH,EAAOwL,EAAO3L,WAAWwH,GAE/BqG,EAAMrG,GAAKuG,EACXD,EAAQtG,GAAKyG,IAjBX,KAmBE9N,GAjBF,KAiBgBA,GAlBhB,KAkB8BA,IAjB9B,KAkBMA,GAAcqH,EAAI,EAAImG,GApB5B,KAoB4ChC,EAAO3L,WAAWwH,EAAI,KAC5DA,IACAqG,EAAMrG,GAAKuG,EACXD,EAAQtG,GAAKyG,GAGjBF,IACAE,EAAS,EAEjB,CAEAJ,EAAMF,GAAgBI,EACtBD,EAAQH,GAAgBM,EAExBnG,EAAK+F,MAAQA,EACb/F,EAAKgG,QAAUA,EACfhG,EAAKqG,UAAW,CACpB,CAEO,MAAMC,GACTvG,WAAAA,GACIwG,KAAKR,MAAQ,KACbQ,KAAKP,QAAU,KACfO,KAAKF,UAAW,CACpB,CACAG,SAAAA,CAAU3C,EAAQiC,EAAc,EAAGI,EAAY,EAAGE,EAAc,GAC5DG,KAAK1C,OAASA,EACd0C,KAAKT,YAAcA,EACnBS,KAAKL,UAAYA,EACjBK,KAAKH,YAAcA,EACnBG,KAAKF,UAAW,CACpB,CACAI,WAAAA,CAAY3C,EAAQ4C,GAKhB,OAJKH,KAAKF,UACNT,GAAuBW,MAGpB,CACH1C,OAAQ6C,EACR5C,OAAQyC,KAAKT,YAAchC,EAC3BmC,KAAMM,KAAKR,MAAMjC,GACjBqC,OAAQI,KAAKP,QAAQlC,GAE7B,CACA6C,gBAAAA,CAAiBvC,EAAOC,EAAKqC,GAKzB,OAJKH,KAAKF,UACNT,GAAuBW,MAGpB,CACH1C,OAAQ6C,EACRtC,MAAO,CACHN,OAAQyC,KAAKT,YAAc1B,EAC3B6B,KAAMM,KAAKR,MAAM3B,GACjB+B,OAAQI,KAAKP,QAAQ5B,IAEzBC,IAAK,CACDP,OAAQyC,KAAKT,YAAczB,EAC3B4B,KAAMM,KAAKR,MAAM1B,GACjB8B,OAAQI,KAAKP,QAAQ3B,IAGjC,ECpEJ,MAAMuC,GAAc,SACdC,GAAa,GACbC,GAAc,IAAIC,IAAI,CACxB,CAACC,EAAelF,GAChB,CAACD,EAAiBC,GAClB,CAACH,EAAmBC,GACpB,CAACG,EAAkBC,KAGhB,MAAMiF,GACTlH,WAAAA,CAAY8D,EAAQqD,GAChBX,KAAKC,UAAU3C,EAAQqD,EAC3B,CACAC,KAAAA,GACIZ,KAAKa,KAAM,EACXb,KAAKc,YAAc,EACnBd,KAAKe,UAAY,EACjBf,KAAKgB,WAAahB,KAAKiB,gBACvBjB,KAAKkB,SAAWlB,KAAKiB,eACzB,CACAhB,SAAAA,CAAU3C,EAAS,GAAIqD,EAAWA,UAG9B,MAAMrB,GAFNhC,EAAShD,OAAOgD,GAAU,KAEEnL,OACtBgP,EAAgBlC,GAAYe,KAAKmB,cAAe7D,EAAOnL,OAAS,GAChEiP,EAAUnC,GAAYe,KAAKoB,QAAS9D,EAAOnL,OAAS,GAC1D,IAAIkP,EAAa,EACbC,EAAmB,EACnBC,EAAe,EACfN,GAAmB,EA8CvB,IA3CAjB,KAAKmB,cAAgB,KACrBnB,KAAKoB,QAAU,KAEfT,EAASrD,GAAQ,CAACkE,EAAM3D,EAAOC,KAC3B,OAAQ0D,GACJ,QACIJ,EAAQC,GAAc/B,EACtB,MAEJ,KAAKgC,EAAkB,CACnB,IAAIG,EAAcF,EAAelB,GAKjC,IAJAkB,EAAeH,EAAQK,GACvBH,EAAmBC,GAAgBjB,GACnCc,EAAQC,GAAcI,EACtBL,EAAQK,KAAiBJ,EAClBI,EAAcJ,EAAYI,IACzBL,EAAQK,KAAiBnC,IACzB8B,EAAQK,GAAeJ,GAG/B,KACJ,CAEA,KAAK/F,EACL,KAAKmF,EACL,KAAKrF,EACL,KAAKI,EACD4F,EAAQC,GAAcE,EACtBD,EAAmBf,GAAYmB,IAAIF,GACnCD,EAAgBD,GAAoBhB,GAAce,EAI1DF,EAAcE,KAAiBG,GAAQlB,GAAcxC,GAC5B,IAArBmD,IACAA,EAAkBpD,EACtB,IAIJsD,EAAcE,GAAe1F,EAAqB2D,EAClD8B,EAAQC,GAAc/B,EACtB8B,EAAQ9B,GAAgBA,EACA,IAAjBiC,GAAoB,CACvB,MAAME,EAAcF,EAAelB,GACnCkB,EAAeH,EAAQK,GACvBL,EAAQK,GAAenC,CAC3B,CAEAU,KAAK1C,OAASA,EACd0C,KAAKiB,iBAAuC,IAArBA,EAAyB,EAAIA,EACpDjB,KAAKqB,WAAaA,EAClBrB,KAAKmB,cAAgBA,EACrBnB,KAAKoB,QAAUA,EAEfpB,KAAKY,QACLZ,KAAK2B,MACT,CAEAC,UAAAA,CAAWrE,GAGP,OAFAA,GAAUyC,KAAKc,YAEFd,KAAKqB,WACPrB,KAAKmB,cAAc5D,IAAW+C,GN9G9B,CMkHf,CACAuB,eAAAA,CAAgBC,GACZ,IAAK,IAAIvE,EAASyC,KAAKc,WAAYvD,EAASyC,KAAKqB,WAAY9D,IAAU,CACnE,MAAMwD,EAAYf,KAAKmB,cAAc5D,IAAW+C,GAEhD,GAAIS,IAAcjG,GAAciG,IAAcrF,GAC5B,GAAVoG,IACA,OAAOf,CAGnB,CAEA,ON9HW,CM+Hf,CACAgB,YAAAA,CAAaxE,GAGT,OAFAA,GAAUyC,KAAKc,YAEFd,KAAKqB,WACPrB,KAAKmB,cAAc5D,EAAS,GAAK8C,GAGrCL,KAAK1C,OAAOnL,MACvB,CACA6P,iBAAAA,CAAkBF,GACd,IAAK,IAAIvE,EAASyC,KAAKc,WAAYvD,EAASyC,KAAKqB,WAAY9D,IAAU,CACnE,MAAMwD,EAAYf,KAAKmB,cAAc5D,IAAW+C,GAEhD,GAAIS,IAAcjG,GAAciG,IAAcrF,GAC5B,GAAVoG,IACA,OAAOvE,EAASyC,KAAKc,UAGjC,CAEA,ONpJW,CMqJf,CACAmB,WAAAA,CAAY1E,EAAQQ,GAGhB,OAFAR,GAAUyC,KAAKc,YAEFd,KAAKqB,YACPzD,GACHoC,KAAK1C,OACL0C,KAAKmB,cAAc5D,EAAS,GAAK8C,GACjCL,KAAKmB,cAAc5D,GAAU8C,GAC7BtC,EAKZ,CACAmE,aAAAA,CAAcpB,GACV,OAAIA,IAAed,KAAKc,WACbd,KAAKgB,WAGZF,EAAa,EACNA,EAAad,KAAKqB,WACnBrB,KAAKmB,cAAcL,EAAa,GAAKT,GACrCL,KAAKmB,cAAcnB,KAAKqB,YAAchB,GAGzCL,KAAKiB,eAChB,CACAkB,cAAAA,CAAetE,GACX,OAAOmC,KAAK1C,OAAOvJ,UAAU8J,EAAOmC,KAAKgB,WAC7C,CAEAoB,aAAAA,CAAcC,GACV,OAAOrC,KAAKoB,QAAQpB,KAAKc,YAAcuB,CAC3C,CACAC,OAAAA,CAAQxQ,EAAMyL,GACV,OAAIA,EAEIyC,KAAK4B,WAAWrE,KAAY7C,GAC5BsF,KAAK1C,OAAO3L,WAAWqO,KAAK+B,aAAaxE,MAAazL,EAK1DkO,KAAKe,YAAcrG,GACnBsF,KAAK1C,OAAO3L,WAAWqO,KAAKgB,cAAgBlP,CAEpD,CAEAyQ,IAAAA,CAAKlB,GACD,IAAIM,EAAO3B,KAAKc,WAAaO,EAEzBM,EAAO3B,KAAKqB,YACZrB,KAAKc,WAAaa,EAClB3B,KAAKgB,WAAahB,KAAKmB,cAAcQ,EAAO,GAAKtB,GACjDsB,EAAO3B,KAAKmB,cAAcQ,GAC1B3B,KAAKe,UAAYY,GAAQrB,GACzBN,KAAKkB,SAAWS,EAAOtB,KAEvBL,KAAKc,WAAad,KAAKqB,WACvBrB,KAAK2B,OAEb,CACAA,IAAAA,GACI,IAAIA,EAAO3B,KAAKc,WAAa,EAEzBa,EAAO3B,KAAKqB,YACZrB,KAAKc,WAAaa,EAClB3B,KAAKgB,WAAahB,KAAKkB,SACvBS,EAAO3B,KAAKmB,cAAcQ,GAC1B3B,KAAKe,UAAYY,GAAQrB,GACzBN,KAAKkB,SAAWS,EAAOtB,KAEvBL,KAAKa,KAAM,EACXb,KAAKc,WAAad,KAAKqB,WACvBrB,KAAKe,UNhOE,EMiOPf,KAAKgB,WAAahB,KAAKkB,SAAWlB,KAAK1C,OAAOnL,OAEtD,CACAqQ,MAAAA,GACI,KAAOxC,KAAKe,YAAcjG,GAAckF,KAAKe,YAAcrF,GACvDsE,KAAK2B,MAEb,CACAc,iBAAAA,CAAkBC,EAAYC,GAC1B,IACIC,EACArF,EAFAsF,EAASH,EAIbI,EACA,KAAOD,EAAS7C,KAAKqB,aACjBuB,EAAa5C,KAAKoB,QAAQyB,KAGtBD,EAAaF,IAJYG,IAW7B,OAHAtF,EAASsF,EAAS,EAAI7C,KAAKmB,cAAc0B,EAAS,GAAKxC,GAAcL,KAAKiB,gBAGlE0B,EAAY3C,KAAK1C,OAAO3L,WAAW4L,KACvC,KAAK,EACD,MAAMuF,EAEV,KAAK,EACDD,IACA,MAAMC,EAEV,QAEQ9C,KAAKoB,QAAQwB,KAAgBC,IAC7BA,EAASD,GAKzB5C,KAAKuC,KAAKM,EAAS7C,KAAKc,WAC5B,CAEAiC,YAAAA,CAAaC,GACT,IAAK,IAAI7J,EAAI,EAAGoE,EAASyC,KAAKiB,gBAAiB9H,EAAI6G,KAAKqB,WAAYlI,IAAK,CACrE,MAAM0E,EAAQN,EACR0F,EAAOjD,KAAKmB,cAAchI,GAC1B2E,EAAMmF,EAAO5C,GAGnB9C,EAASO,EAETkF,EAJaC,GAAQ3C,GAIZzC,EAAOC,EAAK3E,EACzB,CACJ,CACA+J,IAAAA,GACI,MAAMC,EAAS,IAAIpG,MAAMiD,KAAKqB,YAW9B,OATArB,KAAK+C,cAAa,CAACvB,EAAM3D,EAAOC,EAAKjM,KACjCsR,EAAOtR,GAAS,CACZiQ,IAAKjQ,EACL2P,KAAMzC,GAAWyC,GACjB4B,MAAOpD,KAAK1C,OAAOvJ,UAAU8J,EAAOC,GACpCsD,QAASpB,KAAKoB,QAAQvP,GACzB,IAGEsR,CACX,EChRG,SAASxC,GAASrD,EAAQ+F,GAC7B,SAAShG,EAAYE,GACjB,OAAOA,EAAS+B,EAAehC,EAAO3L,WAAW4L,GAAU,CAC/D,CAGA,SAAS+F,IAKL,OAHA/F,EAASiB,GAAclB,EAAQC,GAG3Bb,GAAkBW,EAAYE,GAASF,EAAYE,EAAS,GAAIF,EAAYE,EAAS,KAIrFiE,EAAO+B,OACPhG,EAASgB,GAAYjB,EAAQC,KAKL,KAAxBF,EAAYE,IAEZiE,EAAO+B,OACPhG,UAKJiE,EAAO+B,EACX,CAGA,SAASC,IACL,MAAMC,EAAkBlG,EAOxB,OAJAA,EAASgB,GAAYjB,EAAQC,GAIzBK,GAAON,EAAQmG,EAAiBlG,EAAQ,QAAkC,KAAxBF,EAAYE,IAE9DA,EAASU,GAAkBX,EAAQC,EAAS,GAKhB,KAAxBF,EAAYE,IACY,KAAxBF,EAAYE,IACZiE,EAAO+B,OACPhG,EAASkG,EAAkB,SA2FvC,WAQI,IANAjC,EAAO+B,EAGPhG,EAASU,GAAkBX,EAAQC,GAG5BA,EAASD,EAAOnL,OAAQoL,IAAU,CACrC,MAAMzL,EAAOwL,EAAO3L,WAAW4L,GAE/B,OAAQH,GAAiBtL,IAErB,KAAK,GAGD,YADAyL,IASJ,KAAKP,GAOD,OALAO,EAASU,GAAkBX,EAAQC,GAKP,KAAxBF,EAAYE,IAAsBA,GAAUD,EAAOnL,YAC/CoL,EAASD,EAAOnL,QAChBoL,MAORA,EAASmB,GAAsBpB,EAAQC,QACvCiE,EAAO+B,IAOX,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAKpG,GAKD,OAFAI,EAASmB,GAAsBpB,EAAQC,QACvCiE,EAAO+B,GAIX,KAAK,GAGD,GAAIhH,GAAczK,EAAMuL,EAAYE,EAAS,IAAK,CAC9CA,EAASY,GAAeb,EAAQC,GAAU,EAC1C,KACJ,CAMA,OAFAA,EAASmB,GAAsBpB,EAAQC,QACvCiE,EAAO+B,GAMnB,CACJ,CAnKQG,IAMwB,KAAxBrG,EAAYE,IACZiE,EAAO+B,OACPhG,UAKJiE,EAAO+B,EACX,CAGA,SAASI,EAAmBC,GAYxB,IARKA,IACDA,EAAkBvG,EAAYE,MAIlCiE,EAAO+B,EAGAhG,EAASD,EAAOnL,OAAQoL,IAAU,CACrC,MAAMzL,EAAOwL,EAAO3L,WAAW4L,GAE/B,OAAQH,GAAiBtL,IAErB,KAAK8R,EAGD,YADArG,IASJ,KAAKP,GACD,GAAIX,GAAUvK,GAKV,OAFAyL,GAAUC,GAAiBF,EAAQC,EAAQzL,QAC3C0P,EAAO+B,GAGX,MAGJ,KAAK,GAED,GAAIhG,IAAWD,EAAOnL,OAAS,EAC3B,MAGJ,MAAM0R,EAAWxG,EAAYE,EAAS,GAGlClB,GAAUwH,GACVtG,GAAUC,GAAiBF,EAAQC,EAAS,EAAGsG,GACxCtH,GAAczK,EAAM+R,KAI3BtG,EAASY,GAAeb,EAAQC,GAAU,GAO1D,CACJ,CAyFA,MAAM+B,GAFNhC,EAAShD,OAAOgD,GAAU,KAEEnL,OAC5B,IAEIqP,EAFA3D,EAAQhB,GAAMQ,EAAY,IAC1BE,EAASM,EAKb,KAAON,EAAS+B,GAAc,CAC1B,MAAMxN,EAAOwL,EAAO3L,WAAW4L,GAE/B,OAAQH,GAAiBtL,IAErB,KAAKkL,GAEDwE,EAAO+B,EACPhG,EAASU,GAAkBX,EAAQC,EAAS,GAC5C,MAGJ,KAAK,GAEDoG,IACA,MAGJ,KAAK,GAEGxH,GAAOkB,EAAYE,EAAS,KAAOhB,GAAcc,EAAYE,EAAS,GAAIF,EAAYE,EAAS,KAE/FiE,EAAO+B,EAQPhG,EAASgB,GAAYjB,EAAQC,EAAS,KAKtCiE,EAAO+B,EACPhG,KAGJ,MAGJ,KAAK,GAEDoG,IACA,MAGJ,KAAK,GAEDnC,EAAO+B,EACPhG,IACA,MAGJ,KAAK,GAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAK,GAEGX,GAAc9K,EAAMuL,EAAYE,EAAS,GAAIF,EAAYE,EAAS,IAElE+F,KAGA9B,EAAO+B,EACPhG,KAEJ,MAGJ,KAAK,GAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAK,GAEGX,GAAc9K,EAAMuL,EAAYE,EAAS,GAAIF,EAAYE,EAAS,IAClE+F,IAGgC,KAA5BjG,EAAYE,EAAS,IACO,KAA5BF,EAAYE,EAAS,IACrBiE,EAAO+B,EACPhG,GAAkB,GAGdb,GAAkB5K,EAAMuL,EAAYE,EAAS,GAAIF,EAAYE,EAAS,IAEtEiG,KAGAhC,EAAO+B,EACPhG,KAIZ,MAGJ,KAAK,GAEGX,GAAc9K,EAAMuL,EAAYE,EAAS,GAAIF,EAAYE,EAAS,IAElE+F,KAGA9B,EAAO+B,EACPhG,KAGJ,MAGJ,KAAK,GAE+B,KAA5BF,EAAYE,EAAS,IAGrBiE,EAAO+B,EACPhG,EAASD,EAAOzE,QAAQ,KAAM0E,EAAS,GACvCA,GAAqB,IAAZA,EAAgBD,EAAOnL,OAASoL,EAAS,IAElDiE,EAAO+B,EACPhG,KAEJ,MAGJ,KAAK,GAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAK,GAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAK,GAE+B,KAA5BF,EAAYE,EAAS,IACO,KAA5BF,EAAYE,EAAS,IACO,KAA5BF,EAAYE,EAAS,IAErBiE,EAAO+B,EACPhG,GAAkB,IAGlBiE,EAAO+B,EACPhG,KAGJ,MAGJ,KAAK,GAEGb,GAAkBW,EAAYE,EAAS,GAAIF,EAAYE,EAAS,GAAIF,EAAYE,EAAS,KAEzFiE,EAAO+B,EACPhG,EAASgB,GAAYjB,EAAQC,EAAS,KAGtCiE,EAAO+B,EACPhG,KAGJ,MAGJ,KAAK,GAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAK,GAEGhB,GAAczK,EAAMuL,EAAYE,EAAS,IAEzCiG,KAGAhC,EAAO+B,EACPhG,KAEJ,MAGJ,KAAK,GAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAK,IAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAK,IAEDiE,EAAO+B,EACPhG,IACA,MAGJ,KAAKN,GAEDqG,IACA,MAGJ,KAAKpG,GAEDsG,IACA,MAQJ,QAEIhC,EAAO+B,EACPhG,IAIR8F,EAAQ7B,EAAM3D,EAAOA,EAAQN,EACjC,CACJ,CCxeA,IAAIuG,GAAkB,KAEf,MAAMC,GACT,iBAAOC,CAAWC,GACd,MAAO,CACHC,KAAM,KACNvC,KAAM,KACNsC,OAER,CAEAzK,WAAAA,GACIwG,KAAKmE,KAAO,KACZnE,KAAKoE,KAAO,KACZpE,KAAK6C,OAAS,IAClB,CACAmB,UAAAA,CAAWC,GACP,OAAOF,GAAKC,WAAWC,EAC3B,CAGAI,cAAAA,CAAeH,EAAMvC,GACjB,IAAIkB,EAkBJ,OAhBwB,OAApBiB,IACAjB,EAASiB,GACTA,GAAkBA,GAAgBjB,OAClCA,EAAOqB,KAAOA,EACdrB,EAAOlB,KAAOA,EACdkB,EAAOA,OAAS7C,KAAK6C,QAErBA,EAAS,CACLqB,OACAvC,OACAkB,OAAQ7C,KAAK6C,QAIrB7C,KAAK6C,OAASA,EAEPA,CACX,CACAyB,aAAAA,GACI,MAAMzB,OAAEA,GAAW7C,KAEnBA,KAAK6C,OAASA,EAAOA,OACrBA,EAAOqB,KAAO,KACdrB,EAAOlB,KAAO,KACdkB,EAAOA,OAASiB,GAChBA,GAAkBjB,CACtB,CACA0B,aAAAA,CAAcC,EAASC,EAASC,EAASC,GACrC,IAAI9B,OAAEA,GAAW7C,KAEjB,KAAkB,OAAX6C,GACCA,EAAOqB,OAASM,IAChB3B,EAAOqB,KAAOO,GAGd5B,EAAOlB,OAAS+C,IAChB7B,EAAOlB,KAAOgD,GAGlB9B,EAASA,EAAOA,MAExB,CACA,EAAE+B,OAAOC,YACL,IAAK,IAAIhC,EAAS7C,KAAKmE,KAAiB,OAAXtB,EAAiBA,EAASA,EAAOlB,WACpDkB,EAAOoB,IAErB,CAGA,QAAI9E,GACA,IAAIA,EAAO,EAEX,IAAK,IAAI0D,EAAS7C,KAAKmE,KAAiB,OAAXtB,EAAiBA,EAASA,EAAOlB,KAC1DxC,IAGJ,OAAOA,CACX,CACA,WAAI2F,GACA,OAAqB,OAAd9E,KAAKmE,IAChB,CACA,SAAI3H,GACA,OAAOwD,KAAKmE,MAAQnE,KAAKmE,KAAKF,IAClC,CACA,QAAIc,GACA,OAAO/E,KAAKoE,MAAQpE,KAAKoE,KAAKH,IAClC,CAGAe,SAAAA,CAAUC,GACN,IAAIpC,EAAS,KACb7C,KAAKmE,KAAO,KAEZ,IAAK,IAAIF,KAAQgB,EAAO,CACpB,MAAMhC,EAAOc,GAAKC,WAAWC,GAEd,OAAXpB,EACAA,EAAOlB,KAAOsB,EAEdjD,KAAKmE,KAAOlB,EAGhBA,EAAKiB,KAAOrB,EACZA,EAASI,CACb,CAGA,OADAjD,KAAKoE,KAAOvB,EACL7C,IACX,CACAkF,OAAAA,GACI,MAAO,IAAIlF,KACf,CACAmF,MAAAA,GACI,MAAO,IAAInF,KACf,CAGAoF,OAAAA,CAAQpC,EAAIqC,EAAUrF,MAElB,MAAM6C,EAAS7C,KAAKqE,eAAe,KAAMrE,KAAKmE,MAE9C,KAAuB,OAAhBtB,EAAOlB,MAAe,CACzB,MAAMsB,EAAOJ,EAAOlB,KACpBkB,EAAOlB,KAAOsB,EAAKtB,KACnBqB,EAAG5K,KAAKiN,EAASpC,EAAKgB,KAAMhB,EAAMjD,KACtC,CAGAA,KAAKsE,eACT,CACAgB,YAAAA,CAAatC,EAAIqC,EAAUrF,MAEvB,MAAM6C,EAAS7C,KAAKqE,eAAerE,KAAKoE,KAAM,MAE9C,KAAuB,OAAhBvB,EAAOqB,MAAe,CACzB,MAAMjB,EAAOJ,EAAOqB,KACpBrB,EAAOqB,KAAOjB,EAAKiB,KACnBlB,EAAG5K,KAAKiN,EAASpC,EAAKgB,KAAMhB,EAAMjD,KACtC,CAGAA,KAAKsE,eACT,CACAiB,MAAAA,CAAOvC,EAAIwC,EAAcH,EAAUrF,MAE/B,IAEIiD,EAFAJ,EAAS7C,KAAKqE,eAAe,KAAMrE,KAAKmE,MACxCsB,EAAMD,EAGV,KAAuB,OAAhB3C,EAAOlB,MACVsB,EAAOJ,EAAOlB,KACdkB,EAAOlB,KAAOsB,EAAKtB,KAEnB8D,EAAMzC,EAAG5K,KAAKiN,EAASI,EAAKxC,EAAKgB,KAAMhB,EAAMjD,MAMjD,OAFAA,KAAKsE,gBAEEmB,CACX,CACAC,WAAAA,CAAY1C,EAAIwC,EAAcH,EAAUrF,MAEpC,IAEIiD,EAFAJ,EAAS7C,KAAKqE,eAAerE,KAAKoE,KAAM,MACxCqB,EAAMD,EAGV,KAAuB,OAAhB3C,EAAOqB,MACVjB,EAAOJ,EAAOqB,KACdrB,EAAOqB,KAAOjB,EAAKiB,KAEnBuB,EAAMzC,EAAG5K,KAAKiN,EAASI,EAAKxC,EAAKgB,KAAMhB,EAAMjD,MAMjD,OAFAA,KAAKsE,gBAEEmB,CACX,CACAE,IAAAA,CAAK3C,EAAIqC,EAAUrF,MACf,IAAK,IAAI6C,EAAS7C,KAAKmE,KAAiB,OAAXtB,EAAiBA,EAASA,EAAOlB,KAC1D,GAAIqB,EAAG5K,KAAKiN,EAASxC,EAAOoB,KAAMpB,EAAQ7C,MACtC,OAAO,EAIf,OAAO,CACX,CACA3H,GAAAA,CAAI2K,EAAIqC,EAAUrF,MACd,MAAM5M,EAAS,IAAI2Q,GAEnB,IAAK,IAAIlB,EAAS7C,KAAKmE,KAAiB,OAAXtB,EAAiBA,EAASA,EAAOlB,KAC1DvO,EAAOwS,WAAW5C,EAAG5K,KAAKiN,EAASxC,EAAOoB,KAAMpB,EAAQ7C,OAG5D,OAAO5M,CACX,CACAyS,MAAAA,CAAO7C,EAAIqC,EAAUrF,MACjB,MAAM5M,EAAS,IAAI2Q,GAEnB,IAAK,IAAIlB,EAAS7C,KAAKmE,KAAiB,OAAXtB,EAAiBA,EAASA,EAAOlB,KACtDqB,EAAG5K,KAAKiN,EAASxC,EAAOoB,KAAMpB,EAAQ7C,OACtC5M,EAAOwS,WAAW/C,EAAOoB,MAIjC,OAAO7Q,CACX,CAEA0S,SAAAA,CAAUjI,EAAOmF,EAAIqC,EAAUrF,MAC3B,GAAc,OAAVnC,EACA,OAIJ,MAAMgF,EAAS7C,KAAKqE,eAAe,KAAMxG,GAEzC,KAAuB,OAAhBgF,EAAOlB,MAAe,CACzB,MAAMsB,EAAOJ,EAAOlB,KAEpB,GADAkB,EAAOlB,KAAOsB,EAAKtB,KACfqB,EAAG5K,KAAKiN,EAASpC,EAAKgB,KAAMhB,EAAMjD,MAClC,KAER,CAGAA,KAAKsE,eACT,CACAyB,SAAAA,CAAUlI,EAAOmF,EAAIqC,EAAUrF,MAC3B,GAAc,OAAVnC,EACA,OAIJ,MAAMgF,EAAS7C,KAAKqE,eAAexG,EAAO,MAE1C,KAAuB,OAAhBgF,EAAOqB,MAAe,CACzB,MAAMjB,EAAOJ,EAAOqB,KAEpB,GADArB,EAAOqB,KAAOjB,EAAKiB,KACflB,EAAG5K,KAAKiN,EAASpC,EAAKgB,KAAMhB,EAAMjD,MAClC,KAER,CAGAA,KAAKsE,eACT,CAGA0B,KAAAA,GACIhG,KAAKmE,KAAO,KACZnE,KAAKoE,KAAO,IAChB,CACA6B,IAAAA,GACI,MAAM7S,EAAS,IAAI2Q,GAEnB,IAAK,IAAIE,KAAQjE,KACb5M,EAAOwS,WAAW3B,GAGtB,OAAO7Q,CACX,CACA8S,OAAAA,CAAQjD,GAoBJ,OAhBAjD,KAAKuE,cAAc,KAAMtB,EAAMjD,KAAKmE,KAAMlB,GAGxB,OAAdjD,KAAKmE,MAELnE,KAAKmE,KAAKD,KAAOjB,EAEjBA,EAAKtB,KAAO3B,KAAKmE,MAIjBnE,KAAKoE,KAAOnB,EAIhBjD,KAAKmE,KAAOlB,EACLjD,IACX,CACAmG,WAAAA,CAAYlC,GACR,OAAOjE,KAAKkG,QAAQnC,GAAKC,WAAWC,GACxC,CACAmC,MAAAA,CAAOnD,GACH,OAAOjD,KAAKqG,OAAOpD,EACvB,CACA2C,UAAAA,CAAW3B,GACP,OAAOjE,KAAKqG,OAAOtC,GAAKC,WAAWC,GACvC,CACAoC,MAAAA,CAAOpD,EAAMqD,EAAS,MAClB,GAAe,OAAXA,EAMA,GAFAtG,KAAKuE,cAAc+B,EAAOpC,KAAMjB,EAAMqD,EAAQrD,GAE1B,OAAhBqD,EAAOpC,KAAe,CAEtB,GAAIlE,KAAKmE,OAASmC,EACd,MAAM,IAAIxO,MAAM,iCAIpBkI,KAAKmE,KAAOlB,EACZqD,EAAOpC,KAAOjB,EACdA,EAAKtB,KAAO2E,EACZtG,KAAKuE,cAAc,KAAMtB,EAC7B,MAEIqD,EAAOpC,KAAKvC,KAAOsB,EACnBA,EAAKiB,KAAOoC,EAAOpC,KACnBoC,EAAOpC,KAAOjB,EACdA,EAAKtB,KAAO2E,OAMhBtG,KAAKuE,cAAcvE,KAAKoE,KAAMnB,EAAM,KAAMA,GAGxB,OAAdjD,KAAKoE,MAELpE,KAAKoE,KAAKzC,KAAOsB,EAEjBA,EAAKiB,KAAOlE,KAAKoE,MAIjBpE,KAAKmE,KAAOlB,EAIhBjD,KAAKoE,KAAOnB,EAGhB,OAAOjD,IACX,CACAuG,UAAAA,CAAWtC,EAAMqC,GACb,OAAOtG,KAAKqG,OAAOtC,GAAKC,WAAWC,GAAOqC,EAC9C,CACAE,MAAAA,CAAOvD,GAMH,GAFAjD,KAAKuE,cAActB,EAAMA,EAAKiB,KAAMjB,EAAMA,EAAKtB,MAE7B,OAAdsB,EAAKiB,KACLjB,EAAKiB,KAAKvC,KAAOsB,EAAKtB,SACnB,CACH,GAAI3B,KAAKmE,OAASlB,EACd,MAAM,IAAInL,MAAM,+BAGpBkI,KAAKmE,KAAOlB,EAAKtB,IACrB,CAEA,GAAkB,OAAdsB,EAAKtB,KACLsB,EAAKtB,KAAKuC,KAAOjB,EAAKiB,SACnB,CACH,GAAIlE,KAAKoE,OAASnB,EACd,MAAM,IAAInL,MAAM,+BAGpBkI,KAAKoE,KAAOnB,EAAKiB,IACrB,CAKA,OAHAjB,EAAKiB,KAAO,KACZjB,EAAKtB,KAAO,KAELsB,CACX,CACA5Q,IAAAA,CAAK4R,GACDjE,KAAKqG,OAAOtC,GAAKC,WAAWC,GAChC,CACAwC,GAAAA,GACI,OAAqB,OAAdzG,KAAKoE,KAAgBpE,KAAKwG,OAAOxG,KAAKoE,MAAQ,IACzD,CACAtL,OAAAA,CAAQmL,GACJjE,KAAKkG,QAAQnC,GAAKC,WAAWC,GACjC,CACAjQ,KAAAA,GACI,OAAqB,OAAdgM,KAAKmE,KAAgBnE,KAAKwG,OAAOxG,KAAKmE,MAAQ,IACzD,CACAuC,WAAAA,CAAYC,GACR,OAAO3G,KAAK4G,WAAWD,EAAM3G,KAAKmE,KACtC,CACA0C,UAAAA,CAAWF,GACP,OAAO3G,KAAK4G,WAAWD,EAC3B,CACAC,UAAAA,CAAWD,EAAML,GAEb,OAAkB,OAAdK,EAAKxC,OAILmC,SACAtG,KAAKuE,cAAc+B,EAAOpC,KAAMyC,EAAKvC,KAAMkC,EAAQK,EAAKxC,MAGpC,OAAhBmC,EAAOpC,MAEPoC,EAAOpC,KAAKvC,KAAOgF,EAAKxC,KACxBwC,EAAKxC,KAAKD,KAAOoC,EAAOpC,MAExBlE,KAAKmE,KAAOwC,EAAKxC,KAGrBmC,EAAOpC,KAAOyC,EAAKvC,KACnBuC,EAAKvC,KAAKzC,KAAO2E,IAEjBtG,KAAKuE,cAAcvE,KAAKoE,KAAMuC,EAAKvC,KAAM,KAAMuC,EAAKxC,MAGlC,OAAdnE,KAAKoE,MAILpE,KAAKoE,KAAKzC,KAAOgF,EAAKxC,KAEtBwC,EAAKxC,KAAKD,KAAOlE,KAAKoE,MAItBpE,KAAKmE,KAAOwC,EAAKxC,KAIrBnE,KAAKoE,KAAOuC,EAAKvC,MAGrBuC,EAAKxC,KAAO,KACZwC,EAAKvC,KAAO,MAvCDpE,IAyCf,CACA8G,OAAAA,CAAQC,EAASC,GACT,SAAUA,EACVhH,KAAK4G,WAAWI,EAAeD,GAE/B/G,KAAKqG,OAAOW,EAAeD,GAG/B/G,KAAKwG,OAAOO,EAChB,ECndG,SAASE,GAAkB3O,EAAMxE,GAGpC,MAAMD,EAAQoC,OAAOiR,OAAOC,YAAY9P,WAClC+P,EAAa,IAAItP,MAEvB,OAAO7B,OAAOoR,OAAOxT,EAAO,CACxByE,OACAxE,UACA,SAAIc,GACA,OAAQwS,EAAWxS,OAAS,IAAIkS,QAAQ,eAAgB,GAAGxO,MAASxE,MACxE,GAER,CCXA,MAAMwT,GAAkB,IAClBC,GAAoB,GACpBC,GAAkB,OAExB,SAASC,IAAenK,OAAEA,EAAMoC,KAAEA,EAAIE,OAAEA,EAAM8H,SAAEA,EAAQC,WAAEA,GAAcC,GACpE,SAASC,EAAahK,EAAOC,GACzB,OAAO0B,EACFrH,MAAM0F,EAAOC,GACbzF,KAAI,CAACqH,EAAMoC,IACRxH,OAAOuD,EAAQiE,EAAM,GAAGgG,SAASC,GAAgB,KAAOrI,IAC1DnH,KAAK,KACf,CAEA,MAEMiH,GAFW,KAAKwI,OAAO3J,KAAKe,IAAIsI,EAAW,EAAG,IACjC,IAAIM,OAAO3J,KAAKe,IAAIuI,EAAa,EAAG,IAChBrK,GAAQ2K,MAAM,eAC/CtI,EAAYtB,KAAKe,IAAI,EAAGM,EAAOkI,GAAc,EAC7CM,EAAU7J,KAAKC,IAAIoB,EAAOkI,EAAYpI,EAAMrN,OAAS,GACrD4V,EAAe1J,KAAKe,IAAI,EAAG9E,OAAO4N,GAAS/V,QAAU,EAC3D,IAAIgW,EAAU,GAGdvI,IAAW4H,GAAgBrV,OAAS,IAAMqN,EAAME,EAAO,GAAG0I,OAAO,EAAGxI,EAAS,GAAGyI,MAAM,QAAU,IAAIlW,QAEvFmV,KACTa,EAAUvI,EAAS2H,GAAoB,EACvC3H,EAAS2H,GAAoB,GAGjC,IAAK,IAAIpO,EAAIwG,EAAWxG,GAAK+O,EAAS/O,IAC9BA,GAAK,GAAKA,EAAIqG,EAAMrN,SACpBqN,EAAMrG,GAAKqG,EAAMrG,GAAG2N,QAAQ,MAAOU,IACnChI,EAAMrG,IACDgP,EAAU,GAAK3I,EAAMrG,GAAGhH,OAASgW,EAAU,IAAW,IACvD3I,EAAMrG,GAAGiP,OAAOD,EAASb,GAAkB,IAC1C9H,EAAMrG,GAAGhH,OAASgW,EAAUb,GAAkB,EAAI,IAAW,KAI1E,MAAO,CACHO,EAAalI,EAAWD,GACxB,IAAI3C,MAAM6C,EAASmI,EAAe,GAAGxP,KAAK,KAAO,IACjDsP,EAAanI,EAAMwI,IACrBrC,OAAO/P,SACJyC,KAAK,MACLuO,QAAQ,oBAAqB,IAC7BA,QAAQ,oBAAqB,GACtC,CAEO,SAASK,GAAYrT,EAASwJ,EAAQC,EAAQmC,EAAME,EAAQ8H,EAAW,EAAGC,EAAa,GAiB1F,OAhBc1R,OAAOoR,OAAOJ,GAAkB,cAAenT,GAAU,CACnEwJ,SACAC,SACAmC,OACAE,SACA6H,eAAeG,GACJH,GAAe,CAAEnK,SAAQoC,OAAME,SAAQ8H,WAAUC,cAAcW,MAAMV,GAAc,EAAIA,GAElG,oBAAIW,GACA,MACI,gBAAgBzU,MAChB2T,GAAe,CAAEnK,SAAQoC,OAAME,SAAQ8H,WAAUC,cAAc,EAEvE,GAIR,CCnEO,SAASa,GAAaC,GACzB,MAAMxQ,EAAW+H,KAAK0I,aACtB,IAAIC,GAAQ,EACZ,MAAM1V,EAAU,CACZwV,cAGJ,MAAQzI,KAAKa,KAAK,CACd,OAAQb,KAAKe,WACT,KAAKrF,EACDsE,KAAK2B,OACL,SAEJ,KAAK7G,EACD6N,GAAQ,EACR3I,KAAK2B,OACL,SAGR,IAAIiH,EAAQH,EAAWI,QAAQzQ,KAAK4H,KAAM/M,GAE1C,QAAc6V,IAAVF,EACA,MAGAD,IACIF,EAAWM,cACXN,EAAWM,aAAa3Q,KAAK4H,KAAM4I,EAAO3Q,EAAUhF,GAExD0V,GAAQ,GAGZ1Q,EAAS5F,KAAKuW,EAClB,CAMA,OAJID,GAASF,EAAWM,cACpBN,EAAWM,aAAa3Q,KAAK4H,KAAM,KAAM/H,EAAUhF,GAGhDgF,CACX,CClBA,MAAM+Q,GAAOA,OACPC,GAAkB,GAClBC,GAAa,GACbC,GAAY,GACZC,GAAmB,IACnBC,GAAO,EAEb,SAASC,GAAmBhR,GACxB,OAAO,WACH,OAAO0H,KAAK1H,KAEpB,CAEA,SAASiR,GAAiBC,GACtB,MAAMpW,EAAS6C,OAAOiR,OAAO,MAE7B,IAAK,MAAM5O,KAAQrC,OAAOwT,KAAKD,GAAO,CAClC,MAAMvG,EAAOuG,EAAKlR,GACZ0K,EAAKC,EAAKyG,OAASzG,EAErBD,IACA5P,EAAOkF,GAAQ0K,EAEvB,CAEA,OAAO5P,CACX,CA+BO,SAASuW,GAAaC,GACzB,IAAItM,EAAS,GACT6C,EAAW,YACX0J,GAAgB,EAChBC,EAAed,GACfe,GAAoB,EAExB,MAAMC,EAAc,IAAIjK,GAClBkK,EAAShU,OAAOoR,OAAO,IAAI3G,GArCrC,SAAuBkJ,GACnB,MAAMM,EAAc,CAChBjX,QAASgD,OAAOiR,OAAO,MACvBiD,SAAUlU,OAAOoR,OAAOpR,OAAOiR,OAAO,MAAO0C,EAAOO,UACpDC,MAAOnU,OAAOoR,OAAOpR,OAAOiR,OAAO,MAAO0C,EAAOQ,OACjDC,OAAQd,GAAiBK,EAAOS,QAChCC,OAAQf,GAAiBK,EAAOU,QAChCC,KAAMhB,GAAiBK,EAAOW,OAGlC,IAAK,MAAOjS,EAAMrF,KAAYgD,OAAOuU,QAAQZ,EAAOa,cAChD,cAAexX,GACX,IAAK,WACDiX,EAAYjX,QAAQqF,GAAQrF,EAC5B,MAEJ,IAAK,SACDiX,EAAYjX,QAAQqF,GAAQgR,GAAmBrW,GAK3D,MAAO,CACH2W,OAAQM,KACLA,KACAA,EAAYK,KAEvB,CAUoDG,CAAcd,GAAU,CAAA,GAAK,CACzEe,oBAAoB,EACpBC,kBAAkB,EAClBC,YAAY,EACZC,qBAAqB,EAErBtC,gBAEAuC,uBAAwBA,IAAM,EAC9BC,6BAA6BlZ,GAClBA,IAASsX,GAAmB,EAAI,EAE3C6B,wCAAwCnZ,GAC7BA,IAASsX,IAAoBtX,IAASqX,GAAY,EAAI,EAEjE+B,uCAAuCpZ,GAC5BA,IAASmX,IAAmBnX,IAASqX,GAAY,EAAI,EAEhEgC,8BAA8BrZ,GACnBA,IAASqX,GAAY,EAAI,EAGpCT,WAAUA,IACC,IAAI3E,GAEfqH,qBAAqBb,IACV,IAAIxG,IAAO6B,WAAW2E,GAEjCc,iBAAiB1E,GACNA,GAAQA,EAAKnK,MAExB8O,gBAAgB3E,GACLA,GAAQA,EAAK5B,KAGxBwG,iBAAAA,CAAkBC,EAAUC,GACxB,MAAMC,EAAa1L,KAAKc,WAExB,IACI,OAAO0K,EAASpT,KAAK4H,KACxB,CAAC,MAAOrM,GACL,GAAIoW,EACA,MAAMpW,EAGVqM,KAAKuC,KAAKmJ,EAAa1L,KAAKc,YAC5B,MAAM6K,EAAeF,EAASrT,KAAK4H,MAMnC,OAJA+J,GAAoB,EACpBD,EAAanW,EAAGgY,GAChB5B,GAAoB,EAEb4B,CACX,CACH,EAEDC,eAAAA,CAAgBrO,GACZ,IAAIiE,EAEJ,GAEI,GADAA,EAAOxB,KAAK4B,WAAWrE,KACnBiE,IAAS1G,GAAc0G,IAAS9F,EAChC,OAAO8F,QAENA,IAAS6H,IAElB,OAAOA,EACV,EAED1X,WAAW4L,GACAA,GAAU,GAAKA,EAASD,EAAOnL,OAASmL,EAAO3L,WAAW4L,GAAU,EAE/ExJ,UAASA,CAAC8X,EAAaC,IACZxO,EAAOvJ,UAAU8X,EAAaC,GAEzC3J,cAAAA,CAAetE,GACX,OAAOmC,KAAK1C,OAAOvJ,UAAU8J,EAAOmC,KAAKgB,WAC5C,EAEDvD,QAAOA,CAACF,EAAQwO,IACLtO,GAAQH,EAAQC,EAAQwO,GAEnCnO,OAAMA,CAACiO,EAAaC,EAAWE,IACpBpO,GAAON,EAAQuO,EAAaC,EAAWE,GAGlDC,OAAAA,CAAQlL,GACJ,MAAMlD,EAAQmC,KAAKgB,WAInB,OAFAhB,KAAKkM,IAAInL,GAEFf,KAAKmC,eAAetE,EAC9B,EACDsO,mBAAAA,GACI,MAAM7T,EAAOgF,EAAOvJ,UAAUiM,KAAKgB,WAAYhB,KAAKkB,SAAW,GAI/D,OAFAlB,KAAKkM,IAAIzL,GAEFnI,CACV,EACDkG,aAAAA,CAAcgD,GACV,MAAM4K,EAAS9O,EAAOvJ,UAAUiM,KAAKgB,WAAYxC,GAAclB,EAAQ0C,KAAKgB,aAI5E,OAFAhB,KAAKkM,IAAI1K,GAEF4K,CACV,EAEDF,GAAAA,CAAInL,GACA,GAAIf,KAAKe,YAAcA,EAAW,CAC9B,MAAMsL,EAAYtN,GAAWgC,GAAW5I,MAAM,GAAI,GAAG2O,QAAQ,KAAM,KAAKA,QAAQ,MAAMwF,GAAKA,EAAEC,gBAC7F,IAAIzY,EAAU,GAAG,YAAY4B,KAAK2W,GAAa,IAAIA,KAAeA,gBAC9D9O,EAASyC,KAAKgB,WAGlB,OAAQD,GACJ,KAAK7G,EAEG8F,KAAKe,YAAcN,GAAiBT,KAAKe,YAAcvG,GACvD+C,EAASyC,KAAKkB,SAAW,EACzBpN,EAAU,6CAEVA,EAAU,yBAEd,MAEJ,KAAKuG,EACG2F,KAAKsC,QAAQ4G,MACblJ,KAAK2B,OACLpE,IACAzJ,EAAU,oBAEd,MAEJ,KAAK8G,EACGoF,KAAKe,YAAcyL,IACnBjP,EAASyC,KAAKkB,SACdpN,EAAU,4BAKtBkM,KAAKnM,MAAMC,EAASyJ,EACxB,CAEAyC,KAAK2B,MACR,EACD8K,QAAAA,CAASnU,GACD0H,KAAKe,YAAc7G,IAAuC,IAA9B8F,KAAKiC,YAAY,EAAG3J,IAChD0H,KAAKnM,MAAM,eAAeyE,kBAG9B0H,KAAK2B,MACR,EACD+K,QAAAA,CAAS5a,GACAkO,KAAKsC,QAAQxQ,IACdkO,KAAKnM,MAAM,UAAUyG,OAAOqS,aAAa7a,mBAG7CkO,KAAK2B,MACR,EAEDzB,YAAWA,CAACrC,EAAOC,IACX+L,EACOG,EAAY5J,iBACfvC,EACAC,EACAqC,GAID,KAEXyM,mBAAAA,CAAoBjG,GAChB,GAAIkD,EAAe,CACf,MAAM1F,EAAOnE,KAAKqL,iBAAiB1E,GAC7BvC,EAAOpE,KAAKsL,gBAAgB3E,GAClC,OAAOqD,EAAY5J,iBACN,OAAT+D,EAAgBA,EAAK0I,IAAIhP,MAAMN,OAASyM,EAAYzK,YAAcS,KAAKgB,WAC9D,OAAToD,EAAgBA,EAAKyI,IAAI/O,IAAIP,OAASyM,EAAYzK,YAAcS,KAAKgB,WACrEb,EAER,CAEA,OAAO,IACV,EAEDtM,KAAAA,CAAMC,EAASyJ,GACX,MAAM9H,OAA6B,IAAX8H,GAA0BA,EAASD,EAAOnL,OAC5D6X,EAAY9J,YAAY3C,GACxByC,KAAKa,IACDmJ,EAAY9J,YV9N3B,SAA6B5C,EAAQC,GACxC,KAAOA,GAAU,GACRjB,GAAagB,EAAO3L,WAAW4L,IADpBA,KAMpB,OAAOA,EAAS,CACpB,CUsN8CuP,CAAoBxP,EAAQA,EAAOnL,OAAS,IACpE6X,EAAY9J,YAAYF,KAAKgB,YAEvC,MAAM,IAAImG,GACNrT,GAAW,mBACXwJ,EACA7H,EAAS8H,OACT9H,EAASiK,KACTjK,EAASmK,OACToK,EAAYrK,UACZqK,EAAYnK,YAEpB,IAqDJ,OAAO5J,OAAOoR,QAlDA,SAAS0F,EAAS5Z,GAC5BmK,EAASyP,EACT5Z,EAAUA,GAAW,GAErB8W,EAAOhK,UAAU3C,EAAQqD,IACzBqJ,EAAY/J,UACR3C,EACAnK,EAAQoK,OACRpK,EAAQuM,KACRvM,EAAQyM,QAGZO,EAAWhN,EAAQgN,UAAY,YAC/B0J,EAAgB/T,QAAQ3C,EAAQ6Z,WAChClD,EAA+C,mBAAzB3W,EAAQ2W,aAA8B3W,EAAQ2W,aAAed,GACnFe,GAAoB,EAEpBE,EAAOU,qBAAqB,uBAAwBxX,IAAU2C,QAAQ3C,EAAQwX,oBAC9EV,EAAOW,mBAAmB,qBAAsBzX,IAAU2C,QAAQ3C,EAAQyX,kBAC1EX,EAAOY,aAAa,eAAgB1X,IAAU2C,QAAQ3C,EAAQ0X,YAC9DZ,EAAOa,oBAAsB,wBAAyB3X,GAAU2C,QAAQ3C,EAAQ2X,qBAEhF,MAAM7X,QAAEA,EAAU,UAASga,UAAEA,GAAc9Z,EAE3C,GAAIF,KAAWgX,EAAOhX,UAAY,EAC9B,MAAM,IAAI6E,MAAM,oBAAsB7E,EAAU,KAG3B,mBAAdga,GACPhD,EAAOlH,cAAa,CAACvB,EAAM3D,EAAOC,KAC9B,GAAI0D,IAAS9F,EAAS,CAClB,MAAMmR,EAAM5C,EAAO/J,YAAYrC,EAAOC,GAChCxK,EAAQsK,GAAON,EAAQQ,EAAM,EAAGA,EAAK,MACrCR,EAAOnF,MAAM0F,EAAQ,EAAGC,EAAM,GAC9BR,EAAOnF,MAAM0F,EAAQ,EAAGC,GAE9BmP,EAAU3Z,EAAOuZ,EACrB,KAIR,MAAMK,EAAMjD,EAAOhX,QAAQA,GAASmF,KAAK6R,EAAQ9W,GAMjD,OAJK8W,EAAOpJ,KACRoJ,EAAOpW,QAGJqZ,IAGiB,aACxB/F,GACAyC,OAAQK,EAAOL,QAEvB,iBCtVIuD,GAAe,mEAAmElF,MAAM,IAK9EmF,GAAAC,OAAG,SAAUjB,GACzB,GAAI,GAAKA,GAAUA,EAASe,GAAahb,OACvC,OAAOgb,GAAaf,GAEtB,MAAM,IAAIkB,UAAU,6BAA+BlB,EACrD,EAMcgB,GAAAG,OAAG,SAAUxB,GAiBzB,OAhBW,IAgBCA,GAAYA,GAfb,GAgBDA,EAjBC,GAGG,IAkBCA,GAAYA,GAjBb,IAkBJA,EAnBI,GASK,GANR,IAoBCA,GAAYA,GAnBb,GAoBDA,EArBC,GAOQ,GAJR,IAsBPA,EACK,GAtBG,IA0BRA,EACK,IAID,CACV,EC7BA,IAAIqB,GAAS1a,GAsDb8a,GAAAH,OAAiB,SAA0BI,GACzC,IACIC,EADAC,EAAU,GAGVC,EA3BN,SAAqBH,GACnB,OAAOA,EAAS,EACO,IAAhBA,GAAW,GACE,GAAfA,GAAU,EACjB,CAuBYI,CAAYJ,GAEtB,GACEC,EAzCgBI,GAyCRF,GACRA,KAhDiB,GAiDP,IAGRF,GAjDS,IAmDXC,GAAWP,GAAOC,OAAOK,SAClBE,EAAM,GAEf,OAAOD,CACT,EAMcH,GAAAD,OAAG,SAA0BQ,EAAMC,EAAQC,GACvD,IAGIC,EAAcR,EAvCGD,EAEjBU,EAkCAC,EAASL,EAAK5b,OACdiB,EAAS,EACTY,EAAQ,EAGZ,EAAG,CACD,GAAIga,GAAUI,EACZ,MAAM,IAAItW,MAAM,8CAIlB,IAAe,KADf4V,EAAQN,GAAOG,OAAOQ,EAAKpc,WAAWqc,OAEpC,MAAM,IAAIlW,MAAM,yBAA2BiW,EAAKM,OAAOL,EAAS,IAGlEE,KA7EW,GA6EOR,GAElBta,IADAsa,GA3EgBI,KA4EY9Z,EAC5BA,GAnFiB,CAoFlB,OAAQka,GAETD,EAAU3a,OAvDN6a,GAFiBV,EAyDWra,IAvDR,EADU,IAAP,EAATqa,IAGbU,EACDA,GAqDJF,EAAUK,KAAON,CACnB,yBCjHAO,EAAAC,OATA,SAAgBC,EAAOC,EAAOC,GAC5B,GAAID,KAASD,EACX,OAAOA,EAAMC,GACR,GAAyB,IAArBE,UAAUzc,OACnB,OAAOwc,EAEP,MAAM,IAAI7W,MAAM,IAAM4W,EAAQ,4BAElC,EAGA,IAAIG,EAAY,iEACZC,EAAgB,gBAEpB,SAASC,EAASC,GAChB,IAAI3G,EAAQ2G,EAAK3G,MAAMwG,GACvB,OAAKxG,EAGE,CACL4G,OAAQ5G,EAAM,GACd6G,KAAM7G,EAAM,GACZ5O,KAAM4O,EAAM,GACZ8G,KAAM9G,EAAM,GACZ+G,KAAM/G,EAAM,IAPL,IASX,CAGA,SAASgH,EAAYC,GACnB,IAAIxa,EAAM,GAiBV,OAhBIwa,EAAWL,SACbna,GAAOwa,EAAWL,OAAS,KAE7Bna,GAAO,KACHwa,EAAWJ,OACbpa,GAAOwa,EAAWJ,KAAO,KAEvBI,EAAW7V,OACb3E,GAAOwa,EAAW7V,MAEhB6V,EAAWH,OACbra,GAAO,IAAMwa,EAAWH,MAEtBG,EAAWF,OACbta,GAAOwa,EAAWF,MAEbta,CACT,CArBAyZ,EAAAQ,SAAmBA,EAsBnBR,EAAAc,YAAsBA,EAkDtB,IAvCoBE,EACdC,EAsCFC,GAvCgBF,EAuCO,SAAmBG,GAC5C,IAAIN,EAAOM,EACP5a,EAAMia,EAASW,GACnB,GAAI5a,EAAK,CACP,IAAKA,EAAIsa,KACP,OAAOM,EAETN,EAAOta,EAAIsa,IACZ,CAOD,IANA,IAAIO,EAAapB,EAAQoB,WAAWP,GAGhCQ,EAAQ,GACR/R,EAAQ,EACR1E,EAAI,IACK,CAGX,GAFA0E,EAAQ1E,GAEG,KADXA,EAAIiW,EAAKvW,QAAQ,IAAKgF,IACR,CACZ+R,EAAMvd,KAAK+c,EAAKjX,MAAM0F,IACtB,KACN,CAEM,IADA+R,EAAMvd,KAAK+c,EAAKjX,MAAM0F,EAAO1E,IACtBA,EAAIiW,EAAKjd,QAAsB,MAAZid,EAAKjW,IAC7BA,GAGL,CAEI,IAAI0W,EAAMC,EAAK,EAApB,IAAuB3W,EAAIyW,EAAMzd,OAAS,EAAGgH,GAAK,EAAGA,IAEtC,OADb0W,EAAOD,EAAMzW,IAEXyW,EAAMG,OAAO5W,EAAG,GACE,OAAT0W,EACTC,IACSA,EAAK,IACD,KAATD,GAIFD,EAAMG,OAAO5W,EAAI,EAAG2W,GACpBA,EAAK,IAELF,EAAMG,OAAO5W,EAAG,GAChB2W,MAUN,MAJa,MAFbV,EAAOQ,EAAMrX,KAAK,QAGhB6W,EAAOO,EAAa,IAAM,KAGxB7a,GACFA,EAAIsa,KAAOA,EACJC,EAAYva,IAEdsa,CACT,EAjGMI,EAAQ,GAEL,SAASQ,GACd,IAAK,IAAI7W,EAAI,EAAGA,EAAIqW,EAAMrd,OAAQgH,IAChC,GAAIqW,EAAMrW,GAAG6W,QAAUA,EAAO,CAC5B,IAAIC,EAAOT,EAAM,GAGjB,OAFAA,EAAM,GAAKA,EAAMrW,GACjBqW,EAAMrW,GAAK8W,EACJT,EAAM,GAAGpc,MACjB,CAGH,IAAIA,EAASmc,EAAES,GAWf,OATAR,EAAM1W,QAAQ,CACZkX,QACA5c,WAGEoc,EAAMrd,OA7BU,IA8BlBqd,EAAM/I,MAGDrT,IA6FX,SAASmF,EAAK2X,EAAOR,GACL,KAAVQ,IACFA,EAAQ,KAEI,KAAVR,IACFA,EAAQ,KAEV,IAAIS,EAAWpB,EAASW,GACpBU,EAAWrB,EAASmB,GAMxB,GALIE,IACFF,EAAQE,EAAShB,MAAQ,KAIvBe,IAAaA,EAASlB,OAIxB,OAHImB,IACFD,EAASlB,OAASmB,EAASnB,QAEtBI,EAAYc,GAGrB,GAAIA,GAAYT,EAAMrH,MAAMyG,GAC1B,OAAOY,EAIT,GAAIU,IAAaA,EAAS3W,OAAS2W,EAAShB,KAE1C,OADAgB,EAAS3W,KAAOiW,EACTL,EAAYe,GAGrB,IAAIC,EAA6B,MAApBX,EAAMrB,OAAO,GACtBqB,EACAD,EAAUS,EAAMpJ,QAAQ,OAAQ,IAAM,IAAM4I,GAEhD,OAAIU,GACFA,EAAShB,KAAOiB,EACThB,EAAYe,IAEdC,CACT,CA1DA9B,EAAAkB,UAAoBA,EA2DpBlB,EAAAhW,KAAeA,EAEfgW,EAAqBoB,WAAA,SAAUD,GAC7B,MAA2B,MAApBA,EAAMrB,OAAO,IAAcQ,EAAUnZ,KAAKga,IAyCnDnB,EAAA+B,SAhCA,SAAkBJ,EAAOR,GACT,KAAVQ,IACFA,EAAQ,KAGVA,EAAQA,EAAMpJ,QAAQ,MAAO,IAO7B,IADA,IAAIyJ,EAAQ,EAC0B,IAA/Bb,EAAM7W,QAAQqX,EAAQ,MAAY,CACvC,IAAIre,EAAQqe,EAAMM,YAAY,KAC9B,GAAI3e,EAAQ,EACV,OAAO6d,EAOT,IADAQ,EAAQA,EAAM/X,MAAM,EAAGtG,IACbwW,MAAM,qBACd,OAAOqH,IAGPa,CACH,CAGD,OAAOxT,MAAMwT,EAAQ,GAAGhY,KAAK,OAASmX,EAAMtH,OAAO8H,EAAM/d,OAAS,EACpE,EAGA,IAAIse,IAEO,cADCxa,OAAOiR,OAAO,OAI1B,SAASwJ,EAAUzZ,GACjB,OAAOA,CACT,CA6BA,SAAS0Z,EAAc1Z,GACrB,IAAKA,EACH,OAAO,EAGT,IAAI9E,EAAS8E,EAAE9E,OAEf,GAAIA,EAAS,EACX,OAAO,EAGT,GAAiC,KAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,KAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,MAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,MAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,MAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,MAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,MAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,KAA7B8E,EAAEtF,WAAWQ,EAAS,IACO,KAA7B8E,EAAEtF,WAAWQ,EAAS,GACxB,OAAO,EAGT,IAAK,IAAIgH,EAAIhH,EAAS,GAAIgH,GAAK,EAAGA,IAChC,GAAwB,KAApBlC,EAAEtF,WAAWwH,GACf,OAAO,EAIX,OAAO,CACT,CAmIA,SAASyX,EAAOC,EAAOC,GACrB,OAAID,IAAUC,EACL,EAGK,OAAVD,EACK,EAGK,OAAVC,GACM,EAGND,EAAQC,EACH,GAGD,CACV,CA9LAvC,EAAAwC,YAAsBN,EAAoBC,EAP1C,SAAqB3C,GACnB,OAAI4C,EAAc5C,GACT,IAAMA,EAGRA,CACT,EAUAQ,EAAAyC,cAAwBP,EAAoBC,EAP5C,SAAuB3C,GACrB,OAAI4C,EAAc5C,GACTA,EAAK5V,MAAM,GAGb4V,CACT,EAuEAQ,EAAA0C,2BA5BA,SAAoCC,EAAUC,EAAUC,GACtD,IAAIC,EAAMT,EAAOM,EAAS5T,OAAQ6T,EAAS7T,QAC3C,OAAY,IAAR+T,GAKQ,KADZA,EAAMH,EAASI,aAAeH,EAASG,eAM3B,KADZD,EAAMH,EAASK,eAAiBJ,EAASI,iBACxBH,GAKL,KADZC,EAAMH,EAASM,gBAAkBL,EAASK,kBAM9B,KADZH,EAAMH,EAASO,cAAgBN,EAASM,eAlB/BJ,EAuBFT,EAAOM,EAAS5Y,KAAM6Y,EAAS7Y,KACxC,EA4BAiW,EAAAmD,mCAzBA,SAA4CR,EAAUC,EAAUC,GAC9D,IAAIC,EAGJ,OAAY,KADZA,EAAMH,EAASI,aAAeH,EAASG,eAM3B,KADZD,EAAMH,EAASK,eAAiBJ,EAASI,iBACxBH,GAKL,KADZC,EAAMH,EAASM,gBAAkBL,EAASK,kBAM9B,KADZH,EAAMH,EAASO,cAAgBN,EAASM,eAb/BJ,EAkBFT,EAAOM,EAAS5Y,KAAM6Y,EAAS7Y,KACxC,EAwCAiW,EAAAoD,oCA5BA,SAA6CT,EAAUC,EAAUS,GAC/D,IAAIP,EAAMH,EAASO,cAAgBN,EAASM,cAC5C,OAAY,IAARJ,GAKQ,KADZA,EAAMH,EAASM,gBAAkBL,EAASK,kBACzBI,GAKL,KADZP,EAAMT,EAAOM,EAAS5T,OAAQ6T,EAAS7T,UAM3B,KADZ+T,EAAMH,EAASI,aAAeH,EAASG,eAM3B,KADZD,EAAMH,EAASK,eAAiBJ,EAASI,gBAlBhCF,EAuBFT,EAAOM,EAAS5Y,KAAM6Y,EAAS7Y,KACxC,EA0BAiW,EAAAsD,0CAvBA,SAAmDX,EAAUC,EAAUS,GACrE,IAAIP,EAAMH,EAASM,gBAAkBL,EAASK,gBAC9C,OAAY,IAARH,GAAaO,GAKL,KADZP,EAAMT,EAAOM,EAAS5T,OAAQ6T,EAAS7T,UAM3B,KADZ+T,EAAMH,EAASI,aAAeH,EAASG,eAM3B,KADZD,EAAMH,EAASK,eAAiBJ,EAASI,gBAbhCF,EAkBFT,EAAOM,EAAS5Y,KAAM6Y,EAAS7Y,KACxC,EAuDAiW,EAAAuD,oCA5BA,SAA6CZ,EAAUC,GACrD,IAAIE,EAAMH,EAASO,cAAgBN,EAASM,cAC5C,OAAY,IAARJ,GAKQ,KADZA,EAAMH,EAASM,gBAAkBL,EAASK,kBAM9B,KADZH,EAAMT,EAAOM,EAAS5T,OAAQ6T,EAAS7T,UAM3B,KADZ+T,EAAMH,EAASI,aAAeH,EAASG,eAM3B,KADZD,EAAMH,EAASK,eAAiBJ,EAASI,gBAlBhCF,EAuBFT,EAAOM,EAAS5Y,KAAM6Y,EAAS7Y,KACxC,EAWAiW,EAAAwD,oBAHA,SAA6B/F,GAC3B,OAAOxY,KAAKkW,MAAMsC,EAAIlF,QAAQ,iBAAkB,IAClD,EAsDAyH,EAAAyD,iBA/CA,SAA0BC,EAAYC,EAAWC,GA8B/C,GA7BAD,EAAYA,GAAa,GAErBD,IAEwC,MAAtCA,EAAWA,EAAW9f,OAAS,IAA+B,MAAjB+f,EAAU,KACzDD,GAAc,KAOhBC,EAAYD,EAAaC,GAiBvBC,EAAc,CAChB,IAAIC,EAASrD,EAASoD,GACtB,IAAKC,EACH,MAAM,IAAIta,MAAM,oCAElB,GAAIsa,EAAOhD,KAAM,CAEf,IAAIvd,EAAQugB,EAAOhD,KAAKoB,YAAY,KAChC3e,GAAS,IACXugB,EAAOhD,KAAOgD,EAAOhD,KAAKrb,UAAU,EAAGlC,EAAQ,GAElD,CACDqgB,EAAY3Z,EAAK8W,EAAY+C,GAASF,EACvC,CAED,OAAOzC,EAAUyC,EACnB,iBCzkBIG,GAAO3f,GACP4f,GAAMrc,OAAOoB,UAAUiC,eACvBiZ,GAA8B,oBAAR/R,IAQ1B,SAASgS,KACPxS,KAAKyS,OAAS,GACdzS,KAAK0S,KAAOH,GAAe,IAAI/R,IAAQvK,OAAOiR,OAAO,KACvD,CAKQyL,GAAC3N,UAAY,SAA4B4N,EAAQC,GAEvD,IADA,IAAIC,EAAM,IAAIN,GACLrZ,EAAI,EAAG4Z,EAAMH,EAAOzgB,OAAQgH,EAAI4Z,EAAK5Z,IAC5C2Z,EAAIE,IAAIJ,EAAOzZ,GAAI0Z,GAErB,OAAOC,CACT,EAQAN,GAASnb,UAAU8H,KAAO,WACxB,OAAOoT,GAAevS,KAAK0S,KAAKvT,KAAOlJ,OAAOgd,oBAAoBjT,KAAK0S,MAAMvgB,MAC/E,EAOQwgB,GAACtb,UAAU2b,IAAM,SAAsBjF,EAAM8E,GACnD,IAAIK,EAAOX,GAAexE,EAAOsE,GAAKtB,YAAYhD,GAC9CoF,EAAcZ,GAAevS,KAAKsS,IAAIvE,GAAQuE,GAAIla,KAAK4H,KAAK0S,KAAMQ,GAClEpR,EAAM9B,KAAKyS,OAAOtgB,OACjBghB,IAAeN,GAClB7S,KAAKyS,OAAOpgB,KAAK0b,GAEdoF,IACCZ,GACFvS,KAAK0S,KAAKI,IAAI/E,EAAMjM,GAEpB9B,KAAK0S,KAAKQ,GAAQpR,EAGxB,EAOQ6Q,GAACtb,UAAUib,IAAM,SAAsBvE,GAC7C,GAAIwE,GACF,OAAOvS,KAAK0S,KAAKJ,IAAIvE,GAErB,IAAImF,EAAOb,GAAKtB,YAAYhD,GAC5B,OAAOuE,GAAIla,KAAK4H,KAAK0S,KAAMQ,EAE/B,EAOQP,GAACtb,UAAUwB,QAAU,SAA0BkV,GACrD,GAAIwE,GAAc,CAChB,IAAIzQ,EAAM9B,KAAK0S,KAAKhR,IAAIqM,GACxB,GAAIjM,GAAO,EACP,OAAOA,CAEf,KAAS,CACL,IAAIoR,EAAOb,GAAKtB,YAAYhD,GAC5B,GAAIuE,GAAIla,KAAK4H,KAAK0S,KAAMQ,GACtB,OAAOlT,KAAK0S,KAAKQ,EAEpB,CAED,MAAM,IAAIpb,MAAM,IAAMiW,EAAO,uBAC/B,EAOQ4E,GAACtb,UAAU+b,GAAK,SAAqBC,GAC3C,GAAIA,GAAQ,GAAKA,EAAOrT,KAAKyS,OAAOtgB,OAClC,OAAO6N,KAAKyS,OAAOY,GAErB,MAAM,IAAIvb,MAAM,yBAA2Bub,EAC7C,EAOAb,GAASnb,UAAU6N,QAAU,WAC3B,OAAOlF,KAAKyS,OAAOta,OACrB,EAEAmb,GAAAd,SAAmBA,aCjHfH,GAAO3f,GAqBX,SAAS6gB,KACPvT,KAAKyS,OAAS,GACdzS,KAAKwT,SAAU,EAEfxT,KAAKyT,MAAQ,CAAChC,eAAgB,EAAGD,gBAAiB,EACpD,CAQWkC,GAACrc,UAAUsc,gBACpB,SAA6BC,EAAWC,GACtC7T,KAAKyS,OAAOrN,QAAQwO,EAAWC,EACnC,EAOWH,GAACrc,UAAU2b,IAAM,SAAyBc,GAtCrD,IAAgC5C,EAAUC,EAEpC4C,EACAC,EACAC,EACAC,EAL0BhD,EAuCHlR,KAAKyT,MAvCQtC,EAuCD2C,EArCnCC,EAAQ7C,EAASO,cACjBuC,EAAQ7C,EAASM,cACjBwC,EAAU/C,EAASM,gBACnB0C,EAAU/C,EAASK,gBAChBwC,EAAQD,GAASC,GAASD,GAASG,GAAWD,GAC9C5B,GAAKP,oCAAoCZ,EAAUC,IAAa,GAiCrEnR,KAAKyT,MAAQK,EACb9T,KAAKyS,OAAOpgB,KAAKyhB,KAEjB9T,KAAKwT,SAAU,EACfxT,KAAKyS,OAAOpgB,KAAKyhB,GAErB,EAWAP,GAAYlc,UAAU6N,QAAU,WAK9B,OAJKlF,KAAKwT,UACRxT,KAAKyS,OAAO0B,KAAK9B,GAAKP,qCACtB9R,KAAKwT,SAAU,GAEVxT,KAAKyS,MACd,EAEA2B,GAAAb,YAAsBA,GCvEtB,IAAIc,GAAY3hB,GACZ2f,GAAO5b,GACP+b,GAAW9b,GAAuB8b,SAClCe,GAAc5c,GAA0B4c,YAU5C,SAASe,GAAmB7F,GACrBA,IACHA,EAAQ,CAAA,GAEVzO,KAAKuU,MAAQlC,GAAK7D,OAAOC,EAAO,OAAQ,MACxCzO,KAAKwU,YAAcnC,GAAK7D,OAAOC,EAAO,aAAc,MACpDzO,KAAKyU,gBAAkBpC,GAAK7D,OAAOC,EAAO,kBAAkB,GAC5DzO,KAAK0U,SAAW,IAAIlC,GACpBxS,KAAK2U,OAAS,IAAInC,GAClBxS,KAAK4U,UAAY,IAAIrB,GACrBvT,KAAK6U,iBAAmB,IAC1B,CAEAP,GAAmBjd,UAAUyd,SAAW,EAOxCR,GAAmBS,cACjB,SAA0CC,GACxC,IAAI/C,EAAa+C,EAAmB/C,WAChCgD,EAAY,IAAIX,GAAmB,CACrCY,KAAMF,EAAmBE,KACzBjD,WAAYA,IA2Cd,OAzCA+C,EAAmBG,aAAY,SAAUC,GACvC,IAAIC,EAAa,CACfC,UAAW,CACT5V,KAAM0V,EAAQ3D,cACd7R,OAAQwV,EAAQ5D,kBAIE,MAAlB4D,EAAQ9X,SACV+X,EAAW/X,OAAS8X,EAAQ9X,OACV,MAAd2U,IACFoD,EAAW/X,OAAS+U,GAAK/B,SAAS2B,EAAYoD,EAAW/X,SAG3D+X,EAAWE,SAAW,CACpB7V,KAAM0V,EAAQ9D,aACd1R,OAAQwV,EAAQ7D,gBAGE,MAAhB6D,EAAQ9c,OACV+c,EAAW/c,KAAO8c,EAAQ9c,OAI9B2c,EAAUO,WAAWH,EAC3B,IACIL,EAAmBS,QAAQrQ,SAAQ,SAAUsQ,GAC3C,IAAIC,EAAiBD,EACF,OAAfzD,IACF0D,EAAiBtD,GAAK/B,SAAS2B,EAAYyD,IAGxCT,EAAUP,SAASpC,IAAIqD,IAC1BV,EAAUP,SAAS1B,IAAI2C,GAGzB,IAAIC,EAAUZ,EAAmBa,iBAAiBH,GACnC,MAAXE,GACFX,EAAUa,iBAAiBJ,EAAYE,EAE/C,IACWX,CACX,EAYAX,GAAmBjd,UAAUme,WAC3B,SAAuC/G,GACrC,IAAI6G,EAAYjD,GAAK7D,OAAOC,EAAO,aAC/B8G,EAAWlD,GAAK7D,OAAOC,EAAO,WAAY,MAC1CnR,EAAS+U,GAAK7D,OAAOC,EAAO,SAAU,MACtCnW,EAAO+Z,GAAK7D,OAAOC,EAAO,OAAQ,MAEjCzO,KAAKyU,iBACRzU,KAAK+V,iBAAiBT,EAAWC,EAAUjY,EAAQhF,GAGvC,MAAVgF,IACFA,EAAShD,OAAOgD,GACX0C,KAAK0U,SAASpC,IAAIhV,IACrB0C,KAAK0U,SAAS1B,IAAI1V,IAIV,MAARhF,IACFA,EAAOgC,OAAOhC,GACT0H,KAAK2U,OAAOrC,IAAIha,IACnB0H,KAAK2U,OAAO3B,IAAI1a,IAIpB0H,KAAK4U,UAAU5B,IAAI,CACjBvB,cAAe6D,EAAU5V,KACzB8R,gBAAiB8D,EAAU1V,OAC3B0R,aAA0B,MAAZiE,GAAoBA,EAAS7V,KAC3C6R,eAA4B,MAAZgE,GAAoBA,EAAS3V,OAC7CtC,OAAQA,EACRhF,KAAMA,GAEZ,EAKAgc,GAAmBjd,UAAUye,iBAC3B,SAA6CE,EAAaC,GACxD,IAAI3Y,EAAS0Y,EACW,MAApBhW,KAAKwU,cACPlX,EAAS+U,GAAK/B,SAAStQ,KAAKwU,YAAalX,IAGrB,MAAlB2Y,GAGGjW,KAAK6U,mBACR7U,KAAK6U,iBAAmB5e,OAAOiR,OAAO,OAExClH,KAAK6U,iBAAiBxC,GAAKtB,YAAYzT,IAAW2Y,GACzCjW,KAAK6U,0BAGP7U,KAAK6U,iBAAiBxC,GAAKtB,YAAYzT,IACI,IAA9CrH,OAAOwT,KAAKzJ,KAAK6U,kBAAkB1iB,SACrC6N,KAAK6U,iBAAmB,MAGhC,EAkBAP,GAAmBjd,UAAU6e,eAC3B,SAA2ClB,EAAoBgB,EAAaG,GAC1E,IAAIT,EAAaM,EAEjB,GAAmB,MAAfA,EAAqB,CACvB,GAA+B,MAA3BhB,EAAmBE,KACrB,MAAM,IAAIpd,MACR,iJAIJ4d,EAAaV,EAAmBE,IACjC,CACD,IAAIjD,EAAajS,KAAKwU,YAEJ,MAAdvC,IACFyD,EAAarD,GAAK/B,SAAS2B,EAAYyD,IAIzC,IAAIU,EAAa,IAAI5D,GACjB6D,EAAW,IAAI7D,GAGnBxS,KAAK4U,UAAUjB,iBAAgB,SAAUyB,GACvC,GAAIA,EAAQ9X,SAAWoY,GAAsC,MAAxBN,EAAQ9D,aAAsB,CAEjE,IAAIiE,EAAWP,EAAmBsB,oBAAoB,CACpD5W,KAAM0V,EAAQ9D,aACd1R,OAAQwV,EAAQ7D,iBAEK,MAAnBgE,EAASjY,SAEX8X,EAAQ9X,OAASiY,EAASjY,OACJ,MAAlB6Y,IACFf,EAAQ9X,OAAS+U,GAAK9Z,KAAK4d,EAAgBf,EAAQ9X,SAEnC,MAAd2U,IACFmD,EAAQ9X,OAAS+U,GAAK/B,SAAS2B,EAAYmD,EAAQ9X,SAErD8X,EAAQ9D,aAAeiE,EAAS7V,KAChC0V,EAAQ7D,eAAiBgE,EAAS3V,OACb,MAAjB2V,EAASjd,OACX8c,EAAQ9c,KAAOid,EAASjd,MAG7B,CAED,IAAIgF,EAAS8X,EAAQ9X,OACP,MAAVA,GAAmB8Y,EAAW9D,IAAIhV,IACpC8Y,EAAWpD,IAAI1V,GAGjB,IAAIhF,EAAO8c,EAAQ9c,KACP,MAARA,GAAiB+d,EAAS/D,IAAIha,IAChC+d,EAASrD,IAAI1a,EAGhB,GAAE0H,MACHA,KAAK0U,SAAW0B,EAChBpW,KAAK2U,OAAS0B,EAGdrB,EAAmBS,QAAQrQ,SAAQ,SAAUsQ,GAC3C,IAAIE,EAAUZ,EAAmBa,iBAAiBH,GACnC,MAAXE,IACoB,MAAlBO,IACFT,EAAarD,GAAK9Z,KAAK4d,EAAgBT,IAEvB,MAAdzD,IACFyD,EAAarD,GAAK/B,SAAS2B,EAAYyD,IAEzC1V,KAAK8V,iBAAiBJ,EAAYE,GAErC,GAAE5V,KACP,EAaAsU,GAAmBjd,UAAU0e,iBAC3B,SAA4CQ,EAAYC,EAAWC,EACvB/H,GAK1C,GAAI8H,GAAuC,iBAAnBA,EAAU9W,MAAiD,iBAArB8W,EAAU5W,OACpE,MAAM,IAAI9H,MACN,gPAMR,MAAIye,GAAc,SAAUA,GAAc,WAAYA,GAC/CA,EAAW7W,KAAO,GAAK6W,EAAW3W,QAAU,IAC3C4W,GAAcC,GAAY/H,MAIzB6H,GAAc,SAAUA,GAAc,WAAYA,GAC/CC,GAAa,SAAUA,GAAa,WAAYA,GAChDD,EAAW7W,KAAO,GAAK6W,EAAW3W,QAAU,GAC5C4W,EAAU9W,KAAO,GAAK8W,EAAU5W,QAAU,GAC1C6W,GAKV,MAAM,IAAI3e,MAAM,oBAAsBtE,KAAKC,UAAU,CACnD6hB,UAAWiB,EACXjZ,OAAQmZ,EACRlB,SAAUiB,EACVle,KAAMoW,IAGd,EAMA4F,GAAmBjd,UAAUqf,mBAC3B,WAcE,IAbA,IAOI/U,EACAyT,EACAuB,EACAC,EAVAC,EAA0B,EAC1BC,EAAwB,EACxBC,EAAyB,EACzBC,EAAuB,EACvBC,EAAe,EACfC,EAAiB,EACjB9jB,EAAS,GAMT+jB,EAAWnX,KAAK4U,UAAU1P,UACrB/L,EAAI,EAAG4Z,EAAMoE,EAAShlB,OAAQgH,EAAI4Z,EAAK5Z,IAAK,CAInD,GAFAwI,EAAO,IADPyT,EAAU+B,EAAShe,IAGPsY,gBAAkBqF,EAE5B,IADAD,EAA0B,EACnBzB,EAAQ3D,gBAAkBqF,GAC/BnV,GAAQ,IACRmV,SAIF,GAAI3d,EAAI,EAAG,CACT,IAAKkZ,GAAKP,oCAAoCsD,EAAS+B,EAAShe,EAAI,IAClE,SAEFwI,GAAQ,GACT,CAGHA,GAAQ0S,GAAUhH,OAAO+H,EAAQ5D,gBACJqF,GAC7BA,EAA0BzB,EAAQ5D,gBAEZ,MAAlB4D,EAAQ9X,SACVsZ,EAAY5W,KAAK0U,SAAS7b,QAAQuc,EAAQ9X,QAC1CqE,GAAQ0S,GAAUhH,OAAOuJ,EAAYM,GACrCA,EAAiBN,EAGjBjV,GAAQ0S,GAAUhH,OAAO+H,EAAQ9D,aAAe,EACnB0F,GAC7BA,EAAuB5B,EAAQ9D,aAAe,EAE9C3P,GAAQ0S,GAAUhH,OAAO+H,EAAQ7D,eACJwF,GAC7BA,EAAyB3B,EAAQ7D,eAEb,MAAhB6D,EAAQ9c,OACVqe,EAAU3W,KAAK2U,OAAO9b,QAAQuc,EAAQ9c,MACtCqJ,GAAQ0S,GAAUhH,OAAOsJ,EAAUM,GACnCA,EAAeN,IAInBvjB,GAAUuO,CACX,CAED,OAAOvO,CACX,EAEAkhB,GAAmBjd,UAAU+f,wBAC3B,SAAmDC,EAAUC,GAC3D,OAAOD,EAAShf,KAAI,SAAUiF,GAC5B,IAAK0C,KAAK6U,iBACR,OAAO,KAEU,MAAfyC,IACFha,EAAS+U,GAAK/B,SAASgH,EAAaha,IAEtC,IAAIpK,EAAMmf,GAAKtB,YAAYzT,GAC3B,OAAOrH,OAAOoB,UAAUiC,eAAelB,KAAK4H,KAAK6U,iBAAkB3hB,GAC/D8M,KAAK6U,iBAAiB3hB,GACtB,IACL,GAAE8M,KACP,EAKAsU,GAAmBjd,UAAU8N,OAC3B,WACE,IAAI9M,EAAM,CACRkf,QAASvX,KAAK8U,SACdW,QAASzV,KAAK0U,SAASxP,UACvBsS,MAAOxX,KAAK2U,OAAOzP,UACnBiS,SAAUnX,KAAK0W,sBAYjB,OAVkB,MAAd1W,KAAKuU,QACPlc,EAAI6c,KAAOlV,KAAKuU,OAEM,MAApBvU,KAAKwU,cACPnc,EAAI4Z,WAAajS,KAAKwU,aAEpBxU,KAAK6U,mBACPxc,EAAIof,eAAiBzX,KAAKoX,wBAAwB/e,EAAIod,QAASpd,EAAI4Z,aAG9D5Z,CACX,EAKAic,GAAmBjd,UAAUqgB,SAC3B,WACE,OAAOlkB,KAAKC,UAAUuM,KAAKmF,SAC/B,EAEA,IAAAwS,GAA6BrD,GCta7B,MAAMsD,GAAa,IAAIC,IAAI,CAAC,SAAU,WAAY,gBCiBlD,MAGM/lB,GAAOA,CAAC0P,EAAMlO,KAKhB,GAJIkO,IAAS9G,IACT8G,EAAOlO,GAGS,iBAATkO,EAAmB,CAC1B,MAAMuK,EAAWvK,EAAK7P,WAAW,GACjC,OAAOoa,EAAW,IAAO,MAASA,GAAY,CAClD,CAEA,OAAOvK,CAAI,EASTsW,GAAY,CACd,CAAC5d,EAAOA,GACR,CAACA,EAAOuG,GACR,CAACvG,EAAOM,GACR,CAACN,EAAOO,GACR,CAACP,EAAO,KACR,CAACA,EAAOsS,GACR,CAACtS,EAAOU,GACR,CAACV,EAAOW,GACR,CAACX,EAAOc,GACR,CAACd,EAAOoB,GAER,CAAClB,EAAWF,GACZ,CAACE,EAAWqG,GACZ,CAACrG,EAAWI,GACZ,CAACJ,EAAWK,GACZ,CAACL,EAAW,KACZ,CAACA,EAAWoS,GACZ,CAACpS,EAAWQ,GACZ,CAACR,EAAWS,GACZ,CAACT,EAAWY,GAEZ,CAACX,EAAMH,GACP,CAACG,EAAMoG,GACP,CAACpG,EAAMG,GACP,CAACH,EAAMI,GACP,CAACJ,EAAM,KACP,CAACA,EAAMmS,GACP,CAACnS,EAAMO,GACP,CAACP,EAAMQ,GACP,CAACR,EAAMW,GAEP,CAACH,EAAWX,GACZ,CAACW,EAAW4F,GACZ,CAAC5F,EAAWL,GACZ,CAACK,EAAWJ,GACZ,CAACI,EAAW,KACZ,CAACA,EAAW2R,GACZ,CAAC3R,EAAWD,GACZ,CAACC,EAAWA,GACZ,CAACA,EAAWG,GAEZ,CAAC,IAAKd,GACN,CAAC,IAAKuG,GACN,CAAC,IAAKjG,GACN,CAAC,IAAKC,GACN,CAAC,IAAK,KACN,CAAC,IAAK+R,GACN,CAAC,IAAK5R,GACN,CAAC,IAAKC,GACN,CAAC,IAAKG,GAEN,CAAC,IAAKd,GACN,CAAC,IAAKuG,GACN,CAAC,IAAKjG,GACN,CAAC,IAAKC,GACN,CAAC,IAAK,KACN,CAAC,IAAK+R,GACN,CAAC,IAAK5R,GACN,CAAC,IAAKC,GACN,CAAC,IAAKG,GAEN,CAACwR,EAAatS,GACd,CAACsS,EAAa/L,GACd,CAAC+L,EAAahS,GACd,CAACgS,EAAa/R,GACd,CAAC+R,EAAaA,GACd,CAACA,EAAa5R,GACd,CAAC4R,EAAa3R,GACd,CAAC2R,EAAa,KACd,CAACA,EAAaxR,GAEd,CAAC,IAAKd,GACN,CAAC,IAAKuG,GACN,CAAC,IAAKjG,GACN,CAAC,IAAKC,GACN,CAAC,IAAK,KACN,CAAC,IAAKO,GAEN,CAAC,IAAKwR,GACN,CAAC,IAAK5R,GACN,CAAC,IAAKC,GAEN,CAAC,IAAK2R,GACN,CAAC,IAAK5R,GACN,CAAC,IAAKC,GAEN,CAAC,IAAK,MAGJkd,GAAYD,GAAUE,OAAO,CAC/B,CAAC9d,EAAOG,GAER,CAACQ,EAAWR,GAEZ,CAACA,EAAMA,GAEP,CAACD,EAAWkB,GACZ,CAAClB,EAAW6d,GACZ,CAAC7d,EAAWa,GAEZ,CAACL,EAAYA,GACb,CAACA,EAAYC,GACb,CAACD,EAAY6F,GACb,CAAC7F,EAAY,KAEb,CAACW,EAAkBrB,GACnB,CAACqB,EAAkBkF,GACnB,CAAClF,EAAkBX,GACnB,CAACW,EAAkBV,GACnB,CAACU,EAAkBlB,GACnB,CAACkB,EAAkB,OAGvB,SAAS2c,GAAUC,GACf,MAAMC,EAAuB,IAAIP,IAC7BM,EAAM9f,KAAI,EAAE6L,EAAMvC,KAAW7P,GAAKoS,IAAS,GAAKpS,GAAK6P,MAGzD,OAAO,SAAS0W,EAAU7W,EAAMlO,GAC5B,MAAMuQ,EAAW/R,GAAK0P,EAAMlO,GACtBglB,EAAehlB,EAAM3B,WAAW,GActC,OA5JY,KAgJP2mB,GACG9W,IAAStH,GACTsH,IAASf,GACTe,IAASxG,GApJR,KAqJJsd,EACKF,EAAqB9F,IAAI+F,GAAY,GAAKC,GAAgB,GAC1DF,EAAqB9F,IAAI+F,GAAY,GAAKxU,KAGhD7D,KAAKuY,KAAK,IAAKzd,GAAY,GAGxB+I,EAEf,CAEO,MAAM2U,GAAON,GAAUJ,IACjBW,GAAOP,GAAUH,2DCjL9B,MAAMW,GAAiB,GAEvB,SAASC,GAAgBpO,EAAMqO,GAC3B,GAAyB,mBAAdA,EAeXrO,EAAKtS,SAASmN,QAAQpF,KAAKuK,KAAMvK,UAfjC,CACI,IAAIkE,EAAO,KAEXqG,EAAKtS,SAASmN,SAAQmF,IACL,OAATrG,GACA0U,EAAUxgB,KAAK4H,KAAMkE,GAGzBlE,KAAKuK,KAAKA,GACVrG,EAAOqG,CAAI,GAInB,CAGJ,CAEA,SAASsO,GAAazV,GAClBzC,GAASyC,GAAO,CAAC5B,EAAM3D,EAAOC,KAC1BkC,KAAK8Y,MAAMtX,EAAM4B,EAAMjL,MAAM0F,EAAOC,GAAK,GAEjD,CAEO,SAASib,GAAgBnP,GAC5B,MAAMoP,EAAQ,IAAIxY,IAElB,IAAK,IAAKlI,EAAM2K,KAAShN,OAAOuU,QAAQZ,EAAOW,MAAO,CAGhC,mBAFPtH,EAAKgW,UAAYhW,IAGxB+V,EAAMlG,IAAIxa,EAAM2K,EAAKgW,UAAYhW,EAEzC,CAEA,OAAO,SAASsH,EAAMpX,GAClB,IAAI+L,EAAS,GACTmZ,EAAW,EACXa,EAAW,CACX3O,IAAAA,CAAKA,GACD,IAAIyO,EAAM1G,IAAI/H,EAAK/I,MAGf,MAAM,IAAI1J,MAAM,sBAAwByS,EAAK/I,MAF7CwX,EAAMtX,IAAI6I,EAAK/I,MAAMpJ,KAAK+gB,EAAW5O,EAI5C,EACD6O,YAAaA,GACbN,KAAAA,CAAMtX,EAAMlO,GACR+kB,EAAWrY,KAAKoZ,YAAYf,EAAU7W,EAAMlO,GAE5C0M,KAAKuY,KAAKjlB,EAAOkO,GAAM,GAEnBA,IAAS9G,GAASpH,EAAM3B,WAAW,KAAO+mB,IAC1C1Y,KAAKuY,KAAK,KAAMzd,GAAY,EAEnC,EACDyd,IAAAA,CAAKjlB,GACD4L,GAAU5L,CACb,EACDF,OAAMA,IACK8L,GAIX/L,IACiC,mBAAtBA,EAAQkmB,YACfH,EAAW/lB,EAAQkmB,UAAUH,IAG7B/lB,EAAQmmB,YACRJ,EFzET,SAA2BA,GAC9B,MAAM7gB,EAAM,IAAIic,GACVgB,EAAY,CACd5V,KAAM,EACNE,OAAQ,GAEN2V,EAAW,CACb7V,KAAM,EACNE,OAAQ,GAEN2Z,EAAqB,CACvB7Z,KAAM,EACNE,OAAQ,GAEN4Z,EAAmB,CACrBlE,UAAWiE,GAEf,IAAI7Z,EAAO,EACPE,EAAS,EACT6Z,GAAsB,EAE1B,MAAMC,EAAmBR,EAAS3O,KAClC2O,EAAS3O,KAAO,SAASA,GACrB,GAAIA,EAAKsC,KAAOtC,EAAKsC,IAAIhP,OAAS+Z,GAAWtF,IAAI/H,EAAK/I,MAAO,CACzD,MAAMmY,EAAWpP,EAAKsC,IAAIhP,MAAM6B,KAC1Bka,EAAarP,EAAKsC,IAAIhP,MAAM+B,OAAS,EAEvC2V,EAAS7V,OAASia,GAClBpE,EAAS3V,SAAWga,IACpBrE,EAAS7V,KAAOia,EAChBpE,EAAS3V,OAASga,EAElBtE,EAAU5V,KAAOA,EACjB4V,EAAU1V,OAASA,EAEf6Z,IACAA,GAAsB,EAClBnE,EAAU5V,OAAS6Z,EAAmB7Z,MACtC4V,EAAU1V,SAAW2Z,EAAmB3Z,QACxCvH,EAAImd,WAAWgE,IAIvBC,GAAsB,EACtBphB,EAAImd,WAAW,CACXlY,OAAQiN,EAAKsC,IAAIvP,OACjBiY,WACAD,cAGZ,CAEAoE,EAAiBthB,KAAK4H,KAAMuK,GAExBkP,GAAuB7B,GAAWtF,IAAI/H,EAAK/I,QAC3C+X,EAAmB7Z,KAAOA,EAC1B6Z,EAAmB3Z,OAASA,IAIpC,MAAMia,EAAmBX,EAASX,KAClCW,EAASX,KAAO,SAASjlB,EAAOkO,EAAMsY,GAClC,IAAK,IAAI3gB,EAAI,EAAGA,EAAI7F,EAAMnB,OAAQgH,IACF,KAAxB7F,EAAM3B,WAAWwH,IACjBuG,IACAE,EAAS,GAETA,IAIRia,EAAiBvmB,EAAOkO,EAAMsY,IAGlC,MAAMC,EAAqBb,EAAS9lB,OAYpC,OAXA8lB,EAAS9lB,OAAS,WAKd,OAJIqmB,GACAphB,EAAImd,WAAWgE,GAGZ,CACHQ,IAAKD,IACL1hB,QAID6gB,CACX,CEd2Be,CAAkBf,IAG7B/lB,EAAQ+mB,QAAQd,KAChBF,EAASE,YAAcA,GAAYjmB,EAAQ+mB,QAInD,MAAMf,EAAY,CACd5O,KAAOA,GAAS2O,EAAS3O,KAAKA,GAC9BtS,SAAU0gB,GACVG,MAAOA,CAACtX,EAAMlO,IAAU4lB,EAASJ,MAAMtX,EAAMlO,GAC7CqN,SAAUkY,IAKd,OAFAK,EAAS3O,KAAKA,GAEP2O,EAAS9lB,SAExB,CChGA,MAAQkG,eAAAA,IAAmBrD,OAAOoB,UAC5B8iB,GAAO,WAAW,EAExB,SAASC,GAAe9mB,GACpB,MAAwB,mBAAVA,EAAuBA,EAAQ6mB,EACjD,CAEA,SAASE,GAAcrX,EAAIxB,GACvB,OAAO,SAAS+I,EAAMtH,EAAM0D,GACpB4D,EAAK/I,OAASA,GACdwB,EAAG5K,KAAK4H,KAAMuK,EAAMtH,EAAM0D,GAGtC,CAEA,SAAS2T,GAAwBhiB,EAAMG,GACnC,MAAM8hB,EAAY9hB,EAAS8hB,UACrBC,EAAU,GAEhB,IAAK,MAAMtnB,KAAOqnB,EAAW,CACzB,IAA4C,IAAxCjhB,GAAelB,KAAKmiB,EAAWrnB,GAC/B,SAGJ,IAAIunB,EAAaF,EAAUrnB,GAC3B,MAAMwnB,EAAS,CACXpiB,KAAMpF,EACNsO,MAAM,EACNmZ,UAAU,GAGT5d,MAAM6d,QAAQH,KACfA,EAAa,CAACA,IAGlB,IAAK,MAAMI,KAAaJ,EACF,OAAdI,EACAH,EAAOC,UAAW,EACU,iBAAdE,EACdH,EAAOlZ,KAAO,OACPzE,MAAM6d,QAAQC,KACrBH,EAAOlZ,KAAO,QAIlBkZ,EAAOlZ,MACPgZ,EAAQnoB,KAAKqoB,EAErB,CAEA,OAAIF,EAAQroB,OACD,CACHc,QAASwF,EAASqiB,YAClBC,OAAQP,GAIT,IACX,CAoBA,SAASQ,GAAmBpR,EAAQqR,GAChC,MAAMF,EAASnR,EAAOmR,OAAO5iB,QACvB+iB,EAActR,EAAO3W,QACrBkoB,EAAoC,iBAAhBD,EAM1B,OAJID,GACAF,EAAOE,UAGJ,SAAS1Q,EAAMtX,EAASmoB,EAAMC,GACjC,IAAIC,EAEAH,IACAG,EAAmBroB,EAAQioB,GAC3BjoB,EAAQioB,GAAe3Q,GAG3B,IAAK,MAAMgR,KAASR,EAAQ,CACxB,MAAMS,EAAMjR,EAAKgR,EAAMjjB,MAEvB,IAAKijB,EAAMZ,UAAYa,EACnB,GAAmB,SAAfD,EAAM/Z,KAAiB,CAKvB,GAJkByZ,EACZO,EAAI9V,YAAY2V,GAAa,GAC7BG,EAAIjW,OAAO8V,GAAa,GAG1B,OAAO,CAEf,MAAO,GAAID,EAAKI,GACZ,OAAO,CAGnB,CAEIL,IACAloB,EAAQioB,GAAeI,GAGnC,CAEA,SAASG,IAAsBC,WAC3BA,EAAUC,OACVA,EAAMC,KACNA,EAAIC,MACJA,EAAKC,gBACLA,IAEA,MAAO,CACHH,OAAQ,CACJD,aACAC,SACAC,OACAC,SAEJD,KAAM,CACFF,aACAC,SACAC,OACAC,SAEJE,YAAa,CACTL,aACAC,SACAC,OACAC,QACAC,mBAGZ,CAEO,SAASE,GAAapS,GACzB,MAAMoP,EA1FV,SAA4BpP,GACxB,MAAMoP,EAAQ,CAAA,EAEd,IAAK,MAAM1gB,KAAQsR,EAAOW,KACtB,GAAIjR,GAAelB,KAAKwR,EAAOW,KAAMjS,GAAO,CACxC,MAAMG,EAAWmR,EAAOW,KAAKjS,GAE7B,IAAKG,EAAS8hB,UACV,MAAM,IAAIziB,MAAM,gCAAkCQ,EAAO,0BAG7D0gB,EAAM1gB,GAAQgiB,GAAwBhiB,EAAMG,EAChD,CAGJ,OAAOugB,CACX,CA0EkBiD,CAAmBrS,GAC3BsS,EAAmB,CAAA,EACnBC,EAAmB,CAAA,EACnBC,EAAYxX,OAAO,cACnByX,EAAWzX,OAAO,aAExB,IAAK,MAAMtM,KAAQ0gB,EACX1f,GAAelB,KAAK4gB,EAAO1gB,IAAyB,OAAhB0gB,EAAM1gB,KAC1C4jB,EAAiB5jB,GAAQ0iB,GAAmBhC,EAAM1gB,IAAO,GACzD6jB,EAAiB7jB,GAAQ0iB,GAAmBhC,EAAM1gB,IAAO,IAIjE,MAAMgkB,EAAgCb,GAAsBS,GACtDK,EAAgCd,GAAsBU,GAEtDf,EAAO,SAASoB,EAAMrpB,GACxB,SAASspB,EAASlS,EAAMtH,EAAM0D,GAC1B,MAAM+V,EAAWC,EAAMvkB,KAAKnF,EAASsX,EAAMtH,EAAM0D,GAEjD,OAAI+V,IAAaN,GAIbM,IAAaL,OAIbO,EAAUtjB,eAAeiR,EAAK/I,QAC1Bob,EAAUrS,EAAK/I,MAAM+I,EAAMtX,EAASwpB,EAAUpB,KAKlDwB,EAAMzkB,KAAKnF,EAASsX,EAAMtH,EAAM0D,KAAUyV,EAKlD,CAEA,IAAIO,EAAQxC,GACR0C,EAAQ1C,GACRyC,EAAYV,EACZb,EAAcA,CAACyB,EAAK7Y,EAAMhB,EAAM0D,IAASmW,GAAOL,EAASxY,EAAMhB,EAAM0D,GACzE,MAAM1T,EAAU,CACZ8pB,MAAOX,EACP7Z,KAAM8Z,EAENG,OACAQ,WAAY,KACZ3S,OAAQ,KACR4S,cAAe,KACfC,KAAM,KACNC,SAAU,KACVC,MAAO,KACPC,YAAa,KACbC,SAAU,MAGd,GAAuB,mBAAZnqB,EACPwpB,EAAQxpB,OACL,GAAIA,IACPwpB,EAAQvC,GAAejnB,EAAQwpB,OAC/BE,EAAQzC,GAAejnB,EAAQ0pB,OAE3B1pB,EAAQ8nB,UACR2B,EAAYT,GAGZhpB,EAAQoqB,OAAO,CACf,GAAIjB,EAA8BhjB,eAAenG,EAAQoqB,OACrDX,EAAYzpB,EAAQ8nB,QACdsB,EAA8BppB,EAAQoqB,OACtCjB,EAA8BnpB,EAAQoqB,YACzC,IAAKvE,EAAM1f,eAAenG,EAAQoqB,OACrC,MAAM,IAAIzlB,MAAM,cAAgB3E,EAAQoqB,MAAQ,oCAAsCtnB,OAAOwT,KAAKuP,GAAO7E,OAAO5b,KAAK,MAAQ,KAGjIokB,EAAQtC,GAAcsC,EAAOxpB,EAAQoqB,OACrCV,EAAQxC,GAAcwC,EAAO1pB,EAAQoqB,MACzC,CAGJ,GAAIZ,IAAUxC,IAAQ0C,IAAU1C,GAC5B,MAAM,IAAIriB,MAAM,+EAGpB2kB,EAASD,IA+Cb,OA5CApB,EAAK2B,MAAQX,EACbhB,EAAK7Y,KAAO8Z,EAEZjB,EAAKoC,KAAO,SAAStQ,EAAKlK,GACtB,IAAIya,EAAQ,KASZ,OAPArC,EAAKlO,GAAK,SAAS3C,EAAMtH,EAAM0D,GAC3B,GAAI3D,EAAG5K,KAAK4H,KAAMuK,EAAMtH,EAAM0D,GAE1B,OADA8W,EAAQlT,EACD6R,CAEf,IAEOqB,GAGXrC,EAAKsC,SAAW,SAASxQ,EAAKlK,GAC1B,IAAIya,EAAQ,KAYZ,OAVArC,EAAKlO,EAAK,CACN+N,SAAS,EACT0B,KAAAA,CAAMpS,EAAMtH,EAAM0D,GACd,GAAI3D,EAAG5K,KAAK4H,KAAMuK,EAAMtH,EAAM0D,GAE1B,OADA8W,EAAQlT,EACD6R,CAEf,IAGGqB,GAGXrC,EAAKuC,QAAU,SAASzQ,EAAKlK,GACzB,MAAMya,EAAQ,GAQd,OANArC,EAAKlO,GAAK,SAAS3C,EAAMtH,EAAM0D,GACvB3D,EAAG5K,KAAK4H,KAAMuK,EAAMtH,EAAM0D,IAC1B8W,EAAMprB,KAAKkY,EAEnB,IAEOkT,GAGJrC,CACX,CC9RA,SAASjB,GAAK7mB,GACV,OAAOA,CACX,CA2DA,SAASsqB,GAAiBrT,EAAMsT,EAAUC,EAAaC,GACnD,IAAI3qB,EAEJ,OAAQmX,EAAK/I,MACT,IAAK,QACDpO,EAlBZ,SAA0BmX,EAAMsT,EAAUC,EAAaC,GACnD,MAAMC,EAAiC,MAApBzT,EAAKyT,YAAsBD,EAAUxT,EAAKyT,WAAa,IAAMzT,EAAKyT,WAAa,IAC5F5qB,EAASmX,EAAK0T,MACf5lB,KAAI6lB,GAAQN,GAAiBM,EAAML,EAAUC,EAAaC,KAC1DxlB,KAAKylB,GAEV,OAAIzT,EAAK4T,UAAYL,GACTC,GAAyB,MAAd3qB,EAAO,GAAa,IAAM,MAAQA,GAAU2qB,EAAU,IAAM,MAG5E3qB,CACX,CAQgBgrB,CAAiB7T,EAAMsT,EAAUC,EAAaC,IAC7CxT,EAAK8T,cAAgB,IAAM,IAChC,MAEJ,IAAK,aAED,OACIT,GAAiBrT,EAAK2T,KAAML,EAAUC,EAAaC,GACnDF,EAvEhB,SAA4BS,GACxB,MAAMhgB,IAAEA,EAAGc,IAAEA,EAAGmf,MAAEA,GAAUD,EAE5B,OAAY,IAARhgB,GAAqB,IAARc,EACNmf,EAAQ,KAAO,IAGd,IAARjgB,GAAqB,IAARc,EACN,IAGC,IAARd,GAAqB,IAARc,EACNmf,EAAQ,IAAM,IAGb,IAARjgB,GAAqB,IAARc,EACN,IAINmf,EAAQ,IAAM,KACdjgB,IAAQc,EACH,IAAMd,EAAM,IACZ,IAAMA,EAAM,KAAe,IAARc,EAAYA,EAAM,IAAM,IAGzD,CA6CyBof,CAAmBjU,GAAOA,GAG3C,IAAK,OACDnX,EAAS,IAAMmX,EAAKjS,MAAQiS,EAAKkU,KAAOZ,EA/CpD,SAA0BtT,GACtB,GACS,UADDA,EAAK/I,KAEL,MACI,MACc,OAAb+I,EAAKjM,IAAe,KAAOiM,EAAKjM,KACjC,KACc,OAAbiM,EAAKnL,IAAe,IAAMmL,EAAKnL,KAChC,IAIJ,MAAM,IAAItH,MAAM,sBAAwByS,EAAK/I,KAAO,IAEhE,CAiC6Dkd,CAAiBnU,EAAKkU,MAAOlU,EAAKkU,MAAQ,IAAM,IACjG,MAEJ,IAAK,WACDrrB,EAAS,KAAQmX,EAAKjS,KAAO,KAC7B,MAEJ,IAAK,UACDlF,EAASmX,EAAKjS,KACd,MAEJ,IAAK,YACDlF,EAAS,IAAMmX,EAAKjS,KACpB,MAEJ,IAAK,WACDlF,EAASmX,EAAKjS,KAAO,IACrB,MAEJ,IAAK,SACL,IAAK,QACDlF,EAASmX,EAAKjX,MACd,MAEJ,IAAK,QACDF,EAAS,IACT,MAEJ,QACI,MAAM,IAAI0E,MAAM,sBAAwByS,EAAK/I,KAAO,KAG5D,OAAOqc,EAASzqB,EAAQmX,EAC5B,CAEO,SAAS0O,GAAS1O,EAAMpX,GAC3B,IAAI0qB,EAAW1D,GACX2D,GAAc,EACdC,GAAU,EAYd,MAVuB,mBAAZ5qB,EACP0qB,EAAW1qB,EACJA,IACP2qB,EAAchoB,QAAQ3C,EAAQ2qB,aAC9BC,EAAUjoB,QAAQ3C,EAAQ4qB,SACM,mBAArB5qB,EAAQ0qB,WACfA,EAAW1qB,EAAQ0qB,WAIpBD,GAAiBrT,EAAMsT,EAAUC,EAAaC,EACzD,CC/HA,MAAMY,GAAa,CAAEphB,OAAQ,EAAGmC,KAAM,EAAGE,OAAQ,GAoDjD,SAASgf,GAAQrU,EAAMsU,GACnB,MAAMvrB,EAAQiX,GAAQA,EAAKsC,KAAOtC,EAAKsC,IAAIgS,GAE3C,OAAIvrB,EACO,SAAUA,EAAQwrB,GAASxrB,GAASA,EAGxC,IACX,CAEA,SAASwrB,IAASvhB,OAAEA,EAAMmC,KAAEA,EAAIE,OAAEA,GAAUmf,GACxC,MAAMlS,EAAM,CACRtP,SACAmC,OACAE,UAGJ,GAAImf,EAAO,CACP,MAAMvf,EAAQuf,EAAM9W,MAAM,eAE1B4E,EAAItP,QAAUwhB,EAAM5sB,OACpB0a,EAAInN,MAAQF,EAAMrN,OAAS,EAC3B0a,EAAIjN,OAA0B,IAAjBJ,EAAMrN,OAAe0a,EAAIjN,OAASmf,EAAM5sB,OAASqN,EAAMiH,MAAMtU,OAAS,CACvF,CAEA,OAAO0a,CACX,CAEO,MAAMmS,GAAuB,SAASxd,EAAMyd,GAC/C,MAAMprB,EAAQoT,GACV,uBACAzF,GAAQyd,EAAgB,KAAOA,EAAgB,IAAM,KAKzD,OAFAprB,EAAMqrB,UAAYD,EAEXprB,CACX,EAEasrB,GAAmB,SAASrrB,EAASsrB,EAAQ7U,EAAM8U,GAC5D,MAAMxrB,EAAQoT,GAAkB,mBAAoBnT,IAC9CkmB,IACFA,EAAGsF,eACHA,EAAcC,eACdA,EAAc1hB,MACdA,EAAKC,IACLA,GAhGR,SAAwBuhB,EAAa9U,GACjC,MAAMpH,EAASkc,EAAYlc,OACrBqc,EAAeH,EAAYG,aAC3BC,EAAeD,EAAerc,EAAOhR,QAASgR,EAAOqc,GAAcjV,MAAe,KAClFmV,EAAUD,IAAiBlV,EAAOkV,EAAe,KACvD,IAII5hB,EACAC,EALAwhB,EAAiB,EACjBC,EAAiB,EACjB/U,EAAU,EACVwP,EAAM,GAIV,IAAK,IAAI7gB,EAAI,EAAGA,EAAIgK,EAAOhR,OAAQgH,IAAK,CACpC,MAAM2f,EAAQ3V,EAAOhK,GAAG7F,MAEpB6F,IAAMqmB,IACND,EAAiBzG,EAAM3mB,OACvBmtB,EAAiBtF,EAAI7nB,QAGT,OAAZutB,GAAoBvc,EAAOhK,GAAGoR,OAASmV,IACnCvmB,GAAKqmB,EACLhV,IAEAA,EAAU,GAIlBwP,GAAOlB,CACX,CAYA,OAVI0G,IAAiBrc,EAAOhR,QAAUqY,EAAU,GAC5C3M,EAAQ+gB,GAAQc,GAAWnV,EAAM,QAAUuU,GAASH,GAAY3E,GAChElc,EAAMghB,GAASjhB,KAEfA,EAAQ+gB,GAAQc,EAAS,UACrBZ,GAASF,GAAQrU,EAAM,UAAYoU,GAAY3E,EAAI7hB,MAAM,EAAGmnB,IAChExhB,EAAM8gB,GAAQc,EAAS,QACnBZ,GAASjhB,EAAOmc,EAAI5R,OAAOkX,EAAgBC,KAG5C,CACHvF,MACAsF,iBACAC,iBACA1hB,QACAC,MAER,CAiDQ6hB,CAAeN,EAAa9U,GAmBhC,OAjBA1W,EAAM+rB,WAAa9rB,EACnBD,EAAMurB,OAASA,EAASnG,GAASmG,GAAU,YAC3CvrB,EAAMmmB,IAAMA,EACZnmB,EAAMyrB,eAAiBA,EACvBzrB,EAAM0rB,eAAiBA,EACvB1rB,EAAMC,QAAUA,iBACGD,EAAMurB,OADTtrB,gBAEIkmB,GAAO,kBAFXlmB,eAGG,IAAIiJ,MAAMlJ,EAAMyrB,eAAiB,GAAG/mB,KAAK,KAAO,IAEnEtC,OAAOoR,OAAOxT,EAAOgK,GACrBhK,EAAMgZ,IAAM,CACRvP,OAASiN,GAAQA,EAAKsC,KAAOtC,EAAKsC,IAAIvP,QAAW,YACjDO,QACAC,OAGGjK,CACX,EC1HMgsB,GAAW,IAAIrf,IACfsf,GAAa,IAAItf,IACjBuf,GAAc,GAEPC,GA+Bb,SAA8BA,GAC1B,GAAIH,GAASvN,IAAI0N,GACb,OAAOH,GAASne,IAAIse,GAGxB,MAAM1nB,EAAO0nB,EAAQrnB,cACrB,IAAIsnB,EAAaJ,GAASne,IAAIpJ,GAE9B,QAAmBwQ,IAAfmX,EAA0B,CAC1B,MAAMC,EAASC,GAAiB7nB,EAAM,GAChC8nB,EAAUF,EAAoC,GAA3BG,GAAgB/nB,EAAM,GAC/C2nB,EAAahqB,OAAOqqB,OAAO,CACvBC,SAAUjoB,EAAK8P,OAAOgY,EAAOjuB,QAC7BmG,OACAkoB,OAAQJ,EACRA,SACAF,UAER,CAIA,OAFAL,GAAS/M,IAAIkN,EAASC,GAEfA,CACX,EArDaQ,GAuDb,SAA+BA,GAC3B,GAAIX,GAAWxN,IAAImO,GACf,OAAOX,GAAWpe,IAAI+e,GAG1B,IAAInoB,EAAOmoB,EACPC,EAAOD,EAAS,GAEP,MAATC,EACAA,EAAuB,MAAhBD,EAAS,GAAa,KAAO,IACpB,MAATC,GACS,MAATA,GACS,MAATA,GACS,MAATA,GACS,MAATA,GACS,MAATA,IACPA,EAAO,IAGX,MAAMR,EAASC,GAAiB7nB,EAAMooB,EAAKvuB,QAG3C,IAAK+tB,IACD5nB,EAAOA,EAAKK,cACRmnB,GAAWxN,IAAIha,IAAO,CACtB,MAAM2nB,EAAaH,GAAWpe,IAAIpJ,GAElC,OADAwnB,GAAWhN,IAAI2N,EAAUR,GAClBA,CACX,CAGJ,MAAMG,EAAUF,EAA8C,GAArCG,GAAgB/nB,EAAMooB,EAAKvuB,QAC9CquB,EAASloB,EAAK8P,OAAO,EAAGsY,EAAKvuB,OAASiuB,EAAOjuB,QAC7C8tB,EAAahqB,OAAOqqB,OAAO,CAC7BC,SAAUjoB,EAAK8P,OAAOoY,EAAOruB,QAC7BmG,KAAMA,EAAK8P,OAAOsY,EAAKvuB,QACvBuuB,OACAN,SACAI,SACAN,WAKJ,OAFAJ,GAAWhN,IAAI2N,EAAUR,GAElBA,CACX,EAlGO,SAASE,GAAiBnU,EAAKzO,GAGlC,OAFAA,EAASA,GAAU,EAEZyO,EAAI7Z,OAASoL,GAAU,GACvByO,EAAIra,WAAW4L,KAAYwiB,IAC3B/T,EAAIra,WAAW4L,EAAS,KAAOwiB,EAC1C,CAEA,SAASM,GAAgBrU,EAAKzO,GAI1B,GAHAA,EAASA,GAAU,EAGfyO,EAAI7Z,OAASoL,GAAU,GAEnByO,EAAIra,WAAW4L,KAAYwiB,IAC3B/T,EAAIra,WAAW4L,EAAS,KAAOwiB,GAAa,CAE5C,MAAMY,EAAkB3U,EAAInT,QAAQ,IAAK0E,EAAS,GAElD,IAAyB,IAArBojB,EACA,OAAO3U,EAAIjY,UAAUwJ,EAAQojB,EAAkB,EAEvD,CAGJ,MAAO,EACX,CChCO,MAAMC,GAAkB,CAC3B,UACA,UACA,QACA,SACA,gBCKEC,GAAW,GACXd,GAAc,GAEde,IAAgB,EAGtB,SAASxe,GAAQwW,EAAOhnB,GACpB,OAAiB,OAAVgnB,GAAkBA,EAAMtX,OAAS9G,GAASoe,EAAMxlB,MAAM3B,WAAW,KAAOG,CACnF,CAEA,SAAS0Q,GAAOsW,EAAOvb,EAAQwjB,GAC3B,KAAiB,OAAVjI,IAAmBA,EAAMtX,OAAS1G,GAAcge,EAAMtX,OAAS9F,IAClEod,EAAQiI,IAAexjB,GAG3B,OAAOA,CACX,CAEA,SAASyjB,GAAalI,EAAOmI,EAAaC,EAAc3jB,GACpD,IAAKub,EACD,OAAO,EAGX,MAAMhnB,EAAOgnB,EAAMxlB,MAAM3B,WAAWsvB,GAEpC,GAAInvB,IAAS+uB,IAAY/uB,IAASiuB,GAAa,CAC3C,GAAImB,EAEA,OAAO,EAEXD,GACJ,CAEA,KAAOA,EAAcnI,EAAMxlB,MAAMnB,OAAQ8uB,IACrC,IAAKrlB,EAAQkd,EAAMxlB,MAAM3B,WAAWsvB,IAEhC,OAAO,EAIf,OAAO1jB,EAAS,CACpB,CAIA,SAAS4jB,GAASrI,EAAOsI,EAASL,GAC9B,IAAItiB,GAAO,EACPlB,EAASiF,GAAOsW,EAAOsI,EAASL,GAIpC,GAAc,QAFdjI,EAAQiI,EAAaxjB,IAGjB,OAAO6jB,EAGX,GAAItI,EAAMtX,OAASgL,EAAa,CAC5B,IAAIlK,GAAQwW,EAAO+H,MAAave,GAAQwW,EAAOiH,IAS3C,OAAOqB,EAJP,GAJA3iB,GAAO,EACPlB,EAASiF,GAAOue,IAAexjB,GAASA,EAAQwjB,GAGlC,QAFdjI,EAAQiI,EAAaxjB,KAECub,EAAMtX,OAASgL,EACjC,OAAO,CAKnB,CAEA,IAAK/N,EAAM,CACP,MAAM3M,EAAOgnB,EAAMxlB,MAAM3B,WAAW,GACpC,GAAIG,IAAS+uB,IAAY/uB,IAASiuB,GAE9B,OAAO,CAEf,CAEA,OAAOiB,GAAalI,EAAOra,EAAO,EAAI,EAAGA,EAAMlB,EACnD,CChFA,MACMwiB,GAAc,GACdsB,GAAe,GAGrB,SAAS/e,GAAQwW,EAAOhnB,GACpB,OAAiB,OAAVgnB,GAAkBA,EAAMtX,OAAS9G,GAASoe,EAAMxlB,MAAM3B,WAAW,KAAOG,CACnF,CAMA,SAASwvB,GAAYxI,EAAOvb,EAAQgkB,GAChC,IAAIC,EAAS,EAEb,IAAK,IAAInf,EAAM9E,EAAQ8E,EAAMyW,EAAMxlB,MAAMnB,OAAQkQ,IAAO,CACpD,MAAMvQ,EAAOgnB,EAAMxlB,MAAM3B,WAAW0Q,GAEpC,GAAIvQ,IAASiuB,IAAewB,GAAwB,IAAXC,EAErC,OADAF,GAAYxI,EAAOvb,EAASikB,EAAS,GAAG,GACjC,EAGX,IAAK3lB,EAAW/J,GACZ,OAAO,EAGX,KAAM0vB,EAAS,EACX,OAAO,CAEf,CAEA,OAAOA,CACX,CAEA,SAASC,GAAyBC,EAAUvvB,EAAQ4uB,GAChD,IAAKW,EACD,OAAO,EAGX,KAAOpf,GAAQye,EAAa5uB,GAASkvB,KAAe,CAChD,KAAMK,EAAW,EACb,OAAO,EAGXvvB,GACJ,CAEA,OAAOA,CACX,CCvBA,MAAMwvB,GAAoB,CAAC,QAAS,aAAc,iBAC5CphB,GAAc,IAAIC,IAAI,CACxB,CAACC,EAAelF,GAChB,CAACD,EAAiBC,GAClB,CAACH,EAAmBC,GACpB,CAACG,EAAkBC,KAIvB,SAAS9J,GAAWqa,EAAKna,GACrB,OAAOA,EAAQma,EAAI7Z,OAAS6Z,EAAIra,WAAWE,GAAS,CACxD,CAEA,SAAS+vB,GAAMC,EAAQC,GACnB,OAAOlkB,GAAOikB,EAAQ,EAAGA,EAAO1vB,OAAQ2vB,EAC5C,CAEA,SAASC,GAASF,EAAQC,GACtB,IAAK,IAAI3oB,EAAI,EAAGA,EAAI2oB,EAAS3vB,OAAQgH,IACjC,GAAIyoB,GAAMC,EAAQC,EAAS3oB,IACvB,OAAO,EAIf,OAAO,CACX,CAGA,SAAS6oB,GAAgBhW,EAAKzO,GAC1B,OAAIA,IAAWyO,EAAI7Z,OAAS,IAKI,KAA5BR,GAAWqa,EAAKzO,IAChB3B,EAAQjK,GAAWqa,EAAKzO,EAAS,IAEzC,CAEA,SAAS0kB,GAAWxD,EAAMnrB,EAAO4uB,GAC7B,GAAIzD,GAAsB,UAAdA,EAAKjd,KAAkB,CAC/B,MAAM2gB,EAAMxnB,YACGmO,IAAXoZ,GAAwBA,IAAW5uB,EAAMnB,OACnCmB,EAAM8U,OAAO,EAAG8Z,GAChB5uB,GAGV,GAAIgV,MAAM6Z,GACN,OAAO,EAKX,GAAiB,OAAb1D,EAAKngB,KAAgB6jB,EAAM1D,EAAKngB,KAA2B,iBAAbmgB,EAAKngB,IACnD,OAAO,EAKX,GAAiB,OAAbmgB,EAAKrf,KAAgB+iB,EAAM1D,EAAKrf,KAA2B,iBAAbqf,EAAKrf,IACnD,OAAO,CAEf,CAEA,OAAO,CACX,CA6CA,SAASgjB,GAAKzgB,GACV,OAAO,SAASmX,EAAOiI,EAActC,GACjC,OAAc,OAAV3F,EACO,EAGPA,EAAMtX,OAASf,GAAiBshB,GAASjJ,EAAMxlB,MAAOquB,IAjDlE,SAAyB7I,EAAOiI,GAC5B,IAAIzf,EAAmB,EACnB+gB,EAAe,GACflwB,EAAS,EAGbmwB,EACA,EAAG,CACC,OAAQxJ,EAAMtX,MACV,KAAK/F,EACL,KAAKF,EACL,KAAKF,EACD,GAAIyd,EAAMtX,OAASF,EACf,MAAMghB,EAKV,GAFAhhB,EAAmB+gB,EAAa5b,MAEJ,IAAxB4b,EAAalwB,OAAc,CAC3BA,IACA,MAAMmwB,CACV,CAEA,MAEJ,KAAK7hB,EACL,KAAKnF,EACL,KAAKF,EACL,KAAKI,EACD6mB,EAAahwB,KAAKiP,GAClBA,EAAmBf,GAAYmB,IAAIoX,EAAMtX,MAIjDrP,GACJ,OAAS2mB,EAAQiI,EAAa5uB,IAE9B,OAAOA,CACX,CAYmBowB,CAAgBzJ,EAAOiI,GAG3Bpf,EAAKmX,EAAOiI,EAActC,GAEzC,CAEA,SAAS1d,GAAUyhB,GACf,OAAO,SAAS1J,GACZ,OAAc,OAAVA,GAAkBA,EAAMtX,OAASghB,EAC1B,EAGJ,EAEf,CA0CA,SAASC,GAAY3J,GACjB,OAAc,OAAVA,GAAkBA,EAAMtX,OAAStH,GAKF,KAA/BvI,GAAWmnB,EAAMxlB,MAAO,IAAgD,KAA/B3B,GAAWmnB,EAAMxlB,MAAO,GAJ1D,EAQJ,CACX,CA6KA,SAASovB,GAAUlhB,GAKf,OAJIA,IACAA,EAAO,IAAIqW,IAAIrW,IAGZ,SAASsX,EAAOiI,EAActC,GACjC,GAAc,OAAV3F,GAAkBA,EAAMtX,OAAS3G,EACjC,OAAO,EAGX,MAAM8nB,EAAYnkB,GAAcsa,EAAMxlB,MAAO,GAG7C,GAAa,OAATkO,EAAe,CAEf,MAAMohB,EAAuB9J,EAAMxlB,MAAMuF,QAAQ,KAAM8pB,GACjDE,GAAiC,IAA1BD,GAAgCZ,GAAgBlJ,EAAMxlB,MAAOsvB,GAEpE9J,EAAMxlB,MAAMS,UAAU4uB,EAAWC,GADjC9J,EAAMxlB,MAAM8U,OAAOua,GAGzB,IAAqC,IAAjCnhB,EAAK8Q,IAAIuQ,EAAKlqB,eACd,OAAO,CAEf,CAGA,OAAIspB,GAAWxD,EAAM3F,EAAMxlB,MAAOqvB,GACvB,EAGJ,EAEf,CA8BA,SAASG,GAAKnhB,GAOV,MANoB,mBAATA,IACPA,EAAO,WACH,OAAO,IAIR,SAASmX,EAAOiI,EAActC,GACjC,OAAc,OAAV3F,GAAkBA,EAAMtX,OAASgL,GACL,IAAxB7R,OAAOme,EAAMxlB,OACN,EAIRqO,EAAKmX,EAAOiI,EAActC,GAEzC,CAqDO,MAAMsE,GAAa,CACtB,cAAehiB,GAAU7G,GACzB,iBAAkB6G,GAAUN,GAC5B,mBAAoBM,GAAU3G,GAC9B,aAAc2G,GAAU1G,GACxB,eAAgB0G,GAAUkX,GAC1B,mBAAoBlX,GAAUxG,GAC9B,YAAawG,GAAUvG,GACvB,gBAAiBuG,GAAUtG,GAC3B,cAAesG,GAAUrG,GACzB,eAAgBqG,GAAUyL,GAC1B,mBAAoBzL,GAAUnG,GAC9B,kBAAmBmG,GAAUlG,GAC7B,mBAAoBkG,GAAUjG,GAC9B,YAAaiG,GAAUhG,GACvB,YAAagG,GAAU/F,GACvB,cAAe+F,GAAU9F,GACzB,kBAAmB8F,GAAU7F,GAC7B,cAAe6F,GAAU5F,GACzB,UAAW4F,GAAU3F,GACrB,UAAW2F,GAAU1F,GACrB,UAAW0F,GAAUzF,GACrB,UAAWyF,GAAUxF,GACrB,UAAWwF,GAAUvF,GACrB,UAAWuF,GAAUtF,IAIZunB,GAAkB,CAE3BpxB,OAAUmP,GAAUkX,GACpBgL,MAASliB,GAAU7G,GAGnBgpB,WAAcd,IA7HlB,SAAoBtJ,EAAOiI,EAActC,GAErC,OAAc,OAAV3F,GAAkBA,EAAMtX,OAAS5G,GAKjCqnB,GAAWxD,EAAM3F,EAAMxlB,MAAOwlB,EAAMxlB,MAAMnB,OAAS,GAJ5C,EAQJ,CACX,IAoHI2wB,KAAQA,KACR1W,OAAUgW,IArFd,SAAgBtJ,EAAOiI,EAActC,GACjC,GAAc,OAAV3F,EACA,OAAO,EAGX,MAAM6J,EAAYnkB,GAAcsa,EAAMxlB,MAAO,GAE7C,OADiBqvB,IAAc7J,EAAMxlB,MAAMnB,QACzB6vB,GAAgBlJ,EAAMxlB,MAAOqvB,GAK3CV,GAAWxD,EAAM3F,EAAMxlB,MAAOqvB,GACvB,EAGJ,EARI,CASf,IAqEIQ,QAAWf,IAjEf,SAAiBtJ,EAAOiI,EAActC,GAElC,GAAc,OAAV3F,GAAkBA,EAAMtX,OAASgL,EACjC,OAAO,EAIX,IAAIrT,EAAmC,KAA/BxH,GAAWmnB,EAAMxlB,MAAO,IACO,KAA/B3B,GAAWmnB,EAAMxlB,MAAO,GAAgB,EAAI,EAGpD,KAAO6F,EAAI2f,EAAMxlB,MAAMnB,OAAQgH,IAC3B,IAAKyC,EAAQjK,GAAWmnB,EAAMxlB,MAAO6F,IACjC,OAAO,EAKf,OAAI8oB,GAAWxD,EAAM3F,EAAMxlB,MAAO6F,GACvB,EAGJ,CACX,IA6CI,eAlYJ,SAAqB2f,GACjB,GAAc,OAAVA,GAAkBA,EAAMtX,OAAStH,EACjC,OAAO,EAGX,MAAM5B,EAAOwgB,EAAMxlB,MAAMqF,cAGzB,OAAIopB,GAASzpB,EAAMsoB,KAKfgB,GAAMtpB,EAAM,WAJL,EAcJ,CACX,EA2WI,eAAgBmqB,GAChB,uBAtVJ,SAA4B3J,GAExB,OAAK2J,GAAY3J,GAKG,OAAhBA,EAAMxlB,MACC,EAGJ,EARI,CASf,EA2UI,YArUJ,SAAkBwlB,GACd,GAAc,OAAVA,GAAkBA,EAAMtX,OAASnH,EACjC,OAAO,EAGX,MAAMlI,EAAS2mB,EAAMxlB,MAAMnB,OAG3B,GAAe,IAAXA,GAA2B,IAAXA,GAA2B,IAAXA,GAA2B,IAAXA,EAChD,OAAO,EAGX,IAAK,IAAIgH,EAAI,EAAGA,EAAIhH,EAAQgH,IACxB,IAAK0C,EAAWlK,GAAWmnB,EAAMxlB,MAAO6F,IACpC,OAAO,EAIf,OAAO,CACX,EAmTI,cAjTJ,SAAoB2f,GAChB,OAAc,OAAVA,GAAkBA,EAAMtX,OAASnH,EAC1B,EAGNqC,GAAkB/K,GAAWmnB,EAAMxlB,MAAO,GAAI3B,GAAWmnB,EAAMxlB,MAAO,GAAI3B,GAAWmnB,EAAMxlB,MAAO,IAIhG,EAHI,CAIf,EAwSI,YFheW,SAAiBwlB,EAAOiI,GAEnC,IAAIxjB,EAAS,EAEb,IAAKub,EACD,OAAO,EAIX,GAAIA,EAAMtX,OAASgL,EACf,OAAOwU,GAAalI,EAAO,EAvFhB,MAuF+Bvb,GAQzC,GAAIub,EAAMtX,OAAStH,GAAS4e,EAAMxlB,MAAM3B,WAAW,KAAOouB,GAAa,CAExE,IAAKtiB,GAAQqb,EAAMxlB,MAAO,EAnGxB,KAoGE,OAAO,EAGX,OAAQwlB,EAAMxlB,MAAMnB,QAIhB,KAAK,EACD,OAAOgvB,GAASJ,IAAexjB,GAASA,EAAQwjB,GAGpD,KAAK,EACD,OAAIjI,EAAMxlB,MAAM3B,WAAW,KAAOouB,GACvB,GAGXxiB,EAASiF,GAAOue,IAAexjB,GAASA,EAAQwjB,GAGzCC,GAFPlI,EAAQiI,EAAaxjB,GAEM,EAAGujB,GAAevjB,IAGjD,QACI,OAAIub,EAAMxlB,MAAM3B,WAAW,KAAOouB,GACvB,EAGJiB,GAAalI,EAAO,EAAGgI,GAAevjB,GAEzD,MAOK,GAAIub,EAAMtX,OAAStH,GAAUoI,GAAQwW,EAAO+H,KAAaE,EAAaxjB,EAAS,GAAGiE,OAAStH,EAAQ,CAMpG,GAJI4e,EAAMtX,OAAStH,IACf4e,EAAQiI,IAAexjB,IAGb,OAAVub,IAAmBrb,GAAQqb,EAAMxlB,MAAO,EA9I1C,KA+IE,OAAO,EAGX,OAAQwlB,EAAMxlB,MAAMnB,QAIhB,KAAK,EACD,OAAOgvB,GAASJ,IAAexjB,GAASA,EAAQwjB,GAGpD,KAAK,EACD,OAAIjI,EAAMxlB,MAAM3B,WAAW,KAAOouB,GACvB,GAGXxiB,EAASiF,GAAOue,IAAexjB,GAASA,EAAQwjB,GAGzCC,GAFPlI,EAAQiI,EAAaxjB,GAEM,EAAGujB,GAAevjB,IAGjD,QACI,OAAIub,EAAMxlB,MAAM3B,WAAW,KAAOouB,GACvB,EAGJiB,GAAalI,EAAO,EAAGgI,GAAevjB,GAEzD,MAOK,GAAIub,EAAMtX,OAAS3G,EAAW,CAC/B,IAAI/I,EAAOgnB,EAAMxlB,MAAM3B,WAAW,GAC9B8M,EAAO3M,IAAS+uB,IAAY/uB,IAASiuB,GAAc,EAAI,EACvD5mB,EAAIsF,EAER,KAAOtF,EAAI2f,EAAMxlB,MAAMnB,QACdyJ,EAAQkd,EAAMxlB,MAAM3B,WAAWwH,IADTA,KAM/B,OAAIA,IAAMsF,EAEC,EAGNhB,GAAQqb,EAAMxlB,MAAO6F,EAnMxB,KA0MEA,EAAI,IAAM2f,EAAMxlB,MAAMnB,OACfgvB,GAASJ,IAAexjB,GAASA,EAAQwjB,GAE5CjI,EAAMxlB,MAAM3B,WAAWwH,EAAI,KAAO4mB,GAC3B,EAIP5mB,EAAI,IAAM2f,EAAMxlB,MAAMnB,QACtBoL,EAASiF,GAAOue,IAAexjB,GAASA,EAAQwjB,GAGzCC,GAFPlI,EAAQiI,EAAaxjB,GAEM,EAAGujB,GAAevjB,IAItCyjB,GAAalI,EAAO3f,EAAI,EAAG2nB,GAAevjB,GAtB9C,CAyBf,CAEA,OAAO,CACX,EEgVI6lB,OD7eW,SAAgBtK,EAAOiI,GAClC,IAAI5uB,EAAS,EAGb,GAAc,OAAV2mB,GAAkBA,EAAMtX,OAAStH,IAAUuD,GAAQqb,EAAMxlB,MAAO,EAxE9D,KAyEF,OAAO,EAIX,GAAc,QADdwlB,EAAQiI,IAAe5uB,IAEnB,OAAO,EAKX,GAAImQ,GAAQwW,EAtFC,IAwFT,OAAc,QADdA,EAAQiI,IAAe5uB,IAEZ,EAGP2mB,EAAMtX,OAAStH,EAERunB,GAAyBH,GAAYxI,EAAO,GAAG,KAAS3mB,EAAQ4uB,GAGvEze,GAAQwW,EAAOuI,IAERI,GAAyB,IAAKtvB,EAAQ4uB,GAI1C,EAMX,GAAIjI,EAAMtX,OAASgL,EAAa,CAC5B,MAAM6W,EAAoB/B,GAAYxI,EAAO,GAAG,GAChD,OAA0B,IAAtBuK,EACO,EAIG,QADdvK,EAAQiI,IAAe5uB,IAGZA,EAGP2mB,EAAMtX,OAAS3G,GAAaie,EAAMtX,OAASgL,EAhHvD,SAAoBsM,EAAOhnB,GACvB,OAAOgnB,EAAMxlB,MAAM3B,WAAW,KAAOG,CACzC,CAiHiBwxB,CAAWxK,EAAOiH,KAAiBuB,GAAYxI,EAAO,GAAG,GAIvD3mB,EAAS,EAHL,EAORsvB,GAAyB4B,EAAmBlxB,EAAQ4uB,EAC/D,CAGA,OAAIjI,EAAMtX,OAAS3G,EACR4mB,GAAyBH,GAAYxI,EAAO,GAAG,KAAS3mB,EAAQ4uB,GAGpE,CACX,ECwaI,oBAtSJ,SAA0BjI,EAAOiI,GAC7B,IAAKjI,EACD,OAAO,EAGX,IAAIxX,EAAmB,EACnB+gB,EAAe,GACflwB,EAAS,EAIbmwB,EACA,EAAG,CACC,OAAQxJ,EAAMtX,MAEV,KAAKjH,EACL,KAAKE,EACD,MAAM6nB,EAGV,KAAK7mB,EACL,KAAKF,EACL,KAAKF,EACD,GAAIyd,EAAMtX,OAASF,EACf,MAAMghB,EAGVhhB,EAAmB+gB,EAAa5b,MAChC,MAGJ,KAAKvL,EACD,GAAyB,IAArBoG,EACA,MAAMghB,EAGV,MAGJ,KAAK5nB,EACD,GAAyB,IAArB4G,GAA0C,MAAhBwX,EAAMxlB,MAChC,MAAMgvB,EAGV,MAEJ,KAAK7hB,EACL,KAAKnF,EACL,KAAKF,EACL,KAAKI,EACD6mB,EAAahwB,KAAKiP,GAClBA,EAAmBf,GAAYmB,IAAIoX,EAAMtX,MAIjDrP,GACJ,OAAS2mB,EAAQiI,EAAa5uB,IAE9B,OAAOA,CACX,EA4OI,YAtOJ,SAAkB2mB,EAAOiI,GACrB,IAAKjI,EACD,OAAO,EAGX,IAAIxX,EAAmB,EACnB+gB,EAAe,GACflwB,EAAS,EAIbmwB,EACA,EAAG,CACC,OAAQxJ,EAAMtX,MAEV,KAAKjH,EACL,KAAKE,EACD,MAAM6nB,EAGV,KAAK7mB,EACL,KAAKF,EACL,KAAKF,EACD,GAAIyd,EAAMtX,OAASF,EACf,MAAMghB,EAGVhhB,EAAmB+gB,EAAa5b,MAChC,MAEJ,KAAKhG,EACL,KAAKnF,EACL,KAAKF,EACL,KAAKI,EACD6mB,EAAahwB,KAAKiP,GAClBA,EAAmBf,GAAYmB,IAAIoX,EAAMtX,MAIjDrP,GACJ,OAAS2mB,EAAQiI,EAAa5uB,IAE9B,OAAOA,CACX,GA0MO,SAASoxB,GAAqBC,GACjC,MAAMC,MACFA,EAAKC,QACLA,EAAOC,UACPA,EAASC,KACTA,EAAIzxB,OACJA,EAAM0xB,WACNA,EAAUC,UACVA,EAASC,KACTA,GACAP,GAAS,CAAA,EAEb,MAAO,CACHd,UAAaN,GAAKM,GAAU,OAC5Be,MAASrB,GAAKM,GAAUe,IACxBC,QAAWtB,GAAKM,GAAUgB,IAC1BC,UAAavB,GAAKM,GAAUiB,IAC5BC,KAAQxB,GAAKM,GAAUkB,IACvBzxB,OAAUiwB,GAAKU,GAAKJ,GAAUvwB,KAC9B0xB,WAAczB,GAAKM,GAAUmB,IAC7BC,UAAa1B,GAAKM,GAAUoB,IAC5BC,KAAQ3B,GAAKM,GAAUqB,IAE/B,4CCjlBqB,CAAC,MAAO,OAAQ,MAAO,gBAKrB,CAAC,WADJ,CAAC,gBAFI,CAAC,KAAM,cAtBV,CAElB,KAAM,KAAM,IAAK,KAAM,KAAM,KAAM,KAEnC,KAAM,MACN,KAAM,MACN,MAAO,OACP,KAAM,MACN,KAAM,MACN,KAAM,MAEN,KAAM,MAAO,MAAO,MACpB,KAAM,MAAO,MAAO,MACpB,KAAM,MAAO,MAAO,MACpB,KAAM,MAAO,MAAO,MACpB,OAAQ,QAAS,QAAS,QAC1B,OAAQ,QAAS,QAAS,QAE1B,MAAO,MAAO,MAAO,MAAO,QAAS,oBAKf,CAAC,MAAO,OAAQ,OAAQ,eAGzB,CAAC,WALN,CAAC,IAAK,QCnBnB,SAAS5c,GAAYrT,EAASkc,EAAOzS,GACxC,OAAOtH,OAAOoR,OAAOJ,GAAkB,cAAenT,GAAU,CAC5Dkc,QACAzS,SACAqiB,WAAY9rB,EACZA,QAASA,SACEkc,EADFlc,OAEE,IAAIiJ,OAAOQ,GAAUyS,EAAM7d,QAAU,GAAGoG,KAAK,KAAO,KAEvE,CCHO,MAAMyrB,GACTxqB,WAAAA,CAAYwS,GACRhM,KAAKgM,IAAMA,EACXhM,KAAKqC,IAAM,CACf,CACA1Q,UAAAA,CAAW0Q,GACP,OAAOA,EAAMrC,KAAKgM,IAAI7Z,OAAS6N,KAAKgM,IAAIra,WAAW0Q,GAAO,CAC9D,CACA0J,QAAAA,GACI,OAAO/L,KAAKrO,WAAWqO,KAAKqC,IAChC,CACAiW,YAAAA,GACI,OAAOtY,KAAKrO,WAAWqO,KAAKqC,IAAM,EACtC,CACA4hB,aAAAA,CAAc5hB,GACV,OAAOrC,KAAKrO,WAAWqO,KAAKkkB,UAAU7hB,GAC1C,CACA6hB,SAAAA,CAAU7hB,GACN,KAAOA,EAAMrC,KAAKgM,IAAI7Z,OAAQkQ,IAAO,CACjC,MAAMvQ,EAAOkO,KAAKgM,IAAIra,WAAW0Q,GACjC,GAvBF,KAuBMvQ,GAzBN,KAyBoBA,GAxBpB,KAwBkCA,GAtB9B,KAsB4CA,GA1B9C,IA0BgEA,EAC5D,KAER,CAEA,OAAOuQ,CACX,CACA8hB,cAAAA,CAAermB,GACX,OAAOkC,KAAKgM,IAAIjY,UAAUiM,KAAKqC,IAAKrC,KAAKqC,IAAMvE,EACnD,CACAoO,GAAAA,CAAIpa,GACIkO,KAAK+L,aAAeja,GACpBkO,KAAKnM,MAAM,WAAayG,OAAOqS,aAAa7a,GAAQ,KAGxDkO,KAAKqC,KACT,CACA+hB,IAAAA,GACI,OAAOpkB,KAAKqC,IAAMrC,KAAKgM,IAAI7Z,OAAS6N,KAAKgM,IAAIqC,OAAOrO,KAAKqC,OAAS,EACtE,CACAxO,KAAAA,CAAMC,GACF,MAAM,IAAIqT,GAAYrT,EAASkM,KAAKgM,IAAKhM,KAAKqC,IAClD,EChDJ,MAAMgiB,GAAM,EACNC,GAAI,GACJC,GAAI,GACJC,GAAI,GACJC,GAAQ,GACRxb,GAAkB,GAClBC,GAAa,GACbwb,GAAY,GACZC,GAAa,GACbC,GAAkB,GAClBC,GAAmB,GACnBC,GAAW,GACXjE,GAAW,GACXkE,GAAQ,GACRC,GAAa,GACbC,GAAe,GACfC,GAAkB,GAClB7D,GAAe,GACf8D,GAAe,GACfC,GAAoB,GACpBC,GAAqB,GACrBjc,GAAmB,IACnBkc,GAAe,IACfC,GAAoB,IACpBC,GAAW,KACXC,GAAY,IAAIC,WAAW,KAAKrtB,KAAI,CAACstB,EAAG7jB,IAC1C,gBAAgBpM,KAAK4E,OAAOqS,aAAa7K,IAAQ,EAAI,IAEnD8jB,GAAwB,CAC1B,IAAK,EACL,KAAM,EACN,KAAM,EACN,IAAK,GAGT,SAASC,GAAWC,GAChB,OAAOA,EAAU3B,eACb2B,EAAU5B,UAAU4B,EAAUzjB,KAEtC,CAEA,SAAS0jB,GAASD,GACd,IAAIhoB,EAAMgoB,EAAUzjB,IAEpB,KAAOvE,EAAMgoB,EAAU9Z,IAAI7Z,OAAQ2L,IAAO,CACtC,MAAMhM,EAAOg0B,EAAU9Z,IAAIra,WAAWmM,GACtC,GAAIhM,GAAQ,KAA2B,IAApB2zB,GAAU3zB,GACzB,KAER,CAMA,OAJIg0B,EAAUzjB,MAAQvE,GAClBgoB,EAAUjyB,MAAM,oBAGbiyB,EAAU3B,eAAermB,EACpC,CAEA,SAASkoB,GAAWF,GAChB,IAAIhoB,EAAMgoB,EAAUzjB,IAEpB,KAAOvE,EAAMgoB,EAAU9Z,IAAI7Z,OAAQ2L,IAAO,CACtC,MAAMhM,EAAOg0B,EAAU9Z,IAAIra,WAAWmM,GACtC,GAAIhM,EAAO,IAAMA,EAAO,GACpB,KAER,CAMA,OAJIg0B,EAAUzjB,MAAQvE,GAClBgoB,EAAUjyB,MAAM,mBAGbiyB,EAAU3B,eAAermB,EACpC,CAEA,SAASmoB,GAAWH,GAChB,MAAMhoB,EAAMgoB,EAAU9Z,IAAInT,QAAQ,IAAMitB,EAAUzjB,IAAM,GAOxD,OALa,IAATvE,IACAgoB,EAAUzjB,IAAMyjB,EAAU9Z,IAAI7Z,OAC9B2zB,EAAUjyB,MAAM,yBAGbiyB,EAAU3B,eAAermB,EAAM,EAC1C,CAEA,SAASooB,GAAoBJ,GACzB,IAAIxnB,EAAM,KACNc,EAAM,KAiBV,OAfA0mB,EAAU5Z,IAAI9C,IAEd9K,EAAM0nB,GAAWF,GAEbA,EAAU/Z,aAAegZ,IACzBe,EAAUzjB,MACNyjB,EAAU/Z,aAAewZ,KACzBnmB,EAAM4mB,GAAWF,KAGrB1mB,EAAMd,EAGVwnB,EAAU5Z,IAAIqZ,IAEP,CACHjnB,IAAK3D,OAAO2D,GACZc,IAAKA,EAAMzE,OAAOyE,GAAO,EAEjC,CAgFA,SAAS+mB,GAAgBL,EAAWvb,GAChC,MAAM+T,EA/EV,SAAwBwH,GACpB,IAAIM,EAAQ,KACR7H,GAAQ,EAEZ,OAAQuH,EAAU/Z,YACd,KAAK+Y,GACDgB,EAAUzjB,MAEV+jB,EAAQ,CACJ9nB,IAAK,EACLc,IAAK,GAGT,MAEJ,KAAKyhB,GACDiF,EAAUzjB,MAEV+jB,EAAQ,CACJ9nB,IAAK,EACLc,IAAK,GAGT,MAEJ,KAAKiiB,GACDyE,EAAUzjB,MAEV+jB,EAAQ,CACJ9nB,IAAK,EACLc,IAAK,GAGT,MAEJ,KAAK8J,GACD4c,EAAUzjB,MAEVkc,GAAQ,EAEJuH,EAAU/Z,aAAe3C,GACzBgd,EAAQF,GAAoBJ,GACrBA,EAAU/Z,aAAesV,IAKhCyE,EAAUzjB,MACV+jB,EAAQ,CACJ9nB,IAAK,EACLc,IAAK,IAGTgnB,EAAQ,CACJ9nB,IAAK,EACLc,IAAK,GAIb,MAEJ,KAAKgK,GACDgd,EAAQF,GAAoBJ,GAC5B,MAEJ,QACI,OAAO,KAGf,MAAO,CACHtkB,KAAM,aACN+c,QACAjgB,IAAK8nB,EAAM9nB,IACXc,IAAKgnB,EAAMhnB,IACX8e,KAAM,KAEd,CAGuBmI,CAAeP,GAElC,OAAmB,OAAfxH,GACAA,EAAWJ,KAAO3T,EAWdub,EAAU/Z,aAAe7C,IACzB4c,EAAUn0B,WAAWm0B,EAAUzjB,IAAM,KAAOwe,GACrCsF,GAAgBL,EAAWxH,GAG/BA,GAGJ/T,CACX,CAEA,SAAS+b,GAAWR,GAChB,MAAMS,EAAKT,EAAU1B,OAErB,MAAW,KAAPmC,EACO,KAGJ,CACH/kB,KAAM,QACNlO,MAAOizB,EAEf,CA+EA,SAASC,GAASV,GACd,IAAIxtB,EACAmmB,EAAO,KAkBX,OAhBAqH,EAAU5Z,IAAI+Y,IACd3sB,EAAOytB,GAASD,GAEZA,EAAU/Z,aAAe6Y,IACzBkB,EAAUxN,iBAAmBuM,KAC7BiB,EAAUzjB,KAAO,EACjB/J,GAAQ,MAGRwtB,EAAUn0B,WAAWm0B,EAAU5B,UAAU4B,EAAUzjB,QAAU+iB,KAC7DS,GAAWC,GACXrH,EApER,SAAuBqH,GAEnB,IAAIxnB,EAAM,KACNc,EAAM,KACNX,EAAO,EA0CX,OAxCAqnB,EAAU5Z,IAAIkZ,IAEVU,EAAU/Z,aAAeiZ,KACzBc,EAAU1B,OACV3lB,GAAQ,IAGC,GAATA,GAAcqnB,EAAU/Z,aAAeyZ,GACvCM,EAAU1B,QAEV9lB,EAAMG,EAAO9D,OAAOqrB,GAAWF,IAES,IAApCL,GAAUK,EAAU/Z,cACpBzN,GAAOynB,GAASD,KAIxBD,GAAWC,GACXA,EAAU5Z,IAAI6Y,IACdc,GAAWC,GAEPA,EAAU/Z,aAAeyZ,GACzBM,EAAU1B,QAEV3lB,EAAO,EAEHqnB,EAAU/Z,aAAeiZ,KACzBc,EAAU1B,OACV3lB,GAAQ,GAGZW,EAAMX,EAAO9D,OAAOqrB,GAAWF,IAES,IAApCL,GAAUK,EAAU/Z,cACpB3M,GAAO2mB,GAASD,KAIxBA,EAAU5Z,IAAImZ,IAEP,CACH7jB,KAAM,QACNlD,MACAc,MAER,CAiBeqnB,CAAcX,IAGzBA,EAAU5Z,IAAIgZ,IAEPiB,GAAgBL,EAAW,CAC9BtkB,KAAM,OACNlJ,OACAmmB,QAER,CAoBA,SAASiI,GAAazI,EAAO0I,GACzB,SAASC,EAAY3I,EAAOD,GACxB,MAAO,CACHxc,KAAM,QACNyc,QACAD,aACAK,eAAe,EACfF,UAAU,EAElB,CAEA,IAAIH,EAKJ,IAHA2I,EAAc1wB,OAAOwT,KAAKkd,GACrBxS,MAAK,CAACpb,EAAG8tB,IAAMjB,GAAsB7sB,GAAK6sB,GAAsBiB,KAE9DF,EAAYx0B,OAAS,GAAG,CAC3B6rB,EAAa2I,EAAY3yB,QAEzB,IAAImF,EAAI,EACJ2tB,EAAgB,EAEpB,KAAO3tB,EAAI8kB,EAAM9rB,OAAQgH,IAAK,CAC1B,MAAM+kB,EAAOD,EAAM9kB,GAED,eAAd+kB,EAAK1c,OACD0c,EAAK5qB,QAAU0qB,IACQ,IAAnB8I,IACAA,EAAgB3tB,EAAI,GAExB8kB,EAAMlO,OAAO5W,EAAG,GAChBA,OAEuB,IAAnB2tB,GAAwB3tB,EAAI2tB,EAAgB,IAC5C7I,EAAMlO,OACF+W,EACA3tB,EAAI2tB,EACJF,EAAY3I,EAAM9lB,MAAM2uB,EAAe3tB,GAAI6kB,IAE/C7kB,EAAI2tB,EAAgB,GAExBA,GAAiB,GAG7B,EAEuB,IAAnBA,GAAwBH,EAAYx0B,QACpC8rB,EAAMlO,OACF+W,EACA3tB,EAAI2tB,EACJF,EAAY3I,EAAM9lB,MAAM2uB,EAAe3tB,GAAI6kB,GAGvD,CAEA,OAAOA,CACX,CAEA,SAAS+I,GAAkBjB,GACvB,MAAM7H,EAAQ,GACR0I,EAAc,CAAA,EACpB,IAAI7N,EACAkO,EAAY,KACZC,EAAenB,EAAUzjB,IAE7B,KAAOyW,EAAQsL,GAAK0B,IACG,WAAfhN,EAAMtX,OACa,eAAfsX,EAAMtX,MAEY,OAAdwlB,GAAyC,eAAnBA,EAAUxlB,OAChCskB,EAAUzjB,IAAM4kB,EAChBnB,EAAUjyB,MAAM,0BAGpB8yB,EAAY7N,EAAMxlB,QAAS,GACN,OAAd0zB,GAAyC,eAAnBA,EAAUxlB,OACvCmlB,EAAY,MAAO,EACnB1I,EAAM5rB,KAAK,CACPmP,KAAM,aACNlO,MAAO,OAIf2qB,EAAM5rB,KAAKymB,GACXkO,EAAYlO,EACZmO,EAAenB,EAAUzjB,KAUjC,OALkB,OAAd2kB,GAAyC,eAAnBA,EAAUxlB,OAChCskB,EAAUzjB,KAAO4kB,EACjBnB,EAAUjyB,MAAM,0BAGb,CACH2N,KAAM,QACNyc,QACAD,WAAY0I,GAAazI,EAAO0I,IAAgB,IAChDtI,eAAe,EACfF,UAAU,EAElB,CAmBA,SAASiG,GAAK0B,GACV,IAAIh0B,EAAOg0B,EAAU/Z,WAErB,GAAIja,EAAO,KAA2B,IAApB2zB,GAAU3zB,GACxB,OA/IR,SAA+Bg0B,GAC3B,MAAMxtB,EAAOytB,GAASD,GAEtB,OAAIA,EAAU/Z,aAAe6Y,IACzBkB,EAAUzjB,MAEH,CACHb,KAAM,WACNlJ,SAID6tB,GAAgBL,EAAW,CAC9BtkB,KAAM,UACNlJ,QAER,CA+He4uB,CAAsBpB,GAGjC,OAAQh0B,GACJ,KAAKuzB,GAED,MAEJ,KAAKD,GACD,OAAOe,GAAgBL,EA9BnC,SAAmBA,GACf,IAAI1yB,EAaJ,OAXA0yB,EAAU5Z,IAAIkZ,IACdhyB,EAAS2zB,GAAkBjB,GAC3BA,EAAU5Z,IAAImZ,IAEdjyB,EAAO+qB,UAAW,EAEd2H,EAAU/Z,aAAe9C,KACzB6c,EAAUzjB,MACVjP,EAAOirB,eAAgB,GAGpBjrB,CACX,CAe8C+zB,CAAUrB,IAEhD,KAAKb,GACD,OAAOa,EAAUxN,iBAAmBqM,GAnQhD,SAAsBmB,GAClB,IAAIxtB,EAUJ,OARAwtB,EAAU5Z,IAAI+Y,IACda,EAAU5Z,IAAIyY,IAEdrsB,EAAOytB,GAASD,GAEhBA,EAAU5Z,IAAIyY,IACdmB,EAAU5Z,IAAIgZ,IAEPiB,GAAgBL,EAAW,CAC9BtkB,KAAM,WACNlJ,QAER,CAqPkB8uB,CAAatB,GACbU,GAASV,GAEnB,KAAKR,GACD,MAAO,CACH9jB,KAAM,aACNlO,MAAOwyB,EAAU3B,eACb2B,EAAUzjB,KAAOyjB,EAAUxN,iBAAmBgN,GAAe,EAAI,KAI7E,KAAKZ,GAID,OAHAoB,EAAUzjB,MACVyjB,EAAU5Z,IAAIwY,IAEP,CACHljB,KAAM,aACNlO,MAAO,MAGf,KAAKyxB,GAED,OADAe,EAAUzjB,MACH,CACHb,KAAM,SAGd,KAAKmjB,GACD,OAAOwB,GAAgBL,EAAW,CAC9BtkB,KAAM,SACNlO,MAAO2yB,GAAWH,KAG1B,KAAKrB,GACL,KAAKJ,GACL,KAAKC,GACL,KAAKE,GACL,KAAKD,GACD,MAAO,CACH/iB,KAAM,SACNlO,MAAOuyB,GAAWC,IAG1B,KAAKX,GAGD,OAFArzB,EAAOg0B,EAAUxN,eAEbxmB,EAAO,KAA2B,IAApB2zB,GAAU3zB,IACxBg0B,EAAUzjB,MACH,CACHb,KAAM,YACNlJ,KAAMytB,GAASD,KAIhBQ,GAAWR,GAEtB,KAAKhB,GACL,KAAKjE,GACL,KAAKQ,GACL,KAAKnY,GACL,KAAKD,GAED,MAEJ,KAAKG,GAKD,GAFAtX,EAAOg0B,EAAUxN,eAEbxmB,EAAO,IAAMA,EAAO,GACpB,OAAOw0B,GAAWR,GAGtB,MAEJ,QACI,OAAOQ,GAAWR,GAE9B,CAEO,SAASpc,GAAMpM,GAClB,MAAMwoB,EAAY,IAAI9B,GAAU1mB,GAC1BlK,EAAS2zB,GAAkBjB,GAOjC,OALIA,EAAUzjB,MAAQ/E,EAAOnL,QACzB2zB,EAAUjyB,MAAM,oBAIQ,IAAxBT,EAAO6qB,MAAM9rB,QAAyC,UAAzBiB,EAAO6qB,MAAM,GAAGzc,KACtCpO,EAAO6qB,MAAM,GAGjB7qB,CACX,CCvkBA,MAAM+mB,GAAO,WAAW,EAExB,SAASC,GAAe9mB,GACpB,MAAwB,mBAAVA,EAAuBA,EAAQ6mB,EACjD,CCFA,MAAMkN,GAAc,CAChBhO,SAAAA,CAAUH,GACN,MAAM/V,EAAS,GACf,IAAImkB,EAAU,KAEd,MAAO,IACApO,EACH3O,IAAAA,CAAKA,GACD,MAAMgd,EAAMD,EACZA,EAAU/c,EACV2O,EAAS3O,KAAKnS,KAAK4H,KAAMuK,GACzB+c,EAAUC,CACb,EACDhP,IAAAA,CAAKjlB,EAAOkO,EAAMsY,GACd3W,EAAO9Q,KAAK,CACRmP,OACAlO,QACAiX,KAAMuP,EAAO,KAAOwN,GAE3B,EACDl0B,OAAMA,IACK+P,EAGnB,GAiBW,SAAAqkB,GAASl0B,EAAO8rB,GAC3B,MAAqB,iBAAV9rB,EAff,SAAwB0Y,GACpB,MAAM7I,EAAS,GAUf,OARAxC,GAASqL,GAAK,CAACxK,EAAM3D,EAAOC,IACxBqF,EAAO9Q,KAAK,CACRmP,OACAlO,MAAO0Y,EAAI7T,MAAM0F,EAAOC,GACxByM,KAAM,SAIPpH,CACX,CAIeskB,CAAen0B,GAGnB8rB,EAAOnG,SAAS3lB,EAAO+zB,GAClC,CC/CO,MAAMK,GAAQ,CAAElmB,KAAM,SAChBmmB,GAAW,CAAEnmB,KAAM,YACnBomB,GAAiB,CAAEpmB,KAAM,iBAEhCojB,GAAkB,GAClBC,GAAmB,GAEzB,SAASgD,GAAgBxf,EAAOyf,EAAYC,GAExC,OAAID,IAAeJ,IAASK,IAAeJ,IAIvCtf,IAAUqf,IAASI,IAAeJ,IAASK,IAAeL,GAHnDrf,GAOQ,OAAfA,EAAM7G,MAAiB6G,EAAM2f,OAASL,IAAYG,IAAeJ,KACjEI,EAAazf,EAAM5T,KACnB4T,EAAQA,EAAMA,OAGX,CACH7G,KAAM,KACN6G,QACA5T,KAAMqzB,EACNE,KAAMD,GAEd,CAEA,SAASE,GAAe3vB,GACpB,OACIA,EAAKnG,OAAS,GACdmG,EAAK3G,WAAW2G,EAAKnG,OAAS,KAAOyyB,IACrCtsB,EAAK3G,WAAW2G,EAAKnG,OAAS,KAAO0yB,EAE7C,CAEA,SAASqD,GAAgBhK,GACrB,MACkB,YAAdA,EAAK1c,MACS,cAAd0c,EAAK1c,MACS,aAAd0c,EAAK1c,MACS,SAAd0c,EAAK1c,MAAmBymB,GAAe/J,EAAK5lB,KAEpD,CAEA,SAAS6vB,GAAqBnK,EAAYC,EAAOmK,GAC7C,OAAQpK,GACJ,IAAK,IAAK,CAYN,IAAI5qB,EAASs0B,GAEb,IAAK,IAAIvuB,EAAI8kB,EAAM9rB,OAAS,EAAGgH,GAAK,EAAGA,IAAK,CAGxC/F,EAASy0B,GAFI5J,EAAM9kB,GAIf/F,EACAu0B,GAER,CAEA,OAAOv0B,CACX,CAEA,IAAK,IAAK,CAaN,IAAIA,EAASu0B,GACTtvB,EAAM,KAEV,IAAK,IAAIc,EAAI8kB,EAAM9rB,OAAS,EAAGgH,GAAK,EAAGA,IAAK,CACxC,IAAI+kB,EAAOD,EAAM9kB,GAGjB,GAAI+uB,GAAgBhK,KACJ,OAAR7lB,GAAgBc,EAAI,GAAK+uB,GAAgBjK,EAAM9kB,EAAI,MACnDd,EAAMpC,OAAOiR,OAAO,MACpB9T,EAASy0B,GACL,CACIrmB,KAAM,OACNnJ,OAEJqvB,GACAt0B,IAII,OAARiF,GAAc,CACd,MAAMnF,GAAO+0B,GAAe/J,EAAK5lB,MAAQ4lB,EAAK5lB,KAAKH,MAAM,GAAI,GAAK+lB,EAAK5lB,MAAMK,cAC7E,GAAIzF,KAAOmF,IAAQ,EAAO,CACtBA,EAAInF,GAAOgrB,EACX,QACJ,CACJ,CAGJ7lB,EAAM,KAGNjF,EAASy0B,GACL3J,EACAwJ,GACAt0B,EAER,CAEA,OAAOA,CACX,CAEA,IAAK,KAAM,CAMP,GAAI6qB,EAAM9rB,OAAS,EACf,MAAO,CACHqP,KAAM,YACNyc,QACAoK,KAAK,GA2Bb,IAAIj1B,EAASu0B,GAEb,IAAK,IAAIxuB,EAAI8kB,EAAM9rB,OAAS,EAAGgH,GAAK,EAAGA,IAAK,CACxC,MAAM+kB,EAAOD,EAAM9kB,GACnB,IAAImvB,EAGAA,EADArK,EAAM9rB,OAAS,EACFg2B,GACTnK,EACAC,EAAMpY,QAAO,SAAS0iB,GAClB,OAAOA,IAAiBrK,MAE5B,GAGSwJ,GAGjBt0B,EAASy0B,GACL3J,EACAoK,EACAl1B,EAER,CAEA,OAAOA,CACX,CAEA,IAAK,KAAM,CAMP,GAAI6qB,EAAM9rB,OAAS,EACf,MAAO,CACHqP,KAAM,YACNyc,QACAoK,KAAK,GA2Bb,IAAIj1B,EAASg1B,EAAwBV,GAAQC,GAE7C,IAAK,IAAIxuB,EAAI8kB,EAAM9rB,OAAS,EAAGgH,GAAK,EAAGA,IAAK,CACxC,MAAM+kB,EAAOD,EAAM9kB,GACnB,IAAImvB,EAGAA,EADArK,EAAM9rB,OAAS,EACFg2B,GACTnK,EACAC,EAAMpY,QAAO,SAAS0iB,GAClB,OAAOA,IAAiBrK,MAE5B,GAGSwJ,GAGjBt0B,EAASy0B,GACL3J,EACAoK,EACAl1B,EAER,CAEA,OAAOA,CACX,EAER,CAuFA,SAASo1B,GAAwBje,GAC7B,GAAoB,mBAATA,EACP,MAAO,CACH/I,KAAM,UACNwB,GAAIuH,GAIZ,OAAQA,EAAK/I,MACT,IAAK,QAAS,CACV,IAAIpO,EAAS+0B,GACT5d,EAAKyT,WACLzT,EAAK0T,MAAM5lB,IAAImwB,KACf,GAWJ,OARIje,EAAK8T,gBACLjrB,EAASy0B,GACLz0B,EACAw0B,GACAD,KAIDv0B,CACX,CAEA,IAAK,aACD,OAjHZ,SAAmCmX,GAC/B,IAAInX,EAASs0B,GACTe,EAAYD,GAAwBje,EAAK2T,MAE7C,GAAiB,IAAb3T,EAAKnL,IAELqpB,EAAYZ,GACRY,EACAb,GACAD,IAKJv0B,EAASy0B,GACLY,EACA,KACAd,IAGJv0B,EAAOqB,KAAOozB,GACVH,GACAA,GACAt0B,GAGAmX,EAAKgU,QACLnrB,EAAOqB,KAAKuzB,KAAOH,GACf,CAAErmB,KAAM,QAAS4d,OAAQ7U,GACzBnX,EACAu0B,UAKR,IAAK,IAAIxuB,EAAIoR,EAAKjM,KAAO,EAAGnF,GAAKoR,EAAKnL,IAAKjG,IACnCoR,EAAKgU,OAASnrB,IAAWs0B,KACzBt0B,EAASy0B,GACL,CAAErmB,KAAM,QAAS4d,OAAQ7U,GACzBnX,EACAu0B,KAIRv0B,EAASy0B,GACLY,EACAZ,GACIH,GACAA,GACAt0B,GAEJu0B,IAKZ,GAAiB,IAAbpd,EAAKjM,IAELlL,EAASy0B,GACLH,GACAA,GACAt0B,QAIJ,IAAK,IAAI+F,EAAI,EAAGA,EAAIoR,EAAKjM,IAAM,EAAGnF,IAC1BoR,EAAKgU,OAASnrB,IAAWs0B,KACzBt0B,EAASy0B,GACL,CAAErmB,KAAM,QAAS4d,OAAQ7U,GACzBnX,EACAu0B,KAIRv0B,EAASy0B,GACLY,EACAr1B,EACAu0B,IAKZ,OAAOv0B,CACX,CA8BmBs1B,CAA0Bne,GAErC,IAAK,OACL,IAAK,WACD,MAAO,CACH/I,KAAM+I,EAAK/I,KACXlJ,KAAMiS,EAAKjS,KACX8mB,OAAQ7U,GAGhB,IAAK,UACD,MAAO,CACH/I,KAAM+I,EAAK/I,KACXlJ,KAAMiS,EAAKjS,KAAKK,cAChBymB,OAAQ7U,GAGhB,IAAK,YACD,MAAO,CACH/I,KAAM+I,EAAK/I,KACXlJ,KAAM,IAAMiS,EAAKjS,KAAKK,cACtBymB,OAAQ7U,GAGhB,IAAK,WACD,MAAO,CACH/I,KAAM+I,EAAK/I,KACXlJ,KAAMiS,EAAKjS,KAAKK,cAAgB,IAChCymB,OAAQ7U,GAGhB,IAAK,SAED,OAA0B,IAAtBA,EAAKjX,MAAMnB,OACJ,CACHqP,KAAM,QACNlO,MAAOiX,EAAKjX,MAAM+a,OAAO,GACzB+Q,OAAQ7U,GAKT,CACH/I,KAAM+I,EAAK/I,KACXlO,MAAOiX,EAAKjX,MAAM8U,OAAO,EAAGmC,EAAKjX,MAAMnB,OAAS,GAAG2U,QAAQ,OAAQ,KACnEsY,OAAQ7U,GAGhB,IAAK,QACD,MAAO,CACH/I,KAAM+I,EAAK/I,KACXlO,MAAOiX,EAAKjX,MACZ8rB,OAAQ7U,GAGhB,IAAK,QACD,MAAO,CACH/I,KAAM+I,EAAK/I,KACX4d,OAAQ7U,GAGhB,QACI,MAAM,IAAIzS,MAAM,qBAAsByS,EAAK/I,MAEvD,CAEO,SAASmnB,GAAgBC,EAAYpN,GAKxC,MAJ0B,iBAAfoN,IACPA,EAAalf,GAAMkf,IAGhB,CACHpnB,KAAM,aACN6G,MAAOmgB,GAAwBI,GAC/BxJ,OAAQ5D,GAAO,KACfle,OAAQsrB,EAEhB,CCpcA,MAAQtvB,eAAAA,IAAmBrD,OAAOoB,UAC5BwxB,GAAO,EACPC,GAAQ,EACRC,GAAc,EACdC,GAAe,EAEfC,GAAoB,QACpBC,GAAuB,WACvBC,GAA8B,wGAE9BC,GAAkB,KAkBxB,SAASC,GAA+B3rB,EAASK,GAC7C,GAAIL,EAAQvL,SAAW4L,EAAa5L,OAChC,OAAO,EAGX,IAAK,IAAIgH,EAAI,EAAGA,EAAIuE,EAAQvL,OAAQgH,IAAK,CACrC,MAAMwE,EAAgBI,EAAapM,WAAWwH,GAC9C,IAAI6E,EAAWN,EAAQ/L,WAAWwH,GAOlC,GAJI6E,GAAY,IAAUA,GAAY,KAClCA,GAAsB,IAGtBA,IAAaL,EACb,OAAO,CAEf,CAEA,OAAO,CACX,CAYA,SAAS2rB,GAAoBxQ,GACzB,OAAc,OAAVA,IAKAA,EAAMtX,OAAS+B,GACfuV,EAAMtX,OAAS+B,GACfuV,EAAMtX,OAAS+B,GACfuV,EAAMtX,OAAS+B,GACfuV,EAAMtX,OAAS+B,GApBvB,SAA4BuV,GACxB,OAAIA,EAAMtX,OAAS+B,GAMI,MAAhBuV,EAAMxlB,KACjB,CAaQi2B,CAAmBzQ,GAE3B,CAEA,SAAS0Q,GAAkB1Q,GACvB,OAAc,OAAVA,IAKAA,EAAMtX,OAAS+B,GACfuV,EAAMtX,OAAS+B,GACfuV,EAAMtX,OAAS+B,GACduV,EAAMtX,OAAS+B,GAA8B,MAAhBuV,EAAMxlB,MAE5C,CA+eO,SAASm2B,GAAYtmB,EAAQumB,EAAYC,GAC5C,MAAMtK,EA9eV,SAAuBlc,EAAQ9P,EAAOs2B,GAClC,SAASC,IACL,GACI9oB,IACAgY,EAAQhY,EAAaqC,EAAOhR,OAASgR,EAAOrC,GAAc,WAC3C,OAAVgY,IAAmBA,EAAMtX,OAAS+B,GAAmBuV,EAAMtX,OAAS+B,GACjF,CAEA,SAASwd,EAAaxjB,GAClB,MAAMssB,EAAY/oB,EAAavD,EAE/B,OAAOssB,EAAY1mB,EAAOhR,OAASgR,EAAO0mB,GAAa,IAC3D,CAEA,SAASC,EAAwBC,EAAW7lB,GACxC,MAAO,CACH6lB,YACAC,aACAC,cACAC,YACAppB,aACAoD,OAER,CAEA,SAASimB,EAAcJ,GACnBG,EAAY,CACRH,YACAC,aACAC,cACA/lB,KAAMgmB,EAEd,CAEA,SAASE,EAAcL,GACnBM,EAAYP,EAAwBC,EAAWM,EACnD,CAEA,SAASC,IACLN,EAAa,CACTxoB,KAAMsnB,GACN1J,OAAQ/rB,EAAM+rB,OACdtG,QACA5U,KAAM8lB,GAGVJ,IACAW,EAAc,KAEVzpB,EAAa0e,IACbA,EAAe1e,EAEvB,CAiBA,SAAS0pB,IAEDR,EADAA,EAAWxoB,OAASunB,GACPiB,EAAW9lB,KAEX,CACT1C,KAAMwnB,GACN5J,OAAQ6K,EAAY7K,OACpBtG,MAAOkR,EAAWlR,MAClB5U,KAAM8lB,GAIdC,EAAcA,EAAY/lB,IAC9B,CAEA,IAAI+lB,EAAc,KACdC,EAAY,KACZG,EAAY,KAKZE,EAAc,KAEdE,EAAiB,EACjBC,EAAa,KAEb5R,EAAQ,KACRhY,GAAc,EACd0e,EAAe,EACfwK,EAAa,CACbxoB,KAAMqnB,GACNzJ,OAAQ,KACRtG,MAAO,KACP5U,KAAM,MAKV,IAFA0lB,IAEsB,OAAfc,KAAyBD,EAAiBrB,IAkB7C,OAAQ/1B,EAAMmO,MACV,IAAK,QACD,GAAkB,OAAd0oB,EAAoB,CAEpB,GAAc,OAAVpR,IAEIhY,IAAeqC,EAAOhR,OAAS,GAAsB,QAAhB2mB,EAAMxlB,OAAmC,QAAhBwlB,EAAMxlB,OAAkB,CACtFD,EAAQs0B,GACR,KACJ,CAIJ+C,EAAazB,GACb,KACJ,CAMA,IAHA51B,EAAQ62B,EAAUH,aAGJnC,GAAgB,CAC1B,GAAIsC,EAAUF,aAAeA,EAAY,CACrC32B,EAAQs0B,GACR,KACJ,CACIt0B,EAAQq0B,EAEhB,CAGA,KAAOwC,EAAUD,cAAgBA,GAC7BO,IAIJN,EAAYA,EAAUhmB,KACtB,MAEJ,IAAK,WAED,GAAoB,OAAhBqmB,IAAwC,IAAhBA,GAEN,OAAdF,GAAsBvpB,EAAaupB,EAAUvpB,cAE7CupB,EAAYE,EACZA,GAAc,QAEf,GAAkB,OAAdF,EAAoB,CAG3BK,EAAaxB,GACb,KACJ,CAGA71B,EAAQg3B,EAAUN,UAGlBG,EAAYG,EAAUH,UACtBD,EAAcI,EAAUJ,YACxBD,EAAaK,EAAUL,WACvBlpB,EAAaupB,EAAUvpB,WACvBgY,EAAQhY,EAAaqC,EAAOhR,OAASgR,EAAOrC,GAAc,KAG1DupB,EAAYA,EAAUnmB,KACtB,MAEJ,IAAK,aACD7Q,EAAQA,EAAMgV,MACd,MAEJ,IAAK,KAGGhV,EAAM20B,OAASL,IACfyC,EAAc/2B,EAAM20B,MAGpB30B,EAAMoB,OAASizB,IACfyC,EAAc92B,EAAMoB,MAGxBpB,EAAQA,EAAMgV,MACd,MAEJ,IAAK,YACDhV,EAAQ,CACJmO,KAAM,kBACN4d,OAAQ/rB,EACRxB,MAAO,EACP84B,KAAM,GAEV,MAEJ,IAAK,kBAAmB,CACpB,MAAM1M,EAAQ5qB,EAAM+rB,OAAOnB,MAE3B,GAAI5qB,EAAMxB,QAAUosB,EAAM9rB,OAAQ,CAE9B,GAAmB,IAAfkB,EAAMs3B,MAAct3B,EAAM+rB,OAAOiJ,IAAK,CACtCh1B,EAAQs0B,GACR,KACJ,CAGAt0B,EAAQq0B,GACR,KACJ,CAGA,GAAIr0B,EAAMs3B,QAAU,GAAK1M,EAAM9rB,QAAU,EAAG,CACxCkB,EAAQq0B,GACR,KACJ,CAEA,KAAOr0B,EAAMxB,MAAQosB,EAAM9rB,OAAQkB,EAAMxB,QAAS,CAC9C,MAAM+4B,EAAY,GAAKv3B,EAAMxB,MAE7B,GAAiC,IAA5BwB,EAAMs3B,KAAOC,GAAkB,CAGhCR,EAAc/2B,GACd82B,EAAc,CACV3oB,KAAM,eACN4d,OAAQ/rB,EAAM+rB,OACduL,KAAMt3B,EAAMs3B,KAAOC,IAIvBv3B,EAAQ4qB,EAAM5qB,EAAMxB,SACpB,KACJ,CACJ,CACA,KACJ,CAEA,IAAK,eACDwB,EAAQ,CACJmO,KAAM,kBACN4d,OAAQ/rB,EAAM+rB,OACdvtB,MAAO,EACP84B,KAAMt3B,EAAMs3B,MAEhB,MAEJ,IAAK,OACD,GAAc,OAAV7R,EAAgB,CAChB,IAAIxgB,EAAOwgB,EAAMxlB,MAAMqF,cAOvB,IAJ4B,IAAxBL,EAAKO,QAAQ,QACbP,EAAOA,EAAKwO,QAAQ,YAAa,KAGjCxN,GAAelB,KAAK/E,EAAMgF,IAAKC,GAAO,CACtCjF,EAAQA,EAAMgF,IAAIC,GAClB,KACJ,CACJ,CAEAjF,EAAQs0B,GACR,MAEJ,IAAK,UAAW,CACZ,MAAMlJ,EAAuB,OAAhBwL,EAAuBA,EAAYxL,KAAO,KACjDoM,EAAiB/pB,EAAazC,KAAKysB,MAAMz3B,EAAM2P,GAAG8V,EAAOiI,EAActC,IAE7E,IAAKnW,MAAMuiB,IAAmBA,EAAiB/pB,EAAY,CACvD,KAAOA,EAAa+pB,GAChBP,IAGJj3B,EAAQq0B,EACZ,MACIr0B,EAAQs0B,GAGZ,KACJ,CAEA,IAAK,OACL,IAAK,WAAY,CACb,MAAMoD,EAA4B,SAAf13B,EAAMmO,KAAkB,QAAU,aAC/CwpB,EAAa1xB,GAAelB,KAAKuxB,EAAUoB,GAAcpB,EAASoB,GAAY13B,EAAMiF,MAAQ,KAElG,IAAK0yB,IAAeA,EAAW3iB,MAC3B,MAAM,IAAIvQ,MACN,0BACgB,SAAfzE,EAAMmO,KACD,IAAMnO,EAAMiF,KAAO,IACnB,KAAQjF,EAAMiF,KAAO,OAKnC,IAAoB,IAAhBiyB,GAAmC,OAAVzR,GAAiC,SAAfzlB,EAAMmO,OAK7B,iBAAfnO,EAAMiF,MAA2BwgB,EAAMtX,OAAS+B,GAKjC,WAAflQ,EAAMiF,MAAqC,MAAhBwgB,EAAMxlB,OAEb,CACD,OAAhBi3B,IACAA,EAAcT,EAAwBz2B,EAAOg3B,IAGjDh3B,EAAQs0B,GACR,KACJ,CA/RZsC,EAAc,CACV7K,OAAQ/rB,EAAM+rB,OACdX,KAAMprB,EAAM+rB,OAAOX,MAAyB,OAAhBwL,GAAwBA,EAAYxL,MAAS,KACzEva,KAAM+lB,GAGVD,EAAa,CACTxoB,KAAMunB,GACN3J,OAAQ/rB,EAAM+rB,OACdtG,MAAOkR,EAAWlR,MAClB5U,KAAM8lB,GAyRF32B,EAAQ23B,EAAW3iB,MACnB,KACJ,CAEA,IAAK,UAAW,CACZ,MAAM/P,EAAOjF,EAAMiF,KAEnB,GAAc,OAAVwgB,EAAgB,CAChB,IAAImS,EAAcnS,EAAMxlB,MAOxB,IAJmC,IAA/B23B,EAAYpyB,QAAQ,QACpBoyB,EAAcA,EAAYnkB,QAAQ,YAAa,KAG/CuiB,GAA+B4B,EAAa3yB,GAAO,CACnDgyB,IACAj3B,EAAQq0B,GACR,KACJ,CACJ,CAEAr0B,EAAQs0B,GACR,KACJ,CAEA,IAAK,YACL,IAAK,WACD,GAAc,OAAV7O,GAAkBuQ,GAA+BvQ,EAAMxlB,MAAOD,EAAMiF,MAAO,CAC3EgyB,IACAj3B,EAAQq0B,GACR,KACJ,CAEAr0B,EAAQs0B,GACR,MAEJ,IAAK,QACD,GAAc,OAAV7O,GAAkBA,EAAMxlB,QAAUD,EAAMC,MAAO,CAC/Cg3B,IACAj3B,EAAQq0B,GACR,KACJ,CAEAr0B,EAAQs0B,GACR,MAEJ,IAAK,QACa,OAAV7O,GAAkBA,EAAMtX,OAAS+B,EAC7B+lB,GAAoBU,EAAWlR,OAC/BzlB,EAAQs0B,IAER2C,IACAj3B,EAAQm2B,GAAkB1Q,GAAS6O,GAAWD,IAGlDr0B,EAAQi2B,GAAoBU,EAAWlR,QAAU0Q,GAAkB1Q,GAAS4O,GAAQC,GAGxF,MAEJ,IAAK,SACD,IAAI/1B,EAAS,GACTi5B,EAAiB/pB,EAErB,KAAO+pB,EAAiB1nB,EAAOhR,QAAUP,EAAOO,OAASkB,EAAMC,MAAMnB,OAAQ04B,IACzEj5B,GAAUuR,EAAO0nB,GAAgBv3B,MAGrC,GAAI+1B,GAA+Bz3B,EAAQyB,EAAMC,OAAQ,CACrD,KAAOwN,EAAa+pB,GAChBP,IAGJj3B,EAAQq0B,EACZ,MACIr0B,EAAQs0B,GAGZ,MAEJ,QACI,MAAM,IAAI7vB,MAAM,sBAAwBzE,EAAMmO,MAM1D,OAAQkpB,GACJ,KAAK,KACDQ,QAAQC,KAAK,+BAAiC/B,GAAkB,eAChEsB,EAAavB,GACba,EAAa,KACb,MAEJ,KAAKf,GACD,KAAuB,OAAhBgB,GACHO,IAEJ,MAEJ,QACIR,EAAa,KAGrB,MAAO,CACH7mB,SACAioB,OAAQV,EACRW,WAAYZ,EACZpiB,MAAO2hB,EACPxK,eAER,CAoCwB8L,CAAcnoB,EAAQumB,EAAYC,GAAY,CAAA,GAElE,GAA0B,OAAtBtK,EAAYhX,MACZ,OAAOgX,EAGX,IAAIpc,EAAOoc,EAAYhX,MACnB5O,EAAO4lB,EAAYhX,MAAQ,CAC3B+W,OAAQsK,EAAWtK,QAAU,KAC7B/W,MAAO,IAEX,MAAMkjB,EAAY,CAAC9xB,GAMnB,IAHAwJ,EAvkBJ,SAAqB0D,GACjB,IAAIzC,EAAO,KACPvC,EAAO,KACPsB,EAAO0D,EAEX,KAAgB,OAAT1D,GACHtB,EAAOsB,EAAKiB,KACZjB,EAAKiB,KAAOA,EACZA,EAAOjB,EACPA,EAAOtB,EAGX,OAAOuC,CACX,CA0jBWsnB,CAAYvoB,GAAMiB,KAGT,OAATjB,GAAe,CAClB,OAAQA,EAAKzB,MACT,KAAKunB,GACDtvB,EAAK4O,MAAMhW,KAAKoH,EAAO,CACnB2lB,OAAQnc,EAAKmc,OACb/W,MAAO,KAEXkjB,EAAUl5B,KAAKoH,GACf,MAEJ,KAAKuvB,GACDuC,EAAU9kB,MACVhN,EAAO8xB,EAAUA,EAAUp5B,OAAS,GACpC,MAEJ,QACIsH,EAAK4O,MAAMhW,KAAK,CACZ+sB,OAAQnc,EAAKmc,QAAU,KACvBtG,MAAO7V,EAAK6V,MAAMxlB,MAClBiX,KAAMtH,EAAK6V,MAAMvO,OAI7BtH,EAAOA,EAAKiB,IAChB,CAEA,OAAOmb,CACX,CCrnBO,SAASoM,GAASlhB,GACrB,SAASmhB,EAAiBtM,GACtB,OAAe,OAAXA,IAKgB,SAAhBA,EAAO5d,MACS,aAAhB4d,EAAO5d,MACS,YAAhB4d,EAAO5d,KAEf,CAyBA,IAAIpO,EAAS,KAMb,OAJqB,OAAjB4M,KAAK2rB,SAzBT,SAASC,EAASC,GACd,GAAI9uB,MAAM6d,QAAQiR,EAAUxjB,QAExB,IAAK,IAAIlP,EAAI,EAAGA,EAAI0yB,EAAUxjB,MAAMlW,OAAQgH,IACxC,GAAIyyB,EAASC,EAAUxjB,MAAMlP,IAKzB,OAJIuyB,EAAiBG,EAAUzM,SAC3BhsB,EAAO0F,QAAQ+yB,EAAUzM,SAGtB,OAGZ,GAAIyM,EAAUthB,OAASA,EAK1B,OAJAnX,EAASs4B,EAAiBG,EAAUzM,QAC9B,CAACyM,EAAUzM,QACX,IAEC,EAGX,OAAO,CACX,CAKIwM,CAAS5rB,KAAK2rB,SAGXv4B,CACX,CAcA,SAAS04B,GAASzjB,EAAOkC,EAAMvH,GAC3B,MAAM+oB,EAAQN,GAASrzB,KAAKiQ,EAAOkC,GAEnC,OAAc,OAAVwhB,GAIGA,EAAMpmB,KAAK3C,EACtB,4DAZO,SAAmBuH,GACtB,OAAOuhB,GAAS9rB,KAAMuK,GAAMlC,GAAwB,YAAfA,EAAM7G,MAC/C,aANO,SAAoB+I,EAAMkW,GAC7B,OAAOqL,GAAS9rB,KAAMuK,GAAMlC,GAAwB,aAAfA,EAAM7G,MAAuB6G,EAAM/P,OAASmoB,GACrF,SANO,SAAgBlW,EAAM/I,GACzB,OAAOsqB,GAAS9rB,KAAMuK,GAAMlC,GAAwB,SAAfA,EAAM7G,MAAmB6G,EAAM/P,OAASkJ,GACjF,IC7CA,SAASwqB,GAAkBH,GACvB,MAAI,SAAUA,EACHA,EAAUthB,KAGdyhB,GAAkBH,EAAUxjB,MAAM,GAC7C,CAEA,SAAS4jB,GAAiBJ,GACtB,MAAI,SAAUA,EACHA,EAAUthB,KAGd0hB,GAAiBJ,EAAUxjB,MAAMwjB,EAAUxjB,MAAMlW,OAAS,GACrE,CAEO,SAAS+5B,GAAeC,EAAOjf,EAAK7E,EAAO7G,EAAMlJ,GAmCpD,MAAM8zB,EAAY,GAMlB,OAJsB,OAAlB/jB,EAAMsjB,SApCV,SAASU,EAAcR,GACnB,GAAyB,OAArBA,EAAUzM,QACVyM,EAAUzM,OAAO5d,OAASA,GAC1BqqB,EAAUzM,OAAO9mB,OAASA,EAAM,CAChC,MAAMuF,EAAQmuB,GAAkBH,GAC1B/tB,EAAMmuB,GAAiBJ,GAE7BM,EAAM/M,OAAOhE,KAAKlO,GAAK,SAAS3C,EAAMtH,EAAM0D,GACxC,GAAI4D,IAAS1M,EAAO,CAChB,MAAMyuB,EAAQ,IAAIvoB,GAElB,EAAG,CAGC,GAFAuoB,EAAM1mB,WAAW3C,EAAKgB,MAElBhB,EAAKgB,OAASnG,EACd,MAGJmF,EAAOA,EAAKtB,WACE,OAATsB,GAETmpB,EAAU/5B,KAAK,CACXk6B,OAAQ5lB,EACR2lB,SAER,CACJ,GACJ,CAEIvvB,MAAM6d,QAAQiR,EAAUxjB,QACxBwjB,EAAUxjB,MAAMjD,QAAQinB,EAEhC,CAKIA,CAAchkB,EAAMsjB,SAGjBS,CACX,CC1DA,MAAQ9yB,eAAAA,IAAmBrD,OAAOoB,UAElC,SAASm1B,GAAcl5B,GAEnB,MACqB,iBAAVA,GACPm5B,SAASn5B,IACT+K,KAAKysB,MAAMx3B,KAAWA,GACtBA,GAAS,CAEjB,CAEA,SAASo5B,GAAgB7f,GACrB,OACI/W,QAAQ+W,IACR2f,GAAc3f,EAAItP,SAClBivB,GAAc3f,EAAInN,OAClB8sB,GAAc3f,EAAIjN,OAE1B,CAEA,SAAS+sB,GAA2BnrB,EAAMuZ,GACtC,OAAO,SAAmBxQ,EAAM4gB,GAC5B,IAAK5gB,GAAQA,EAAK/Q,cAAgBvD,OAC9B,OAAOk1B,EAAK5gB,EAAM,oCAGtB,IAAK,IAAIrX,KAAOqX,EAAM,CAClB,IAAIqiB,GAAQ,EAEZ,IAAuC,IAAnCtzB,GAAelB,KAAKmS,EAAMrX,GAA9B,CAIA,GAAY,SAARA,EACIqX,EAAK/I,OAASA,GACd2pB,EAAK5gB,EAAM,oBAAsBA,EAAK/I,KAAO,gBAAkBA,EAAO,UAEvE,GAAY,QAARtO,EAAe,CACtB,GAAiB,OAAbqX,EAAKsC,IACL,SACG,GAAItC,EAAKsC,KAAOtC,EAAKsC,IAAIrT,cAAgBvD,OAC5C,GAA+B,iBAApBsU,EAAKsC,IAAIvP,OAChBpK,GAAO,eACJ,GAAKw5B,GAAgBniB,EAAKsC,IAAIhP,OAE9B,IAAK6uB,GAAgBniB,EAAKsC,IAAI/O,KAGjC,SAFA5K,GAAO,MAGX,MALIA,GAAO,SAQf05B,GAAQ,CACX,MAAM,GAAI7R,EAAOzhB,eAAepG,GAAM,CACnC05B,GAAQ,EAER,IAAK,IAAIzzB,EAAI,GAAIyzB,GAASzzB,EAAI4hB,EAAO7nB,GAAKf,OAAQgH,IAAK,CACnD,MAAM0hB,EAAYE,EAAO7nB,GAAKiG,GAE9B,OAAQ0hB,GACJ,KAAKvgB,OACDsyB,EAA6B,iBAAdriB,EAAKrX,GACpB,MAEJ,KAAK4C,QACD82B,EAA6B,kBAAdriB,EAAKrX,GACpB,MAEJ,KAAK,KACD05B,EAAsB,OAAdriB,EAAKrX,GACb,MAEJ,QAC6B,iBAAd2nB,EACP+R,EAAQriB,EAAKrX,IAAQqX,EAAKrX,GAAKsO,OAASqZ,EACjC9d,MAAM6d,QAAQC,KACrB+R,EAAQriB,EAAKrX,aAAgB6Q,IAG7C,CACJ,MACIonB,EAAK5gB,EAAM,kBAAoBrX,EAAM,SAAWsO,EAAO,cAGtDorB,GACDzB,EAAK5gB,EAAM,kBAAoB/I,EAAO,IAAMtO,EAAM,IAtDtD,CAwDJ,CAEA,IAAK,MAAMA,KAAO6nB,EACVzhB,GAAelB,KAAK2iB,EAAQ7nB,KACO,IAAnCoG,GAAelB,KAAKmS,EAAMrX,IAC1Bi4B,EAAK5gB,EAAM,UAAY/I,EAAO,IAAMtO,EAAM,eAI1D,CAEA,SAAS25B,GAAiBv0B,EAAMG,GAC5B,MAAM8hB,EAAY9hB,EAAS8hB,UACrBQ,EAAS,CACXvZ,KAAMlH,OACNuS,KAAK,GAEHigB,EAAO,CACTtrB,KAAM,IAAMlJ,EAAO,KAGvB,IAAK,MAAMpF,KAAOqnB,EAAW,CACzB,IAA4C,IAAxCjhB,GAAelB,KAAKmiB,EAAWrnB,GAC/B,SAGJ,MAAM65B,EAAY,GACZtS,EAAaM,EAAO7nB,GAAO6J,MAAM6d,QAAQL,EAAUrnB,IACnDqnB,EAAUrnB,GAAKiF,QACf,CAACoiB,EAAUrnB,IAEjB,IAAK,IAAIiG,EAAI,EAAGA,EAAIshB,EAAWtoB,OAAQgH,IAAK,CACxC,MAAM0hB,EAAYJ,EAAWthB,GAC7B,GAAI0hB,IAAcvgB,QAAUugB,IAAc/kB,QACtCi3B,EAAU16B,KAAKwoB,EAAUviB,WACtB,GAAkB,OAAduiB,EACPkS,EAAU16B,KAAK,aACZ,GAAyB,iBAAdwoB,EACdkS,EAAU16B,KAAK,IAAMwoB,EAAY,SAC9B,KAAI9d,MAAM6d,QAAQC,GAGrB,MAAM,IAAI/iB,MAAM,gBAAkB+iB,EAAY,SAAWviB,EAAO,IAAMpF,EAAM,0BAF5E65B,EAAU16B,KAAK,OAGnB,CACJ,CAEAy6B,EAAK55B,GAAO65B,EAAUx0B,KAAK,MAC/B,CAEA,MAAO,CACHu0B,OACAE,MAAOL,GAA2Br0B,EAAMyiB,GAEhD,CClIA,MAAMkS,GAAwBtE,GAAgB/H,GAAgBroB,KAAK,QAEnE,SAAS20B,GAAc70B,EAAK0lB,EAASoP,GACjC,MAAM/5B,EAAS,CAAA,EAEf,IAAK,MAAMkF,KAAQD,EACXA,EAAIC,GAAM8mB,SACVhsB,EAAOkF,GAAQ60B,EACT90B,EAAIC,GAAM8mB,OACVnG,GAAS5gB,EAAIC,GAAM8mB,OAAQ,CAAErB,aAI3C,OAAO3qB,CACX,CAEA,SAASg6B,GAAoB/0B,EAAK0lB,EAASoP,GACvC,MAAM/5B,EAAS,CAAA,EAEf,IAAK,MAAOkF,EAAM+R,KAAWpU,OAAOuU,QAAQnS,GACxCjF,EAAOkF,GAAQ,CACX+0B,QAAShjB,EAAOgjB,UACZF,EACM9iB,EAAOgjB,QAAQjO,OACfnG,GAAS5O,EAAOgjB,QAAQjO,OAAQ,CAAErB,aAE5CuP,YAAajjB,EAAOijB,aAAeJ,GAAc7iB,EAAOijB,YAAavP,EAASoP,IAItF,OAAO/5B,CACX,CAYA,SAASm6B,GAAiB5B,EAAS93B,EAAOw3B,GACtC,MAAO,CACHM,UACAN,aACAx3B,WACGk4B,GAEX,CAEA,SAASyB,GAAYrB,EAAO/M,EAAQ9rB,EAAOm6B,GACvC,MAAMtqB,EAASqkB,GAAcl0B,EAAO64B,EAAM/M,QAC1C,IAAIhsB,EAEJ,OAvBJ,SAAqB+P,GACjB,IAAK,IAAIhK,EAAI,EAAGA,EAAIgK,EAAOhR,OAAQgH,IAC/B,GAAsC,SAAlCgK,EAAOhK,GAAG7F,MAAMqF,cAChB,OAAO,EAIf,OAAO,CACX,CAeQ+0B,CAAYvqB,GACLoqB,GAAiB,KAAM,IAAIz1B,MAAM,qDAGxC21B,IACAr6B,EAASq2B,GAAYtmB,EAAQgpB,EAAMc,sBAAuBd,IAGzDsB,GAAuBr6B,EAAOiV,QAC/BjV,EAASq2B,GAAYtmB,EAAQic,EAAO/W,MAAO8jB,GACtC/4B,EAAOiV,OASTklB,GAAiBn6B,EAAOiV,MAAO,KAAMjV,EAAOi4B,YARpCkC,GACH,KACA,IAAIpO,GAAiB/rB,EAAOg4B,OAAQhM,EAAOA,OAAQ9rB,EAAOF,GAC1DA,EAAOi4B,YAMvB,CAEO,MAAMsC,GACTn0B,WAAAA,CAAYoQ,EAAQwV,EAAQ7E,GAUxB,GATAva,KAAKitB,sBAAwBA,GAC7BjtB,KAAKof,OAASA,EACdpf,KAAK4tB,SAAU,EACf5tB,KAAKwjB,MAAQ,IAAKA,IAClBxjB,KAAK6tB,QAAU53B,OAAOiR,OAAO,MAC7BlH,KAAK8f,WAAa7pB,OAAOiR,OAAO,MAChClH,KAAKgZ,MAAQ/iB,OAAOiR,OAAO,MAC3BlH,KAAKua,UAAYA,GD6ClB,SAAgC3Q,GACnC,MAAM2Q,EAAY,CAAA,EAElB,GAAI3Q,EAAOW,KACP,IAAK,MAAMjS,KAAQsR,EAAOW,KACtB,GAAIjR,GAAelB,KAAKwR,EAAOW,KAAMjS,GAAO,CACxC,MAAMG,EAAWmR,EAAOW,KAAKjS,GAE7B,IAAIG,EAAS8hB,UAGT,MAAM,IAAIziB,MAAM,gCAAkCQ,EAAO,0BAFzDiiB,EAAUjiB,GAAQu0B,GAAiBv0B,EAAMG,EAIjD,CAIR,OAAO8hB,CACX,CC/DsCuT,CAAuBlkB,GAEjDA,EAAQ,CACR,GAAIA,EAAO4Z,MACP,IAAK,MAAMuK,KAAS93B,OAAOwT,KAAK+Z,IACxBzmB,MAAM6d,QAAQhR,EAAO4Z,MAAMuK,MAC3B/tB,KAAKwjB,MAAMuK,GAASnkB,EAAO4Z,MAAMuK,IAK7C,GAAInkB,EAAOoP,MACP,IAAK,MAAO1gB,EAAMkJ,KAASvL,OAAOuU,QAAQZ,EAAOoP,OAC7ChZ,KAAKguB,SAAS11B,EAAMkJ,GAI5B,GAAIoI,EAAOgkB,QAAS,CAChB5tB,KAAK4tB,SAAU,EACf,IAAK,MAAOt1B,EAAMhF,KAAU2C,OAAOuU,QZgf5C,SAA4BgZ,GAC/B,MAAO,IACAT,MACAC,MACAO,GAAqBC,GAEhC,CYtf2DyK,CAAmBjuB,KAAKwjB,QAC/DxjB,KAAKguB,SAAS11B,EAAMhF,EAE5B,CAEA,GAAIsW,EAAOikB,QACP,IAAK,MAAOv1B,EAAM+R,KAAWpU,OAAOuU,QAAQZ,EAAOikB,SAC/C7tB,KAAKkuB,WAAW51B,EAAM+R,GAI9B,GAAIT,EAAOkW,WACP,IAAK,MAAOxnB,EAAMmoB,KAAaxqB,OAAOuU,QAAQZ,EAAOkW,YACjD9f,KAAKmuB,aAAa71B,EAAMmoB,EAGpC,CACJ,CAEA2N,cAAAA,CAAelhB,GACX,SAASmhB,EAAe9jB,EAAMzW,GAC1Bw6B,EAAMj8B,KAAK,CAAEkY,OAAMzW,WACvB,CAEA,MAAMymB,EAAYva,KAAKua,UACjB+T,EAAQ,GAUd,OARAtuB,KAAKof,OAAOhE,KAAKlO,GAAK,SAAS3C,GACvBgQ,EAAUjhB,eAAeiR,EAAK/I,MAC9B+Y,EAAUhQ,EAAK/I,MAAMwrB,MAAMziB,EAAM8jB,GAEjCA,EAAe9jB,EAAM,sBAAwBA,EAAK/I,KAAO,IAEjE,MAEO8sB,EAAMn8B,QAASm8B,CAC1B,CAEAC,gBAAAA,CAAiBnP,EAAQ5d,EAAMlJ,EAAMi0B,EAAS,MAC1C,MAAM/Q,EAAM,CACRha,OACAlJ,QAEE2nB,EAAa,CACfze,OACAlJ,OACAi0B,SACAiC,aAAgC,iBAAXpP,GAAwBA,GAAiC,iBAAhBA,EAAO5d,KACrE4d,OAAQ,KACR/W,MAAO,MAiCX,MA9BsB,mBAAX+W,EACPa,EAAW5X,MAAQsgB,GAAgBvJ,EAAQ5D,IAErB,iBAAX4D,EAEPnpB,OAAOC,eAAe+pB,EAAY,SAAU,CACxCve,IAAGA,KACCzL,OAAOC,eAAe+pB,EAAY,SAAU,CACxC3sB,MAAOoW,GAAM0V,KAGVa,EAAWb,UAI1Ba,EAAWb,OAASA,EAIxBnpB,OAAOC,eAAe+pB,EAAY,QAAS,CACvCve,IAAGA,KACCzL,OAAOC,eAAe+pB,EAAY,QAAS,CACvC3sB,MAAOq1B,GAAgB1I,EAAWb,OAAQ5D,KAGvCyE,EAAW5X,UAKvB4X,CACX,CACAiO,UAAAA,CAAW51B,EAAM8mB,GACRA,IAILpf,KAAK6tB,QAAQv1B,GAAQ,CACjBkJ,KAAM,SACNlJ,KAAMA,EACN+0B,QAASjO,EAAOiO,QAAUrtB,KAAKuuB,iBAAiBnP,EAAOiO,QAAS,gBAAiB/0B,GAAQ,KACzFg1B,YAAalO,EAAOkO,YACdr3B,OAAOwT,KAAK2V,EAAOkO,aAAa/nB,QAC9B,CAAClN,EAAKo2B,KACFp2B,EAAIo2B,GAAYzuB,KAAKuuB,iBAAiBnP,EAAOkO,YAAYmB,GAAW,mBAAoBA,EAAUn2B,GAC3FD,IAEXpC,OAAOiR,OAAO,OAEhB,MAEd,CACAinB,YAAAA,CAAa71B,EAAM8mB,GACVA,IAILpf,KAAK8f,WAAWxnB,GAAQ0H,KAAKuuB,iBAAiBnP,EAAQ,WAAY9mB,GACtE,CACA01B,QAAAA,CAAS11B,EAAM8mB,GACNA,IAILpf,KAAKgZ,MAAM1gB,GAAQ0H,KAAKuuB,iBAAiBnP,EAAQ,OAAQ9mB,GAC7D,CAEAo2B,eAAAA,CAAgBC,GACZ,IAAK3uB,KAAK4uB,UAAUD,GAChB,OAAO,IAAI3P,GAAqB,kBAAmB,IAAM2P,EAEjE,CACAE,kBAAAA,CAAmBF,EAAYtB,GAC3B,MAAMx5B,EAAQmM,KAAK0uB,gBAAgBC,GAEnC,GAAI96B,EACA,OAAOA,EAGX,MAAMwW,EAASrK,KAAK4uB,UAAUD,GAE9B,OAAKtkB,EAAOgjB,SAAWA,EACZ,IAAIlmB,YAAY,aAAewnB,EAAa,mCAGnDtkB,EAAOgjB,SAAYA,GACdG,GAAYxtB,KAAMqK,EAAOgjB,QAAS,IAAI,GAAO1B,aADtD,EAEe,IAAIxkB,YAAY,aAAewnB,EAAa,6BAG/D,CACAG,yBAAAA,CAA0BH,EAAYI,GAClC,MAAMl7B,EAAQmM,KAAK0uB,gBAAgBC,GAEnC,GAAI96B,EACA,OAAOA,EAGX,MAAMwW,EAASrK,KAAK4uB,UAAUD,GACxB1O,EAAazI,GAAcuX,GAEjC,OAAK1kB,EAAOijB,YAIPjjB,EAAOijB,YAAYrN,EAAW3nB,OAC9B+R,EAAOijB,YAAYrN,EAAWM,eADnC,EAEW,IAAIvB,GAAqB,6BAA8B+P,GALvD,IAAI5nB,YAAY,aAAewnB,EAAa,6BAO3D,CACAK,iBAAAA,CAAkBC,GACd,IAAKjvB,KAAKkvB,YAAYD,GAClB,OAAO,IAAIjQ,GAAqB,mBAAoBiQ,EAE5D,CAEAE,kBAAAA,CAAmBR,EAAYtB,GAC3B,MAAMx5B,EAAQmM,KAAK6uB,mBAAmBF,EAAYtB,GAElD,GAAIx5B,EACA,OAAO05B,GAAiB,KAAM15B,GAGlC,MAAMwW,EAASrK,KAAK4uB,UAAUD,GAE9B,OAAKtkB,EAAOgjB,QAILG,GAAYxtB,KAAMqK,EAAOgjB,QAASA,GAAW,IAAI,GAH7CE,GAAiB,KAAM,KAItC,CACA6B,qBAAAA,CAAsBT,EAAYI,EAAgBz7B,GAC9C,MAAMO,EAAQmM,KAAK8uB,0BAA0BH,EAAYI,GAEzD,GAAIl7B,EACA,OAAO05B,GAAiB,KAAM15B,GAGlC,MAAMwW,EAASrK,KAAK4uB,UAAUD,GACxB1O,EAAazI,GAAcuX,GAEjC,OAAOvB,GAAYxtB,KAAMqK,EAAOijB,YAAYrN,EAAW3nB,OAAS+R,EAAOijB,YAAYrN,EAAWM,UAAWjtB,GAAO,EACpH,CACA+7B,gBAAAA,CAAiB9kB,GACb,MAAkB,gBAAdA,EAAK/I,KACE+rB,GAAiB,KAAM,IAAIz1B,MAAM,2BAGrCkI,KAAKsvB,cAAc/kB,EAAKkW,SAAUlW,EAAKjX,MAClD,CACAg8B,aAAAA,CAAcL,EAAc37B,GAExB,GAAIkkB,GAAeyX,GAAc/O,OAC7B,OAAOqN,GAAiB,KAAM,IAAIz1B,MAAM,4DAG5C,MAAMjE,EAAQmM,KAAKgvB,kBAAkBC,GAErC,OAAIp7B,EACO05B,GAAiB,KAAM15B,GAG3B25B,GAAYxtB,KAAMA,KAAKkvB,YAAYD,GAAe37B,GAAO,EACpE,CACAi8B,SAAAA,CAAUC,EAAUl8B,GAChB,MAAMm8B,EAAazvB,KAAK0vB,QAAQF,GAEhC,OAAKC,EAIEjC,GAAYxtB,KAAMyvB,EAAYn8B,GAAO,GAHjCi6B,GAAiB,KAAM,IAAIvO,GAAqB,eAAgBwQ,GAI/E,CACAnnB,KAAAA,CAAM+W,EAAQ9rB,GACV,MAAsB,iBAAX8rB,GAAyBA,GAAWA,EAAO5d,MAIhC,iBAAX4d,GAAwBA,EAAO/W,QACtC+W,EAASpf,KAAKuuB,iBAAiBnP,EAAQ,OAAQ,cAG5CoO,GAAYxtB,KAAMof,EAAQ9rB,GAAO,IAP7Bi6B,GAAiB,KAAM,IAAIvO,GAAqB,cAQ/D,CAEA2Q,kBAAAA,CAAmBV,EAAc37B,EAAOkO,EAAMlJ,GAC1C,OAAO4zB,GAAelsB,KAAM1M,EAAO0M,KAAKsvB,cAAcL,EAAc37B,GAAQkO,EAAMlJ,EACtF,CACAs3B,6BAAAA,CAA8BvS,EAAa7b,EAAMlJ,GAC7C,OAAO4zB,GAAelsB,KAAMqd,EAAY/pB,MAAO0M,KAAKqvB,iBAAiBhS,GAAc7b,EAAMlJ,EAC7F,CACAu3B,gBAAAA,CAAiB3iB,EAAK1L,EAAMlJ,GACxB,MAAMlF,EAAS,GASf,OAPA4M,KAAKof,OAAOhE,KAAKlO,EAAK,CAClBqQ,MAAO,cACPZ,MAAQU,IACJjqB,EAAOf,KAAKy9B,MAAM18B,EAAQ4M,KAAK4vB,8BAA8BvS,EAAa7b,EAAMlJ,GAAM,IAIvFlF,CACX,CAEAw7B,SAAAA,CAAUD,EAAYoB,GAAmB,GACrC,MAAM1lB,EAASmN,GAAcmX,GAK7B,OAJoBtkB,EAAO+V,QAAU2P,EAC/B/vB,KAAK6tB,QAAQxjB,EAAO/R,OAAS0H,KAAK6tB,QAAQxjB,EAAOkW,UACjDvgB,KAAK6tB,QAAQxjB,EAAO/R,QAEJ,IAC1B,CACA03B,gBAAAA,CAAiBrB,EAAYoB,GAAmB,GAC5C,MAAM1lB,EAASrK,KAAK4uB,UAAUD,EAAYoB,GAE1C,OAAO1lB,GAAUA,EAAOgjB,SAAW,IACvC,CACA4C,mBAAAA,CAAoBtB,EAAYr2B,GAC5B,OAAO0H,KAAK6tB,QAAQv0B,eAAeq1B,IAAe3uB,KAAK6tB,QAAQqC,aACzDlwB,KAAK6tB,QAAQc,GAAYuB,YAAY53B,IACrC,IACV,CACA42B,WAAAA,CAAYD,EAAcc,GAAmB,GACzC,MAAMtP,EAAWjJ,GAAeyX,GAKhC,OAJsBxO,EAASL,QAAU2P,EACnC/vB,KAAK8f,WAAWW,EAASnoB,OAAS0H,KAAK8f,WAAWW,EAASF,UAC3DvgB,KAAK8f,WAAWW,EAASnoB,QAEP,IAC5B,CACAo3B,OAAAA,CAAQp3B,GACJ,OAAOgB,eAAelB,KAAK4H,KAAKgZ,MAAO1gB,GAAQ0H,KAAKgZ,MAAM1gB,GAAQ,IACtE,CAEA63B,QAAAA,GACI,SAASA,EAAS/Q,EAAQ9mB,EAAM83B,EAAQnQ,GACpC,GAAImQ,EAAO9d,IAAIha,GACX,OAAO83B,EAAO1uB,IAAIpJ,GAGtB83B,EAAOtd,IAAIxa,GAAM,GACS,OAAtB2nB,EAAWb,QPtZpB,SAAc7U,EAAMpX,EAASF,GA8BhC,IAAI0pB,EAAQxC,GACR0C,EAAQ1C,GASZ,GAPuB,mBAAZhnB,EACPwpB,EAAQxpB,EACDA,IACPwpB,EAAQvC,GAAejnB,EAAQwpB,OAC/BE,EAAQzC,GAAejnB,EAAQ0pB,QAG/BF,IAAUxC,IAAQ0C,IAAU1C,GAC5B,MAAM,IAAIriB,MAAM,gFAxCpB,SAASsjB,EAAK7Q,GAGV,OAFAoS,EAAMvkB,KAAKnF,EAASsX,GAEZA,EAAK/I,MACT,IAAK,QACD+I,EAAK0T,MAAM7Y,QAAQgW,GACnB,MAEJ,IAAK,aACDA,EAAK7Q,EAAK2T,MACV,MAEJ,IAAK,OACL,IAAK,WACL,IAAK,UACL,IAAK,YACL,IAAK,WACL,IAAK,SACL,IAAK,QACL,IAAK,QACD,MAEJ,QACI,MAAM,IAAIpmB,MAAM,iBAAmByS,EAAK/I,MAGhDqb,EAAMzkB,KAAKnF,EAASsX,EACxB,CAgBA6Q,CAAK7Q,EACT,CO0WgB6Q,CAAK6E,EAAWb,QAAQ,SAAS7U,GAC7B,GAAkB,SAAdA,EAAK/I,MAAiC,aAAd+I,EAAK/I,KAC7B,OAGJ,MAAMnJ,EAAoB,SAAdkS,EAAK/I,KAAkB4d,EAAOpG,MAAQoG,EAAOU,WACnDuQ,EAA0B,SAAd9lB,EAAK/I,KAAkB8uB,EAAcC,EAElDj3B,eAAelB,KAAKC,EAAKkS,EAAKjS,QAAS63B,EAAS/Q,EAAQ7U,EAAKjS,KAAM+3B,EAAWh4B,EAAIkS,EAAKjS,QACxF83B,EAAOtd,IAAIxa,GAAM,EAExB,GAAE0H,KAEX,CAEA,IAAIswB,EAAc,IAAI9vB,IAClB+vB,EAAmB,IAAI/vB,IAE3B,IAAK,MAAMtN,KAAO8M,KAAKgZ,MACnBmX,EAASnwB,KAAM9M,EAAKo9B,EAAatwB,KAAKgZ,MAAM9lB,IAGhD,IAAK,MAAMA,KAAO8M,KAAK8f,WACnBqQ,EAASnwB,KAAM9M,EAAKq9B,EAAkBvwB,KAAK8f,WAAW5sB,IAM1D,OAHAo9B,EAAc,IAAIA,EAAY7mB,QAAQ5D,QAAOvN,GAAQg4B,EAAY5uB,IAAIpJ,KACrEi4B,EAAmB,IAAIA,EAAiB9mB,QAAQ5D,QAAOvN,GAAQi4B,EAAiB7uB,IAAIpJ,KAEhFg4B,EAAYn+B,QAAUo+B,EAAiBp+B,OAChC,CACH6mB,MAAOsX,EACPxQ,WAAYyQ,GAIb,IACX,CACArtB,IAAAA,CAAKiqB,EAAaqD,GACd,MAAO,CACH5C,QAAS5tB,KAAK4tB,QACdpK,MAAOxjB,KAAKwjB,MACZxK,MAAOkU,GAAcltB,KAAKgZ,OAAQwX,EAAQrD,GAC1CrN,WAAYoN,GAAcltB,KAAK8f,YAAa0Q,EAAQrD,GACpDU,QAAST,GAAoBptB,KAAK6tB,SAAU2C,EAAQrD,GAE5D,CACAzV,QAAAA,GACI,OAAOlkB,KAAKC,UAAUuM,KAAKkD,OAC/B,EC9cJ,SAASutB,GAAY13B,EAAG8tB,GACpB,MAAiB,iBAANA,GAAkB,SAASnxB,KAAKmxB,GACnB,iBAAN9tB,EACRA,EAAI8tB,EACJA,EAAE/f,QAAQ,YAAa,IAG1B+f,GAAK,IAChB,CAEA,SAAS6J,GAAWC,EAAKC,GACrB,MAAMx9B,EAAS6C,OAAOiR,OAAO,MAE7B,IAAK,MAAOhU,EAAKI,KAAU2C,OAAOuU,QAAQmmB,GACtC,GAAIr9B,EAAO,CACPF,EAAOF,GAAO,GACd,IAAK,MAAM29B,KAAQ56B,OAAOwT,KAAKnW,GACvBs9B,EAAME,SAASD,KACfz9B,EAAOF,GAAK29B,GAAQv9B,EAAMu9B,GAGtC,CAGJ,OAAOz9B,CACX,CAEe,SAAS29B,GAAIC,EAAMC,GAC9B,MAAM79B,EAAS,IAAK49B,GAEpB,IAAK,MAAOH,EAAMv9B,KAAU2C,OAAOuU,QAAQymB,GACvC,OAAQJ,GACJ,IAAK,UACDz9B,EAAOy9B,GAAQ/6B,QAAQxC,GACvB,MAEJ,IAAK,QACDF,EAAOy9B,GAAQ,IAAKG,EAAKH,IACzB,IAAK,MAAOv4B,EAAM44B,KAAUj7B,OAAOuU,QAAQlX,GACvCF,EAAOy9B,GAAMv4B,GAAQyE,MAAM6d,QAAQsW,GAASA,EAAQ,GAExD,MAEJ,IAAK,UACD99B,EAAOy9B,GAAQ,IAAKG,EAAKH,IAEzB,IAAK,MAAOv4B,EAAM+R,KAAWpU,OAAOuU,QAAQlX,GAAQ,CAChD,MAAM69B,EAAS/9B,EAAOy9B,GAAMv4B,IAAS,CAAA,EAC/B84B,EAAUh+B,EAAOy9B,GAAMv4B,GAAQ,CACjC+0B,QAAS8D,EAAO9D,SAAW,KAC3BC,YAAa,IACN6D,EAAO7D,cAIlB,GAAKjjB,EAAL,CAIA+mB,EAAQ/D,QAAUhjB,EAAOgjB,QACnBoD,GAAYW,EAAQ/D,QAAShjB,EAAOgjB,SACpC+D,EAAQ/D,SAAW,KAEzB,IAAK,MAAO0B,EAAgBsC,KAAoBp7B,OAAOuU,QAAQH,EAAOijB,aAAe,CAAA,GACjF8D,EAAQ9D,YAAYyB,GAAkBsC,EAChCZ,GAAYW,EAAQ9D,YAAYyB,GAAiBsC,GACjD,KAGLp7B,OAAOwT,KAAK2nB,EAAQ9D,aAAan7B,SAClCi/B,EAAQ9D,YAAc,KAb1B,CAeJ,CACA,MAEJ,IAAK,QACL,IAAK,aACDl6B,EAAOy9B,GAAQ,IAAKG,EAAKH,IACzB,IAAK,MAAOv4B,EAAM8mB,KAAWnpB,OAAOuU,QAAQlX,GACxCF,EAAOy9B,GAAMv4B,GAAQm4B,GAAYr9B,EAAOy9B,GAAMv4B,GAAO8mB,GAEzD,MAEJ,IAAK,QACL,IAAK,WACDhsB,EAAOy9B,GAAQ,IAAKG,EAAKH,IACzB,IAAK,MAAOv4B,EAAMs4B,KAAU36B,OAAOuU,QAAQlX,GACvCF,EAAOy9B,GAAMv4B,GAAQ,IAAKlF,EAAOy9B,GAAMv4B,MAAUs4B,GAErD,MAEJ,IAAK,eACDx9B,EAAOy9B,GAAQ,IACRG,EAAKH,MACLv9B,GAEP,MAEJ,IAAK,SACL,IAAK,SACDF,EAAOy9B,GAAQ,IACRG,EAAKH,MACLH,GAAWp9B,EAAO,CAAC,WAE1B,MAEJ,IAAK,OACDF,EAAOy9B,GAAQ,IACRG,EAAKH,MACLH,GAAWp9B,EAAO,CAAC,OAAQ,YAAa,QAAS,WAAY,iBAMhF,OAAOF,CACX,CC5GA,SAASk+B,GAAa1nB,GAClB,MAAMF,EAAQC,GAAaC,GACrBwR,EAAOY,GAAapS,GACpBqP,EAAWF,GAAgBnP,IAC3B2nB,gBAAEA,EAAeC,cAAEA,GCVtB,SAAyBpW,GAC5B,MAAO,CACHmW,gBAAgBrkB,IACZkO,EAAKlO,EAAK,CACNyP,KAAAA,CAAMpS,GACEA,EAAKtS,UAAYsS,EAAKtS,oBAAoB8L,IAAS,IACnDwG,EAAKtS,UAAW,IAAI8L,IAAOiB,UAAUuF,EAAKtS,UAElD,IAGGiV,GAEXskB,cAActkB,IACVkO,EAAKlO,EAAK,CACN2P,KAAAA,CAAMtS,GACEA,EAAKtS,UAAYsS,EAAKtS,oBAAoB8L,KAC1CwG,EAAKtS,SAAWsS,EAAKtS,SAASiN,UAEtC,IAGGgI,GAGnB,CDf+CukB,CAAgBrW,GAErDgE,EAAS,CACX+M,MAAO,KACPuF,YAAa9nB,GAAU,IAAI+jB,GAAM/jB,EAAQwV,EAAQA,EAAO+M,MAAM5R,oBAE9D5Z,GACA+I,QACAuP,WAEAmC,OACAoC,KAAMpC,EAAKoC,KACXE,SAAUtC,EAAKsC,SACfC,QAASvC,EAAKuC,QAEd4T,kBACAC,gBAEAG,IAAAA,CAAKC,GACD,MAAMC,EAAOd,GAAI,CAAE,EAAEnnB,GAErB,OAAO0nB,GACkB,mBAAdM,EACDA,EAAUC,EAAM57B,OAAOoR,QACvB0pB,GAAIc,EAAMD,GAExB,GAYJ,OATAxS,EAAO+M,MAAQ,IAAIwB,GAAM,CACrBC,SAAS,EACTpK,MAAO5Z,EAAO4Z,MACdxK,MAAOpP,EAAOoP,MACd6U,QAASjkB,EAAOikB,QAChB/N,WAAYlW,EAAOkW,WACnBvV,KAAMX,EAAOW,MACd6U,GAEIA,CACX,CE1CA,MAAMyB,GAAW,GACXd,GAAc,GACduE,GAAI,IACJxD,IAAgB,EAGtB,SAASE,GAAazjB,EAAQ2jB,GAC1B,IAAI7e,EAAMrC,KAAKgB,WAAazD,EAC5B,MAAMzL,EAAOkO,KAAKrO,WAAW0Q,GAS7B,IAPIvQ,IAAS+uB,IAAY/uB,IAASiuB,KAC1BmB,GACAlhB,KAAKnM,MAAM,8BAEfwO,KAGGA,EAAMrC,KAAKkB,SAAUmB,IACnBzG,EAAQoE,KAAKrO,WAAW0Q,KACzBrC,KAAKnM,MAAM,sBAAuBwO,EAG9C,CAEA,SAASyvB,GAAoB5Q,GACzB,OAAOF,GAAa5oB,KAAK4H,KAAM,EAAGkhB,EACtC,CAEA,SAAS6Q,GAAex0B,EAAQzL,GAC5B,IAAKkO,KAAKvC,QAAQuC,KAAKgB,WAAazD,EAAQzL,GAAO,CAC/C,IAAIkgC,EAAM,GAEV,OAAQlgC,GACJ,KAAKwyB,GACD0N,EAAM,gBACN,MACJ,KAAKjS,GACDiS,EAAM,0BAIdhyB,KAAKnM,MAAMm+B,EAAKhyB,KAAKgB,WAAazD,EACtC,CACJ,CAIA,SAAS4jB,KACL,IAAI5jB,EAAS,EACTkB,EAAO,EACP+C,EAAOxB,KAAKe,UAEhB,KAAOS,IAAS1G,GAAc0G,IAAS9F,GACnC8F,EAAOxB,KAAK4B,aAAarE,GAG7B,GAAIiE,IAAS7G,EAAQ,CACjB,IAAIqF,KAAKsC,QAAQue,GAAUtjB,KACvByC,KAAKsC,QAAQyd,GAAaxiB,GAY1B,OAAO,KAXPkB,EAAOuB,KAAKsC,QAAQue,GAAUtjB,GAAUsjB,GAAWd,GAEnD,GACIve,EAAOxB,KAAK4B,aAAarE,SACpBiE,IAAS1G,GAAc0G,IAAS9F,GAErC8F,IAAS7G,IACTqF,KAAKuC,KAAKhF,GACVu0B,GAAoB15B,KAAK4H,KAAM8gB,IAK3C,CAcA,OAZIvjB,EAAS,GACTyC,KAAKuC,KAAKhF,GAGD,IAATkB,IACA+C,EAAOxB,KAAKrO,WAAWqO,KAAKgB,YACxBQ,IAASqf,IAAYrf,IAASue,IAC9B/f,KAAKnM,MAAM,4BAInBi+B,GAAoB15B,KAAK4H,KAAe,IAATvB,GACxBA,IAASshB,GAAc,IAAM/f,KAAKiM,QAAQtR,GAAUqF,KAAKiM,QAAQtR,EAC5E,CAGO,MACM4f,GAAY,CACrBxhB,EAAG,CAACuB,OAAQ,MACZusB,EAAG,CAACvsB,OAAQ,OAGT,SAASoP,KAEZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IAAIjI,EAAI,KACJ8tB,EAAI,KAGR,GAAI7mB,KAAKe,YAAcpG,EACnBm3B,GAAoB15B,KAAK4H,KApGd,OAqGX6mB,EAAI7mB,KAAKiM,QAAQtR,QAQhB,GAAIqF,KAAKe,YAAc7G,GAAS8F,KAAKvC,QAAQuC,KAAKgB,WAAY+e,IAK/D,OAJAhnB,EAAI,KAEJg5B,GAAe35B,KAAK4H,KAAM,EAAGskB,IAErBtkB,KAAKkB,SAAWlB,KAAKgB,YAIzB,KAAK,EACDhB,KAAK2B,OACLklB,EAAI1F,GAAS/oB,KAAK4H,MAClB,MAGJ,KAAK,EACD+xB,GAAe35B,KAAK4H,KAAM,EAAG+f,IAE7B/f,KAAK2B,OACL3B,KAAKwC,SAELsvB,GAAoB15B,KAAK4H,KAAM8gB,IAE/B+F,EAAI,IAAM7mB,KAAKiM,QAAQtR,GACvB,MAGJ,QACIo3B,GAAe35B,KAAK4H,KAAM,EAAG+f,IAC7BiB,GAAa5oB,KAAK4H,KAAM,EAAG8gB,IAC3B9gB,KAAK2B,OAELklB,EAAI7mB,KAAKmC,eAAetE,EAAQ,QASvC,GAAImC,KAAKe,YAAc7G,GAAU8F,KAAKsC,QAAQue,KAAa7gB,KAAK4B,WAAW,KAAO1H,EAAQ,CAC3F,IAAIuE,EAAO,EAWX,OAVA1F,EAAI,IAGAiH,KAAKsC,QAAQue,MACbpiB,EAAO,EACPuB,KAAK2B,QAGTowB,GAAe35B,KAAK4H,KAAM,EAAGskB,IAErBtkB,KAAKkB,SAAWlB,KAAKgB,YAIzB,KAAK,EACDhB,KAAK2B,OACLklB,EAAI1F,GAAS/oB,KAAK4H,MAClB,MAGJ,KAAK,EACD+xB,GAAe35B,KAAK4H,KAAM,EAAG+f,IAE7B/f,KAAK2B,OACL3B,KAAKwC,SAELsvB,GAAoB15B,KAAK4H,KAAM8gB,IAE/B+F,EAAI,IAAM7mB,KAAKiM,QAAQtR,GACvB,MAGJ,QACIo3B,GAAe35B,KAAK4H,KAAM,EAAG+f,IAC7BiB,GAAa5oB,KAAK4H,KAAM,EAAG8gB,IAC3B9gB,KAAK2B,OAELklB,EAAI7mB,KAAKmC,eAAetE,EAAQY,EAAO,GAEnD,MAOK,GAAIuB,KAAKe,YAAclG,EAAW,CACnC,MAAM/I,EAAOkO,KAAKrO,WAAWqO,KAAKgB,YAC5BvC,EAAO3M,IAAS+uB,IAAY/uB,IAASiuB,GAC3C,IAAI5mB,EAAI6G,KAAKgB,WAAavC,EAE1B,KAAOtF,EAAI6G,KAAKkB,UACPtF,EAAQoE,KAAKrO,WAAWwH,IADPA,KAMtBA,IAAM6G,KAAKgB,WAAavC,GACxBuB,KAAKnM,MAAM,sBAAuBmM,KAAKgB,WAAavC,GAGxDszB,GAAe35B,KAAK4H,KAAM7G,EAAI6G,KAAKgB,WAAYsjB,IAC/CvrB,EAAIiH,KAAKjM,UAAU8J,EAAO1E,GAKtBA,EAAI,IAAM6G,KAAKkB,UACflB,KAAK2B,OACLklB,EAAI1F,GAAS/oB,KAAK4H,QAElB+xB,GAAe35B,KAAK4H,KAAM7G,EAAI6G,KAAKgB,WAAa,EAAG+e,IAG/C5mB,EAAI,IAAM6G,KAAKkB,UACflB,KAAK2B,OACL3B,KAAKwC,SACLsvB,GAAoB15B,KAAK4H,KAAM8gB,IAC/B+F,EAAI,IAAM7mB,KAAKiM,QAAQtR,KAIvBqmB,GAAa5oB,KAAK4H,KAAM7G,EAAI6G,KAAKgB,WAAa,EAAG8f,IACjD9gB,KAAK2B,OACLklB,EAAI7mB,KAAKmC,eAAehJ,EAAI,IAGxC,MACI6G,KAAKnM,QAWT,OARU,OAANkF,GAAcA,EAAEpH,WAAW,KAAOkvB,KAClC9nB,EAAIA,EAAEqP,OAAO,IAGP,OAANye,GAAcA,EAAEl1B,WAAW,KAAOkvB,KAClCgG,EAAIA,EAAEze,OAAO,IAGV,CACH5G,KAAM,UACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClCjI,IACA8tB,IAER,+CAEO,SAAkBtc,GACrB,GAAIA,EAAKxR,EAAG,CACR,MAAMA,GACS,OAAXwR,EAAKxR,GACO,MAAZwR,EAAKxR,EADc,IAER,OAAXwR,EAAKxR,GAAc,OACnBwR,EAAKxR,EAAI,IAEb,GAAIwR,EAAKsc,EAAG,CACR,MAAMA,EAAkB,MAAdtc,EAAKsc,EAAE,IAA4B,MAAdtc,EAAKsc,EAAE,GAChCtc,EAAKsc,EACL,IAAMtc,EAAKsc,EACjB7mB,KAAKW,SAAS5H,EAAI8tB,EACtB,MACI7mB,KAAKW,SAAS5H,EAEtB,MACIiH,KAAKW,SAAS4J,EAAKsc,EAE3B,OAhMoB,kCC5FpB,SAASoL,KACL,OAAOjyB,KAAKkyB,IAAIlyB,KAAKiL,yCAAyC,EAClE,CAEA,SAASknB,KACL,IAAK,IAAgB3wB,EAAZjE,EAAS,EAASiE,EAAOxB,KAAK4B,WAAWrE,GAASA,IAAU,CACjE,GAAIiE,IAAS/F,EACT,OAAO,EAGX,GAAI+F,IAAShG,GACTgG,IAASpH,EACT,OAAO,CAEf,CAEA,OAAO,CACX,CAGO,MAEMmgB,GAAY,CACrBjiB,KAAMgC,OACN+yB,QAAS,CAAC,gBAAiB,MAAO,MAClCjQ,MAAO,CAAC,QAAS,OAGd,SAAS1T,GAAM0oB,GAAgB,GAClC,MAAMv0B,EAAQmC,KAAKgB,WACnB,IAAI1I,EACA+5B,EACAhF,EAAU,KACVjQ,EAAQ,KAqBZ,OAnBApd,KAAKkM,IAAI9R,GAET9B,EAAO0H,KAAKmC,eAAetE,EAAQ,GACnCw0B,EAAgB/5B,EAAKK,cACrBqH,KAAKwC,UAGY,IAAbxC,KAAKa,KACLb,KAAKe,YAAcvF,GACnBwE,KAAKe,YAAc7F,IAEfmyB,EADArtB,KAAK2K,mBACK3K,KAAKuL,kBAAkBvL,KAAKsyB,cAAcC,KAAKvyB,KAAM1H,EAAM85B,GAAgBH,IAE3EA,GAAW75B,KAAK4H,KAAMA,KAAKc,YAGzCd,KAAKwC,UAGDxC,KAAKe,WACT,KAAK7F,EACD8E,KAAK2B,OACL,MAEJ,KAAKnG,EACDwE,KAAKkM,IAAI1Q,GAIL4hB,EAFA9jB,eAAelB,KAAK4H,KAAKqK,OAAQgoB,IACW,mBAArCryB,KAAKqK,OAAOgoB,GAAejV,MAC1Bpd,KAAKqK,OAAOgoB,GAAejV,MAAMhlB,KAAK4H,KAAMoyB,GAG5CpyB,KAAK6b,MAAMsW,GAAyB/5B,KAAK4H,OAGhDA,KAAKa,KACNb,KAAKkM,IAAIzQ,GAMrB,MAAO,CACH+F,KAAM,SACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,OACA+0B,UACAjQ,QAER,+CAEO,SAAkB7S,GACrBvK,KAAK8Y,MAAM1e,EAAW,IAAMmQ,EAAKjS,MAEZ,OAAjBiS,EAAK8iB,SACLrtB,KAAKuK,KAAKA,EAAK8iB,SAGf9iB,EAAK6S,OACLpd,KAAK8Y,MAAMtd,EAAkB,KAC7BwE,KAAKuK,KAAKA,EAAK6S,OACfpd,KAAK8Y,MAAMrd,EAAmB,MAE9BuE,KAAK8Y,MAAM5d,EAAW,IAE9B,OAhFoB,2CACO,WCjBpB,SAASwO,GAAMpR,GAClB,IAAIL,EAAW,KAyBf,OAvBa,OAATK,IACAA,EAAOA,EAAKK,eAGhBqH,KAAKwC,SAKDvK,EAHAqB,eAAelB,KAAK4H,KAAKqK,OAAQ/R,IACI,mBAA9B0H,KAAKqK,OAAO/R,GAAM+0B,QAEdrtB,KAAKqK,OAAO/R,GAAM+0B,QAAQj1B,KAAK4H,MAG/BA,KAAKwI,aAAaxI,KAAKoK,MAAMkoB,eAG5CtyB,KAAKwC,UAEY,IAAbxC,KAAKa,KACLb,KAAKe,YAAcvF,GACnBwE,KAAKe,YAAc7F,GACnB8E,KAAKnM,MAAM,kCAGR,CACH2N,KAAM,gBACNqL,IAAK7M,KAAK4M,oBAAoB3U,GAC9BA,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,EAClB,OAzCoB,mCAEK,CACrBtS,SAAU,CAAC,iBAFY,kBCE3B,MAAMu6B,GAAa,GACb1N,GAAW,GACX2N,GAAa,GACbC,GAAmB,GACnBpN,GAAe,IACfqN,GAAQ,IAEd,SAASC,KACD5yB,KAAKa,KACLb,KAAKnM,MAAM,2BAGf,MAAMgK,EAAQmC,KAAKgB,WACnB,IAAI6xB,GAAc,EAoBlB,OAlBI7yB,KAAKsC,QAAQwiB,KACb+N,GAAc,EACd7yB,KAAK2B,QACG3B,KAAKsC,QAAQgjB,KACrBtlB,KAAKkM,IAAIhS,GAGT8F,KAAKsC,QAAQgjB,IACTtlB,KAAKrO,WAAWqO,KAAKgB,WAAa,KAAOyxB,IACzCzyB,KAAK2B,OACL3B,KAAKkM,IAAIhS,IACF24B,GACP7yB,KAAKnM,MAAM,yBAA0BmM,KAAKkB,UAEvC2xB,GACP7yB,KAAKnM,MAAM,6BAGR,CACH2N,KAAM,aACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,KAAM0H,KAAKmC,eAAetE,GAElC,CAEA,SAASi1B,KACL,MAAMj1B,EAAQmC,KAAKgB,WACblP,EAAOkO,KAAKrO,WAAWkM,GAsB7B,OApBI/L,IAAS2gC,IACT3gC,IAAS6gC,IACT7gC,IAAS4gC,IACT5gC,IAAS0gC,IACT1gC,IAASgzB,IACThzB,IAASwzB,IAETtlB,KAAKnM,MAAM,0DAGfmM,KAAK2B,OAED7P,IAAS2gC,KACJzyB,KAAKsC,QAAQmwB,KACdzyB,KAAKnM,MAAM,0BAGfmM,KAAK2B,QAGF3B,KAAKmC,eAAetE,EAC/B,CAIO,MACM0c,GAAY,CACrBjiB,KAAM,aACNy6B,QAAS,CAACz4B,OAAQ,MAClBhH,MAAO,CAAC,SAAU,aAAc,MAChC0/B,MAAO,CAAC14B,OAAQ,OAGb,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IAAI1I,EACAy6B,EAAU,KACVz/B,EAAQ,KACR0/B,EAAQ,KAgCZ,OA9BAhzB,KAAKkM,IAAI9Q,GACT4E,KAAKwC,SAELlK,EAAOs6B,GAAiBx6B,KAAK4H,MAC7BA,KAAKwC,SAEDxC,KAAKe,YAAc1F,IAEf2E,KAAKe,YAAc7G,IACnB64B,EAAUD,GAAY16B,KAAK4H,MAE3BA,KAAKwC,SAELlP,EAAQ0M,KAAKe,YAAckX,EACrBjY,KAAK1F,SACL0F,KAAKizB,aAEXjzB,KAAKwC,UAILxC,KAAKe,YAAc7G,IACnB84B,EAAQhzB,KAAKiM,QAAQ/R,GAErB8F,KAAKwC,WAIbxC,KAAKkM,IAAI7Q,GAEF,CACHmG,KAAM,oBACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,OACAy6B,UACAz/B,QACA0/B,QAER,+CAEO,SAAkBzoB,GACrBvK,KAAK8Y,MAAMpe,EAAO,KAClBsF,KAAKuK,KAAKA,EAAKjS,MAEM,OAAjBiS,EAAKwoB,UACL/yB,KAAKW,SAAS4J,EAAKwoB,SACnB/yB,KAAKuK,KAAKA,EAAKjX,QAGA,OAAfiX,EAAKyoB,OACLhzB,KAAK8Y,MAAM5e,EAAOqQ,EAAKyoB,OAG3BhzB,KAAK8Y,MAAMpe,EAAO,IACtB,OArEoB,4CCnEpB,SAASu3B,KACL,OAAOjyB,KAAKkyB,IAAI,MAAM,EAC1B,CACA,SAASgB,KACL,OAAOlzB,KAAKuL,kBAAkBvL,KAAK4b,KAAMqW,GAC7C,CACA,SAASkB,KACL,OAAOnzB,KAAKkyB,IAAIlyB,KAAKmL,+BAA+B,EACxD,CACA,SAASioB,KACL,GAAIpzB,KAAKe,YAAc7F,EACnB,OAAOi4B,GAAsB/6B,KAAK4H,KAAMA,KAAKc,YAGjD,MAAMyJ,EAAOvK,KAAKuL,kBAAkBvL,KAAK+b,YAAaoX,IAMtD,OAJInzB,KAAKe,YAAc7F,GACnB8E,KAAK2B,OAGF4I,CACX,CAYO,SAASb,GAAM2pB,GAClB,MAAM7nB,EAAW6nB,EAAeD,GAAqBF,GAC/Cr1B,EAAQmC,KAAKgB,WACnB,IAAI/I,EAAW+H,KAAK0I,aAEpB4Z,EACA,MAAQtiB,KAAKa,KACT,OAAQb,KAAKe,WACT,KAAKtF,EACD,MAAM6mB,EAEV,KAAKxnB,EACL,KAAKY,EACDsE,KAAK2B,OACL,MAEJ,KAAKvH,EACDnC,EAAS5F,KAAK2N,KAAKuL,kBAAkBvL,KAAK2b,OAAO4W,KAAKvyB,KAAMqzB,GAAepB,KAC3E,MAEJ,QACQoB,GAAgBrzB,KAAKsC,QAxDvB,IAyDErK,EAAS5F,KAAK6gC,GAAY96B,KAAK4H,OAE/B/H,EAAS5F,KAAKmZ,EAASpT,KAAK4H,OAK5C,MAAO,CACHwB,KAAM,QACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC/I,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,GAAMrG,IACE,gBAAdA,EAAK1C,MACLxB,KAAK8Y,MAAM5d,EAAW,IAC1B,GAER,OApDoB,2BAEK,CACrBjD,SAAU,CAAC,CACP,SACA,OACA,6BALmB,UCvBpB,SAASyR,GAAMlB,EAAcC,GAChC,MAAM5K,EAAQmC,KAAKgB,WACnB,IAAI/I,EAAW,KAUf,OARA+H,KAAKkM,IAAI9Q,GAETnD,EAAWuQ,EAAapQ,KAAK4H,KAAMyI,GAE9BzI,KAAKa,KACNb,KAAKkM,IAAI7Q,GAGN,CACHmG,KAAM,WACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC/I,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK8Y,MAAMpe,EAAO,KAClBsF,KAAK/H,SAASsS,GACdvK,KAAK8Y,MAAMpe,EAAO,IACtB,OA5BoB,8BACK,CACrBzC,SAAU,CAAC,OCHR,SAASyR,KACZ,MAAM7L,EAAQmC,KAAKgB,WAInB,OAFAhB,KAAKkM,IAAIlR,GAEF,CACHwG,KAAM,MACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAE1C,+CAEO,WACHhB,KAAK8Y,MAAM9d,EAAK,SACpB,OAhBoB,yBACK,KCElB,SAAS0O,KACZ,MAAM7L,EAAQmC,KAAKgB,WAInB,OAFAhB,KAAKkM,IAAInR,GAEF,CACHyG,KAAM,MACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAE1C,+CAEO,WACHhB,KAAK8Y,MAAM/d,EAAK,UACpB,OAhBoB,yBACK,KCDzB,MAIawf,GAAY,CACrBjiB,KAAMgC,QAGH,SAASoP,KAGZ,OAFA1J,KAAK0M,SATQ,IAWN,CACHlL,KAAM,gBACNqL,IAAK7M,KAAKE,YAAYF,KAAKgB,WAAa,EAAGhB,KAAKkB,UAChD5I,KAAM0H,KAAKiM,QAAQ/R,GAE3B,+CAEO,SAAkBqQ,GACrBvK,KAAK8Y,MAAMpe,EAAO,KAClBsF,KAAK8Y,MAAM5e,EAAOqQ,EAAKjS,KAC3B,OAlBoB,wCCHpB,MAMaiiB,GAAY,CACrBjiB,KAAMgC,QAIH,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IAAI1I,EAEJ,OAAQ0H,KAAKe,WACT,KAAKjG,EACDxC,EAAO,IACP,MAEJ,KAAKoC,EACD,OAAQsF,KAAKrO,WAAWqO,KAAKgB,aACzB,KApBQ,GAqBR,KAvBC,GAwBD,KArBF,IAsBMhB,KAAK2B,OACL,MAEJ,KA3BA,GA4BI3B,KAAK2B,OACL3B,KAAKyM,SAAS,QACdzM,KAAK0M,SA9BT,IA+BI,MAEJ,QACI1M,KAAKnM,MAAM,0BAGnByE,EAAO0H,KAAKmC,eAAetE,GAInC,MAAO,CACH2D,KAAM,aACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,OAER,+CAEO,SAAkBiS,GACrBvK,KAAKW,SAAS4J,EAAKjS,KACvB,OA9CoB,qCCLpB,MAKaiiB,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IAAIlD,EAAMkC,KAAKkB,SAUf,OARAlB,KAAKkM,IAAIxQ,GAEJoC,EAAMD,EAAQ,GAAM,GAfZ,KAgBTmC,KAAKrO,WAAWmM,EAAM,IAfd,KAgBRkC,KAAKrO,WAAWmM,EAAM,KACtBA,GAAO,GAGJ,CACH0D,KAAM,UACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1N,MAAO0M,KAAKjM,UAAU8J,EAAQ,EAAGC,GAEzC,+CAEO,SAAkByM,GACrBvK,KAAK8Y,MAAMpd,EAAS,KAAO6O,EAAKjX,MAAQ,KAC5C,OA1BoB,kCCKpB,MAAMggC,GAAqB,IAAIzb,IAAI,CAAC5c,EAAOM,ExDTxB,IwDYNgf,GAAY,CACrBgZ,KAAMj5B,OACNrC,SAAU,CAAC,CACP,aACA,UACA,kBACA,eACA,yBAIR,SAASu7B,GAAeD,GACpB,OAAIvzB,KAAK6B,gBAAgB,KAAO3H,GAC5Bo5B,GAAmBhhB,IAAItS,KAAK6B,gBAAgB,IACrC7B,KAAKyzB,QAAQF,GAGjBvzB,KAAK0zB,aAAaH,EAC7B,CAEA,MAAMI,GAAc,CAChBC,MAAOJ,GACPK,UAAWL,GACXM,QAAAA,GACI,OAAO9zB,KAAK+zB,qBAChB,GAGG,SAASrqB,GAAM6pB,EAAO,SACzB,MAAMt7B,EAAW+H,KAAK0I,aAEtB4Z,EAAM,MAAQtiB,KAAKa,KACf,OAAQb,KAAKe,WACT,KAAKrF,EACL,KAAKZ,EACDkF,KAAK2B,OACL,SAEJ,KAAKzH,EACDjC,EAAS5F,KAAK2N,KAAKizB,cACnB,MAEJ,KAAK33B,EAAiB,CAClB,IAAI4iB,EAAOle,KAAKuL,mBACZ,IAAMooB,GAAYJ,GAAMn7B,KAAK4H,KAAMuzB,KACnC,IAAM,OAGLrV,IACDA,EAAOle,KAAKuL,mBACR,KACIvL,KAAKkM,IAAI5Q,GACT,MAAM04B,EAAMh0B,KAAKi0B,UAAUV,GAE3B,OADAvzB,KAAKkM,IAAI3Q,GACFy4B,CAAG,IAEd,IACWh0B,KAAKk0B,gBAAgBX,MAKxCt7B,EAAS5F,KAAK6rB,GACd,KACJ,CAEA,KAAKzd,EAAe,CAChB,IAAIyd,EAAOle,KAAKuL,mBACZ,IAAMvL,KAAKm0B,gBAAgBZ,KAC3B,IAAM,OAGLrV,IACDA,EAAOle,KAAKk0B,gBAAgBX,IAGhCt7B,EAAS5F,KAAK6rB,GACd,KACJ,CAEA,QACI,MAAMoE,EAQlB,OAJIrqB,EAAS6M,SACT9E,KAAKnM,MAAM,yBAGR,CACH2N,KAAM,YACNqL,IAAK7M,KAAK4M,oBAAoB3U,GAC9Bs7B,OACAt7B,WAER,+CAEO,SAAkBsS,GACrBA,EAAKtS,SAASmN,SAAQwD,IACC,cAAfA,EAAMpH,MACNxB,KAAK8Y,MAAMxd,EAAiB,KAC5B0E,KAAKuK,KAAK3B,GACV5I,KAAK8Y,MAAMvd,EAAkB,MAE7ByE,KAAKuK,KAAK3B,EACd,GAER,OA5GoB,oCCHpB,MAAMK,GAAkB,GAClBC,GAAa,GACbspB,GAAa,GACb9N,GAAY,GACZI,GAAW,GACXjE,GAAW,GACXuT,GAAU,GAEhB,SAASC,KACL,OAAOr0B,KAAKkyB,IAAIlyB,KAAKkL,wCAAwC,EACjE,CAEA,SAASopB,KACL,OAAOt0B,KAAKkyB,IAAIlyB,KAAKkL,wCAAwC,EACjE,CAEA,SAASqpB,KACL,MAAMC,EAAkBx0B,KAAKc,WACvBxN,EAAQ0M,KAAKy0B,QAUnB,MARmB,QAAfnhC,EAAMkO,OACO,IAAbxB,KAAKa,KACLb,KAAKe,YAAc7F,IACe,IAAlC8E,KAAKsC,QAAQ2G,MAC2B,IAAxCjJ,KAAKoC,cAAcoyB,IACnBx0B,KAAKnM,QAGFP,CACX,CAEO,MAEMinB,GAAY,CACrBma,UAAW,CAAC5+B,QAASwE,QACrBmmB,SAAUnmB,OACVhH,MAAO,CAAC,QAAS,QAGd,SAASoW,KACZ,MAAM7L,EAAQmC,KAAKgB,WACb0B,EAAa1C,KAAKc,WAClB2f,EAAW2G,GAAahvB,KAAK4H,MAC7B20B,EAAiBxU,GAAiBM,GAClC5V,EAAa8pB,EAAiB30B,KAAK8K,oBAAsB9K,KAAK6K,WAC9DonB,EAAa0C,EAAiBL,GAA2BD,GAC/D,IACI/gC,EADAohC,GAAY,EAGhB10B,KAAKwC,SACLxC,KAAKkM,IAAIjR,GAET,MAAM25B,EAAa50B,KAAKc,WAYxB,GAVK6zB,GACD30B,KAAKwC,SAILlP,EADAuX,EACQ7K,KAAKuL,kBAAkBgpB,GAActC,GAErCA,EAAW75B,KAAK4H,KAAMA,KAAKc,YAGnC6zB,GAAiC,UAAfrhC,EAAMkO,MAAoBlO,EAAM2E,SAAS6M,QAC3D,IAAK,IAAIvH,EAASq3B,EAAa50B,KAAKc,WAAYvD,GAAU,EAAGA,IACzD,GAAIyC,KAAK4B,WAAWrE,KAAYzC,EAAY,CACxCxH,EAAM2E,SAAS2N,WAAW,CACtBpE,KAAM,aACNqL,IAAK,KACLvZ,MAAO,MAEX,KACJ,CAkBR,OAdI0M,KAAKsC,QAAQ2G,MACbyrB,EAAYG,GAAaz8B,KAAK4H,MAC9BA,KAAKwC,WAMQ,IAAbxC,KAAKa,KACLb,KAAKe,YAAc7F,IACgB,IAAnC8E,KAAKoC,cAAcM,IACnB1C,KAAKnM,QAGF,CACH2N,KAAM,cACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC0zB,YACAjU,WACAntB,QAER,CAaA,SAAS8zB,KACL,MAAMvpB,EAAQmC,KAAKgB,WAGnB,GAAIhB,KAAKe,YAAcrG,EACnB,OAAQsF,KAAKrO,WAAWqO,KAAKgB,aACzB,KAAK8jB,GACL,KAAK0N,GACL,KAAK3R,GACL,KAAK3X,GACL,KAAKwb,GACD1kB,KAAK2B,OACL,MAGJ,KAAKyyB,GACDp0B,KAAK2B,OACD3B,KAAKsC,QAAQ8xB,KACbp0B,KAAK2B,OAYrB,OANI3B,KAAKe,YAAc1G,EACnB2F,KAAKkM,IAAI7R,GAET2F,KAAKkM,IAAIhS,GAGN8F,KAAKmC,eAAetE,EAC/B,CAGA,SAASg3B,KACL70B,KAAKkM,IAAIxR,GACTsF,KAAKwC,SAEL,MAAMkyB,EAAY10B,KAAKiM,QAAQ/R,GAI/B,MAAqB,cAAdw6B,GAAmCA,CAC9C,+CAtDO,SAAkBnqB,GACrBvK,KAAK8Y,MAAM5e,EAAOqQ,EAAKkW,UACvBzgB,KAAK8Y,MAAM7d,EAAO,KAClB+E,KAAKuK,KAAKA,EAAKjX,OAEXiX,EAAKmqB,YACL10B,KAAK8Y,MAAMpe,EAAO,KAClBsF,KAAK8Y,MAAM5e,GAA0B,IAAnBqQ,EAAKmqB,UAAqB,YAAcnqB,EAAKmqB,WAEvE,OA9EoB,gDACO,gBCjC3B,SAASzC,KACL,OAAOjyB,KAAKkyB,IAAIlyB,KAAKmL,+BAA+B,EACxD,CAWO,SAASzB,KACZ,MAAMzR,EAAW+H,KAAK0I,aAGtB,MAAQ1I,KAAKa,KACT,OAAQb,KAAKe,WACT,KAAKjG,EACL,KAAKY,EACL,KAAKR,EACD8E,KAAK2B,OACL,MAEJ,KAAKvH,EACDnC,EAAS5F,KAAK2N,KAAKuL,kBAAkBvL,KAAK2b,OAAO4W,KAAKvyB,MAAM,GAAOiyB,KACnE,MAEJ,QACQjyB,KAAKsC,QAhCP,IAiCErK,EAAS5F,KAAK2N,KAAKuL,kBAAkBvL,KAAK4b,KAAMqW,KAEhDh6B,EAAS5F,KAAK2N,KAAKuL,kBAAkBvL,KAAK+b,YAAakW,KAKvE,MAAO,CACHzwB,KAAM,kBACNqL,IAAK7M,KAAK4M,oBAAoB3U,GAC9BA,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,GAAMrG,IACE,gBAAdA,EAAK1C,MACLxB,KAAK8Y,MAAM5d,EAAW,IAC1B,GAER,OA/CoB,qCACK,CACrBjD,SAAU,CAAC,CACP,cACA,SACA,YChBD,MACMsiB,GAAY,CACrBjnB,MAAOgH,OACPuoB,KAAMvoB,QAGH,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WACb1N,EAAQ0M,KAAKxB,cAAc3D,GAEjC,MAAO,CACH2G,KAAM,YACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1N,QACAuvB,KAAM7iB,KAAKjM,UAAU8J,EAAQvK,EAAMnB,OAAQ6N,KAAKgB,YAExD,+CAEO,SAAkBuJ,GACrBvK,KAAK8Y,MAAMje,EAAW0P,EAAKjX,MAAQiX,EAAKsY,KAC5C,OApBoB,oCCSpB,MAGatI,GAAY,CACrBgZ,KAAMj5B,OACNhC,KAAMgC,OACNhH,MAAO,CAAC,aAAc,SAAU,YAAa,QAAS,WAAY,OAG/D,SAASoW,GAAM6pB,GAClB,MAAM11B,EAAQmC,KAAKgB,WACnB,IAAI1I,EACAhF,EAAQ,KAQZ,GANA0M,KAAKkM,IAAI5Q,GACT0E,KAAKwC,SAELlK,EAAO0H,KAAKiM,QAAQ/R,GACpB8F,KAAKwC,SAEDxC,KAAKe,YAAcxF,EAAkB,CAIrC,OAHAyE,KAAKkM,IAAIjR,GACT+E,KAAKwC,SAEGxC,KAAKe,WACT,KAAKpG,EAEGrH,EADA0M,KAAK4L,gBAAgB,KAAOlR,EACpBsF,KAAK80B,QAEL90B,KAAKrF,SAGjB,MAEJ,KAAKE,EACDvH,EAAQ0M,KAAKnF,YACb,MAEJ,KAAKX,EACD5G,EAAQ0M,KAAKizB,aACb,MAEJ,KAAKxyB,EACDnN,EAAQ0M,KAAKuL,mBACT,KACI,MAAMyoB,EAAMh0B,KAAK7F,SAAS6F,KAAKwI,aAAcxI,KAAKoK,MAAMqqB,OAQxD,OANAz0B,KAAKwC,SAEDxC,KAAKsC,QAjDjB,KAkDYtC,KAAKnM,QAGFmgC,CAAG,IAEd,IACWh0B,KAAK80B,UAGpB,MAEJ,QACI90B,KAAKnM,MAAM,sDAGnBmM,KAAKwC,QACT,CAMA,OAJKxC,KAAKa,KACNb,KAAKkM,IAAI3Q,GAGN,CACHiG,KAAM,UACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClCuyB,OACAj7B,OACAhF,QAER,+CAEO,SAAkBiX,GACrBvK,KAAK8Y,MAAMxd,EAAiB,KAC5B0E,KAAK8Y,MAAM5e,EAAOqQ,EAAKjS,MAEJ,OAAfiS,EAAKjX,QACL0M,KAAK8Y,MAAM7d,EAAO,KAClB+E,KAAKuK,KAAKA,EAAKjX,QAGnB0M,KAAK8Y,MAAMvd,EAAkB,IACjC,OAzFoB,kCCRb,MACMgf,GAAY,CACrBgZ,KAAMj5B,OACNy6B,QAASz6B,OACThH,MAAO,CAAC,cAAe,aAG3B,SAAS0hC,GAAiBzB,EAAMj7B,GAC5B,MACM2R,GADiBjK,KAAKmK,SAASopB,IAAS,CAAA,GAChBj7B,GAM9B,MAJsB,mBAAX2R,GACPjK,KAAKnM,MAAM,mBAAmByE,OAG3B2R,CACX,CAEO,SAASP,GAAM6pB,EAAO,WACzB,MAAM11B,EAAQmC,KAAKgB,WACbi0B,EAAej1B,KAAKmM,sBACpB+oB,EAAcF,GAAiB58B,KAAK4H,KAAMuzB,EAAM0B,EAAat8B,eAEnEqH,KAAKwC,SAEL,MAAMlP,EAAQ0M,KAAKuL,mBACf,KACI,MAAMipB,EAAkBx0B,KAAKc,WACvBxN,EAAQ4hC,EAAY98B,KAAK4H,MAO/B,OALiB,IAAbA,KAAKa,MACmC,IAAxCb,KAAKoC,cAAcoyB,IACnBx0B,KAAKnM,QAGFP,CAAK,IAEhB,IAAM0M,KAAKkyB,IAAI,MAAM,KAOzB,OAJKlyB,KAAKa,KACNb,KAAKkM,IAAI3Q,GAGN,CACHiG,KAAM,kBACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClCuyB,OACAwB,QAASE,EACT3hC,QAER,+CAEO,SAAkBiX,GACrBvK,KAAK8Y,MAAMrY,EAAe8J,EAAKwqB,QAAU,KACzC/0B,KAAKuK,KAAKA,EAAKjX,OACf0M,KAAK8Y,MAAMvd,EAAkB,IACjC,OAzDoB,0CCIpB,MAAM64B,GAAU,GACVnP,GAAe,GACfwN,GAAa,GACbvN,GAAkB,GAGX3K,GAAY,CACrBgZ,KAAMj5B,OACN66B,KAAM,CAAC,aAAc,SAAU,YAAa,QAAS,YACrDC,eAAgB96B,OAChB+6B,OAAQ,CAAC,aAAc,SAAU,YAAa,QAAS,YACvDC,gBAAiB,CAACh7B,OAAQ,MAC1Bi7B,MAAO,CAAC,aAAc,SAAU,YAAa,QAAS,WAAY,OAGtE,SAASC,KAGL,OAFAx1B,KAAKwC,SAEGxC,KAAKe,WACT,KAAKpG,EACD,OAAIqF,KAAKsC,QAAQ8xB,GAASp0B,KAAKgC,kBAAkB,IACtChC,KAAK80B,QAEL90B,KAAKrF,SAGpB,KAAKE,EACD,OAAOmF,KAAKnF,YAEhB,KAAKX,EACD,OAAO8F,KAAKizB,aAEhB,KAAKxyB,EACD,OAAOT,KAAKuL,mBACR,KACI,MAAMyoB,EAAMh0B,KAAK7F,SAAS6F,KAAKwI,aAAcxI,KAAKoK,MAAMqqB,OAQxD,OANAz0B,KAAKwC,SAEDxC,KAAKsC,QAAQ8xB,KACbp0B,KAAKnM,QAGFmgC,CAAG,IAEd,IACWh0B,KAAK80B,UAIxB,QACI90B,KAAKnM,MAAM,sDAEvB,CAEA,SAAS4hC,GAAeC,GAGpB,GAFA11B,KAAKwC,SAEDxC,KAAKsC,QAAQ2iB,KACbjlB,KAAKsC,QAAQ4iB,IAAkB,CAC/B,MAAM5xB,EAAQ0M,KAAK1C,OAAO0C,KAAKgB,YAI/B,OAFAhB,KAAK2B,OAED3B,KAAKsC,QAAQmwB,KACbzyB,KAAK2B,OACErO,EAAQ,KAGZA,CACX,CAEA,GAAI0M,KAAKsC,QAAQmwB,IACb,MAAO,IAGXzyB,KAAKnM,MAAM,YAAY6hC,EAAc,QAAU,yBACnD,CAEO,SAAShsB,GAAM6pB,EAAO,WACzB,MAAM11B,EAAQmC,KAAKgB,WAEnBhB,KAAKwC,SACLxC,KAAKkM,IAAI5Q,GAET,MAAM65B,EAAOK,GAASp9B,KAAK4H,MACrBo1B,EAAiBK,GAAer9B,KAAK4H,KAAoB,eAAdm1B,EAAK3zB,MAChD6zB,EAASG,GAASp9B,KAAK4H,MAC7B,IAAIs1B,EAAkB,KAClBC,EAAQ,KAUZ,OARIv1B,KAAK4L,gBAAgB,KAAOrQ,IAC5B+5B,EAAkBG,GAAer9B,KAAK4H,MACtCu1B,EAAQC,GAASp9B,KAAK4H,OAG1BA,KAAKwC,SACLxC,KAAKkM,IAAI3Q,GAEF,CACHiG,KAAM,eACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClCuyB,OACA4B,OACAC,iBACAC,SACAC,kBACAC,QAER,+CAEO,SAAkBhrB,GACrBvK,KAAK8Y,MAAMxd,EAAiB,KAC5B0E,KAAKuK,KAAKA,EAAK4qB,MACfn1B,KAAKW,SAAS4J,EAAK6qB,gBACnBp1B,KAAKuK,KAAKA,EAAK8qB,QAEX9qB,EAAKgrB,QACLv1B,KAAKW,SAAS4J,EAAK+qB,iBACnBt1B,KAAKuK,KAAKA,EAAKgrB,QAGnBv1B,KAAK8Y,MAAMvd,EAAkB,IACjC,OAtHoB,uCCRb,MAEMgf,GAAY,CACrBjiB,KAAMgC,OACNrC,SAAU,CAAC,KAIR,SAASyR,GAAMlB,EAAcC,GAChC,MAAM5K,EAAQmC,KAAKgB,WACb1I,EAAO0H,KAAKmM,sBACZkmB,EAAgB/5B,EAAKK,cAC3B,IAAIV,EAUJ,OARAA,EAAWwQ,EAAWnP,eAAe+4B,GAC/B5pB,EAAW4pB,GAAej6B,KAAK4H,KAAMyI,GACrCD,EAAapQ,KAAK4H,KAAMyI,GAEzBzI,KAAKa,KACNb,KAAKkM,IAAI3Q,GAGN,CACHiG,KAAM,WACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,OACAL,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK8Y,MAAMrY,EAAe8J,EAAKjS,KAAO,KACtC0H,KAAK/H,SAASsS,GACdvK,KAAK8Y,MAAMvd,EAAkB,IACjC,OAlCoB,6CACO,aCApB,MACMgf,GAAY,CACrBgZ,KAAMj5B,OACNgjB,SAAU,CAAChjB,OAAQ,MACnBrC,SAAU,CAAC,KAKR,SAASyR,GAAM6pB,GAClB,MAAM11B,EAAQmC,KAAKgB,WACnB,IAAIi0B,EAAe,KAEfj1B,KAAKe,YAAcN,EACnBw0B,EAAej1B,KAAKmM,sBAEpBnM,KAAKkM,IAAI5Q,GAGb,MAAMrD,EAAW+H,KAAKuL,mBAClB,KACI,MAAMipB,EAAkBx0B,KAAKc,WACvB7I,EAAW+H,KAAKwI,aAAaxI,KAAKoK,MAAMqqB,OAO9C,OALiB,IAAbz0B,KAAKa,MACmC,IAAxCb,KAAKoC,cAAcoyB,IACnBx0B,KAAKnM,QAGFoE,CAAQ,IAEnB,IAAM+H,KAAKoL,qBACPpL,KAAKkyB,IAAI,MAAM,MAQvB,OAJKlyB,KAAKa,KACNb,KAAKkM,IAAI3Q,GAGN,CACHiG,KAAM,kBACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClCuyB,OACAjW,SAAU2X,EACVh9B,WAER,+CAEO,SAAkBsS,GACjBA,EAAK+S,SACLtd,KAAK8Y,MAAMrY,EAAe8J,EAAK+S,SAAW,KAE1Ctd,KAAK8Y,MAAMxd,EAAiB,KAGhC0E,KAAK/H,SAASsS,GACdvK,KAAK8Y,MAAMvd,EAAkB,IACjC,OA1DoB,0CCJb,MAEMgf,GAAY,CACrBjnB,MAAOgH,QAEJ,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WAInB,OAFAhB,KAAKkM,IAAI7R,GAEF,CACHmH,KAAM,OACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1N,MAAO0M,KAAKmC,eAAetE,EAAQ,GAE3C,+CACO,SAAkB0M,GACrBvK,KAAK8Y,MAAMze,EAAM,IAAMkQ,EAAKjX,MAChC,OAjBoB,iCADD,QCDZ,MACMinB,GAAY,CACrBjiB,KAAMgC,QAGH,SAASoP,KACZ,MAAO,CACHlI,KAAM,aACNqL,IAAK7M,KAAKE,YAAYF,KAAKgB,WAAYhB,KAAKkB,UAC5C5I,KAAM0H,KAAKiM,QAAQ/R,GAE3B,+CAEO,SAAkBqQ,GACrBvK,KAAK8Y,MAAM5e,EAAOqQ,EAAKjS,KAC3B,OAfoB,qCCAb,MACMiiB,GAAY,CACrBjiB,KAAMgC,QAGH,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WAKnB,OAFAhB,KAAKkM,IAAI7R,GAEF,CACHmH,KAAM,aACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,KAAM0H,KAAKmC,eAAetE,EAAQ,GAE1C,+CAEO,SAAkB0M,GAIrBvK,KAAK8Y,MAAMpe,EAAO,IAAM6P,EAAKjS,KACjC,OAvBoB,qCCApB,MAGaiiB,GAAY,CACrBjiB,KAAMgC,QAGH,SAASoP,KACZ,IAAIpR,EAAO0H,KAAKiM,QAAQ/R,GAExB,KAAO8F,KAAKsC,QAVC,KAWTtC,KAAKkM,IAAIxR,GACTpC,GAAQ,IAAM0H,KAAKiM,QAAQ/R,GAG/B,MAAO,CACHsH,KAAM,QACNqL,IAAK7M,KAAKE,YAAYF,KAAKgB,WAAYhB,KAAKkB,UAC5C5I,OAER,+CAEO,SAAkBiS,GACrBvK,KAAKW,SAAS4J,EAAKjS,KACvB,OAtBoB,gCCKb,SAASoR,KACZ,MAAMzR,EAAW+H,KAAK0I,aAItB,IAFA1I,KAAKwC,UAEGxC,KAAKa,MACT5I,EAAS5F,KAAK2N,KAAK21B,SAEf31B,KAAKe,YAAc5F,IAIvB6E,KAAK2B,OACL3B,KAAKwC,SAGT,MAAO,CACHhB,KAAM,YACNqL,IAAK7M,KAAK4M,oBAAoB3U,GAC9BA,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,GAAM,IAAMvK,KAAK8Y,MAAM3d,EAAO,MAChD,OAhCoB,+BACK,CACrBlD,SAAU,CAAC,CACP,kBCKD,MACMsiB,GAAY,CACrBqb,SAAU,CAACt7B,OAAQ,MACnBu7B,UAAW,CAACv7B,OAAQ,MACpBw7B,UAAW,CAAC,YAAa,OAGtB,SAASpsB,KACZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IAAI40B,EAAW,KACXC,EAAY,KACZC,EAAY,KAIhB,GAFA91B,KAAKwC,SAEDxC,KAAKe,YAAc7G,GAAS8F,KAAK6B,gBAAgB,KAAOvG,EAAiB,CAEzE,MAAM2nB,EAAQjjB,KAAKiM,QAAQ/R,GACrB67B,EAAiB9S,EAAMtqB,cAU7B,OARuB,QAAnBo9B,GAA+C,SAAnBA,GAC5B/1B,KAAKwC,SACLozB,EAAWG,EACXF,EAAY71B,KAAKiM,QAAQ/R,IAEzB27B,EAAY5S,EAGRjjB,KAAK6B,gBAAgB,IACzB,KAAK3H,EAED8F,KAAKwC,SACLxC,KAAKyM,SAAS,OACdqpB,EAAY91B,KAAKi0B,UAAU,SAC3B,MAGJ,KAAKz4B,EACL,KAAKN,EACL,KAAKC,EACL,KtEhDO,EsEiDH,MAEJ,QACI6E,KAAKnM,MAAM,yCAEvB,MACI,OAAQmM,KAAKe,WACT,KAAK7G,EACL,KAAKoB,EACL,KAAKmF,EAEDq1B,EAAY91B,KAAKi0B,UAAU,SAC3B,MAGJ,KAAKz4B,EACL,KAAKN,EACL,KtElEO,EsEmEH,MAEJ,QACI8E,KAAKnM,MAAM,yCAIvB,MAAO,CACH2N,KAAM,aACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC40B,WACAC,YACAC,YAER,+CAEO,SAAkBvrB,GACjBA,EAAKsrB,WACDtrB,EAAKqrB,UACL51B,KAAK8Y,MAAM5e,EAAOqQ,EAAKqrB,UAG3B51B,KAAK8Y,MAAM5e,EAAOqQ,EAAKsrB,WAEnBtrB,EAAKurB,YACL91B,KAAK8Y,MAAM5e,EAAO,OAClB8F,KAAKuK,KAAKA,EAAKurB,aAEZvrB,EAAKurB,WACZ91B,KAAKuK,KAAKA,EAAKurB,UAEvB,OA1FoB,qCCDb,SAASpsB,KACZ,MAAMzR,EAAW+H,KAAK0I,aAItB,IAFA1I,KAAKwC,UAEGxC,KAAKa,MACT5I,EAAS5F,KAAK2N,KAAKg2B,cAEfh2B,KAAKe,YAAc5F,IAIvB6E,KAAK2B,OAGT,MAAO,CACHH,KAAM,iBACNqL,IAAK7M,KAAK4M,oBAAoB3U,GAC9BA,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,GAAM,IAAMvK,KAAK8Y,MAAM3d,EAAO,MAChD,OA/BoB,oCACK,CACrBlD,SAAU,CAAC,CACP,kBCGD,SAASyR,KACZ,MAAM7L,EAAQmC,KAAKgB,WAInB,OAFAhB,KAAK0M,SATS,IAWP,CACHlL,KAAM,kBACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAE1C,+CAEO,WACHhB,KAAK8Y,MAAMpe,EAAO,IACtB,OAjBoB,qCACK,CAAA,ICGlB,SAASgP,KACZ1J,KAAKwC,SAEL,MAAM3E,EAAQmC,KAAKgB,WACnB,IAEIi1B,EAFAn4B,EAAMD,EACNsf,EAAW,KAmBf,OAfI8Y,EADAj2B,KAAKiC,YAAY,EAAG,QAAUjC,KAAKiC,YAAY,EAAG,QAC5CjC,KAAKizB,aAELjzB,KAAKk2B,UAGfp4B,EAAMkC,KAAKgB,WACXhB,KAAKwC,SAEDxC,KAAKiC,YAAY,EAAG,QACpBjC,KAAK2B,OAELwb,EAAWnd,KAAKm2B,eAChBr4B,EAAMkC,KAAKgB,YAGR,CACHQ,KAAM,MACNqL,IAAK7M,KAAKE,YAAYrC,EAAOC,GAC7Bm4B,MACA9Y,WAER,+CAEO,SAAkB5S,GACrBvK,KAAKuK,KAAKA,EAAK0rB,KACO,OAAlB1rB,EAAK4S,WACLnd,KAAK8Y,MAAM5e,EAAO,MAClB8F,KAAKuK,KAAKA,EAAK4S,UAEvB,OA5CoB,yBACK,CACrB8Y,IAAK,CAAC,UAAW,cACjB9Y,SAAU,CAAC,eAAgB,SCHxB,MACM5C,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,KACZ,MAAO,CACHlI,KAAM,SACNqL,IAAK7M,KAAKE,YAAYF,KAAKgB,WAAYhB,KAAKkB,UAC5C5N,MAAO0M,KAAKiM,QAAQO,GAE5B,+CAEO,SAAkBjC,GACrBvK,KAAK8Y,MAAMtM,EAAajC,EAAKjX,MACjC,OAfoB,iCCDb,MACMinB,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WAInB,OAFAhB,KAAK2B,OAEE,CACHH,KAAM,WACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1N,MAAO0M,KAAKmC,eAAetE,GAEnC,+CAEO,SAAkB0M,GACrBvK,KAAKW,SAAS4J,EAAKjX,MACvB,OAnBoB,mCCSb,SAASoW,GAAMlB,EAAcC,GAChC,MAAM5K,EAAQmC,KAAKgB,WACnB,IAAI/I,EAAW,KAUf,OARA+H,KAAKkM,IAAI5Q,GAETrD,EAAWuQ,EAAapQ,KAAK4H,KAAMyI,GAE9BzI,KAAKa,KACNb,KAAKkM,IAAI3Q,GAGN,CACHiG,KAAM,cACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC/I,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK8Y,MAAMxd,EAAiB,KAC5B0E,KAAK/H,SAASsS,GACdvK,KAAK8Y,MAAMvd,EAAkB,IACjC,OA5BoB,iCACK,CACrBtD,SAAU,CAAC,OCLR,MACMsiB,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,KACZ,MAAO,CACHlI,KAAM,aACNqL,IAAK7M,KAAKE,YAAYF,KAAKgB,WAAYhB,KAAKkB,UAC5C5N,MAAO0M,KAAKxB,cAAc5D,GAElC,+CAEO,SAAkB2P,GACrBvK,KAAK8Y,MAAMle,EAAY2P,EAAKjX,MAAQ,IACxC,OAfoB,qCCMb,MAEMinB,GAAY,CACrBjiB,KAAMgC,OACNrC,SAAU,CAAC,CAAC,OAAQ,OAIjB,SAASyR,KACZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IACI1I,EACA+5B,EAFAp6B,EAAW,KA4Bf,OAxBA+H,KAAKkM,IAAIjR,GAEL+E,KAAKe,YAAcN,GACnBnI,EAAO0H,KAAKmM,sBACZkmB,EAAgB/5B,EAAKK,cAEjBqH,KAAK4L,gBAAgB,IAAMrQ,EAC3BtD,EAAW+H,KAAK0I,aACTpP,eAAelB,KAAK4H,KAAKsK,OAAQ+nB,IACxCryB,KAAKwC,SACLvK,EAAW+H,KAAKsK,OAAO+nB,GAAej6B,KAAK4H,MAC3CA,KAAKwC,WAELvK,EAAW+H,KAAK0I,aAChBzQ,EAAS5F,KACL2N,KAAKkyB,IAAI,MAAM,KAIvBlyB,KAAKkM,IAAI3Q,IAETjD,EAAO0H,KAAKiM,QAAQ/R,GAGjB,CACHsH,KAAM,sBACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,OACAL,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK8Y,MAAM7d,EAAO,KAEI,OAAlBsP,EAAKtS,SACL+H,KAAK8Y,MAAM5e,EAAOqQ,EAAKjS,OAEvB0H,KAAK8Y,MAAMrY,EAAe8J,EAAKjS,KAAO,KACtC0H,KAAK/H,SAASsS,GACdvK,KAAK8Y,MAAMvd,EAAkB,KAErC,OAxDoB,wDACO,aCFpB,MAEMgf,GAAY,CACrBjiB,KAAMgC,OACNrC,SAAU,CAAC,CAAC,OAAQ,OAIjB,SAASyR,KACZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IACI1I,EACA+5B,EAFAp6B,EAAW,KA6Bf,OAzBA+H,KAAKkM,IAAIjR,GACT+E,KAAKkM,IAAIjR,GAEL+E,KAAKe,YAAcN,GACnBnI,EAAO0H,KAAKmM,sBACZkmB,EAAgB/5B,EAAKK,cAEjBqH,KAAK4L,gBAAgB,IAAMrQ,EAC3BtD,EAAW+H,KAAK0I,aACTpP,eAAelB,KAAK4H,KAAKsK,OAAQ+nB,IACxCryB,KAAKwC,SACLvK,EAAW+H,KAAKsK,OAAO+nB,GAAej6B,KAAK4H,MAC3CA,KAAKwC,WAELvK,EAAW+H,KAAK0I,aAChBzQ,EAAS5F,KACL2N,KAAKkyB,IAAI,MAAM,KAIvBlyB,KAAKkM,IAAI3Q,IAETjD,EAAO0H,KAAKiM,QAAQ/R,GAGjB,CACHsH,KAAM,wBACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,OACAL,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK8Y,MAAM7d,EAAO,KAClB+E,KAAK8Y,MAAM7d,EAAO,KAEI,OAAlBsP,EAAKtS,SACL+H,KAAK8Y,MAAM5e,EAAOqQ,EAAKjS,OAEvB0H,KAAK8Y,MAAMrY,EAAe8J,EAAKjS,KAAO,KACtC0H,KAAK/H,SAASsS,GACdvK,KAAK8Y,MAAMvd,EAAkB,KAErC,OA1DoB,0DACO,aCU3B,SAAS66B,KAGL,OAFAp2B,KAAKwC,SAEGxC,KAAKe,WACT,KAAKyL,EACD,OAAOxM,KAAKrF,SAEhB,KAAK8F,EACD,OAAOT,KAAK7F,SAAS6F,KAAKwI,aAAcxI,KAAKoK,MAAMqqB,OAEvD,QACIz0B,KAAKnM,MAAM,kCAEvB,CASO,SAAS6V,KACZ,MAAM7L,EAAQmC,KAAKgB,WACbm0B,EAAOiB,GAAYh+B,KAAK4H,MAC9B,IAAIu1B,EAAQ,KAQZ,OANAv1B,KAAKwC,SACDxC,KAAKsC,QAxCG,MAyCRtC,KAAK0M,SAzCG,IA0CR6oB,EAAQa,GAAYh+B,KAAK4H,OAGtB,CACHwB,KAAM,QACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClCm0B,OACAI,QAER,+CAEO,SAAkBhrB,GACrBvK,KAAKuK,KAAKA,EAAK4qB,MACfn1B,KAAK8Y,MAAMpe,EAAO,KACd6P,EAAKgrB,MACLv1B,KAAKuK,KAAKA,EAAKgrB,OAEfv1B,KAAKuK,KAAKiC,EAAa,EAE/B,OAlCoB,2BACK,CACrB2oB,KAAM,CAAC,SAAU,YACjBI,MAAO,CAAC,SAAU,WAAY,SClClC,SAASc,KACL,OAAIr2B,KAAKc,WAAa,GACdd,KAAK4B,YAAY,KAAO9G,EACjBkF,KAAKc,WAAa,EACnBd,KAAKkC,cAAclC,KAAKc,WAAa,GACrCd,KAAKiB,gBAIZjB,KAAKgB,UAChB,CAEO,MACMuZ,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,GAAM4sB,EAAcC,GAChC,MAAMh3B,EAAcS,KAAKkC,cAAclC,KAAKc,YAC5C,IAAI01B,EAUJ,OARAx2B,KAAKyC,kBAAkBzC,KAAKc,WAAYw1B,GAAgBt2B,KAAK+K,wBAGzDyrB,EADAD,GAAqBv2B,KAAKgB,WAAazB,EAC3B82B,GAAmBj+B,KAAK4H,MAExBA,KAAKgB,WAGd,CACHQ,KAAM,MACNqL,IAAK7M,KAAKE,YAAYX,EAAai3B,GACnCljC,MAAO0M,KAAKjM,UAAUwL,EAAai3B,GAE3C,+CAEO,SAAkBjsB,GACrBvK,KAAKW,SAAS4J,EAAKjX,MACvB,OA1BoB,8BCZpB,SAAS2+B,KACL,OAAOjyB,KAAKkyB,IAAIlyB,KAAKgL,8BAA8B,EACvD,CAEA,SAASyrB,KACL,MAAMpJ,EAAUrtB,KAAKm2B,eAQrB,MANqB,QAAjB9I,EAAQ7rB,OACK,IAAbxB,KAAKa,KACLb,KAAKe,YAAcvF,GACnBwE,KAAKnM,QAGFw5B,CACX,CASO,SAAS3jB,KACZ,MAAMhH,EAAa1C,KAAKc,WAClBvB,EAAcS,KAAKgB,WACzB,IAAIqsB,EACAjQ,EAiBJ,OAdIiQ,EADArtB,KAAK4K,iBACK5K,KAAKuL,kBAAkBkrB,GAAgBxE,IAEvCA,GAAW75B,KAAK4H,KAAM0C,GAGpC1C,KAAKwC,SACLxC,KAAKkM,IAAI1Q,GAET4hB,EAAQpd,KAAK6b,OAAM,GAEd7b,KAAKa,KACNb,KAAKkM,IAAIzQ,GAGN,CACH+F,KAAM,OACNqL,IAAK7M,KAAKE,YAAYX,EAAaS,KAAKgB,YACxCqsB,UACAjQ,QAER,+CACO,SAAkB7S,GACrBvK,KAAKuK,KAAKA,EAAK8iB,SACfrtB,KAAK8Y,MAAMtd,EAAkB,KAC7BwE,KAAKuK,KAAKA,EAAK6S,OACfpd,KAAK8Y,MAAMrd,EAAmB,IAClC,OAxCoB,0BAEK,CACrB4xB,QAAS,CAAC,eAAgB,OAC1BjQ,MAAO,CAAC,sBAHe,SCPpB,SAAS1T,KACZ,IAAI8S,EAAO,KACPka,EAAQ,KAEZ12B,KAAKwC,SAEL,MAAMjD,EAAcS,KAAKgB,WA0BzB,OAzBIhB,KAAKe,YAAczF,IACnB0E,KAAK2B,OACL3B,KAAKwC,SACLga,EAAOxc,KAAKuL,kBACRvL,KAAKm2B,cACL,IAAMn2B,KAAKkyB,KAAI,GAAO,KAE1BlyB,KAAKwC,SACLxC,KAAKkM,IAAI3Q,IAGTyE,KAAK4L,gBAAgB,KAAO1R,IAC5B8F,KAAKwC,SACLxC,KAAKyM,SAAS,MACdzM,KAAKwC,SACLxC,KAAKkM,IAAI5Q,GACT0E,KAAKwC,SACLk0B,EAAQ12B,KAAKuL,kBACTvL,KAAKm2B,cACL,IAAMn2B,KAAKkyB,KAAI,GAAO,KAE1BlyB,KAAKwC,SACLxC,KAAKkM,IAAI3Q,IAGN,CACHiG,KAAM,QACNqL,IAAK7M,KAAKE,YAAYX,EAAaS,KAAKgB,YACxCwb,OACAka,QAER,+CAEO,SAAkBnsB,GACjBA,EAAKiS,OACLxc,KAAK8Y,MAAMxd,EAAiB,KAC5B0E,KAAKuK,KAAKA,EAAKiS,MACfxc,KAAK8Y,MAAMvd,EAAkB,MAG7BgP,EAAKmsB,QACL12B,KAAK8Y,MAAM5e,EAAO,MAClB8F,KAAK8Y,MAAMxd,EAAiB,KAC5B0E,KAAKuK,KAAKA,EAAKmsB,OACf12B,KAAK8Y,MAAMvd,EAAkB,KAErC,OA3DoB,2BACK,CACrBihB,KAAM,CAAC,eAAgB,MAAO,MAC9Bka,MAAO,CAAC,eAAgB,MAAO,SCI5B,SAAShtB,KACZ,MAAMzR,EAAW+H,KAAKwI,aAAaxI,KAAKoK,MAAMusB,UAO9C,OAJwC,OAApC32B,KAAKqL,iBAAiBpT,IACtB+H,KAAKnM,MAAM,wBAGR,CACH2N,KAAM,WACNqL,IAAK7M,KAAK4M,oBAAoB3U,GAC9BA,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,EAClB,OA9BoB,8BACK,CACrBtS,SAAU,CAAC,CACP,eACA,aACA,gBACA,oBACA,sBACA,wBACA,kBCED,SAASyR,KACZ,MAAMzR,EAAW+H,KAAK0I,aAEtB,MAAQ1I,KAAKa,MACT5I,EAAS5F,KAAK2N,KAAK22B,YAEf32B,KAAKe,YAAc5F,IACnB6E,KAAK2B,OAOb,MAAO,CACHH,KAAM,eACNqL,IAAK7M,KAAK4M,oBAAoB3U,GAC9BA,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,GAAM,IAAMvK,KAAK8Y,MAAM3d,EAAO,MAChD,OAhCoB,kCAEK,CACrBlD,SAAU,CAAC,CACP,WACA,qBAJmB,aCK3B,MAAM2+B,GAAkB,GAClBC,GAAiB,GACjBlS,GAAa,GAEZ,SAASpX,GAAOvB,GACnB,MAAM+G,EAAM/G,EAAI7Z,OACV2kC,EAAY9qB,EAAIra,WAAW,GAC3BkM,EAAQi5B,IAAcD,IAAkBC,IAAcnS,GAAa,EAAI,EACvE7mB,EAAgB,IAAVD,GAAekV,EAAM,GAAK/G,EAAIra,WAAWohB,EAAM,KAAO+jB,EAAY/jB,EAAM,EAAIA,EAAM,EAC9F,IAAIgkB,EAAU,GAEd,IAAK,IAAI59B,EAAI0E,EAAO1E,GAAK2E,EAAK3E,IAAK,CAC/B,IAAIrH,EAAOka,EAAIra,WAAWwH,GAE1B,GAAIrH,IAAS8kC,GAAiB,CAE1B,GAAIz9B,IAAM2E,EAAK,CAGP3E,IAAM4Z,EAAM,IACZgkB,EAAU/qB,EAAI5D,OAAOjP,EAAI,IAE7B,KACJ,CAKA,GAHArH,EAAOka,EAAIra,aAAawH,GAGpBoD,GAAcq6B,GAAiB9kC,GAAO,CACtC,MAAMklC,EAAc79B,EAAI,EAClB89B,EAAY94B,GAAe6N,EAAKgrB,GAEtC79B,EAAI89B,EAAY,EAChBF,GAAWp4B,GAAcqN,EAAIjY,UAAUijC,EAAc,EAAGC,GAC5D,MAEiB,KAATnlC,GAA6C,KAA1Bka,EAAIra,WAAWwH,EAAI,IACtCA,GAGZ,MACI49B,GAAW/qB,EAAI7S,EAEvB,CAEA,OAAO49B,CACX,CCnDO,MACMxc,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,KACZ,MAAO,CACHlI,KAAM,SACNqL,IAAK7M,KAAKE,YAAYF,KAAKgB,WAAYhB,KAAKkB,UAC5C5N,MAAOia,GAAOvN,KAAKiM,QAAQgM,IAEnC,+CAEO,SAAkB1N,GACrBvK,KAAK8Y,MAAMb,EDyCR,SAAgBjM,EAAKkrB,GACxB,MAAMC,EAAQD,EAAa,IAAO,IAC5BE,EAAYF,EAAavS,GAAakS,GAC5C,IAAIlpB,EAAU,GACV0pB,GAAsB,EAE1B,IAAK,IAAIl+B,EAAI,EAAGA,EAAI6S,EAAI7Z,OAAQgH,IAAK,CACjC,MAAMrH,EAAOka,EAAIra,WAAWwH,GAGf,IAATrH,EAQAA,GAAQ,IAAmB,MAATA,GAClB6b,GAAW,KAAO7b,EAAK4lB,SAAS,IAChC2f,GAAsB,GAKtBvlC,IAASslC,GAAatlC,IAAS8kC,IAC/BjpB,GAAW,KAAO3B,EAAIqC,OAAOlV,GAC7Bk+B,GAAsB,IAElBA,IAAwBx7B,EAAW/J,IAASwK,GAAaxK,MACzD6b,GAAW,KAIfA,GAAW3B,EAAIqC,OAAOlV,GACtBk+B,GAAsB,GAxBtB1pB,GAAW,GA0BnB,CAEA,OAAOwpB,EAAQxpB,EAAUwpB,CAC7B,CCjF4B9pB,CAAO9C,EAAKjX,OACxC,OAfoB,iCCOpB,SAAS2+B,KACL,OAAOjyB,KAAKkyB,IAAI,MAAM,EAC1B,CAeO,SAASxoB,KACZ,MAAM7L,EAAQmC,KAAKgB,WACb/I,EAAW+H,KAAK0I,aACtB,IAAIE,EAGJ,MAAQ5I,KAAKa,KAAK,CACd,OAAQb,KAAKe,WACT,KAAKjG,EACDkF,KAAK2B,OACL,SAEJ,KAAKjG,EAED,GAjCQ,KAiCJsE,KAAKrO,WAAWqO,KAAKgB,WAAa,GAAwB,CAC1DhB,KAAK2B,OACL,QACJ,CAEAiH,EAAQ5I,KAAKtE,UACb,MAEJ,KAAKX,EACD6N,EAAQ5I,KAAKjF,MACb,MAEJ,KAAKC,EACD4N,EAAQ5I,KAAKhF,MACb,MAKJ,KAAKZ,EACDwO,EAAQ5I,KAAKuL,kBAAkBvL,KAAK2b,OAAQsW,IAC5C,MAGJ,QACIrpB,EAAQ5I,KAAKuL,kBAAkBvL,KAAK4b,KAAMqW,IAGlDh6B,EAAS5F,KAAKuW,EAClB,CAEA,MAAO,CACHpH,KAAM,aACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC/I,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,EAClB,OAnEoB,gCAEK,CACrBtS,SAAU,CAAC,CACP,UACA,MACA,MACA,SACA,OACA,qBARmB,eCLpB,SAASyR,KACZ,MAAM7L,EAAQmC,KAAKgB,WAEnBhB,KAAKkM,IAAI5Q,GACT0E,KAAKwC,SAEL,MAAM6a,EAAcrd,KAAK+b,cAMzB,OAJK/b,KAAKa,KACNb,KAAKkM,IAAI3Q,GAGN,CACHiG,KAAM,sBACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClCqc,cAER,+CAEO,SAAkB9S,GACrBvK,KAAK8Y,MAAMxd,EAAiB,KAC5B0E,KAAKuK,KAAKA,EAAK8S,aACfrd,KAAK8Y,MAAMvd,EAAkB,IACjC,OA5BoB,yCACK,CACrB8hB,YAAa,iBCLjB,MAAMyH,GAAW,GAGjB,SAASwS,KACDt3B,KAAKe,YAAc7G,IACQ,IAA3B8F,KAAKsC,QAAQwiB,KACb9kB,KAAKnM,MAAM,sCAGfmM,KAAK2B,MACT,CAEO,MACM4Y,GAAY,CACrBjiB,KAAMgC,QAWH,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WAcnB,OAZIhB,KAAKsC,QA3BQ,MA4BbtC,KAAK2B,OACL21B,GAAwBl/B,KAAK4H,QAE7Bs3B,GAAwBl/B,KAAK4H,MAEzBA,KAAKsC,QAjCI,OAkCTtC,KAAK2B,OACL21B,GAAwBl/B,KAAK4H,QAI9B,CACHwB,KAAM,eACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1I,KAAM0H,KAAKmC,eAAetE,GAElC,+CAEO,SAAkB0M,GACrBvK,KAAKW,SAAS4J,EAAKjS,KACvB,OArCoB,uCCPpB,MAAMuoB,GAAW,GACXd,GAAc,GACdsB,GAAe,GAErB,SAASkW,GAAeh6B,EAAQgkB,GAC5B,IAAIxO,EAAM,EAEV,IAAK,IAAI1Q,EAAMrC,KAAKgB,WAAazD,EAAQ8E,EAAMrC,KAAKkB,SAAUmB,IAAO,CACjE,MAAMvQ,EAAOkO,KAAKrO,WAAW0Q,GAE7B,GAAIvQ,IAASiuB,IAAewB,GAAqB,IAARxO,EAErC,OADAwkB,GAAen/B,KAAK4H,KAAMzC,EAASwV,EAAM,GAAG,IACpC,EAGPlX,EAAW/J,IACZkO,KAAKnM,MACD0tB,GAAqB,IAARxO,EACP,gBAAkBA,EAAM,EAAI,gBAAkB,IAAM,eACnDA,EAAM,EAAI,wBAA0B,mBAC3C1Q,KAIF0Q,EAAM,GACR/S,KAAKnM,MAAM,sBAAuBwO,EAE1C,CAGA,OADArC,KAAK2B,OACEoR,CACX,CAEA,SAASykB,GAAwBp4B,GAC7B,IAAIq4B,EAAQ,EAEZ,KAAOz3B,KAAKsC,QAAQ+e,OACVoW,EAAQr4B,GACVY,KAAKnM,MAAM,2BAGfmM,KAAK2B,MAEb,CAEA,SAAS2hB,GAAWxxB,GACZkO,KAAKrO,WAAWqO,KAAKgB,cAAgBlP,GACrCkO,KAAKnM,OAAO/B,IAAS+uB,GAAW,YAAc,gBAAkB,eAExE,CAqBA,SAAS6W,KACL,IAAIC,EAAY,EAEhB,OAAQ33B,KAAKe,WACT,KAAKpG,EAMD,GAFAg9B,EAAYJ,GAAen/B,KAAK4H,KAAM,GAAG,GAErCA,KAAKsC,QAAQ+e,IAAe,CAC5BmW,GAAwBp/B,KAAK4H,KAAM,EAAI23B,GACvC,KACJ,CAEA,GAAI33B,KAAKe,YAAclG,GACnBmF,KAAKe,YAAcpG,EAAQ,CAC3B2oB,GAAWlrB,KAAK4H,KAAM+f,IACtBwX,GAAen/B,KAAK4H,KAAM,GAAG,GAC7B,KACJ,CAEA,MAEJ,KAAKnF,EAED88B,EAAYJ,GAAen/B,KAAK4H,KAAM,GAAG,GAErC23B,EAAY,GACZH,GAAwBp/B,KAAK4H,KAAM,EAAI23B,GAG3C,MAEJ,QAKI,GAFA33B,KAAK0M,SAASmU,IAEV7gB,KAAKe,YAAc7G,EAAO,CAC1By9B,EAAYJ,GAAen/B,KAAK4H,KAAM,GAAG,GACrC23B,EAAY,GACZH,GAAwBp/B,KAAK4H,KAAM,EAAI23B,GAE3C,KACJ,CAEA,GAAI33B,KAAKsC,QAAQ+e,IAAe,CAC5BrhB,KAAK2B,OACL61B,GAAwBp/B,KAAK4H,KAAM,GACnC,KACJ,CAEAA,KAAKnM,MAAM,0CAEvB,CAEO,MACM0mB,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WAMnB,OAHAhB,KAAKyM,SAAS,KACdirB,GAAiBt/B,KAAK4H,MAEf,CACHwB,KAAM,eACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1N,MAAO0M,KAAKmC,eAAetE,GAEnC,+CAEO,SAAkB0M,GACrBvK,KAAKW,SAAS4J,EAAKjX,MACvB,OArBoB,uCC9HpB,MAAMmxB,GAAQ,GACRmS,GAAkB,GAClBC,GAAiB,GACjBlS,GAAa,GACbC,GAAkB,GAClBC,GAAmB,GCJlB,MACMtK,GAAY,CACrBjnB,MAAOgH,QAIJ,SAASoP,KACZ,MAAM7L,EAAQmC,KAAKgB,WACnB,IAAI1N,EAEJ,OAAQ0M,KAAKe,WACT,KAAKvG,EACDlH,EDNL,SAAgB0Y,GACnB,MAAM+G,EAAM/G,EAAI7Z,OAChB,IAAI0L,EAAQ,EACRC,EAAMkO,EAAIra,WAAWohB,EAAM,KAAO8R,GAAmB9R,EAAM,EAAIA,EAAM,EACrEgkB,EAAU,GAEd,KAAOl5B,EAAQC,GAAOxB,GAAa0P,EAAIra,WAAWkM,KAC9CA,IAGJ,KAAOA,EAAQC,GAAOxB,GAAa0P,EAAIra,WAAWmM,KAC9CA,IAGJ,IAAK,IAAI3E,EAAI0E,EAAO1E,GAAK2E,EAAK3E,IAAK,CAC/B,IAAIrH,EAAOka,EAAIra,WAAWwH,GAE1B,GAAIrH,IAAS8kC,GAAiB,CAE1B,GAAIz9B,IAAM2E,EAAK,CAGP3E,IAAM4Z,EAAM,IACZgkB,EAAU/qB,EAAI5D,OAAOjP,EAAI,IAE7B,KACJ,CAKA,GAHArH,EAAOka,EAAIra,aAAawH,GAGpBoD,GAAcq6B,GAAiB9kC,GAAO,CACtC,MAAMklC,EAAc79B,EAAI,EAClB89B,EAAY94B,GAAe6N,EAAKgrB,GAEtC79B,EAAI89B,EAAY,EAChBF,GAAWp4B,GAAcqN,EAAIjY,UAAUijC,EAAc,EAAGC,GAC5D,MAEiB,KAATnlC,GAA6C,KAA1Bka,EAAIra,WAAWwH,EAAI,IACtCA,GAGZ,MACI49B,GAAW/qB,EAAI7S,EAEvB,CAEA,OAAO49B,CACX,CC3CoBjiC,CAAWkL,KAAKiM,QAAQzR,IAChC,MAEJ,KAAKiG,EACIT,KAAKpC,OAAOoC,KAAKgB,WAAYhB,KAAKkB,SAAU,SAC7ClB,KAAKnM,MAAM,+BAGfmM,KAAKkM,IAAIzL,GACTT,KAAKwC,SACLlP,EAAQ1B,GAAcoO,KAAKiM,QAAQgM,IACnCjY,KAAKwC,SACAxC,KAAKa,KACNb,KAAKkM,IAAI3Q,GAEb,MAEJ,QACIyE,KAAKnM,MAAM,+BAGnB,MAAO,CACH2N,KAAM,MACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC1N,QAER,+CAEO,SAAkBiX,GACrBvK,KAAK8Y,MAAMte,EDgBR,SAAgBwR,GACnB,IAAI2B,EAAU,GACV0pB,GAAsB,EAE1B,IAAK,IAAIl+B,EAAI,EAAGA,EAAI6S,EAAI7Z,OAAQgH,IAAK,CACjC,MAAMrH,EAAOka,EAAIra,WAAWwH,GAGf,IAATrH,EAQAA,GAAQ,IAAmB,MAATA,GAClB6b,GAAW,KAAO7b,EAAK4lB,SAAS,IAChC2f,GAAsB,GAItBvlC,IAAS2yB,IACT3yB,IAAS8kC,IACT9kC,IAAS+kC,IACT/kC,IAAS6yB,IACT7yB,IAAS8yB,IACT9yB,IAAS+yB,IACTlX,GAAW,KAAO3B,EAAIqC,OAAOlV,GAC7Bk+B,GAAsB,IAElBA,GAAuBx7B,EAAW/J,KAClC6b,GAAW,KAGfA,GAAW3B,EAAIqC,OAAOlV,GACtBk+B,GAAsB,GA3BtB1pB,GAAW,GA6BnB,CAEA,MAAO,OAASA,EAAU,GAC9B,CCzDoB7Y,CAAWyV,EAAKjX,OACpC,OA1CoB,8BCJb,SAASoW,KACZ,MAAM7L,EAAQmC,KAAKgB,WACb/I,EAAW+H,KAAKwI,aAAaxI,KAAKoK,MAAMqqB,OAE9C,MAAO,CACHjzB,KAAM,QACNqL,IAAK7M,KAAKE,YAAYrC,EAAOmC,KAAKgB,YAClC/I,WAER,+CAEO,SAAkBsS,GACrBvK,KAAK/H,SAASsS,EAClB,OAlBoB,2BACK,CACrBtS,SAAU,CAAC,OCAf,MAAMwsB,GAAQxuB,OAAOqqB,OAAO,CACxB9e,KAAM,aACNqL,IAAK,KACLvZ,MAAO,MAIEinB,GAAY,CACrBjnB,MAAOgH,QAGJ,SAASoP,KAEZ,OADA1J,KAAKkM,IAAIpR,GACF2pB,EAOX,+CAEO,SAAkBla,GACrBvK,KAAK8Y,MAAMhe,EAAYyP,EAAKjX,MAChC,OAlBoB,0tBCLLskC,GAAA,CACXhK,SAAS,ECHTA,SAAW,EACXpK,MAAS,CACLC,MAAS,CACL,MACA,OACA,MACA,QAEJC,QAAW,CACP,MAEJE,KAAQ,CACJ,MAEJD,UAAa,CACT,KACA,OAEJxxB,OAAU,CACN,KACA,KACA,IACA,KACA,KACA,KACA,KACA,KACA,MACA,KACA,MACA,MACA,OACA,KACA,MACA,KACA,MACA,KACA,MACA,KACA,MACA,MACA,MACA,KACA,MACA,MACA,MACA,KACA,MACA,MACA,MACA,KACA,MACA,MACA,MACA,OACA,QACA,QACA,QACA,OACA,QACA,QACA,QACA,MACA,MACA,MACA,MACA,QACA,SAEJ0xB,WAAc,CACV,MACA,OACA,OACA,KAEJC,UAAa,CACT,MAEJC,KAAQ,CACJ,IACA,OAGR/K,MAAS,CACL,QAAS,oBACT,gBAAiB,iEACjB,SAAU,qBACV,cAAe,wBACf,mBAAoB,uBACpB,qBAAsB,qBACtB,qBAAsB,+BACtB,0BAA2B,2EAC3B,sBAAuB,0CACvB,SAAU,qBACV,SAAU,qBACV,UAAW,mCACX6e,WAAc,qBACd,SAAU,2DACV,eAAgB,6BAChB,gBAAiB,MACjB,qBAAsB,qGACtB,cAAe,+EACf,kBAAmB,0IACnBC,KAAQ,mCACR,oBAAqB,yBACrB,cAAe,wDACf,WAAY,eACZ,WAAY,uFACZ,cAAe,8NACf,UAAW,gDACX,SAAU,mBACV,aAAc,kJACdC,IAAO,qCACP,eAAgB,oCAChB,SAAU,qBACV,WAAY,6CACZ,eAAgB,gDAChB,aAAc,mEACd,gBAAiB,8BACjB,iBAAkB,kBAClB,kBAAmB,yBACnB,WAAY,+CACZ,UAAW,0BACX,iBAAkB,oBAClB,cAAe,QACfC,MAAS,mJACT,aAAc,yCACd,mBAAoB,0BACpB,oBAAqB,2BACrB,kBAAmB,wEACnBha,WAAc,wBACd,oBAAqB,yCACrB,cAAe,6HACf,kBAAmB,+HACnB,uBAAwB,iCACxB,oBAAqB,2CACrB,yBAA0B,uBAC1B,mBAAoB,mEACpB,wBAAyB,sBACzB,mBAAoB,iFACpB,wBAAyB,6BACzB,uBAAwB,kDACxB,eAAgB,8EAChB,mBAAoB,uCACpB,sBAAuB,UACvB,aAAc,oCACd,QAAS,oBACTia,QAAW,2BACX,YAAa,+CACb,eAAgB,iBAChB,gBAAiB,kCACjB,qBAAsB,iBACtB,aAAc,2DACd,eAAgB,sDAChB,+BAAgC,0GAChC,0BAA2B,iWAC3B,2BAA4B,uDAC5B,cAAe,gBACf,iBAAkB,sCAClB,mBAAoB,uLACpB,iBAAkB,qEAClB,mBAAoB,mDACpB,kBAAmB,sBACnB,gBAAiB,wCACjB,4BAA6B,mDAC7B,0BAA2B,kCAC3B,YAAa,wFACb,YAAa,mDACb,eAAgB,iBAChB,QAAS,+CACT,QAAS,oBACT,sBAAuB,8CACvB,cAAe,2BACf,oBAAqB,+BACrB,eAAgB,0FAChB,sBAAuB,0DACvB,2BAA4B,yBAC5B,4BAA6B,gCAC7B,iCAAkC,8BAClC,qBAAsB,iBACtB,YAAa,kBACb,kBAAmB,kIACnB,uBAAwB,6BACxB,iBAAkB,6GAClB,gBAAiB,sBACjB,eAAgB,4EAChB,aAAc,+GACd,wBAAyB,oIACzB,qBAAsB,sBACtB,uBAAwB,gCACxB,uBAAwB,2BACxB,mBAAoB,uDACpB,iBAAkB,2DAClB,eAAgB,6CAChB,eAAgB,2CAChBC,SAAY,yKACZ,cAAe,mCACf,YAAa,uFACb,wBAAyB,iDACzB,QAAS,wHACT,SAAU,0HACVC,IAAO,mBACP,eAAgB,wBAChB,QAAS,wFACT,UAAW,uBACXC,MAAS,gFACT,UAAW,oDACX,cAAe,mCACf,mBAAoB,sDACpB,YAAa,iBACb,aAAc,UACd,qBAAsB,mDACtB,UAAW,+DACX,WAAY,gCACZ,iBAAkB,0BAClB,iBAAkB,8CAClB,sBAAuB,oBACvB,oBAAqB,0DACrB,QAAS,0HACT,UAAW,wBACX,aAAc,yBACd,QAAS,0GACT,WAAY,0BACZ,cAAe,8BACf,oBAAqB,wBACrB,aAAc,0BACd,iBAAkB,gCAClB,aAAc,mEACd,aAAc,6BACd,oBAAqB,sBACrB,oBAAqB,+BACrB,oBAAqB,wEACrB,QAAS,kCACT,aAAc,gJACd,gBAAiB,mFACjB,iBAAkB,6BAClB,cAAe,QACf,eAAgB,+BAChB,WAAY,yBACZ,aAAc,4BACd,QAAS,qBACT,YAAa,6CACb,kBAAmB,uDACnB,6BAA8B,4CAC9B,gBAAiB,2CACjB,kBAAmB,2DACnB,YAAa,wBACb,WAAY,4CACZ,cAAe,iFACf,mBAAoB,iBACpB,aAAc,UACd,aAAc,YACd,UAAW,UACX,WAAY,yBACZ,WAAY,gLACZ,WAAY,uCACZ,QAAS,qBACT,WAAY,2HACZ,QAAS,iCACT,cAAe,wDACf,cAAe,48CACf,mBAAoB,UACpB,YAAa,2BACb,oBAAqB,wBACrB,wBAAyB,8BACzB,0BAA2B,yCAC3B,yBAA0B,mCAC1BnC,IAAO,uBACP,YAAa,mCACb,oBAAqB,cACrB,iBAAkB,wBAClB,YAAa,gEACb,kBAAmB,oDACnB,uBAAwB,oOACxB,qBAAsB,sBACtB,gBAAiB,wCACjB,YAAa,mDACb,SAAU,oCACV,UAAW,0CACX,gBAAiB,uCACjB,YAAa,uEACboC,SAAY,qMACZ,QAAS,iCACT,wBAAyB,yDACzB,0BAA2B,+DAC3B,cAAe,6BACflB,MAAS,sDACT,oBAAqB,oFACrBmB,MAAS,qCACT,QAAS,0DACT,oBAAqB,mCACrB,yBAA0B,uBAC1B,gBAAiB,iBACjB,QAAS,iCACT,eAAgB,wDAChB,6BAA8B,2FAC9B,8BAA+B,kFAC/B,8BAA+B,8FAC/B,wBAAyB,6BACzB,QAAS,gKACT,SAAU,oKACV,WAAY,6BACZ,aAAc,gEACd,YAAa,8BACb,YAAa,8BACb,YAAa,8BACb,UAAW,0DACX,oBAAqB,0BACrB,aAAc,kCACd,UAAW,yCACX,YAAa,yCACb,WAAY,oCACZ,WAAY,oCACZ,WAAY,oCACZ,WAAY,kCACZC,SAAY,eACZ,gBAAiB,2DACjB,eAAgB,iDAChB,SAAU,qBACV,SAAU,+CACV,UAAW,4BACX,UAAW,4BACX,UAAW,+BACXC,OAAU,kCACV,WAAY,4BACZC,MAAS,oFACT,YAAa,mBACb,iBAAkB,6BAClB,QAAS,oBACT,mBAAoB,sPACpB,6BAA8B,6CAC9B,6BAA8B,+BAC9B,mCAAoC,oBACpC,8BAA+B,iBAC/B,4BAA6B,+CAC7B,oBAAqB,yEACrB,6BAA8B,qBAC9Bt5B,KAAQ,4FACR,SAAU,qBACV,gBAAiB,oDACjB,uBAAwB,8DACxB,oBAAqB,8EACrB,qBAAsB,4HACtB,qBAAsB,iEACtB,mBAAoB,yCACpB,gBAAiB,oBACjB,uBAAwB,iCACxBu5B,OAAU,kCACV,QAAS,oBACTC,OAAU,yDACV,mBAAoB,yEACpB,oBAAqB,qFACrB,gBAAiB,yEACjB,kBAAmB,sBACnB,sBAAuB,wDACvB,kBAAmB,+DACnB,gBAAiB,0DACjB,aAAc,+DACd,eAAgB,4EAChB,aAAc,sGACd,qBAAsB,qQACtB,iBAAkB,wBAClB,cAAe,0DACf,gBAAiB,sEACjB,eAAgB,oCAChB,eAAgB,oCAChB,eAAgB,yBAChB,eAAgB,mKAChB,gBAAiB,6BACjB,QAAS,uDACT,SAAU,6CACV,kBAAmB,2BACnB,aAAc,qCACd,UAAW,6BACX,mBAAoB,mJACpB,0BAA2B,uLAC3B,oCAAqC,qNACrC,oCAAqC,kDACrC,0BAA2B,uLAC3B,oCAAqC,qNACrC,oCAAqC,wIACrC,+BAAgC,0EAChC,gCAAiC,iBACjC,qBAAsB,mTACtB,sBAAuB,67BACvB,gCAAiC,8EACjC,yBAA0B,4GAC1B,qBAAsB,+KACtB,qBAAsB,+NACtB,8BAA+B,yFAC/B,yBAA0B,kFAC1B,0BAA2B,wBAC3B,wBAAyB,gBACzB,0BAA2B,uBAC3B,2BAA4B,yBAC5B,sBAAuB,4DACvB,6BAA8B,iFAC9B,6BAA8B,gDAC9B,sBAAuB,kEACvB,0BAA2B,2FAC3BC,IAAO,kBACP,YAAa,YACb,gBAAiB,cACjB,UAAW,oBACXC,OAAU,gBACV,iBAAkB,iBAClB,sBAAuB,6FACvB,YAAa,kEACb,gBAAiB,+BACjBC,OAAU,sBACV3D,KAAQ,gBACR4D,MAAS,iEACT,qBAAsB,iBACtBxD,MAAS,gBACT,cAAe,4BACf,YAAa,4BACb,0BAA2B,+BAC3B,mCAAoC,gCACpC,gBAAiB,0BACjB,6BAA8B,2BAC9B,uBAAwB,qBACxB,8BAA+B,4BAC/B,wBAAyB,sDACzB,wBAAyB,2DACzB,yBAA0B,wCAC1B,2BAA4B,qDAC5B,kBAAmB,sCACnB,iCAAkC,6CAClC,+BAAgC,yBAChC,aAAc,iCACd,mBAAoB,6BACpByD,IAAO,gBACPC,EAAK,WACLC,EAAK,WACL7b,YAAe,wDACf,mBAAoB,uCACpBvoB,IAAO,8CACP,eAAgB,yCAChB,kBAAmB,iBACnB,wBAAyB,iBACzB,UAAW,yDACX,oBAAqB,yCACrB,wBAAyB,mDACzB,iBAAkB,2DAClB,aAAc,8CACd,YAAa,sBACb,UAAW,4HACX,UAAW,4GACX,cAAe,8BACf,WAAY,kEACZ,kBAAmB,yFACnB,eAAgB,qCAChB,gBAAiB,gBACjB,cAAe,oCACf,kBAAmB,6FACnB,kBAAmB,+DACnB,wBAAyB,0JAE7BgrB,WAAc,CACV,MAAO,sBACP,kBAAmB,aACnB,wBAAyB,cACzB,4BAA6B,eAC7B,sBAAuB,YACvB,yBAA0B,gEAC1B,6BAA8B,eAC9B,6BAA8B,eAC9B,wBAAyB,mEACzB,+BAAgC,wEAChC,6BAA8B,2BAC9B,aAAc,WACd,gBAAiB,yBACjB,gBAAiB,yBACjB,mBAAoB,sCACpB,gBAAiB,sCACjB,2BAA4B,YAC5B,4BAA6B,sBAC7B,4BAA6B,qBAC7B,2BAA4B,wBAC5B,gBAAiB,aACjB,qBAAsB,+CACtB,8BAA+B,UAC/B,4BAA6B,UAC7B,2BAA4B,UAC5B,iCAAkC,UAClC,2BAA4B,UAC5B,gCAAiC,UACjC,6BAA8B,UAC9B,4BAA6B,UAC7B,sBAAuB,eACvB,mBAAoB,8GACpB,yBAA0B,gBAC1B,yBAA0B,WAC1B,yBAA0B,gBAC1B,yBAA0B,WAC1B,mBAAoB,cACpB,2BAA4B,6FAC5B,2BAA4B,6FAC5B,uBAAwB,2BACxB,oBAAqB,wDACrB,oBAAqB,wDACrB,yBAA0B,8BAC1B,qBAAsB,+EACtB,mBAAoB,gBACpB,kBAAmB,oBACnB,gBAAiB,oCACjB,kBAAmB,WACnB,mBAAoB,YACpB,kBAAmB,6tDACnB,eAAgB,aAChB,4BAA6B,gBAC7B,0BAA2B,gBAC3B,2BAA4B,gBAC5B,yBAA0B,gBAC1B,0BAA2B,kDAC3B,kBAAmB,gDACnB,+BAAgC,MAChC,oBAAqB,eACrB,cAAe,mCACf,sBAAuB,mDACvB,iCAAkC,mBAClC,kCAAmC,mBACnC,8BAA+B,mBAC/B,+BAAgC,mBAChC,oBAAqB,wBACrB,kBAAmB,aACnB,kBAAmB,mFACnB,kBAAmB,6BACnB,mBAAoB,kCACpB,uBAAwB,eACxB,qBAAsB,kCACtB,qBAAsB,8oCACtB,wBAAyB,8CACzB,8BAA+B,UAC/B,8BAA+B,mBAC/B,8BAA+B,mBAC/B,sBAAuB,+CACvB,qBAAsB,iBACtB,eAAgB,sIAChB,0BAA2B,gBAC3B,oBAAqB,uCACrB,yBAA0B,qBAC1B,qBAAsB,oBACtB,sBAAuB,kCACvB,wBAAyB,cACzB,0BAA2B,2CAC3B,0BAA2B,2CAC3B,sBAAuB,kBACvB,wBAAyB,+BACzB,wBAAyB,+BACzB,oBAAqB,aACrB,6BAA8B,aAC9B,8BAA+B,UAC/B,0BAA2B,UAC3B,sBAAuB,oBACvB,4BAA6B,UAC7B,4BAA6B,WAC7B,wBAAyB,eACzB,sBAAuB,iDACvB,eAAgB,eAChB,gBAAiB,4FACjB,cAAe,4EACf,aAAc,+EACd,eAAgB,+FAChBuI,IAAO,4CACP8Q,UAAa,sBACb,wBAAyB,kCACzB,kBAAmB,UACnB,sBAAuB,gCACvB,qBAAsB,UACtB,sBAAuB,gCACvB,4BAA6B,sCAC7B,iBAAkB,2BAClB,uBAAwB,iCACxB,kBAAmB,wDACnB,sBAAuB,2EACvB,wBAAyB,2EACzB,4BAA6B,qBAC7B,qBAAsB,+BACtBC,WAAc,oDACd,eAAgB,eAChBC,QAAW,8HACX,kBAAmB,8BACnB,sBAAuB,iBACvBC,WAAc,mCACd,wBAAyB,gBACzB,wBAAyB,gBACzB,kBAAmB,aACnB,mBAAoB,UACpB,mBAAoB,cACpB,oBAAqB,SACrB,sBAAuB,iBACvB,wBAAyB,gEACzB,wBAAyB,gEACzB,oBAAqB,kBACrB,kBAAmB,aACnB,iBAAkB,yBAClB,aAAc,YACdC,OAAU,sCACV,eAAgB,sDAChB,qBAAsB,4BACtB,qBAAsB,uBACtB,qBAAsB,uBACtB,mBAAoB,sDACpB,yBAA0B,uBAC1B,yBAA0B,uBAC1B,yBAA0B,uBAC1B,qBAAsB,sDACtB,2BAA4B,uBAC5B,2BAA4B,uBAC5B,2BAA4B,uBAC5B,gBAAiB,sCACjB,sBAAuB,uBACvB,4BAA6B,2BAC7B,6BAA8B,2BAC9B,sBAAuB,eACvB,sBAAuB,eACvB,kBAAmB,oBACnB,eAAgB,eAChB,wBAAyB,2BACzB,0BAA2B,2BAC3B,eAAgB,2JAChB,sBAAuB,2BACvB,sBAAuB,oCACvB,qBAAsB,kCACtB,sBAAuB,eACvB,qBAAsB,2CACtB,gBAAiB,sDACjB,oBAAqB,sDACrB,sBAAuB,4BACvB,sBAAuB,uBACvB,sBAAuB,uBACvB,0BAA2B,uBAC3B,0BAA2B,uBAC3B,0BAA2B,uBAC3B,sBAAuB,sDACvB,4BAA6B,uBAC7B,4BAA6B,uBAC7B,4BAA6B,uBAC7B,cAAe,sCACf,oBAAqB,UACrB,oBAAqB,eACrB,oBAAqB,eACrB,gBAAiB,yDACjB,eAAgB,sCAChB,qBAAsB,UACtB,qBAAsB,eACtB,qBAAsB,eACtB,iBAAkB,qBAClB,0BAA2B,2BAC3B,4BAA6B,2BAC7B,eAAgB,oBAChB,aAAc,sCACd,mBAAoB,UACpB,yBAA0B,2BAC1B,0BAA2B,2BAC3B,mBAAoB,eACpB,mBAAoB,eACpB,eAAgB,oBAChBV,OAAU,6BACV,YAAa,oCACb,uBAAwB,cACxB,gBAAiB,yBACjB,WAAY,WACZ,iBAAkB,YAClB,YAAa,kBACb,oBAAqB,YACrB,aAAc,qDACd,WAAY,2BACZ,aAAc,iBACd,aAAc,yBACd,cAAe,uGACf,eAAgB,uGAChB,eAAgB,kDAChB,eAAgB,2DAChBW,MAAS,mCACT,cAAe,eACf,cAAe,4BACfxzB,MAAS,+CACTyzB,KAAQ,eACR,YAAa,qDACbzB,MAAS,UACT,eAAgB,6CAChB,eAAgB,iBAChB,cAAe,2BACf,aAAc,6BACd,cAAe,sEACf,oBAAqB,UACrB,oBAAqB,mBACrB,oBAAqB,mBACrB,cAAe,WACf,eAAgB,gBAChBv4B,QAAW,qCACXi6B,QAAW,kEACX,yBAA0B,+BAC1B,+BAAgC,wBAChC,2BAA4B,wBAC5B,gCAAiC,wBACjC,0BAA2B,wBAC3B7F,UAAa,6CACb,iBAAkB,uBAClB,iBAAkB,6BAClBje,QAAW,gFACX,qBAAsB,sBACtB,oBAAqB,oCACrB,gBAAiB,uEACjB,cAAe,oCACf/S,OAAU,2cACV82B,UAAa,UACbC,QAAW,qIACX,cAAe,YACf/zB,OAAU,yDACV+d,KAAQ,wDACR,aAAc,oBACd,iBAAkB,wCAClB,YAAa,oCACb,YAAa,WACb,cAAe,WACf,YAAa,2BACbiW,MAAS,0CACTC,KAAQ,8MACR,cAAe,oCACf,wBAAyB,8BACzB,eAAgB,mBAChB,yBAA0B,kBAC1B,sBAAuB,YACvB,eAAgB,yCAChB,0BAA2B,8BAC3B,YAAa,sDACb,mBAAoB,gFACpB,cAAe,6CACf,eAAgB,0BAChB,aAAc,iCACd,iBAAkB,mCAClB,4BAA6B,YAC7B,uBAAwB,YACxB,wBAAyB,YACzB,eAAgB,6kBAChB,0BAA2B,oPAC3B,oBAAqB,oFACrB,0BAA2B,wEAC3B,qBAAsB,4BACtB,yBAA0B,kHAC1B,uBAAwB,+GACxB,wBAAyB,mBACzB,cAAe,wCACf,sBAAuB,YACvBC,IAAO,8BACPC,KAAQ,4JACR,YAAa,mCACb,oBAAqB,gBACrB,iBAAkB,sBAClB,iBAAkB,gBAClB,cAAe,+BACf,kBAAmB,cACnB,kBAAmB,sBACnB,oBAAqB,cACrB,WAAY,wCACZ,WAAY,+BACZ,eAAgB,cAChB,eAAgB,sBAChB,iBAAkB,cAClB,gBAAiB,6IACjB,sBAAuB,iBACvB,wBAAyB,gEACzB,qBAAsB,gEACtB,sBAAuB,4CACvBC,OAAU,iIACV,sBAAuB,gBACvB,wBAAyB,wBACzBC,QAAW,mBACX,oBAAqB,qCACrB,kBAAmB,2FACnB,mBAAoB,oCACpB,WAAY,uCACZ,iBAAkB,+BAClB,uBAAwB,wCACxB,cAAe,YACf,iBAAkB,YAClBC,MAAS,eACT,cAAe,eACf,kBAAmB,UACnB,oBAAqB,UACrB,eAAgB,eAChB,mBAAoB,UACpB,qBAAsB,UACtBC,UAAa,eACb,kBAAmB,qFACnB,gBAAiB,0HACjB,eAAgB,4FAChB,iBAAkB,wFAClBjF,KAAQ,6BACR,iBAAkB,6BAClB,aAAc,oCACd,aAAc,iBACd,cAAe,wCACf,mBAAoB,WACpB,aAAc,qEACd,mBAAoB,eACpB,sBAAuB,iBACvB,kBAAmB,gCACnBkF,OAAU,oCACV,eAAgB,uBAChB,mBAAoB,kBACpB,qBAAsB,kBACtB,gBAAiB,6BACjB,gBAAiB,uBACjB,oBAAqB,kBACrB,sBAAuB,kBACvB,cAAe,6BACf,eAAgB,6BAChB,aAAc,6BACd,cAAe,mBACf1P,KAAQ,gBACR,cAAe,sJACf,mBAAoB,kBACpB,qBAAsB,2BACtB,qBAAsB,oCACtB,oBAAqB,iCACrB,qBAAsB,eACtB,oBAAqB,2CACrB,YAAa,4BACb,iBAAkB,0BAClB,aAAc,oBACd,YAAa,kBACb,cAAe,kBACf,gBAAiB,cACjB,cAAe,kBACf,YAAa,aACb,YAAa,kBACb,oBAAqB,wCACrB,aAAc,sCACd,aAAc,iBACd,aAAc,iBACd,iBAAkB,gBAClB,aAAc,+HACd,kBAAmB,gBACnB,YAAa,iBACb,YAAa,+HACb,iBAAkB,gBAClB,aAAc,iIACd,kBAAmB,gBACnB,YAAa,iIACb,iBAAkB,4BAClB,aAAc,qCACd,kBAAmB,aACnBptB,OAAU,8GACV,gBAAiB,kBACjB,kBAAmB,sBACnB,cAAe,kCACf,kBAAmB,yBACnB,gBAAiB,0BACjB+8B,QAAW,gBACXC,MAAS,YACTC,QAAW,YACXC,QAAW,4DACX,gBAAiB,iBACjB,iBAAkB,WAClB,gBAAiB,wBACjB,gBAAiB,eACjBC,SAAY,kEACZ,kBAAmB,YACnB,iBAAkB,kCAClB,oBAAqB,0BACrB,uBAAwB,+BACxB,kBAAmB,kCACnB,gBAAiB,6BACjB,aAAc,kCACd,aAAc,kCACd,sBAAuB,2BACvB,4BAA6B,oBAC7B,6BAA8B,oBAC9B,wBAAyB,oBACzB,wBAAyB,oBACzBC,QAAW,+BACX,gBAAiB,wBACjB,oBAAqB,mBACrB,sBAAuB,mBACvB,iBAAkB,wBAClB,iBAAkB,wBAClB,qBAAsB,mBACtB,uBAAwB,mBACxB,eAAgB,wBAChB,gBAAiB,wBACjB,cAAe,wBACfC,KAAQ,sBACR,mBAAoB,2CACpB,oBAAqB,2CACrB,oBAAqB,aACrB,cAAe,iCACfC,YAAe,gBACf,qBAAsB,aACtB,gBAAiB,yCACjB,cAAe,qCACf,aAAc,mCACd,iBAAkB,6FAClBxC,SAAY,uDACZ,qBAAsB,gBACtByC,OAAU,iCACVC,OAAU,6CACVxF,MAAS,6BACTyF,OAAU,4CACV,UAAW,6BACX,aAAc,0CACd,aAAc,yBACd,gBAAiB,4CACjBC,MAAS,qBACT,kBAAmB,kBACnB,mBAAoB,2BACpB,kBAAmB,iBACnB,kBAAmB,cACnB,gBAAiB,gBACjB,sBAAuB,gBACvB,4BAA6B,WAC7B,0BAA2B,WAC3B,uBAAwB,WACxB,uBAAwB,gBACxB,6BAA8B,WAC9B,2BAA4B,WAC5B,qBAAsB,WACtB,sBAAuB,WACvB,oBAAqB,WACrB,iBAAkB,kCAClB,uBAAwB,kCACxB,6BAA8B,2BAC9B,2BAA4B,2BAC5B,wBAAyB,2BACzB,wBAAyB,kCACzB,8BAA+B,2BAC/B,4BAA6B,2BAC7B,sBAAuB,2BACvB,uBAAwB,2BACxB,qBAAsB,2BACtB,oBAAqB,+BACrB,yBAA0B,mBAC1B,0BAA2B,aAC3B,uBAAwB,qCACxB,uBAAwB,qCACxB,mBAAoB,gBACpB,mBAAoB,sDACpB,qBAAsB,2BACtB,qBAAsB,2BACtB,kBAAmB,wDACnB,uBAAwB,sCACxB,uBAAwB,uBACxB,wBAAyB,gBACzB,eAAgB,sBAChB,gBAAiB,4CACjB,WAAY,qBACZ,eAAgB,aAChB,aAAc,mDACd,kBAAmB,2CACnB,uBAAwB,+BACxB,kBAAmB,gHACnB,wBAAyB,UACzB,uBAAwB,+EACxB,uBAAwB,oFACxB,2BAA4B,gBAC5B,wBAAyB,kCACzB,4BAA6B,uCAC7B,gBAAiB,mDACjB,sBAAuB,UACvB,yBAA0B,6BAC1B,sBAAuB,4EACvB,cAAe,4CACf,eAAgB,uCAChB,mBAAoB,yBACpB,gBAAiB,gCACjB,iBAAkB,2DAClB,cAAe,mBACf,mBAAoB,yBACpB,iBAAkB,gEAClB,wBAAyB,6BACzB,0BAA2B,uCAC3B,YAAa,oCACb,iBAAkB,uBAClBjC,IAAO,6BACP,eAAgB,2FAChBkC,UAAa,wBACb,gBAAiB,sDACjB,mBAAoB,kJACpB,kBAAmB,mBACnBC,WAAc,uBACd,mBAAoB,UACpB,sBAAuB,UACvB,sBAAuB,qCACvB,6BAA8B,qBAC9BC,UAAa,4DACb,eAAgB,6KAChB,cAAe,6BACf,iBAAkB,kFAClB,gBAAiB,oDACjB,qBAAsB,sBACtB,sBAAuB,qCACvB,qBAAsB,uBACtB,uBAAwB,sBACxBC,WAAc,0BACd,cAAe,mHACf,uBAAwB,yEACxB,mBAAoB,oDACpBC,OAAU,YACVC,MAAS,iIACT,cAAe,8BACf,aAAc,uCACd,eAAgB,kBAChB,YAAa,oBACb,eAAgB,mFAChB,UAAW,iBACXC,KAAQ,qCACR,uBAAwB,iBACxB,gCAAiC,gCACjC,iCAAkC,iCAClC,6BAA8B,6BAC9B,8BAA+B,iCAC/B,oCAAqC,iBACrC,0BAA2B,iBAC3B,mBAAoB,0BACpB,iBAAkB,oCAClB,sBAAuB,yCACvB,qBAAsB,8CACtB,oBAAqB,kBACrB,gBAAiB,sCACjB,iBAAkB,YAClB,oBAAqB,gBACrB,0BAA2B,iBAC3B,yBAA0B,2BAC1B,wBAAyB,2BACzB,qBAAsB,2BACtB,2BAA4B,iCAC5B,0BAA2B,uCAC3B,6BAA8B,oBAC9B,8BAA+B,oBAC/B,8BAA+B,oBAC/B,yBAA0B,6CAC1B,yBAA0B,iFAC1B,6BAA8B,gBAC9B,wBAAyB,0BACzB,oBAAqB,oBACrB,sBAAuB,qBACvB,qBAAsB,mIACtB,iBAAkB,kCAClBC,SAAY,SACZ,YAAa,kBACbC,IAAO,gCACP,YAAa,wBACb,aAAc,wBACd,oBAAqB,mIACrBC,KAAQ,UACR,eAAgB,oBAChB,YAAa,kBACb,+BAAgC,UAChC,6BAA8B,UAC9BC,QAAW,oBACXC,OAAU,aACV,aAAc,aACd,aAAc,aACd,eAAgB,aAChBC,MAAS,oCACT,cAAe,iDACf,eAAgB,iDAChBxtB,KAAQ,kCACR,aAAc,iDACd,cAAe,iDACf,kBAAmB,mDACnB2iB,IAAO,yDACP8K,MAAS,oBACT,WAAY,iEACZC,OAAU,UACV,mBAAoB,wBACpB,oBAAqB,eACrB,iBAAkB,oBAClB,kBAAmB,oBACnB,oBAAqB,0BACrB,iBAAkB,oBAClB,eAAgB,eAChB,cAAe,mBACf,gBAAiB,YACjB,gBAAiB,kDACjB,iBAAkB,cAClB,eAAgB,gFAChB,cAAe,iGACf,cAAe,iGACf,aAAc,wDACd,eAAgB,sCAChB,eAAgB,wDAEpBnO,QAAW,CACPoO,QAAW,CACP5O,QAAW,WACXC,YAAe,MAEnB,gBAAiB,CACbD,QAAW,uBACXC,YAAe,CACX,mBAAoB,yBACpB7hB,SAAY,uBACZywB,SAAY,qBACZC,IAAO,sBACP3b,OAAU,WACV4F,MAAS,kCACT,WAAY,4DACZgW,OAAU,WACVC,QAAW,YACXC,OAAU,kGAGlB/kC,SAAY,CACR81B,QAAW,mGACXC,YAAe,MAEnB,sBAAuB,CACnBD,QAAW,iBACXC,YAAe,CACX,eAAgB,6BAChB,cAAe,iBACf,kBAAmB,6CAG3B,YAAa,CACTD,QAAW,KACXC,YAAe,CACX,kBAAmB,sBACnB,mBAAoB,sBACpB,eAAgB,sCAChB,cAAe,gBACf,wBAAyB,8BACzB,0BAA2B,8BAC3B,eAAgB,+BAChB,aAAc,qCACd,cAAe,8BACf,eAAgB,6kBAChB,oBAAqB,sBACrB,cAAe,eACf2D,IAAO,yDACP,gBAAiB,cAGzB,sBAAuB,CACnB5D,QAAW,iBACXC,YAAe,MAEnBiP,OAAU,CACNlP,QAAW,0HACXC,YAAe,MAEnBkP,UAAa,CACTnP,QAAW,mBACXC,YAAe,MAEnBmP,MAAS,CACLpP,QAAW,gCACXC,YAAe,MAEnBsG,MAAS,CACLvG,QAAW,qBACXC,YAAe,MAEnBoP,UAAa,CACTrP,QAAW,uCACXC,YAAe,MAEnBsN,KAAQ,CACJvN,QAAW,uBACXC,YAAe,CACXqP,MAAS,gBACTC,MAAS,qBACT,mBAAoB,mCACpBz9B,KAAQ,2DAGhBshB,SAAY,CACR4M,QAAW,yBACXC,YAAe,CACXlO,OAAU,WACVyd,SAAY,aACZ,gBAAiB,aAGzB/I,SAAY,CACRzG,QAAW,uBACXC,YAAe,MAEnBwP,SAAY,CACRzP,QAAW,KACXC,YAAe,CACX2M,OAAU,yBACV,aAAc,oBACd,YAAa,oBACb,WAAY,6BACZ,aAAc,oBACd,YAAa,oBACb,WAAY,6BACZ8C,YAAe,0BACf,YAAa,aACb,eAAgB,qBAChBxB,MAAS,yBACTC,KAAQ,+BAGhB3H,UAAa,CACTxG,QAAW,4CACXC,YAAe,MAEnB0P,KAAQ,CACJ3P,QAAW,0BACXC,YAAe,MAEnBljB,MAAS,CACLijB,QAAW,6CACXC,YAAe,ODprCvB/iB,KAAAA,IEgBW,SAAS0yB,GAAkBhqC,GACtC,OAAQ+M,KAAKe,WACT,KAAK1G,EACD,OAAO2F,KAAK3F,OAEhB,KAAKc,EACD,OAAO6E,KAAKk9B,WAEhB,KAAK5hC,EACD,OAAO0E,KAAKm9B,YAAYn9B,KAAKwI,aAAcvV,EAAQwV,YAEvD,KAAKrN,EACD,OAAO4E,KAAKo9B,SAASp9B,KAAKwI,aAAcvV,EAAQwV,YAEpD,KAAKwP,EACD,OAAOjY,KAAK1F,SAEhB,KAAKO,EACD,OAAOmF,KAAKnF,YAEhB,KAAKD,EACD,OAAOoF,KAAKpF,aAEhB,KAAK4R,EACD,OAAOxM,KAAKrF,SAEhB,KAAK8F,EACD,OAAOT,KAAKpC,OAAOoC,KAAKgB,WAAYhB,KAAKkB,SAAU,QAC7ClB,KAAKxF,MACLwF,KAAK7F,SAAS6F,KAAKwI,aAAcvV,EAAQwV,YAEnD,KAAKjO,EACD,OAAOwF,KAAKxF,MAEhB,KAAKN,EAED,OAAI8F,KAAKvC,QAAQuC,KAAKgB,WAtCxB,MAuCMhB,KAAKvC,QAAQuC,KAAKgB,WAAa,EA1C9B,IA2CMhB,KAAKq9B,eAELr9B,KAAKizB,aAGpB,KAAKv4B,EAAO,CACR,MAAM5I,EAAOkO,KAAKrO,WAAWqO,KAAKgB,YAElC,GAjDI,KAiDAlP,GApDC,KAqDDA,GApDC,KAqDDA,GApDI,KAqDJA,EACA,OAAOkO,KAAKk9B,WAzDT,KA8DHprC,GACAkO,KAAKnM,MAAM,gCAAiCmM,KAAKgB,WAAa,GAGlE,KACJ,EAER,CClFe,IAAAic,GAAA,CACXpU,QAAAA,ICuFW,IAAAy0B,GAAA,CACXv0B,aAtEJ,SAAsBpH,EAAM1J,GACF,OAAlBA,EAAS8M,MAAwC,eAAvB9M,EAAS8M,KAAKvD,MAC/B,OAATG,GAA+B,eAAdA,EAAKH,MACtBvJ,EAAS5F,KAAK,CACVmP,KAAM,aACNqL,IAAK,KACLvU,KAAM,KAGlB,EA8DIuQ,QA5DJ,WACI,OAAQ7I,KAAKe,WACT,KAAK3F,EACD,OAAO4E,KAAKu9B,oBAEhB,KAAKljC,EACD,OAAO2F,KAAKw9B,aAEhB,KAAKviC,EACD,OAAI+E,KAAK4B,WAAW,KAAO3G,EAChB+E,KAAKy9B,wBAELz9B,KAAK09B,sBAGpB,KAAKxjC,EACD,OAAO8F,KAAK29B,eAEhB,KAAKnxB,EACL,KAAK5R,EACD,OAAOoF,KAAKpF,aAEhB,KAAKC,EAtCI,KAwCDmF,KAAKrO,WAAWqO,KAAKgB,aACrBhB,KAAKnM,MAAM,yBAA0BmM,KAAKgB,WAAa,GAE3D,MAEJ,KAAKtG,EAGD,OAFasF,KAAKrO,WAAWqO,KAAKgB,aAG9B,KAnDC,GAoDD,KAjDQ,GAkDR,KAhDF,IAiDE,KArDA,GAsDI,OAAOhB,KAAK49B,aAEhB,KAvDC,GAwDG,OAAO59B,KAAK69B,gBAEhB,KA7DC,GA8DD,KAzDK,IA0DD,OAAO79B,KAAK29B,eAEhB,KAnEG,GAoEC,OAAO39B,KAAKw9B,aAEhB,KArEE,GAsEE,OAAOx9B,KAAK89B,kBAGpB,MAGZ,GCpFA,SAASC,GAAoBxzB,GACzB,OACa,OAATA,GACc,aAAdA,EAAK/I,OACkC,MAAtC+I,EAAKjX,MAAMiX,EAAKjX,MAAMnB,OAAS,IAAoD,MAAtCoY,EAAKjX,MAAMiX,EAAKjX,MAAMnB,OAAS,GAErF,CAEe,IAAAmB,GAAA,SACXuV,GACAE,YAAAA,CAAapH,EAAM1J,GACX8lC,GAAoBp8B,KACpBA,EAAKrO,MAAQ,IAAMqO,EAAKrO,OAExByqC,GAAoB9lC,EAAS8M,QAC7B9M,EAAS8M,KAAKzR,OAAS,IAE9B,EACD0qC,WCpBW,WACX,OAAOh+B,KAAKoL,qBACRpL,KAAKkyB,IAAI,MAAM,GAEvB,EDiBI+L,IEpBW,WACX,MAAMhmC,EAAW+H,KAAK0I,aAStB,GAPA1I,KAAKwC,SAGLvK,EAAS5F,KAAK2N,KAAKizB,cAEnBjzB,KAAKwC,SAEDxC,KAAKe,YAAc5F,EAAO,CAC1BlD,EAAS5F,KAAK2N,KAAKk9B,YAEnB,MAAMxxB,EAAa1L,KAAKc,WAClBxN,EAAQ0M,KAAK8K,oBACb9K,KAAKy0B,MAAM,MACXz0B,KAAKkyB,IAAIlyB,KAAKkL,wCAAwC,GAE5D,GAAmB,UAAf5X,EAAMkO,MAAoBlO,EAAM2E,SAAS6M,QACzC,IAAK,IAAIvH,EAASmO,EAAa1L,KAAKc,WAAYvD,GAAU,EAAGA,IACzD,GAAIyC,KAAK4B,WAAWrE,KAAYzC,EAAY,CACxCxH,EAAM2E,SAAS2N,WAAW,CACtBpE,KAAM,aACNqL,IAAK,KACLvZ,MAAO,MAEX,KACJ,CAIR2E,EAAS5F,KAAKiB,EAClB,CAEA,OAAO2E,CACX,4EClCA,MAAMimC,GAA2B,IAAIrmB,IAAI,CAAC,OAAQ,MAAO,MAAO,OAEjD,IAAAgc,GAAA,CACXnqB,MAAO,CACH2jB,OAAAA,GACI,MAAMp1B,EAAW+H,KAAK0I,aAEtB,GAAI1I,KAAKe,YAAc7G,EAAO,CAC1B,MAAM5B,EAAO0H,KAAKjM,UAAUiM,KAAKgB,WAAYhB,KAAKkB,UAE7Cg9B,GAAyB5rB,IAAIha,EAAKK,gBACnCV,EAAS5F,KAAK2N,KAAKizB,aAE3B,CAIA,OAFAh7B,EAAS5F,KAAK2N,KAAKi0B,UAAU,cAEtBh8B,CACV,EACDmlB,KAAAA,CAAM+gB,GAAS,GACX,OAAOn+B,KAAK6b,MAAMsiB,EACtB,IChBR,SAAS5yB,GAAkB7B,EAAO+B,GAC9B,OAAOzL,KAAKuL,mBACR,KACI,IACI,OAAO7B,EAAMtR,KAAK4H,KACtB,CAAU,QACNA,KAAKwC,SACDxC,KAAK4L,gBAAgB,KAAOrQ,GAC5ByE,KAAKnM,OAEb,IAEJ4X,GAAa,KAAMzL,KAAKkyB,IAAI,MAAM,IAE1C,CAEA,MAAMkM,GAAiB,CACnB3B,KAAAA,GACIz8B,KAAKwC,SAEL,MAAMvK,EAAW+H,KAAK0I,aAChB6B,EAAOgB,GAAkBnT,KAAK4H,KAAMA,KAAK21B,OAM/C,MAJkB,QAAdprB,EAAK/I,MAAiC,KAAf+I,EAAKjX,OAC5B2E,EAAS5F,KAAKkY,GAGXtS,CACV,EACD67B,QAAAA,GACI9zB,KAAKwC,SAEL,MAAMvK,EAAW+H,KAAK0I,aAChB6B,EAAOgB,GAAkBnT,KAC3B4H,KACAA,KAAK+b,aACL,IAAMxQ,GAAkBnT,KAAK4H,MAAM,IAAMA,KAAKi0B,UAAU,gBAO5D,MAJkB,QAAd1pB,EAAK/I,MAAiC,KAAf+I,EAAKjX,OAC5B2E,EAAS5F,KAAKkY,GAGXtS,CACX,GCrDJ,MAAMomC,GAAe,CACjB30B,KAAAA,GACI,OAAO1J,KAAKoL,qBACRpL,KAAKm2B,eAEb,GAGEhZ,GAAW,CACbzT,KAAAA,GACI,OAAO1J,KAAKoL,qBACRpL,KAAK22B,WAEb,GAGE2H,GAAY,CACd50B,KAAAA,GACI,OAAO1J,KAAKoL,qBACRpL,KAAKizB,aAEb,GAGEgD,GAAM,CACRvsB,KAAAA,GACI,OAAO1J,KAAKoL,qBACRpL,KAAKu+B,MAEb,GAGW,IC3Bfnf,GhEgDyBkS,GAAaP,GAAI,CAAE,EgEhDhB,IACrB6G,MCDQ,CACXntB,aAAc,CACVjY,QAAS,aACTwqB,WAAY,aACZ3S,OAAQ,SACR4S,aAAAA,CAAc9pB,GACV,OAAO6M,KAAKsyB,cAAcn/B,EAAQkX,OAAS/P,OAAOnH,EAAQkX,QAAU,KACvE,EACDm0B,eAAgB,iBAChBC,WAAY,aACZ3I,SAAAA,CAAU3iC,GACN,OAAO6M,KAAKi0B,UAAU9gC,EAAQogC,KACjC,EACDrW,KAAM,OACNmhB,aAAc,eACdlhB,SAAU,WACVC,KAAAA,GACI,OAAOpd,KAAK6b,OAAM,EACrB,EACD6iB,gBAAiB,kBACjBrhB,YAAa,cACb/pB,MAAO,SAEX6W,SAAU,CACN2pB,SAAU,CACN3W,QAAAA,GACI,OAAOnd,KAAK22B,UAChB,GAEJ9C,UAAW,CACP8K,KAAAA,GACI,OAAO3+B,KAAK+b,aAChB,UAGR3R,GACAC,OC9BW,CACXwpB,aACA,YCbW,CACXnqB,MAAO,CACH2jB,QAAS,KACTjQ,KAAAA,GACI,OAAOpd,KAAK6b,OAAM,EACtB,IDSJ0gB,OJ0CW,CACX7yB,MAAO,CACH2jB,OAAAA,GACI,MAAMp1B,EAAW+H,KAAK0I,aAEtB,OAAQ1I,KAAKe,WACT,KAAKkX,EACDhgB,EAAS5F,KAAK2N,KAAK1F,UACnB,MAEJ,KAAKE,EACL,KAAKiG,EACDxI,EAAS5F,KAAK2N,KAAKxF,OACnB,MAEJ,QACIwF,KAAKnM,MAAM,+BA2BnB,OAxBAmM,KAAKwC,SAEDxC,KAAKe,YAAc7G,GACnB8F,KAAKpC,OAAOoC,KAAKgB,WAAYhB,KAAKkB,SAAU,SAC5CjJ,EAAS5F,KAAK2N,KAAKizB,cAEnBjzB,KAAKe,YAAcN,GACnBT,KAAKpC,OAAOoC,KAAKgB,WAAYhB,KAAKkB,SAAU,WAE5CjJ,EAAS5F,KAAK2N,KAAK7F,SAAS,KAAMikC,KAGtCp+B,KAAKwC,SAEDxC,KAAKe,YAAcN,GACnBT,KAAKpC,OAAOoC,KAAKgB,WAAYhB,KAAKkB,SAAU,cAC5CjJ,EAAS5F,KAAK2N,KAAK7F,SAAS,KAAMikC,KAGlCp+B,KAAK4L,gBAAgB,KAAO1R,GAC5B8F,KAAK4L,gBAAgB,KAAOtQ,GAC5BrD,EAAS5F,KAAK2N,KAAK4+B,kBAGhB3mC,CACV,EACDmlB,MAAO,OItFXqf,MEfW,CACX/yB,MAAO,CACH2jB,OAAAA,GACI,OAAOrtB,KAAKoL,qBACRpL,KAAK6+B,YAEZ,EACDzhB,KAAAA,GACI,OAAOpd,KAAK6b,OAAM,EACtB,IFOJ+X,MGhBW,CACXlqB,MAAO,CACH2jB,OAAAA,GACI,OAAOrtB,KAAKoL,qBACRpL,KAAK4+B,iBAEZ,EACDxhB,KAAAA,CAAM+gB,GAAS,GACX,OAAOn+B,KAAK6b,MAAMsiB,EACtB,IHQJnB,KIjBW,CACXtzB,MAAO,CACH2jB,OAAAA,GACI,OAAOrtB,KAAKoL,qBACRpL,KAAKm2B,eAEZ,EACD/Y,KAAAA,GACI,OAAOpd,KAAK6b,OAAM,EACtB,IJSJ+e,KKlBW,CACXlxB,MAAO,CACH2jB,OAAAA,GACI,OAAOrtB,KAAKoL,qBACRpL,KAAKm2B,eAEZ,EACD/Y,KAAAA,GACI,OAAOpd,KAAK6b,OAAM,EACtB,ILUJzR,MMnBW,CACXV,MAAO,CACH2jB,OAAAA,GACI,OAAOrtB,KAAKoL,qBACRpL,KAAK8+B,QAEZ,EACD1hB,KAAAA,CAAM+gB,GAAS,GACX,OAAOn+B,KAAK6b,MAAMsiB,EACtB,INWJ,iBOpBW,CACXz0B,MAAO,CACH2jB,QAAS,KACTjQ,KAAAA,CAAM+gB,GAAS,GACX,OAAOn+B,KAAK6b,MAAMsiB,EACtB,IPgBJrK,SQrBW,CACXpqB,MAAO,CACH2jB,OAAAA,GACI,OAAOrtB,KAAKoL,qBACRpL,KAAKi0B,UAAU,YAEtB,EACD7W,KAAAA,CAAM+gB,GAAS,GACX,OAAOn+B,KAAK6b,MAAMsiB,EACtB,KTiCJ7zB,OFVW,CACXy0B,IAAOT,GACPhsB,IAAO+rB,GACPW,KAAQV,GACRW,QAAWZ,GACXa,GAAMb,GACN,WAAYA,GACZ,cAAeA,GACfc,MAASd,GACTe,IAAOf,GACP,YAAapI,GACb,iBAAkBA,GAClB,mBAAoBA,GACpB,cAAeA,GACfoJ,QAAWliB,GACX1jB,KAAQ0jB,GACR,eAAgBA,IELhB5S,2rBUzCW,CACXA,KAAAA,OCUG,MAAM5J,SACTA,GAAQ+I,MACRA,GAAKuP,SACLA,GAAQkT,MACRA,GAAKuF,YACLA,GAAWtW,KAEXA,GAAIoC,KACJA,GAAIE,SACJA,GAAQC,QACRA,GAAO6T,cAEPA,GAAaD,gBACbA,GAAeI,KAEfA,IACAvS,GC7BEkgB,GAAgD,IAAI9+B,IAAI,CAC5D,CACE,aACA,IAAIqX,IAAI,CACN,mBACA,sBACA,wBACA,wBACA,kBACA,oBACA,sBACA,sBACA,kBACA,oBACA,wBACA,sBAGJ,CAAC,sBAAuB,IAAIA,IAAI,CAAC,wBAAyB,2BAC1D,CAAC,oBAAqB,IAAIA,IAAI,CAAC,sBAAuB,yBACtD,CACE,OACA,IAAIA,IAAI,CACN,aACA,oBACA,cACA,eACA,YACA,cACA,cACA,mBACA,eACA,sBACA,0BACA,0BACA,yBACA,uBACA,wBACA,yBACA,wBACA,6BAGJ,CACE,eACA,IAAIA,IAAI,CACN,oBACA,uBACA,0BACA,yBACA,6BAGJ,CAAC,UAAW,IAAIA,IAAI,CAAC,gBAAiB,gBAAiB,mBACvD,CACE,SACA,IAAIA,IAAI,CACN,mBACA,qBACA,sBACA,oBACA,mBACA,qBACA,sBACA,oBACA,mBACA,qBACA,sBACA,oBACA,sBACA,qBACA,qBACA,sBACA,yBAGJ,CAAC,eAAgB,IAAIA,IAAI,CAAC,mBAAoB,qBAAsB,sBAAuB,uBAC3F,CAAC,eAAgB,IAAIA,IAAI,CAAC,mBAAoB,qBAAsB,sBAAuB,uBAC3F,CAAC,eAAgB,IAAIA,IAAI,CAAC,mBAAoB,qBAAsB,sBAAuB,uBAC3F,CACE,eACA,IAAIA,IAAI,CACN,2BACA,yBACA,2BACA,yBACA,2BACA,4BAGJ,CAAC,qBAAsB,IAAIA,IAAI,CAAC,2BAA4B,2BAA4B,8BACxF,CAAC,mBAAoB,IAAIA,IAAI,CAAC,yBAA0B,yBAA0B,4BAClF,CACE,gBACA,IAAIA,IAAI,CACN,4BACA,0BACA,4BACA,0BACA,4BACA,6BAGJ,CACE,sBACA,IAAIA,IAAI,CAAC,4BAA6B,4BAA6B,+BAErE,CAAC,oBAAqB,IAAIA,IAAI,CAAC,0BAA2B,0BAA2B,6BACrF,CACE,eACA,IAAIA,IAAI,CACN,sBACA,qBACA,qBACA,sBACA,yBAGJ,CACE,gBACA,IAAIA,IAAI,CACN,yBACA,0BACA,6BACA,+BAGJ,CAAC,UAAW,IAAIA,IAAI,CAAC,cAAe,gBAAiB,iBAAkB,kBACvE,CAAC,gBAAiB,IAAIA,IAAI,CAAC,sBAAuB,uBAClD,CAAC,iBAAkB,IAAIA,IAAI,CAAC,uBAAwB,wBACpD,CAAC,SAAU,IAAIA,IAAI,CAAC,aAAc,eAAgB,gBAAiB,iBACnE,CAAC,eAAgB,IAAIA,IAAI,CAAC,qBAAsB,sBAChD,CAAC,gBAAiB,IAAIA,IAAI,CAAC,sBAAuB,uBAClD,CAAC,QAAS,IAAIA,IAAI,CAAC,MAAO,QAAS,SAAU,UAC7C,CAAC,cAAe,IAAIA,IAAI,CAAC,oBAAqB,qBAC9C,CAAC,eAAgB,IAAIA,IAAI,CAAC,qBAAsB,sBAChD,CAAC,OAAQ,IAAIA,IAAI,CAAC,YAAa,cAAe,gBAC9C,CAAC,YAAa,IAAIA,IAAI,CAAC,iBAAkB,eACzC,CAAC,MAAO,IAAIA,IAAI,CAAC,UAAW,gBAC5B,CACE,aACA,IAAIA,IAAI,CAAC,sBAAuB,6BAA8B,mBAAoB,yBAEpF,CACE,OACA,IAAIA,IAAI,CACN,qBACA,wBACA,sBACA,iBACA,oBACA,oBAGJ,CAAC,gBAAiB,IAAIA,IAAI,CAAC,qBAAsB,wBAAyB,yBAC1E,CAAC,WAAY,IAAIA,IAAI,CAAC,iBAAkB,kBACxC,CAAC,cAAe,IAAIA,IAAI,CAAC,oBAAqB,qBAC9C,CAAC,WAAY,IAAIA,IAAI,CAAC,eAAgB,kBAAmB,UAAW,gBACpE,CAAC,gBAAiB,IAAIA,IAAI,CAAC,gBAAiB,qBAC5C,CAAC,cAAe,IAAIA,IAAI,CAAC,cAAe,mBACxC,CAAC,aAAc,IAAIA,IAAI,CAAC,aAAc,kBACtC,CAAC,UAAW,IAAIA,IAAI,CAAC,eAAgB,kBACrC,CAAC,cAAe,IAAIA,IAAI,CAAC,oBAAqB,oBAAqB,uBACnE,CAAC,aAAc,IAAIA,IAAI,CAAC,kBAAmB,sBAAuB,sBAClE,CAAC,SAAU,IAAIA,IAAI,CAAC,kBAAmB,cAAe,kBAAmB,gBAAiB,mBAC1F,CAAC,WAAY,IAAIA,IAAI,CAAC,aAAc,gBACpC,CAAC,sBAAuB,IAAIA,IAAI,CAAC,wBAAyB,2BAC1D,CACE,gBACA,IAAIA,IAAI,CAAC,oBAAqB,sBAAuB,uBAAwB,wBAE/E,CACE,iBACA,IAAIA,IAAI,CAAC,qBAAsB,uBAAwB,wBAAyB,yBAElF,CACE,kBACA,IAAIA,IAAI,CAAC,uBAAwB,wBAAyB,wBAAyB,+BAErF,CAAC,cAAe,IAAIA,IAAI,CAAC,oBAAqB,uBAC9C,CACE,YACA,IAAIA,IAAI,CACN,qBACA,4BACA,kBACA,4BACA,sBACA,sBACA,uBACA,iBACA,qBACA,wBACA,yBAGJ,CACE,OACA,IAAIA,IAAI,CACN,aACA,YACA,gBACA,gBACA,kBACA,kBACA,YACA,cACA,YACA,oBAGJ,CAAC,cAAe,IAAIA,IAAI,CAAC,gBAAiB,mBAC1C,CAAC,gBAAiB,IAAIA,IAAI,CAAC,kBAAmB,qBAC9C,CAAC,qBAAsB,IAAIA,IAAI,CAAC,uBAAwB,0BACxD,CAAC,mBAAoB,IAAIA,IAAI,CAAC,qBAAsB,qBAAsB,wBAC1E,CAAC,cAAe,IAAIA,IAAI,CAAC,uBAAwB,iBAG7C0nB,GAAmD,IAAI/+B,IAAI,CAC/Dg/B,GAAW,YAAa,OACxBA,GAAW,eAAgB,OAC3BA,GAAW,OAAQ,OACnBA,GAAW,aAAc,OACzBA,GAAW,UAAW,OACtBA,GAAW,cAAe,OAC1BA,GAAW,cAAe,OAC1B,CAAC,kBAAmB,IAAI3nB,IAAI,CAAC,wBAAyB,wBAAyB,2BAC/E,CAAC,oBAAqB,IAAIA,IAAI,CAAC,0BAA2B,0BAA2B,6BACrF,CACE,sBACA,IAAIA,IAAI,CACN,8BACA,+BACA,kCACA,sCAKA4nB,GAAsD,IAAIj/B,IAAI,CAClEg/B,GAAW,YAAa,UACxBA,GAAW,gBAAiB,UAC5BA,GAAW,cAAe,UAC1BA,GAAW,UAAW,UACtBA,GAAW,OAAQ,UACnBA,GAAW,YAAa,UACxBA,GAAW,OAAQ,UACnBA,GAAW,cAAe,UAC1BA,GAAW,qBAAsB,UACjCA,GAAW,mBAAoB,UAC/BA,GAAW,aAAc,UACzB,CACE,uBACA,IAAI3nB,IAAI,CAAC,6BAA8B,6BAA8B,gCAEvE,CACE,wBACA,IAAIA,IAAI,CAAC,8BAA+B,8BAA+B,iCAEzE,CAAC,qBAAsB,IAAIA,IAAI,CAAC,2BAA4B,2BAA4B,8BACxF,CACE,uBACA,IAAIA,IAAI,CAAC,6BAA8B,6BAA8B,kCAInE6nB,GAAyC,CAAC,sBAAuB,oBAAqB,mBAE5FH,GAAuBn6B,SAAQ,CAACu6B,EAAaC,IAAcN,GAAoBxsB,IAAI8sB,EAAWD,KAE9FF,GAA0Br6B,SAAQ,CAACu6B,EAAaC,IAAcN,GAAoBxsB,IAAI8sB,EAAWD,KAEjG,MAAME,GAA+C,IAAIr/B,IAUzD,SAASg/B,GAAWI,EAAmBxf,GACrC,MAAM0f,EAAYR,GAAoB59B,IAAIk+B,GAC1C,GAAIE,EACF,MAAO,CAAC,IAAI1f,KAAUwf,IAAa,IAAI/nB,IAAI9a,MAAMrJ,KAAKosC,GAAYC,GAAqB,IAAI3f,KAAU2f,OAEzG,CAMA,SAASC,GAAeJ,EAAmBG,GACzC,MAAMD,EAAYR,GAAoB59B,IAAIk+B,GAC1C,QAAOE,GAAYA,EAAUxtB,IAAIytB,EACnC,CCtSA,SAASE,GAAyBC,GAChC,MAAMjoC,EAAW8E,MAAMrJ,KAAKwsC,GAAkB36B,QAAO,CAACtN,EAA4B8nC,KAChF,MAAMtf,EDkTV,SAA4Bsf,GAC1B,OAAOL,GAA6BliB,MAAMoiB,GACtBN,GAAoB59B,IAAIk+B,GACzBttB,IAAIytB,IAEzB,CCvTqBI,CAAmBJ,IAAaA,EACjD9nC,EAAS6a,IAAI2N,EAAU2f,GAAeF,EAAkBzf,IACxD,MAAM4f,ED4SV,SAAuBN,GACrB,OAAOF,GAAmBn+B,IAAIq+B,EAChC,CC9SkCO,CAAcP,GAS5C,OARIM,GACFA,EAAsBj7B,SAAQw6B,IACxBM,EAAiBK,iBAAiBX,KACpC3nC,EAASuoC,OAAOZ,GAChB3nC,EAAS6a,IAAI8sB,EAAWQ,GAAeF,EAAkBN,IAC1D,IAGE3nC,CAAQ,GACd,IAAIuI,KAEP,OAAOzD,MAAMrJ,KAAKuE,EAASwoC,SAC7B,CAEA,SAASL,GAAeF,EAAuCzf,GAC7D,MAAO,CACLjf,KAAM,cACNkzB,UAAW5+B,QAAQoqC,EAAiBQ,oBAAoBjgB,IACxDA,WACAntB,MAAO,CAACkO,KAAM,MAAOlO,MAAO4sC,EAAiBK,iBAAiB9f,IAElE,CDqPA6e,GAAoBl6B,SAAQ,CAACu6B,EAA0BC,KACrDD,EAAYv6B,SAAS26B,IACdF,GAAmBn+B,IAAIq+B,IAC1BF,GAAmB/sB,IAAIitB,EAAU,IAAIloB,KAEvCgoB,GAAmBn+B,IAAIq+B,GAAU/sB,IAAI4sB,EAAU,GAC/C,IEjRJ,MAuBMe,GAAiD,CACrD,CAHe,mBAGc,CAACt2B,OAAQ,WAAYgjB,QAAS,QAC3D,CAtBc,GAsBc,CAAChjB,OAAQ,UAAWgjB,QAAS,WACzD,CAtBa,iBAsBc,CAAChjB,OAAQ,SAAUgjB,QAAS,UACvD,CAjBgB,oBAiBc,CAAChjB,OAAQ,YAAagjB,QAAS,aAC7D,CA1BY,gBA0Bc,CAACA,QAAS,WAAYjQ,MAAO,SACvD,CApBe,mBAoBc,CAACiQ,QAAS,MAAOjQ,MAAO,SACrD,CAvBW,eAuBc,CAAC/S,OAAQ,OAAQgjB,QAAS,WAAYjQ,MAAO,SACtE,CAzBgB,mBAyBc,CAAC/S,OAAQ,YAAa+S,MAAO,SAC3D,CA3BY,gBA2Bc,CAAC/S,OAAQ,QAASgjB,QAAS,YAAajQ,MAAO,UACzE,CArBe,mBAqBc,CAAC/S,OAAQ,WAAYgjB,QAAS,YAAajQ,MAAO,UAC/E,CArBe,IAqBc,CAAC/S,OAAQ,WAAYgjB,QAAS,YAAajQ,MAAO,UAC/E,CA3BgB,oBA2Bc,CAAC/S,OAAQ,YAAagjB,QAAS,OAAQjQ,MAAO,UAC5E,CAnBgB,oBAmBc,CAAC/S,OAAQ,YAAagjB,QAAS,YAAajQ,MAAO,UACjF,CAlBsB,yBAkBc,CAAC/S,OAAQ,QAASgjB,QAAS,YAC/D,CApBkB,qBAoBc,CAAChjB,OAAQ,QAASgjB,QAAS,OAAQjQ,MAAO,WAG5E,SAASwjB,GAAmBC,GAC1B,OAAO9jC,MAAMrJ,KAAKmtC,GAAaC,cAE7B,MAAMlQ,EAAsC,QAA9BmQ,EAAAJ,GAAWG,EAAUt/B,aAAS,IAAAu/B,EAAAA,EAAAJ,GAAWG,EAAUtnC,YAAYlB,MAC7E,IAAKs4B,EACH,MAAM,IAAI94B,MACR,iCAAiCgpC,EAAUtnC,YAAYlB,QAA2B,QAAnB0oC,EAAAF,EAAUG,eAAS,IAAAD,OAAA,EAAAA,EAAAjtC,UAAU,EAAG,QAEnG,MAAMmpB,EAAY,CAAA,EAClB,GAAI0T,EAAMvmB,OAAQ,CAChB6S,EAAK1b,KAAO,SACZ,MAAOmkB,EAAGvF,GAAU0gB,EAAUG,QAAQ54B,MAAM,IAAI64B,OAAO,cAActQ,EAAMvmB,YAAc,GACzF6S,EAAK5kB,KAAO8nB,EAASA,EAASwQ,EAAMvmB,OAASumB,EAAMvmB,MACpD,MACC6S,EAAK1b,KAAO,OAGd,IAAI2/B,EAwBJ,GAvBqB,aAAjBvQ,EAAMvmB,QACR82B,EAAgBL,EAAkBxoC,KAElC4kB,EAAKkC,OAAU0hB,EAAkB1hB,OACjClC,EAAK2f,SAAYiE,EAAkBjE,SACnC3f,EAAK1X,aAAgBs7B,EAAkBt7B,cACZ,aAAlBorB,EAAMvD,QACf8T,EAAgBL,EAA2BM,aAChB,QAAlBxQ,EAAMvD,QACf8T,EAAgBL,EAA8BO,QACnB,cAAlBzQ,EAAMvD,QACf8T,EAAgBL,EAAkBQ,cACP,SAAlB1Q,EAAMvD,QACf8T,EAAgBL,EAAkBxoC,KACP,WAAlBs4B,EAAMvD,QACf8T,EAAe,QAASL,EAA4BzrC,UAAWyrC,EAA4BlN,MAAM2N,YACtE,cAAlB3Q,EAAMvD,QACf8T,EAAe,GAAIL,EAAkBtgB,eAAgBsgB,EAAkBU,iBAC5C,YAAlB5Q,EAAMvD,QACf8T,EAAe,IAAKL,EAAkBW,YACX,aAAlB7Q,EAAMvD,UACf8T,EAAgBL,EAAkBY,UAEhCP,EAAc,CAChB,MAAMQ,EAAe/Q,EAAMvmB,OAAS,CAACpX,QAAS,gBAAiBoX,OAAQumB,EAAMvmB,QAAU,CAACpX,QAAS,gBACjGiqB,EAAKmQ,QAAUuU,GAAsBC,GAAcV,EAAcQ,GAClE,MACCzkB,EAAKmQ,QAAU,KAUjB,MAPoB,WAAhBuD,EAAMxT,QAAmD,QAA7B0kB,EAAChB,EAAkBiB,gBAAU,IAAAD,OAAA,EAAAA,EAAA3vC,QAAS,EACpE+qB,EAAKE,MAAQ,CAAC5b,KAAM,QAASvJ,SAAU2oC,GAAoBE,EAAkBiB,WACpD,UAAhBnR,EAAMxT,MACfF,EAAKE,MAAQ,CAAC5b,KAAM,QAASvJ,SAAUgoC,GAA0Ba,EAA2BnC,QAE5FzhB,EAAKE,MAAQ,KAERF,CAAI,GAEf,CCrGA,MAAM8kB,GAA6B,IAAInqB,IAAI,CAAC,SAAU,QAAS,aAAc,iBCA7E,MAAMoqB,GAA2C,CAC/C,YAAa,gBACbxI,KAAM,aAGR,SAASyI,GAAWC,EAAkBtB,GACpC,IAAIh+B,EAAS,EACb,MAAMu/B,EAAc,GAgCpB,OA/BAD,EAAU/8B,SAASi9B,IACjB,MAAMnlB,EAAY,CAAA,EAClBA,EAAK1b,KAAO6gC,EAAS7gC,KACrB0b,EAAK5kB,KAAO+pC,EAAS/pC,KACrB4kB,EAAKmQ,QAAUgV,EAAShV,QACxBnQ,EAAKE,MAAQilB,EAASjlB,MACtB,MAAMvrB,EAmIV,SAAkBywC,EAAgBz/B,EAAgB0/B,GAChD,OAsBF,SACEt9B,EACAyG,EACA82B,GAEA,IAAK,IAAI3wC,EAAQ6Z,EAAY7Z,EAAQoT,EAAM9S,SAAUN,EACnD,GAAI2wC,EAAWv9B,EAAMpT,GAAQA,EAAOoT,GAClC,OAAOpT,EAGX,OAAQ,CACV,CAjCS4wC,CAAUH,EAASz/B,GAASqa,IACjC,OACEA,EAAK1b,OAAS+gC,EAAS/gC,MACvB0b,EAAK5kB,OAASiqC,EAASjqC,OAlEJoqC,EAmEHxlB,EAAKmQ,QAnEgBsV,EAmEPJ,EAASlV,SAjEvCqV,IAAgBC,GACjBD,EAAYlhC,OAASmhC,EAAanhC,MAAQohC,GAAgBF,EAAYzqC,SAAU0qC,EAAa1qC,cAiE1F4qC,GAAYN,KA9BGO,EA8BwB5lB,EAAKE,MAAMnlB,UA9BhB8qC,EA8B0BR,EAASnlB,MAAMnlB,UA7B1CsN,QAAO,CAACy9B,EAA4BC,KACzE,MAAMtX,EACsB,gBAA1BsX,EAAiBzhC,OAgCvB,SAA0Bif,GACxB,MAAO,WAAW/qB,KAAK+qB,EACzB,CAjCOyiB,CAAiBD,EAAiBxiB,WACjCqiB,EAAWn9B,MAAMw9B,GASzB,SAA2BC,EAAsBC,GAC/C,MAAMC,EAA0BrB,GAAiBmB,IAAiBA,EAC5DG,EAA2BtB,GAAiBoB,IAAkBA,EACpE,OACEC,IAA4BC,GAC5BvD,GAAeuD,EAA0BD,IACzCtD,GAAesD,EAAyBC,EAE5C,CAhBUC,CAAkBL,EAAgB1iB,SAAUwiB,EAAiBxiB,aAEnE,OAAOuiB,GAAsBrX,EAAU,EAAI,EAAE,GAC5C,IAE0BoX,EAAY5wC,SAX3C,IAAuB2wC,EAAmBC,EAtCjBL,EAAkBC,CAqEtC,GAEL,CA5IkBc,CAAS5C,EAAYh+B,EAAQw/B,GACvCxwC,EAAQgR,GACVuC,GAAQy7B,EAAYh+B,EAAQhR,GAAQivC,GAAmBsB,EAAY/vC,KAAKyuC,KAEtEjvC,GAAS,IACXgR,EAAShR,EAAQ,GAiJvB,SAAsBqrB,GACpB,MAAqB,WAAdA,EAAK1b,MAAqB,gDAAgD9L,KAAKwnB,EAAK5kB,KAC7F,CAlJUorC,CAAarB,GAKNQ,GAAYR,KACrBnlB,EAAKE,MAAQ,CACX5b,KAAM,QACNvJ,SAAU0rC,GAAYtB,EAASjlB,MAAMnlB,SAAU4oC,EAAWhvC,GAAOurB,MAAMnlB,YAPzEilB,EAAKE,MAAQ,CACX5b,KAAM,QACNvJ,SAAUiqC,GAAWG,EAASjlB,MAAMnlB,SAAU4oC,EAAWhvC,GAAOurB,MAAMnlB,YAS5EmqC,EAAY/vC,KAAK6qB,EAAK,GACrB,IAECra,EAASg+B,EAAW1uC,QACtBiT,GAAQy7B,EAAYh+B,EAAQg+B,EAAW1uC,QAAS2uC,GAAmBsB,EAAY/vC,KAAKyuC,KAG/EsB,CACT,CAEA,SAASuB,GAAYC,EAAyBC,GAC5C,IAAIC,EAAyB,GAqC7B,OAnCAF,EAAiBx+B,SAAS2+B,IACK,gBAAzBA,EAAgBviC,MACpBsiC,EAAgBzxC,KAAK0xC,EAAgB,IAEvCF,EAAkBz+B,SAAS86B,IACzB,GAA8B,gBAA1BA,EAAiB1+B,KAAwB,OAC7C,GJwPwBu+B,EItPpBG,EAAiBzf,SACjBqjB,EAAgBzrC,KAAKglB,GAAqBA,EAAYoD,WJsP1C9a,MAAMi6B,GAAsBI,GAAeJ,EAAWG,KInPpE,OJkPN,IAA4BA,EIjPxB,MAAMiE,EAA8BF,EAAgBj+B,QACjDwX,GAAqBA,EAAYoD,WAAayf,EAAiBzf,WAElE,GAA2C,IAAvCujB,EAA4B7xC,OAC9B2xC,EAAgBzxC,KAAK6tC,OAChB,CACL,MAAM+D,EAA0BD,EAC7B7rC,QACA8iB,UACAuC,MAAMH,GAAqBA,EAAY/pB,MAAMA,QAAU4sC,EAAiB5sC,MAAMA,QACjF,GAAK2wC,EAMMA,EAAwBvP,YAAcwL,EAAiBxL,WAChEsP,EAA4B5+B,SAASiY,GAAsBA,EAAYqX,UAAYwL,EAAiBxL,gBAPxE,CAC5B,GJyNakL,EIzNGM,EAAiBzf,SJ0NhC6e,GAAoBhtB,IAAIstB,GI1NmB,OAC5CkE,EAAkBA,EAAgBj+B,QAC/BwX,GAAqBA,EAAYoD,WAAayf,EAAiBzf,WAElEqjB,EAAgBzxC,KAAK6tC,EACtB,CAGF,CJiNL,IAAqBN,CIjNhB,IAGIkE,CACT,CASA,SAASlB,GAAgBsB,EAAmBC,GAC1C,OAAKpnC,MAAM6d,QAAQspB,KAAkBnnC,MAAM6d,QAAQupB,IAI/CpnC,MAAM6d,QAAQspB,IACdnnC,MAAM6d,QAAQupB,IACdD,EAAa/xC,SAAWgyC,EAAchyC,QACtC+xC,EAAaE,OAAM,CAACC,EAAgBxyC,KAClC,MAAMyyC,EAAaH,EAActyC,GACjC,OACEwyC,EAAU7iC,OAAS8iC,EAAW9iC,OAYnB+iC,EAXCF,EAAU/rC,KAWIksC,EAXEF,EAAWhsC,KAYxCisC,IAAaC,GAAcD,GAAYC,GAAaD,EAASjsC,MAAQisC,EAASjsC,OAASksC,EAAUlsC,QAGpFmsC,EAdCJ,EAAU/wC,MAcKoxC,EAdEJ,EAAWhxC,MAe1CmxC,IAAcC,GAAeD,EAAUjjC,OAASkjC,EAAWljC,MAAQijC,EAAUnxC,QAAUoxC,EAAWpxC,QAdjGsvC,GAAgByB,EAAUpsC,SAAUqsC,EAAWrsC,UAazD,IAAsBwsC,EAAgBC,EAJjBH,EAAeC,CAR3B,GAIT,CAmDA,SAAS3B,GAAY3lB,GACnB,MAAqB,SAAdA,EAAK1b,MAAmB,6BAA6B9L,KAAKwnB,EAAK5kB,KACxE,CAmBA,SAAS8M,GACPH,EACA0/B,EACAC,EACAC,GAEA,IAAK,IAAIhzC,EAAQ8yC,EAAW9yC,EAAQ+yC,IAAW/yC,EAC7CgzC,EAAS5/B,EAAMpT,GAAQA,EAAOoT,EAElC,CCjMA,MAAMkV,GAAO,IAAI2qB,KAAJ,ECEb,SAASC,GAAuBC,GAC9B,MAAMC,EAAaloC,MAAMrJ,KAAKsxC,EAAGjtC,YAC9BM,KAAI6sC,GACe,OAAdA,EAAK5sC,KACA,IAAI4sC,EAAK5xC,QACO,UAAd4xC,EAAK5sC,KACPyE,MAAMrJ,KAAMsxC,EAAmBG,WACnC9sC,KAAIgB,GAAK,IAAIA,MACbd,KAAK,IAED,IAAI2sC,EAAK5sC,SAAS4sC,EAAK5xC,YAGjCiF,KAAK,IACR,MAAO,GAAGysC,EAAGI,WAAWH,GAC1B,CCRA,SAASI,GAAiBC,EAA6BC,EAAMprB,IAC3DorB,EAAI,+CAAgDR,GAAuBO,IAE3E,IACE,MAAME,EJRV,SAAkCC,GAChC,MAAMC,EAAU7D,GAAc4D,EAAa,CACzCxyC,QAAS,aACT0X,oBAAoB,EACpBC,kBAAkB,EAClBC,YAAY,EACZC,qBAAqB,IA4EvB,OAxEA66B,GAAaD,EAAS,CACpBnoB,MAAO,eACP,KAAAZ,CAAMpS,EAAWtH,GACG,SAAdsH,EAAKjS,KACP2K,EAAKgB,KAAO,CAACzC,KAAM,aAAclO,MAAO,KACjB,OAAdiX,EAAKjS,OACd2K,EAAKgB,KAAO,CAACzC,KAAM,aAAclO,MAAO,OAE3C,IAGHqyC,GAAaD,EAAS,CACpBnoB,MAAO,gBACP,KAAAZ,CAAMpS,GACJ,GAAI,CAAC,SAAU,aAAaumB,SAAS9wB,KAAKqK,OAAO/R,MAAO,CACtD,MAAML,EAAWsS,EAAKtS,SAASiN,UACzB0gC,EAAyB,WAAdr7B,EAAKjS,KAAoB,EAAIL,EAAS9F,OAAS,EAC1D2C,EAAMmD,EAAS2tC,GACJ,WAAb9wC,EAAI0M,OACNvJ,EAAS2tC,GAAY,CAACpkC,KAAM,MAAOlO,MAAOwB,EAAIxB,OAC9CiX,EAAKtS,SAAS+M,UAAU/M,GAE3B,CACF,IAGH0tC,GAAaD,EAAS,CACpBnoB,MAAO,sBACP,KAAAZ,CAAMpS,GACAy3B,GAA2B1vB,IAAI/H,EAAKjS,QACtCiS,EAAK/I,KAAO,wBAEf,IAGHmkC,GAAaD,EAAS,CACpBnoB,MAAO,WACP,KAAAZ,CAAMpS,GACJ,MAAMtS,EAAWsS,EAAKtS,SAASiN,UAC/B,GAAIjN,EAAS9F,OAAS,EAAG,CACvB,MAAM0zC,EAAmB5tC,EAAS4N,QAAO,CAACigC,EAASj0C,KACjD,MAAMk0C,EAAc9tC,EAASpG,EAAQ,GAE/Bm0C,EAAuBD,EACJ,wBAArBA,EAAYvkC,MAAuD,0BAArBukC,EAAYvkC,UAC1DsH,EAIJ,QAF0C,MAAjBg9B,EAAQxtC,MAAiC,iBAAjBwtC,EAAQtkC,MAA2BwkC,EAE5D,IAE1Bz7B,EAAKtS,SAAS+M,UAAU6gC,EAAiB1zC,OAAS0zC,EAAmB,KACtE,CACF,IAGHF,GAAaD,EAAS,CACpBnoB,MAAO,oBACP,KAAAZ,CAAMpS,GACAA,EAAKjX,OAA6B,eAApBiX,EAAKjX,MAAMkO,OAQ3B+I,EAAKjX,MAAQ,CAACkO,KAAM,SAAUlO,MAAOiX,EAAKjX,MAAMgF,MAEnD,IAGIspC,GAAsB8D,EAC/B,CI3E2BO,CAAyBX,EAAUG,aAC1DF,EAAI,kDAEJ,MAAMW,EAAWtF,GAAmB0E,EAAUa,MAAMpE,UACpDwD,EAAI,4CAEJ,MAAMnD,EAAcF,GAAWsD,EAAevtC,SAAUiuC,GACxDX,EAAI,iCAEJ,MAAMtE,EAAUmF,GAAiBC,GAAwB,CAAC7kC,KAAM,aAAcvJ,SAAUmqC,KAGxF,OAFAmD,EAAI,iDAAkDtE,EAAQ9uC,QAEvD8uC,CACR,CAAC,MAAOtsC,GAIP,OAHA4wC,EAAI,wDAAyD5wC,EAAIb,QAASa,GAC1E4wC,EAAI,0CAEiC,iBAA1BD,EAAUG,aAA4BH,EAAUG,YAAYtzC,OAAS,GAC9EozC,EAAI,6DACGD,EAAUG,aACRH,EAAUa,OAASb,EAAUa,MAAMpE,UAC5CwD,EAAI,6DACGxoC,MAAMrJ,KAAK4xC,EAAUa,MAAMpE,UAAUx8B,QAAO,CAACyG,GAAci1B,aAAsBj1B,EAAMi1B,GAAS,MAGzGsE,EAAI,2DAEG,GACR,CACH,CC1CA,SAASe,GAASrN,EAAasN,GAC7B,IAAIxtC,EAAIkgC,EAAE,GACRpS,EAAIoS,EAAE,GACN5/B,EAAI4/B,EAAE,GACNuN,EAAIvN,EAAE,GAERlgC,EAAI0tC,GAAG1tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,WAC7BC,EAAIC,GAAGD,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,IAAK,WAC9BltC,EAAIotC,GAAGptC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,GAAI,WAC7B1f,EAAI4f,GAAG5f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,YAC9BxtC,EAAI0tC,GAAG1tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,WAC7BC,EAAIC,GAAGD,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,GAAI,YAC7BltC,EAAIotC,GAAGptC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,IAAK,YAC9B1f,EAAI4f,GAAG5f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,UAC9BxtC,EAAI0tC,GAAG1tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,EAAG,YAC5BC,EAAIC,GAAGD,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,IAAK,YAC9BltC,EAAIotC,GAAGptC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,IAAK,OAC/B1f,EAAI4f,GAAG5f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,IAAK,IAAK,YAC/BxtC,EAAI0tC,GAAG1tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,IAAK,EAAG,YAC7BC,EAAIC,GAAGD,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,IAAK,IAAK,UAC/BltC,EAAIotC,GAAGptC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,IAAK,YAC/B1f,EAAI4f,GAAG5f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,IAAK,GAAI,YAE9BxtC,EAAI2tC,GAAG3tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,WAC7BC,EAAIE,GAAGF,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,GAAI,YAC7BltC,EAAIqtC,GAAGrtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,GAAI,WAC9B1f,EAAI6f,GAAG7f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,WAC9BxtC,EAAI2tC,GAAG3tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,WAC7BC,EAAIE,GAAGF,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,IAAK,EAAG,UAC7BltC,EAAIqtC,GAAGrtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,IAAK,WAC/B1f,EAAI6f,GAAG7f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,WAC9BxtC,EAAI2tC,GAAG3tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,EAAG,WAC5BC,EAAIE,GAAGF,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,IAAK,GAAI,YAC9BltC,EAAIqtC,GAAGrtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,IAAK,WAC9B1f,EAAI6f,GAAG7f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,GAAI,YAC7BxtC,EAAI2tC,GAAG3tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,IAAK,GAAI,YAC9BC,EAAIE,GAAGF,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,GAAI,UAC7BltC,EAAIqtC,GAAGrtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,GAAI,YAC7B1f,EAAI6f,GAAG7f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,IAAK,IAAK,YAE/BxtC,EAAI4tC,GAAG5tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,QAC7BC,EAAIG,GAAGH,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,IAAK,YAC9BltC,EAAIstC,GAAGttC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,GAAI,YAC9B1f,EAAI8f,GAAG9f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,IAAK,IAAK,UAC/BxtC,EAAI4tC,GAAG5tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,YAC7BC,EAAIG,GAAGH,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,GAAI,YAC7BltC,EAAIstC,GAAGttC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,IAAK,WAC9B1f,EAAI8f,GAAG9f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,IAAK,IAAK,YAC/BxtC,EAAI4tC,GAAG5tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,IAAK,EAAG,WAC7BC,EAAIG,GAAGH,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,IAAK,WAC9BltC,EAAIstC,GAAGttC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,IAAK,WAC9B1f,EAAI8f,GAAG9f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,GAAI,UAC7BxtC,EAAI4tC,GAAG5tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,WAC7BC,EAAIG,GAAGH,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,IAAK,IAAK,WAC/BltC,EAAIstC,GAAGttC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,GAAI,WAC9B1f,EAAI8f,GAAG9f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,WAE9BxtC,EAAI6tC,GAAG7tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,WAC7BC,EAAII,GAAGJ,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,GAAI,YAC7BltC,EAAIutC,GAAGvtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,IAAK,YAC/B1f,EAAI+f,GAAG/f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,UAC9BxtC,EAAI6tC,GAAG7tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,IAAK,EAAG,YAC7BC,EAAII,GAAGJ,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,GAAI,IAAK,YAC9BltC,EAAIutC,GAAGvtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,IAAK,IAAK,SAC/B1f,EAAI+f,GAAG/f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,YAC9BxtC,EAAI6tC,GAAG7tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,EAAG,YAC5BC,EAAII,GAAGJ,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,IAAK,IAAK,UAC/BltC,EAAIutC,GAAGvtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,IAAK,YAC9B1f,EAAI+f,GAAG/f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,IAAK,GAAI,YAC9BxtC,EAAI6tC,GAAG7tC,EAAG8tB,EAAGxtB,EAAGmtC,EAAGD,EAAE,GAAI,GAAI,WAC7BC,EAAII,GAAGJ,EAAGztC,EAAG8tB,EAAGxtB,EAAGktC,EAAE,IAAK,IAAK,YAC/BltC,EAAIutC,GAAGvtC,EAAGmtC,EAAGztC,EAAG8tB,EAAG0f,EAAE,GAAI,GAAI,WAC7B1f,EAAI+f,GAAG/f,EAAGxtB,EAAGmtC,EAAGztC,EAAGwtC,EAAE,GAAI,IAAK,WAE9BtN,EAAE,GAAK4N,GAAM9tC,EAAGkgC,EAAE,IAClBA,EAAE,GAAK4N,GAAMhgB,EAAGoS,EAAE,IAClBA,EAAE,GAAK4N,GAAMxtC,EAAG4/B,EAAE,IAClBA,EAAE,GAAK4N,GAAML,EAAGvN,EAAE,GACpB,CAEA,SAAS6N,GAAIC,EAAWhuC,EAAW8tB,EAAWoS,EAAWhiC,EAAWC,GAElE,OADA6B,EAAI8tC,GAAMA,GAAM9tC,EAAGguC,GAAIF,GAAM5N,EAAG/hC,IACzB2vC,GAAO9tC,GAAK9B,EAAM8B,IAAO,GAAK9B,EAAK4vB,EAC5C,CAEA,SAAS4f,GAAG1tC,EAAW8tB,EAAWxtB,EAAWmtC,EAAWvN,EAAWhiC,EAAWC,GAC5E,OAAO4vC,GAAKjgB,EAAIxtB,GAAOwtB,EAAI2f,EAAIztC,EAAG8tB,EAAGoS,EAAGhiC,EAAGC,EAC7C,CAEA,SAASwvC,GAAG3tC,EAAW8tB,EAAWxtB,EAAWmtC,EAAWvN,EAAWhiC,EAAWC,GAC5E,OAAO4vC,GAAKjgB,EAAI2f,EAAMntC,GAAKmtC,EAAIztC,EAAG8tB,EAAGoS,EAAGhiC,EAAGC,EAC7C,CAEA,SAASyvC,GAAG5tC,EAAW8tB,EAAWxtB,EAAWmtC,EAAWvN,EAAWhiC,EAAWC,GAC5E,OAAO4vC,GAAIjgB,EAAIxtB,EAAImtC,EAAGztC,EAAG8tB,EAAGoS,EAAGhiC,EAAGC,EACpC,CAEA,SAAS0vC,GAAG7tC,EAAW8tB,EAAWxtB,EAAWmtC,EAAWvN,EAAWhiC,EAAWC,GAC5E,OAAO4vC,GAAIztC,GAAKwtB,GAAK2f,GAAIztC,EAAG8tB,EAAGoS,EAAGhiC,EAAGC,EACvC,CAqCA,SAAS8vC,GAAO/vC,GAEd,MAAMgwC,EAAoB,GAC1B,IAAI9tC,EACJ,IAAKA,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACvB8tC,EAAQ9tC,GAAK,GACXlC,EAAEtF,WAAWwH,IAAMlC,EAAEtF,WAAWwH,EAAI,IAAM,IAAMlC,EAAEtF,WAAWwH,EAAI,IAAM,KAAOlC,EAAEtF,WAAWwH,EAAI,IAAM,IAEzG,OAAO8tC,CACT,CAEA,MAAMC,GAAU,mBAAmBj/B,MAAM,IAEzC,SAASk/B,GAAKjvC,GACZ,IAAIjB,EAAI,GACJmwC,EAAI,EACR,KAAOA,EAAI,EAAGA,IAAKnwC,GAAKiwC,GAAShvC,GAAU,EAAJkvC,EAAQ,EAAM,IAAQF,GAAShvC,GAAU,EAAJkvC,EAAU,IACtF,OAAOnwC,CACT,CAMA,SAASowC,GAAIpwC,GACX,OALWgiC,EAvDb,SAAchiC,GACZ,MAAMiB,EAAIjB,EAAE9E,OACNkB,EAAQ,CAAC,YAAa,WAAY,WAAY,WACpD,IAAI8F,EACJ,IAAKA,EAAI,GAAIA,GAAKlC,EAAE9E,OAAQgH,GAAK,GAC/BmtC,GAASjzC,EAAO2zC,GAAO/vC,EAAElD,UAAUoF,EAAI,GAAIA,KAE7ClC,EAAIA,EAAElD,UAAUoF,EAAI,IACpB,MAAMiL,EAAO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC3D,IAAKjL,EAAI,EAAGA,EAAIlC,EAAE9E,OAAQgH,IAAKiL,EAAKjL,GAAK,IAAMlC,EAAEtF,WAAWwH,KAAOA,EAAI,GAAK,GAE5E,GADAiL,EAAKjL,GAAK,IAAM,MAASA,EAAI,GAAK,GAC9BA,EAAI,GAEN,IADAmtC,GAASjzC,EAAO+Q,GACXjL,EAAI,EAAGA,EAAI,GAAIA,IAAKiL,EAAKjL,GAAK,EAIrC,OAFAiL,EAAK,IAAU,EAAJlM,EACXouC,GAASjzC,EAAO+Q,GACT/Q,CACT,CA0Cai0C,CAAKrwC,GAJTgiC,EAAE5gC,IAAI8uC,IAAM5uC,KAAK,IAD1B,IAAa0gC,CAMb,CAEA,SAAS4N,GAAM9tC,EAAW8tB,GACxB,OAAQ9tB,EAAI8tB,EAAK,UACnB,CChKA,SAAS0gB,GAAkBtG,GAAiBuG,8BAACA,GAA2D,CAAA,GAGtG,MAWM1qB,EAAgB,GAOtB,MAlBgB,CAEd,8BAGA,8BAGA,gCAIM1X,SAAQqiC,IACd,IAAIr0C,EACJ,KAAuC,QAA/BA,EAASq0C,EAAGC,KAAKzG,KACvBnkB,EAAIzqB,KAAKe,EAAO,GACjB,IAEIo0C,EACH1qB,EAAIzkB,KAAIvD,IACN,MAAMuT,EAAQvT,EAAIuT,MAAM,eACxB,OAAOA,GAASA,EAAMlW,OAASkW,EAAM,GAAGtU,UAAU,GAAKe,CAAG,IAE5DgoB,CACN,CC/BA,SAAS6qB,GAA0BhJ,GACjC,IAAIiJ,EAAe,GACnB,IAAK,IAAIzuC,EAAI,EAAGytC,EAAKjI,EAAMxsC,OAAQgH,EAAIytC,EAAIztC,IAAK,CAC9C,MAAMsnB,EAAWke,EAAMxlC,GACvB,IAAI0uC,EAAgBlJ,EAAM4B,iBAAiB9f,IACvC,eAAe/qB,KAAKmyC,IAAkB,MAAMnyC,KAAK+qB,MACnDonB,EAA4BA,EAW7B/gC,QAAQ,4BAA4ByO,GAAYjb,OAAOwE,cAAcD,SAAS0W,EAASnN,OAAO,GAAG0/B,OAAQ,OACzGhhC,QAAQ,oBAAqB,OAV9B,MAAMihC,EAAOR,GAAkBM,GAC/BD,EAAKA,EAAG5vB,OAAO+vB,EAChB,CACD,OAAOH,CACT,CCXA,MAAMI,GAAe,kCAErB,SAASC,GAAwBjD,GAC/B,MAAM/F,GAAY+F,EAAW/F,SAAY+F,EAAWkD,mBAAmB3V,KAAKyS,GAE5E,IAAI+C,EAAiB,GAGrB,GAAI9I,EAAQ,8BAA+B,CACzC,MAAMkJ,EAASnD,EAAGhsC,aAAa,UAE/B+uC,EAAOA,EAAK/vB,OAiDd,SAAiBowB,EAAgBx2C,EAAgBy2C,GAC/C,MAAMpJ,EAAoB,GACpBqJ,EAAe,IAAIpH,OAAOkH,EAAO9qC,OAAQ8qC,EAAOpV,OAChDuV,EAAWD,EAAaE,OAC9B,IAAIngC,EACJ,MAAQA,EAAQigC,EAAaZ,KAAK91C,MAChCqtC,EAAQ5sC,KAAKg2C,EAAOhgC,IACfkgC,KAEP,OAAOtJ,CACR,CA3DoBwJ,CAAQT,GAAcG,GAAQ9/B,GAASA,EAAM,KACjE,CAGD,GAAI42B,EAAQ,uEAAwE,CAClF,MAAMhO,EAAM+T,EAAGhsC,aAAa,OAC5B+uC,EAAK11C,KAAK4+B,EACX,CAGD,GAAIgO,EAAQ,aAAc,CACxB,MAAM5pC,EAAO2vC,EAAGhsC,aAAa,SAAWgsC,EAAGhsC,aAAa,cACpD3D,IAiDN,SAAiBP,EAAaC,GAC5B,IACE,MAAM2zC,EAAgB,IAAI1zC,IAAID,GACxB4zC,EAAY,IAAI3zC,IAAIF,EAAKC,GAC/B,OACE4zC,EAAUC,SAAWF,EAAcE,QACnCD,EAAUE,WAAaH,EAAcG,UACrC/yC,QAAQ6yC,EAAUG,KAErB,CAAC,MAAOn1C,GACP,OAAO,CACR,CACF,CA7Dco1C,CAAQ1zC,EAAO2vC,EAAGttC,cAA2BjC,SAASJ,OACjE0yC,EAAK11C,KAAKgD,EAEb,CAQD,GALI4pC,EAAQ,WAAa+F,EAAGhsC,aAAa,SACvC+uC,EAAK11C,KAAK2yC,EAAGhsC,aAAa,SAIxBimC,EAAQ,kDAAmD,CAC7D,MAAM5pC,EAAO2vC,EAAGhsC,aAAa,QAC7B+uC,EAAK11C,KAAKgD,EACX,CAGD,GAAI4pC,EAAQ,iBAAkB,CAC5B,MAAM+J,EAAShE,EAAGhsC,aAAa,UAC/B+uC,EAAK11C,KAAK22C,EACX,CAGD,GAAI/J,EAAQ,cAAe,CACzB,MAAMhO,EAAM+T,EAAGhsC,aAAa,OAC5B+uC,EAAK11C,KAAK4+B,EACX,CAGD,MAAMgY,ECpDR,SAA2CjE,GACzC,GAAIA,EAAGntC,aAAa,SAClB,OAAO8vC,GAA2B3C,EAAmBrG,MAEzD,CDgDwBuK,CAAkClE,GAKxD,OAJIiE,IACFlB,EAAOA,EAAK/vB,OAAOixB,IAGdlB,CA4BT,CEpFA,SAASoB,GAAoBhD,GAC3B,MAAMD,EAAWtF,GAAmBuF,EAAMpE,UAC1C,OAAOqE,GAAiBC,GAAwB,CAAC7kC,KAAM,aAAcvJ,SAAUiuC,IACjF,CCPA,SAASkD,GAAmBC,GAC1B,MAAM3xC,cAACA,GAAiB2xC,EACxB,IAAK3xC,EAAe,OAAO,EAC3B,MAAMkiC,QAACA,GAAWliC,EAAc3B,YAAauzC,iBAAiBD,IACxD9N,MAACA,EAAKtB,OAAEA,GAAUoP,EAAQE,wBAEhC,MAAmB,SAAZ3P,GAAgC,IAAV2B,GAA0B,IAAXtB,CAC9C,CCJA,SAASuP,GAAmB5V,GAC1B,IAIE,OAH0BgO,GACxBC,GAAcjO,EAAMj7B,cAAe,CAAC1F,QAAS,oBAEtBgF,SAAS0N,MAAM8jC,IACtC,MAAMC,EAAiBC,GAAsBF,GAG7C,OAFIA,EAAc5T,WAAW6T,EAAe5wC,QAAQ2wC,GAE7CC,EAAetF,OAAO75B,YAC3B,QAAIA,EAAKqrB,WAAa,CAAC,MAAO,QAAQ9E,SAASvmB,EAAKqrB,aAClC,YAAdrrB,EAAK/I,OAEQ,eAAd+I,EAAK/I,MAAuC,eAAd+I,EAAK/I,OACpC,CAAC,MAAO,UAAUsvB,SAAoC,QAA3BkQ,EAAa,QAAbD,EAAAx2B,EAAKjS,YAAQ,IAAAyoC,EAAAA,EAAAx2B,EAAKsrB,iBAAS,IAAAmL,EAAAA,EAAI,IAGhDz2B,EAAKqrB,UAA8B,QAAlBrrB,EAAKqrB,UADxBrrB,EAAKqrB,UAA8B,QAAlBrrB,EAAKqrB,UACoB,GACpD,GAEL,CAAC,MAAAmL,GACA,OAAO,CACR,CACH,CAEA,SAAS4I,GAAsBF,WAC7B,MAAMC,EAAsC,GAC5C,GAAID,EAAc3T,UAChB4T,EAAer3C,QAAQs3C,GAAsBF,EAAc3T,gBACtD,CACL,MAAM8T,EAKE,QAJN5I,EAAwB,QAAxBD,EAAA0I,EAAcxxC,gBAAU,IAAA8oC,OAAA,EAAAA,EAAAx7B,QAAO,CAACqkC,EAA4Br/B,KACxC,cAAdA,EAAK/I,KAAsBooC,EAAMv3C,QAAQs3C,GAAsBp/B,IAC1C,eAAdA,EAAK/I,MAAuC,QAAd+I,EAAKjS,MAAiBsxC,EAAMv3C,KAAKkY,GACnEq/B,IACN,WAAG,IAAA5I,EAAAA,EAAI,GACZ0I,EAAer3C,QAAQu3C,EACxB,CAED,OAAOF,CACT,CC1CA,MAAMG,GAAYjlC,OAAO,OA4CzB,SAASklC,GAAgCv/B,GACvC,MAAMw/B,EApBR,SAAyBx/B,GACvB,GAAsB,oBAAXpT,OAAwB,OAAO,KAE1C,MAAM83B,EAAe93B,OAAOC,KAAKC,UAAUqgB,SAASoY,MAAMvlB,GAAMzD,QAAQ,iBAAkB,MAC1F,OAAQ3P,OAAe83B,EACzB,CAee+a,CAAgBz/B,GAE7B,OAAKw/B,GA7CuBE,EAiDhB1/B,EAjD6B2/B,EAiDvBH,EAAK1yC,UAhDhB,IAAI8yC,MAAMl0C,OAAOiR,OAAO+iC,GAAW,CACxC,GAAAvoC,CAAI0oC,EAASvZ,EAAMwZ,GACjB,GAAIxZ,IAASgZ,GACX,OAAOI,EAGT,MAAM32C,EAAQg3C,QAAQ5oC,IAAIwoC,EAAOrZ,EAAMoZ,GACvC,MAAqB,mBAAV32C,EACF,WACL,OAAOA,EAAMw8B,MAAM9vB,OAASqqC,EAAQJ,EAAWjqC,KAAM4O,UACvD,EAEOtb,CAEV,KA+BMiX,EA9CX,IAA8B0/B,EAAaC,CAkD3C,CAEAJ,GAAgBS,OAjChB,SAAgCC,GAC9B,OAAQA,EAAgBX,KAAcW,CACxC,ECAA,MAAMC,GAAuB,IAAI5yB,IAAI,CACnC,OACA,iBACA,QACA,QACA,SACA,WACA,SACA,MACA,OACA,OACA,MACA,OACA,UAEI6yB,GAAiB,aAEvB,SAASC,GAAcC,EAAsC71C,EAAiBwwC,EAAMprB,IAClF,MAAM0wB,EAAiB,CAAC,CAACpyC,SAAUrB,KAAK0zC,gBAClCC,EAAyD,CAACH,GAC1DI,EAAkC,GAClCC,EAA+B,GAC/BC,EAAyB,GACzBC,EAA4B,GAClC,IAAIC,EAAqB,GACzB,MAAMC,EAA0B,GAC1BC,EAA0B,GAMhC,OAJAT,EAAI,GAAGU,iBAAmBC,EAAgBX,EAAKD,EAAQa,YAClDb,EAAgBc,oBAAuBd,EAAgBc,mBAAmBv5C,OAAS,IACtF04C,EAAI,GAAGc,uBAAyBC,GAAsBhB,IAEjD,CACLC,MACAE,WACAC,iBACAE,SACAD,eACAE,cACAC,WACAC,aACAC,cAGF,SAASE,EAAgBX,EAAgBgB,GACvC,IAAKA,GAAwC,IAAxBA,EAAa15C,OAAc,OAAO,KAEvD,MAAM25C,EAAyB,GAO/B,OANA/uC,MAAM1F,UAAU+N,QAAQhN,KAAKyzC,GAAeE,IAC1C,MAAMl6C,EAAQm6C,EAAmBnB,EAAKkB,GACxB,OAAVl6C,GACFi6C,EAAaz5C,KAAKR,EACnB,IAEIi6C,CACR,CAED,SAASE,EAAmBnB,EAAgBoB,SAC1C,MAAMF,EAAcjC,GAAgBmC,GAEpC,IAAI1hC,EAEJ,GAAI,CAACnT,KAAKsB,aAActB,KAAK80C,wBAAwBpb,SAASib,EAAYtzC,UAAkB,CAC1F,GAAKszC,EAAoBl0C,cAAiBk0C,EAAoBl0C,aAAa,wBAAyB,OAAO,KAC3G,GACE,CAAC,OAAQ,QAAS,UAAUi5B,SAAUib,EAAwB3G,YAClC,QAA5BrE,EAACgL,EAAoBnY,aAAO,IAAAmN,OAAA,EAAAA,EAAA+G,UAC3B0B,GAAoBuC,EAAoBnY,OAEzC,OAAO,KAGT,GAA0C,WAArCmY,EAAwB3G,SAC3B76B,EAgRR,SAAuBwhC,GACrB,MAAO,CACLtzC,SAAUrB,KAAKsB,aACf0sC,SAAU,SACVrtC,WAAYo0C,GAAeJ,GACxB1zC,KAAInF,IACH,MAAMoF,EAAOyzC,EAAYh0C,WAAW7E,GAAKoF,KAEzC,MAAO,CAACA,OAAMhF,MADAo3C,GAAeh1C,KAAK4C,GAAQ,GAAKyzC,EAAYh0C,WAAW7E,GAAKI,MACvD,IAErBuS,QAAOq/B,GAAsB,QAAdA,EAAK5sC,OACvBizC,iBAAkB,GAEtB,CA7Rea,CAAcL,OAChB,CACL,MAAMM,EACHN,EAAoBO,YACpBP,EAAoBO,WAAWb,WAAWt5C,QACU,eAApD45C,EAAoBO,WAAW9yC,YAAYlB,KAoB9C,GAnBAiS,EAgKR,SAAsBwhC,aACpB,MAAMxhC,EAAgB,CACpB9R,SAAUszC,EAAYtzC,SACtB2sC,SAAU2G,EAAY3G,SACtBrtC,WAAYo0C,GAAeJ,GAAa1zC,KAAInF,IAC1C,IAAII,EAAQy4C,EAAYh0C,WAAW7E,GAAKI,MACxC,MAAMgF,EAAOyzC,EAAYh0C,WAAW7E,GAAKoF,KAkBzC,OAjBIhF,EAAMw9B,SAAS,SACjBx9B,EAAQA,EAAMwT,QAAQ,SAAU,IACvB4jC,GAAeh1C,KAAK4C,GAC7BhF,EAAQ,GAEiB,WAAzBy4C,EAAY3G,UACZhvC,EAAkB21C,IACT,QAATzzC,GACsE,gBAArEyzC,EAAkCv2C,gBAAiBC,SAASJ,MAC5D02C,EAAkCv2C,gBAAiBC,SAASJ,OAC3DiB,EAAchD,EAAOy4C,EAAYr0C,cAAejC,SAASJ,MAE3D/B,EAASy4C,EAAkCv2C,gBAAiBC,SAASJ,KACnD,UAATiD,IACThF,ECxRR,SAA+B4sC,GAC7B,MAAMqM,EAAiB,CACrB/qC,KAAM,kBACNvJ,SAAUgoC,GAAyBC,IAGrC,OAAOkG,GAAiBmG,EAC1B,CDiRgBC,CAAuBT,EAA4BpN,QAGtD,CAACrmC,OAAMhF,QAAM,KAIxB,GACgD,UAA7Cy4C,EAAiC/zC,SAClC,CAAC,WAAY,SAAS84B,SAAUib,EAAiCvqC,MACjE,CACA,GACGuqC,EAAiCh0C,WAAW00C,aAAa,aACxDV,EAAiCW,QACnC,CACA,MAAM5qC,EAAMyI,EAAKxS,WAAY0qC,WAAU1pC,GAAgB,YAAXA,EAAET,OAC9CiS,EAAKxS,WAAYgY,OAAOjO,EAAK,EAC9B,EAEGiqC,EAAiCh0C,WAAW00C,aAAa,YAC1DV,EAAiCW,SAElCniC,EAAKxS,WAAY1F,KAAK,CAACiG,KAAM,YAE1ByzC,EAAiCY,eACpCpiC,EAAKxS,WAAY1F,KAAK,CACpBiG,KAAM,gCACNhF,MAAOE,KAAKC,UAAU,CAACk5C,eAAe,KAG3C,CAED,GACgD,UAA7CZ,EAAiC/zC,SAClCyyC,GAAqBn4B,IAAKy5B,EAAiCvqC,MAC3D,CACA,MAAMorC,EAAsF,OAAtEb,EAAiCh0C,WAAW00C,aAAa,SACzEI,EAAqF,QAAzE7L,EAAkE,QAAjED,EAAAgL,EAAiCh0C,WAAW00C,aAAa,gBAAQ,IAAA1L,OAAA,EAAAA,EAAEztC,aAAK,IAAA0tC,EAAAA,EAAI,GACzF8L,EAAmD,QAAtChL,EAAAiK,EAAiCz4C,aAAK,IAAAwuC,EAAAA,EAAI,GAGxD8K,GAAgBC,IAAcC,GACjCC,GAAqBxiC,EAAKxS,WAAa,QAAS+0C,EAEnD,CAGgD,WAA9Cf,EAAkC/zC,SAClC+zC,EAAkCiB,eACjCjB,EAAkCiB,cAAoCC,iBACxElwC,MAAMrJ,KAAOq4C,EAAkCiB,cAAoCC,iBAAiBp0C,QAClGixC,GAAgBS,OAAOwB,KACpB,GAELgB,GAAqBxiC,EAAKxS,WAAa,WAAY,IAIL,UAA7Cg0C,EAAiC/zC,SACjC+zC,EAAiC5F,OACjC4F,EAAiC5F,MAAO+G,UAEzC3iC,EAAKxS,WAAY1F,KAAK,CAACiG,KAAM,2BAA4BhF,MAAO,KAGnB,SAA5Cy4C,EAAgC/zC,SACS,aAAzC+zC,EAAgCvqC,MAChCuqC,EAAgC5F,OAChC4F,EAAgC5F,MAAO+G,UAExCH,GAAqBxiC,EAAKxS,WAAa,WAAY,IAGrD,OAAOwS,CACT,CA/Pe4iC,CAAapB,GAGoB,UAArCA,EAAwB3G,UACxB2G,EAAoB5F,OACpB4F,EAAoB5F,MAAMpE,SAAS5vC,QAEpC04C,EAAIx4C,KA6Hd,SACE05C,EACAxG,EACA0G,GAEA,MAAMmB,GE9OsB9H,EF8OUyG,EE5O/B1E,GADKtqC,MAAM1F,UAAUgB,IAAID,KAAKktC,EAAUa,MAAMpE,UAAU7kB,GAAQA,EAAK+jB,UAAS1oC,KAAK,MAD5F,IAA8B+sC,EF+OvB2G,EAAuBoB,eAAkBpB,EAAuBoB,cAAcn6C,MAAQk6C,EACzF7H,EAAI,gDAAiDR,GAAuBgH,IAE1EE,EAAuBoB,cAAgB,CACvCn6C,IAAKk6C,EACL95C,MAAO+xC,GAAiB0G,EAAaxG,IAIzC,MAAO,CACL9sC,SAAUrB,KAAKk2C,UACfC,UAAYtB,EAAuBoB,cAAc/5C,MAErD,CAhJmBk6C,CAAgBzB,EAAiCxG,EAAK0G,IAC/D1hC,EAAKghC,iBAAmB,CAACV,EAAI14C,OAAS,IAEW,aAAhD45C,EAAoC/zC,SACpC+zC,EAAoCz4C,QAAUy4C,EAAYtG,aAE3DoF,EAAIx4C,KA4Id,SAA4B05C,GAC1B,MAAO,CACLtzC,SAAUrB,KAAKk2C,UACfC,UAAWxB,EAAYz4C,MAE3B,CAjJmBm6C,CAAmB1B,IAC5BxhC,EAAKghC,iBAAmB,CAACV,EAAI14C,OAAS,IAEtCoY,EAAKghC,kBACFc,GAAsBN,EAAYN,WAAWt5C,OAASq5C,EAAgBX,EAAKkB,EAAYN,YAAc,GAGxGY,GACyC,SAAxCN,EAA4B/zC,SACiB,mBAAtC+zC,EAAoB2B,cAC5B,CACA,MAAMA,EAAiB3B,EAAoB2B,gBAC3CnjC,EAAKghC,iBAAmBhhC,EAAKghC,kBAAoB,GACjDhhC,EAAKghC,iBAAmBmC,EAAcv7C,OAClCoY,EAAKghC,iBAAiBvzB,OAAOwzB,EAAgBX,EAAK6C,IAClDnjC,EAAKghC,gBACV,CAiBD,GAfKQ,EAAoBO,aACnBD,EAKF9hC,EAAKghC,iBAAmBhhC,EAAKghC,iBAAiBvzB,OAC5CwzB,EAAgBX,EAAMkB,EAAoBO,WAAWb,cAGvDlhC,EAAKojC,gBAAkB3B,EAAmBnB,EAAMkB,EAAoBO,YACpEvB,EAAS14C,KAAM05C,EAAoBO,cAIG,WAArCP,EAAwB3G,WAA0BgE,GAAmB6C,GAA4B,CACpG,MAAM2B,EAAWt3C,EAAc,qBAAqBwD,UAAc/E,GAClEwV,EAAKxS,WAAY1F,KAAK,CAACiG,KAAM,sBAAuBhF,MAAOs6C,IAC3D5C,EAAe34C,KAAK,CAACg3C,QAAS0C,EAAkC8B,QAAStjC,EAAMzV,IAAK84C,GACrF,CAED,GAA0C,WAArC7B,EAAwB3G,SAAuB,CAClD,MAAM0I,EAAWh0C,IAEjB,GADEiyC,EAAkCvzC,aAAa,2BAA4Bs1C,EAASp2B,YAClF0xB,GAAmB6C,GACrB1hC,EAAKxS,WAAYqN,SAAQ8/B,IACL,QAAdA,EAAK5sC,MAAgC,WAAd4sC,EAAK5sC,OAC9BiS,EAAMxS,WAAY1F,KAAK,CACrBiG,KAAM,4BAA4B4sC,EAAK5sC,OACvChF,MAAO4xC,EAAK5xC,QAEd4xC,EAAK5xC,MAAQ,GACd,SAEE,GAAI8C,EAAkB61C,GAC3B,GAAI51C,EAAc01C,GAAmC,CACnD,MAAMj3C,EAAMwB,EAAc,sBAAsBwD,MAAU/E,GAC1DwV,EAAKxS,WAAY1F,KAAK,CAACiG,KAAM,sBAAuBhF,MAAOwB,IAC3Dm2C,EAAa54C,KAAK,CAACg3C,QAAS0C,EAAkCj3C,OAC/D,KAAM,CACL,MAAMi5C,EAAYhC,EAAkCv2C,gBAAiBC,SAASJ,KACxEP,EAAMwB,EAAc,sBAAsBwD,MAAUi0C,GAC1DxjC,EAAKxS,WAAY1F,KAAK,CAACiG,KAAM,sBAAuBhF,MAAOwB,IAC3Do2C,EAAO74C,KAAK,CAACg3C,QAAS0C,EAAkCj3C,OACzD,KACI,CACL,MAAMqoB,EAAW,8BAA8B2wB,MAC/C3C,EAAY94C,KAAK,CAAC8qB,WAAUtrB,MAAOg5C,EAAI14C,QACxC,CACF,CAEI45C,EAAoBL,oBAAuBK,EAAoBL,mBAAmBv5C,OAAS,IAC9FoY,EAAKohC,uBAAyBC,GAAsBG,GAEvD,CAED,GAAIA,EAAYtzC,WAAarB,KAAKsB,aAAc,CAC9C,MAAMs1C,EAAsB/F,GAAwB8D,GAKpD,GAJIiC,EAAoB77C,OAAS,IAC/Bi5C,EAAWA,EAASpzB,OAAOg2B,IAImB,QAA7CjC,EAAiC/zC,SAClC,SAAStC,KAAMq2C,EAAiC9a,KAChD,CACA,MAAMn8B,EAAOi3C,EAAiC9a,IAAInqB,QAAQ,SAAU,IACpEukC,EAAWh5C,KAAK,CAACg3C,QAAS0C,EAAiC8B,QAAStjC,EAAMzV,OAC3E,CAED,GACgD,UAA7Ci3C,EAAiC/zC,UACjC,SAAStC,KAAMq2C,EAAiC9a,MAAS8a,EAAiCkC,WAC3F,CACA,IAAIn5C,EACCi3C,EAAiC9a,IACpCn8B,EAAOi3C,EAAiC9a,IAAInqB,QAAQ,SAAU,KAE9DhS,EAAMwB,EAAc,oBAAoBwD,WAAe/E,GACvDwV,EAAKxS,WAAY1F,KAAK,CAACiG,KAAM,sBAAuBhF,MAAOwB,KAE7Dw2C,EAAWj5C,KAAK,CAACg3C,QAAS0C,EAAiCj3C,OAC5D,CACF,CACF,MAAUi3C,EAAYtzC,WAAarB,KAAKk2C,UACvC/iC,EAqKN,SAAqBwhC,GACnB,MAAO,CACLtzC,SAAUrB,KAAKk2C,UACfC,UAAWxB,EAAYwB,UAE3B,CA1KaW,CAAYnC,GACVA,EAAYtzC,WAAarB,KAAK+2C,qBACvC5jC,EA0KN,SAAoBwhC,GAClB,MAAO,CACLtzC,SAAUrB,KAAK+2C,mBACf/I,SAAU2G,EAAY3G,SAE1B,CA/KagJ,CAAWrC,IAGpB,OAAKxhC,GAELsgC,EAAIx4C,KAAKkY,GACFsgC,EAAI14C,OAAS,GAHF,IAInB,CACH,CAEA,SAASg6C,GAAe9C,GACtB,OAAOpzC,OAAOwT,KAAK4/B,EAAQtxC,YAAc,CAAE,GAAE8N,QAAO0gC,GAAK8C,EAAQtxC,WAAYwuC,IAAM8C,EAAQtxC,WAAYwuC,GAAGjuC,MAC5G,CA+HA,SAASy0C,GAAqBh1C,EAAkDO,EAAchF,GAC5F,MAAM+6C,EAAWt2C,EAAWylB,MAAKzkB,GAAKA,EAAET,OAASA,IAC7C+1C,EACFA,EAAS/6C,MAAQA,EAEjByE,EAAW1F,KAAK,CAACiG,OAAMhF,SAE3B,CA+BA,SAASs4C,GAAsBrhC,GAC7B,OAAOxN,MAAMrJ,KAAK6W,EAAKmhC,oBAAoBrzC,IAAI8wC,GACjD,CGhZA,SAASmF,GAAQC,GACf,MAAMn7C,EAAc,GAEpB,OADA,IAAIykB,IAAI02B,GAAKnpC,SAAQopC,GAAKA,GAAKp7C,EAAOf,KAAKm8C,KACpCp7C,CACT,CCDA,SAASq7C,GAA8BC,GACrC,OAAOA,EAAwBnpC,QAC7B,EAAEopC,aAAcC,EAAiBC,SAAUC,IAAeH,eAAcE,eAAe,CACrFF,aAAcL,GAAKM,EAAgB52B,OAAO22B,IAC1CE,SAAU54C,OAAOoR,OAAOynC,EAAaD,MAEvC,CAACF,aAAc,GAAIE,SAAU,CAAA,GAEjC,wBCRA,IAAIE,EAAmC,oBAAfrpB,YACgB,oBAAhBspB,aACe,oBAAfC,WAExB,SAASC,EAAKve,EAAKz9B,GACjB,OAAO+C,OAAOoB,UAAUiC,eAAelB,KAAKu4B,EAAKz9B,EACnD,CAEAqb,EAAiBlH,OAAA,SAAUspB,GAEzB,IADA,IAAIlb,EAAU1Y,MAAM1F,UAAUc,MAAMC,KAAKwW,UAAW,GAC7C6G,EAAQtjB,QAAQ,CACrB,IAAImL,EAASmY,EAAQzhB,QACrB,GAAKsJ,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAIgQ,UAAUhQ,EAAS,sBAG/B,IAAK,IAAI6xC,KAAK7xC,EACR4xC,EAAK5xC,EAAQ6xC,KACfxe,EAAIwe,GAAK7xC,EAAO6xC,GARM,CAW3B,CAED,OAAOxe,GAKTpiB,EAAA6gC,UAAoB,SAAUC,EAAKlwC,GACjC,OAAIkwC,EAAIl9C,SAAWgN,EAAekwC,EAC9BA,EAAIC,SAAmBD,EAAIC,SAAS,EAAGnwC,IAC3CkwC,EAAIl9C,OAASgN,EACNkwC,IAIT,IAAIE,EAAU,CACZj8B,SAAU,SAAU0d,EAAMC,EAAKue,EAAUz8B,EAAK08B,GAC5C,GAAIxe,EAAIqe,UAAYte,EAAKse,SACvBte,EAAKle,IAAIme,EAAIqe,SAASE,EAAUA,EAAWz8B,GAAM08B,QAInD,IAAK,IAAIt2C,EAAI,EAAGA,EAAI4Z,EAAK5Z,IACvB63B,EAAKye,EAAYt2C,GAAK83B,EAAIue,EAAWr2C,EAExC,EAEDu2C,cAAe,SAAUz9C,GACvB,IAAIkH,EAAGF,EAAG8Z,EAAK1Q,EAAKe,EAAOhQ,EAI3B,IADA2f,EAAM,EACD5Z,EAAI,EAAGF,EAAIhH,EAAOE,OAAQgH,EAAIF,EAAGE,IACpC4Z,GAAO9gB,EAAOkH,GAAGhH,OAMnB,IAFAiB,EAAS,IAAIsyB,WAAW3S,GACxB1Q,EAAM,EACDlJ,EAAI,EAAGF,EAAIhH,EAAOE,OAAQgH,EAAIF,EAAGE,IACpCiK,EAAQnR,EAAOkH,GACf/F,EAAO0f,IAAI1P,EAAOf,GAClBA,GAAOe,EAAMjR,OAGf,OAAOiB,CACR,GAGCu8C,EAAY,CACdr8B,SAAU,SAAU0d,EAAMC,EAAKue,EAAUz8B,EAAK08B,GAC5C,IAAK,IAAIt2C,EAAI,EAAGA,EAAI4Z,EAAK5Z,IACvB63B,EAAKye,EAAYt2C,GAAK83B,EAAIue,EAAWr2C,EAExC,EAEDu2C,cAAe,SAAUz9C,GACvB,MAAO,GAAG+lB,OAAO8X,MAAM,GAAI79B,EAC5B,GAMHsc,EAAmBqhC,SAAA,SAAUC,GACvBA,GACFthC,EAAAuhC,KAAgBpqB,WAChBnX,EAAAwhC,MAAgBf,YAChBzgC,EAAAyhC,MAAgBf,WAChB1gC,EAAQlH,OAAOkH,EAASghC,KAExBhhC,EAAAuhC,KAAgB/yC,MAChBwR,EAAAwhC,MAAgBhzC,MAChBwR,EAAAyhC,MAAgBjzC,MAChBwR,EAAQlH,OAAOkH,EAASohC,KAI5BphC,EAAQqhC,SAASb,8BCjFbkB,GAAQv9C,GAaRw9C,GAAwB,EACxBC,GAAwB,EAO5B,SAASrtB,GAAKusB,GAA6B,IAAtB,IAAIt8B,EAAMs8B,EAAIl9C,SAAiB4gB,GAAO,GAAKs8B,EAAIt8B,GAAO,CAAM,CAIjF,IAAIq9B,GAAe,EAcfC,GAAgB,GAGhBC,GAAgB,IAGhBC,GAAgBD,GAAW,EAAID,GAG/BG,GAAgB,GAGhBC,GAAgB,GAGhBC,GAAgB,EAAIH,GAAU,EAG9BI,GAAgB,GAGhBC,GAAgB,GAQhBC,GAAc,EAGdC,GAAc,IAGdC,GAAc,GAGdC,GAAc,GAGdC,GAAc,GAIdC,GACF,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,GAEvDC,GACF,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,IAEhEC,GACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEnCC,GACF,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAgB3CC,GAAgB,IAAIv0C,MAAsB,GAAfwzC,GAAU,IACrCgB,GAACD,IAOL,IAAIE,GAAgB,IAAIz0C,MAAgB,EAAVyzC,IAC1Be,GAACC,IAKL,IAAIC,GAAgB,IAAI10C,MAjBJ,KAkBhBw0C,GAACE,IAML,IAAIC,GAAgB,IAAI30C,MAAM40C,KAC1BJ,GAACG,IAGL,IAAIE,GAAgB,IAAI70C,MAAMszC,IAC1BkB,GAACK,IAGL,IAkBIC,GACAC,GACAC,GApBAC,GAAgB,IAAIj1C,MAAMyzC,IAK9B,SAASyB,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,GAElEtyC,KAAKkyC,YAAeA,EACpBlyC,KAAKmyC,WAAeA,EACpBnyC,KAAKoyC,WAAeA,EACpBpyC,KAAKqyC,MAAeA,EACpBryC,KAAKsyC,WAAeA,EAGpBtyC,KAAKuyC,UAAeL,GAAeA,EAAY//C,MACjD,CAQA,SAASqgD,GAASC,EAAUC,GAC1B1yC,KAAKyyC,SAAWA,EAChBzyC,KAAK2yC,SAAW,EAChB3yC,KAAK0yC,UAAYA,CACnB,CAIA,SAASE,GAAOz8C,GACd,OAAOA,EAAO,IAAMs7C,GAAWt7C,GAAQs7C,GAAW,KAAOt7C,IAAS,GACpE,CAOA,SAAS08C,GAAU57C,EAAG67C,GAGpB77C,EAAE87C,YAAY97C,EAAE+7C,WAAmB,IAALF,EAC9B77C,EAAE87C,YAAY97C,EAAE+7C,WAAcF,IAAM,EAAK,GAC3C,CAOA,SAASG,GAAUh8C,EAAG3D,EAAOnB,GACvB8E,EAAEi8C,SAAYtC,GAAWz+C,GAC3B8E,EAAEk8C,QAAW7/C,GAAS2D,EAAEi8C,SAAY,MACpCL,GAAU57C,EAAGA,EAAEk8C,QACfl8C,EAAEk8C,OAAS7/C,GAAUs9C,GAAW35C,EAAEi8C,SAClCj8C,EAAEi8C,UAAY/gD,EAASy+C,KAEvB35C,EAAEk8C,QAAW7/C,GAAS2D,EAAEi8C,SAAY,MACpCj8C,EAAEi8C,UAAY/gD,EAElB,CAGA,SAASihD,GAAUn8C,EAAGoC,EAAGg6C,GACvBJ,GAAUh8C,EAAGo8C,EAAS,EAAJh6C,GAAiBg6C,EAAS,EAAJh6C,EAAQ,GAClD,CAQA,SAASi6C,GAAWxhD,EAAMihB,GACxB,IAAIihB,EAAM,EACV,GACEA,GAAc,EAAPliC,EACPA,KAAU,EACVkiC,IAAQ,UACCjhB,EAAM,GACjB,OAAOihB,IAAQ,CACjB,CA+HA,SAASuf,GAAUF,EAAMV,EAAUa,GAKjC,IAEIC,EACAv7C,EAHAw7C,EAAY,IAAI32C,MAAM4zC,GAAW,GACjC7+C,EAAO,EAOX,IAAK2hD,EAAO,EAAGA,GAAQ9C,GAAU8C,IAC/BC,EAAUD,GAAQ3hD,EAAQA,EAAO0hD,EAASC,EAAO,IAAO,EAS1D,IAAKv7C,EAAI,EAAIA,GAAKy6C,EAAUz6C,IAAK,CAC/B,IAAI6a,EAAMsgC,EAAS,EAAJn7C,EAAQ,GACX,IAAR6a,IAEJsgC,EAAS,EAAJn7C,GAAkBo7C,GAAWI,EAAU3gC,KAAQA,GAIrD,CACH,CA8GA,SAAS4gC,GAAW18C,GAClB,IAAIiB,EAGJ,IAAKA,EAAI,EAAGA,EAAIq4C,GAAUr4C,IAAOjB,EAAE28C,UAAc,EAAJ17C,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EAAIs4C,GAAUt4C,IAAOjB,EAAE48C,UAAc,EAAJ37C,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EAAIu4C,GAAUv4C,IAAOjB,EAAE68C,QAAY,EAAJ57C,GAAkB,EAE7DjB,EAAE28C,UAAsB,EAAZ9C,IAA0B,EACtC75C,EAAE88C,QAAU98C,EAAE+8C,WAAa,EAC3B/8C,EAAEg9C,SAAWh9C,EAAEgoC,QAAU,CAC3B,CAMA,SAASiV,GAAUj9C,GAEbA,EAAEi8C,SAAW,EACfL,GAAU57C,EAAGA,EAAEk8C,QACNl8C,EAAEi8C,SAAW,IAEtBj8C,EAAE87C,YAAY97C,EAAE+7C,WAAa/7C,EAAEk8C,QAEjCl8C,EAAEk8C,OAAS,EACXl8C,EAAEi8C,SAAW,CACf,CA6BA,SAASiB,GAAQd,EAAMn7C,EAAGoU,EAAG8nC,GAC3B,IAAIC,EAAU,EAAJn8C,EACNo8C,EAAU,EAAJhoC,EACV,OAAQ+mC,EAAKgB,GAAgBhB,EAAKiB,IAC1BjB,EAAKgB,KAAkBhB,EAAKiB,IAAiBF,EAAMl8C,IAAMk8C,EAAM9nC,EACzE,CAQA,SAASioC,GAAWt9C,EAAGo8C,EAAM9M,GAO3B,IAFA,IAAIiI,EAAIv3C,EAAEu9C,KAAKjO,GACXa,EAAIb,GAAK,EACNa,GAAKnwC,EAAEw9C,WAERrN,EAAInwC,EAAEw9C,UACRN,GAAQd,EAAMp8C,EAAEu9C,KAAKpN,EAAI,GAAInwC,EAAEu9C,KAAKpN,GAAInwC,EAAEm9C,QAC1ChN,KAGE+M,GAAQd,EAAM7E,EAAGv3C,EAAEu9C,KAAKpN,GAAInwC,EAAEm9C,SAGlCn9C,EAAEu9C,KAAKjO,GAAKtvC,EAAEu9C,KAAKpN,GACnBb,EAAIa,EAGJA,IAAM,EAERnwC,EAAEu9C,KAAKjO,GAAKiI,CACd,CASA,SAASkG,GAAez9C,EAAG09C,EAAOC,GAKhC,IAAIz+C,EACA0+C,EAEA/iD,EACAitB,EAFA+1B,EAAK,EAIT,GAAmB,IAAf79C,EAAEg9C,SACJ,GACE99C,EAAQc,EAAE87C,YAAY97C,EAAE89C,MAAa,EAALD,IAAW,EAAM79C,EAAE87C,YAAY97C,EAAE89C,MAAa,EAALD,EAAS,GAClFD,EAAK59C,EAAE87C,YAAY97C,EAAE+9C,MAAQF,GAC7BA,IAEa,IAAT3+C,EACFi9C,GAAUn8C,EAAG49C,EAAIF,IAKjBvB,GAAUn8C,GADVnF,EAAO4/C,GAAamD,IACAvE,GAAW,EAAGqE,GAEpB,KADd51B,EAAQmyB,GAAYp/C,KAGlBmhD,GAAUh8C,EADV49C,GAAMjD,GAAY9/C,GACDitB,GAMnBq0B,GAAUn8C,EAHVnF,EAAO8gD,KADPz8C,GAImBy+C,GAEL,KADd71B,EAAQoyB,GAAYr/C,KAGlBmhD,GAAUh8C,EADVd,GAAQ67C,GAAUlgD,GACCitB,UAQhB+1B,EAAK79C,EAAEg9C,UAGlBb,GAAUn8C,EAAG65C,GAAW6D,EAC1B,CAWA,SAASM,GAAWh+C,EAAGi+C,GAIrB,IAIIh9C,EAAGoU,EAEH/B,EANA8oC,EAAW6B,EAAKzC,SAChB0C,EAAWD,EAAKxC,UAAUR,YAC1BK,EAAY2C,EAAKxC,UAAUH,UAC3BF,EAAW6C,EAAKxC,UAAUL,MAE1BM,GAAY,EAUhB,IAHA17C,EAAEw9C,SAAW,EACbx9C,EAAEm+C,SAAW1E,GAERx4C,EAAI,EAAGA,EAAIm6C,EAAOn6C,IACQ,IAAzBm7C,EAAS,EAAJn7C,IACPjB,EAAEu9C,OAAOv9C,EAAEw9C,UAAY9B,EAAWz6C,EAClCjB,EAAEm9C,MAAMl8C,GAAK,GAGbm7C,EAAS,EAAJn7C,EAAQ,GAAa,EAS9B,KAAOjB,EAAEw9C,SAAW,GAElBpB,EAAY,GADZ9oC,EAAOtT,EAAEu9C,OAAOv9C,EAAEw9C,UAAa9B,EAAW,IAAMA,EAAW,IACjC,EAC1B17C,EAAEm9C,MAAM7pC,GAAQ,EAChBtT,EAAE88C,UAEExB,IACFt7C,EAAE+8C,YAAcmB,EAAa,EAAP5qC,EAAW,IASrC,IALA2qC,EAAKvC,SAAWA,EAKXz6C,EAAKjB,EAAEw9C,UAAY,EAAcv8C,GAAK,EAAGA,IAAOq8C,GAAWt9C,EAAGo8C,EAAMn7C,GAKzEqS,EAAO8nC,EACP,GAGEn6C,EAAIjB,EAAEu9C,KAAK,GACXv9C,EAAEu9C,KAAK,GAAiBv9C,EAAEu9C,KAAKv9C,EAAEw9C,YACjCF,GAAWt9C,EAAGo8C,EAAM,GAGpB/mC,EAAIrV,EAAEu9C,KAAK,GAEXv9C,EAAEu9C,OAAOv9C,EAAEm+C,UAAYl9C,EACvBjB,EAAEu9C,OAAOv9C,EAAEm+C,UAAY9oC,EAGvB+mC,EAAY,EAAP9oC,GAAqB8oC,EAAS,EAAJn7C,GAAkBm7C,EAAS,EAAJ/mC,GACtDrV,EAAEm9C,MAAM7pC,IAAStT,EAAEm9C,MAAMl8C,IAAMjB,EAAEm9C,MAAM9nC,GAAKrV,EAAEm9C,MAAMl8C,GAAKjB,EAAEm9C,MAAM9nC,IAAM,EACvE+mC,EAAS,EAAJn7C,EAAQ,GAAam7C,EAAS,EAAJ/mC,EAAQ,GAAa/B,EAGpDtT,EAAEu9C,KAAK,GAAiBjqC,IACxBgqC,GAAWt9C,EAAGo8C,EAAM,SAEbp8C,EAAEw9C,UAAY,GAEvBx9C,EAAEu9C,OAAOv9C,EAAEm+C,UAAYn+C,EAAEu9C,KAAK,GAjehC,SAAoBv9C,EAAGi+C,GAIrB,IAOIG,EACAn9C,EAAGoU,EACHmnC,EACA6B,EACA/lC,EAXA8jC,EAAkB6B,EAAKzC,SACvBE,EAAkBuC,EAAKvC,SACvBwC,EAAkBD,EAAKxC,UAAUR,YACjCK,EAAkB2C,EAAKxC,UAAUH,UACjCxzB,EAAkBm2B,EAAKxC,UAAUP,WACjCtgB,EAAkBqjB,EAAKxC,UAAUN,WACjCE,EAAkB4C,EAAKxC,UAAUJ,WAMjC5X,EAAW,EAEf,IAAK+Y,EAAO,EAAGA,GAAQ9C,GAAU8C,IAC/Bx8C,EAAEu8C,SAASC,GAAQ,EAQrB,IAFAJ,EAA0B,EAArBp8C,EAAEu9C,KAAKv9C,EAAEm+C,UAAgB,GAAa,EAEtCC,EAAIp+C,EAAEm+C,SAAW,EAAGC,EAAI3E,GAAW2E,KAEtC5B,EAAOJ,EAA+B,EAA1BA,EAAS,GADrBn7C,EAAIjB,EAAEu9C,KAAKa,IACc,GAAiB,GAAa,GAC5C/C,IACTmB,EAAOnB,EACP5X,KAEF2Y,EAAS,EAAJn7C,EAAQ,GAAau7C,EAGtBv7C,EAAIy6C,IAER17C,EAAEu8C,SAASC,KACX6B,EAAQ,EACJp9C,GAAK25B,IACPyjB,EAAQv2B,EAAM7mB,EAAI25B,IAEpBtiB,EAAI8jC,EAAS,EAAJn7C,GACTjB,EAAE88C,SAAWxkC,GAAKkkC,EAAO6B,GACrB/C,IACFt7C,EAAE+8C,YAAczkC,GAAK4lC,EAAU,EAAJj9C,EAAQ,GAAao9C,KAGpD,GAAiB,IAAb5a,EAAJ,CAMA,EAAG,CAED,IADA+Y,EAAOnB,EAAa,EACQ,IAArBr7C,EAAEu8C,SAASC,IAAeA,IACjCx8C,EAAEu8C,SAASC,KACXx8C,EAAEu8C,SAASC,EAAO,IAAM,EACxBx8C,EAAEu8C,SAASlB,KAIX5X,GAAY,QACLA,EAAW,GAOpB,IAAK+Y,EAAOnB,EAAqB,IAATmB,EAAYA,IAElC,IADAv7C,EAAIjB,EAAEu8C,SAASC,GACF,IAANv7C,IACLoU,EAAIrV,EAAEu9C,OAAOa,IACL1C,IACJU,EAAS,EAAJ/mC,EAAQ,KAAemnC,IAE9Bx8C,EAAE88C,UAAYN,EAAOJ,EAAS,EAAJ/mC,EAAQ,IAAc+mC,EAAS,EAAJ/mC,GACrD+mC,EAAS,EAAJ/mC,EAAQ,GAAamnC,GAE5Bv7C,IAjC2B,CAoCjC,CAgZEq9C,CAAWt+C,EAAGi+C,GAGd3B,GAAUF,EAAMV,EAAU17C,EAAEu8C,SAC9B,CAOA,SAASgC,GAAUv+C,EAAGo8C,EAAMV,GAK1B,IAAIz6C,EAEAu9C,EADAC,GAAW,EAGXC,EAAUtC,EAAK,GAEf5b,EAAQ,EACRme,EAAY,EACZC,EAAY,EAQhB,IANgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAEdxC,EAAsB,GAAhBV,EAAW,GAAS,GAAa,MAElCz6C,EAAI,EAAGA,GAAKy6C,EAAUz6C,IACzBu9C,EAASE,EACTA,EAAUtC,EAAe,GAATn7C,EAAI,GAAS,KAEvBu/B,EAAQme,GAAaH,IAAWE,IAG3Ble,EAAQoe,EACjB5+C,EAAE68C,QAAiB,EAAT2B,IAAwBhe,EAEd,IAAXge,GAELA,IAAWC,GAAWz+C,EAAE68C,QAAiB,EAAT2B,KACpCx+C,EAAE68C,QAAkB,EAAV/C,OAEDtZ,GAAS,GAClBxgC,EAAE68C,QAAoB,EAAZ9C,MAGV/5C,EAAE68C,QAAsB,EAAd7C,MAGZxZ,EAAQ,EACRie,EAAUD,EAEM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,CAOA,SAASC,GAAU7+C,EAAGo8C,EAAMV,GAK1B,IAAIz6C,EAEAu9C,EADAC,GAAW,EAGXC,EAAUtC,EAAK,GAEf5b,EAAQ,EACRme,EAAY,EACZC,EAAY,EAQhB,IALgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAGT39C,EAAI,EAAGA,GAAKy6C,EAAUz6C,IAIzB,GAHAu9C,EAASE,EACTA,EAAUtC,EAAe,GAATn7C,EAAI,GAAS,OAEvBu/B,EAAQme,GAAaH,IAAWE,GAAtC,CAGO,GAAIle,EAAQoe,EACjB,GAAKzC,GAAUn8C,EAAGw+C,EAAQx+C,EAAE68C,eAA+B,KAAVrc,QAE7B,IAAXge,GACLA,IAAWC,IACbtC,GAAUn8C,EAAGw+C,EAAQx+C,EAAE68C,SACvBrc,KAGF2b,GAAUn8C,EAAG85C,GAAS95C,EAAE68C,SACxBb,GAAUh8C,EAAGwgC,EAAQ,EAAG,IAEfA,GAAS,IAClB2b,GAAUn8C,EAAG+5C,GAAW/5C,EAAE68C,SAC1Bb,GAAUh8C,EAAGwgC,EAAQ,EAAG,KAGxB2b,GAAUn8C,EAAGg6C,GAAah6C,EAAE68C,SAC5Bb,GAAUh8C,EAAGwgC,EAAQ,GAAI,IAG3BA,EAAQ,EACRie,EAAUD,EACM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,EAdb,CAiBL,CAnuBItE,GAACS,IAu1BL,IAAI+D,IAAmB,EA4BvB,SAASC,GAAiB/+C,EAAGo4C,EAAK4G,EAAYlxC,GAM5CkuC,GAAUh8C,GAAIm5C,IAAgB,IAAMrrC,EAAO,EAAI,GAAI,GAzfrD,SAAoB9N,EAAGo4C,EAAKt8B,EAAKmjC,GAM/BhC,GAAUj9C,GAENi/C,IACFrD,GAAU57C,EAAG8b,GACb8/B,GAAU57C,GAAI8b,IAKhBk9B,GAAM38B,SAASrc,EAAE87C,YAAa97C,EAAEE,OAAQk4C,EAAKt8B,EAAK9b,EAAE+7C,SACpD/7C,EAAE+7C,SAAWjgC,CACf,CAyeEojC,CAAWl/C,EAAGo4C,EAAK4G,GAAY,EACjC,CAmKgBG,GAAAC,SAlMhB,SAAkBp/C,GAGX8+C,MAxmBP,WACE,IAAI79C,EACAu7C,EACAthD,EACAL,EACAqE,EACAq9C,EAAW,IAAIz2C,MAAM4zC,GAAW,GAiBpC,IADAx+C,EAAS,EACJL,EAAO,EAAGA,EAAOu+C,GAAe,EAAGv+C,IAEtC,IADA8/C,GAAY9/C,GAAQK,EACf+F,EAAI,EAAGA,EAAK,GAAKg5C,GAAYp/C,GAAQoG,IACxCw5C,GAAav/C,KAAYL,EAY7B,IAJA4/C,GAAav/C,EAAS,GAAKL,EAG3BqE,EAAO,EACFrE,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAkgD,GAAUlgD,GAAQqE,EACb+B,EAAI,EAAGA,EAAK,GAAKi5C,GAAYr/C,GAAQoG,IACxCu5C,GAAWt7C,KAAUrE,EAKzB,IADAqE,IAAS,EACFrE,EAAO0+C,GAAS1+C,IAErB,IADAkgD,GAAUlgD,GAAQqE,GAAQ,EACrB+B,EAAI,EAAGA,EAAK,GAAMi5C,GAAYr/C,GAAQ,EAAKoG,IAC9Cu5C,GAAW,IAAMt7C,KAAUrE,EAM/B,IAAK2hD,EAAO,EAAGA,GAAQ9C,GAAU8C,IAC/BD,EAASC,GAAQ,EAInB,IADAv7C,EAAI,EACGA,GAAK,KACVo5C,GAAiB,EAAJp5C,EAAQ,GAAa,EAClCA,IACAs7C,EAAS,KAEX,KAAOt7C,GAAK,KACVo5C,GAAiB,EAAJp5C,EAAQ,GAAa,EAClCA,IACAs7C,EAAS,KAEX,KAAOt7C,GAAK,KACVo5C,GAAiB,EAAJp5C,EAAQ,GAAa,EAClCA,IACAs7C,EAAS,KAEX,KAAOt7C,GAAK,KACVo5C,GAAiB,EAAJp5C,EAAQ,GAAa,EAClCA,IACAs7C,EAAS,KASX,IAHAD,GAAUjC,GAAcf,GAAU,EAAGiD,GAGhCt7C,EAAI,EAAGA,EAAIs4C,GAASt4C,IACvBs5C,GAAiB,EAAJt5C,EAAQ,GAAa,EAClCs5C,GAAiB,EAAJt5C,GAAkBo7C,GAAWp7C,EAAG,GAI/C25C,GAAgB,IAAII,GAAeX,GAAcJ,GAAaZ,GAAW,EAAGC,GAASI,IACrFmB,GAAgB,IAAIG,GAAeT,GAAcL,GAAa,EAAYX,GAASG,IACnFoB,GAAiB,IAAIE,GAAe,IAAIl1C,MAAM,GAAIq0C,GAAc,EAAWX,GAAUI,GAGvF,CAugBIyF,GACAP,IAAmB,GAGrB9+C,EAAEs/C,OAAU,IAAI/D,GAASv7C,EAAE28C,UAAW/B,IACtC56C,EAAEu/C,OAAU,IAAIhE,GAASv7C,EAAE48C,UAAW/B,IACtC76C,EAAEw/C,QAAU,IAAIjE,GAASv7C,EAAE68C,QAAS/B,IAEpC96C,EAAEk8C,OAAS,EACXl8C,EAAEi8C,SAAW,EAGbS,GAAW18C,EACb,EAkLwBm/C,GAAAJ,iBAAGA,GACJI,GAAAM,gBAnJvB,SAAyBz/C,EAAGo4C,EAAK4G,EAAYlxC,GAM3C,IAAI4xC,EAAUC,EACVC,EAAc,EAGd5/C,EAAEsZ,MAAQ,GAnhCY,IAshCpBtZ,EAAE6/C,KAAKC,YACT9/C,EAAE6/C,KAAKC,UArGb,SAA0B9/C,GAKxB,IACIiB,EADA8+C,EAAa,WAIjB,IAAK9+C,EAAI,EAAGA,GAAK,GAAIA,IAAK8+C,KAAgB,EACxC,GAAkB,EAAbA,GAAoD,IAAhC//C,EAAE28C,UAAc,EAAJ17C,GACnC,OAAOg4C,GAKX,GAAoC,IAAhCj5C,EAAE28C,UAAU,KAA0D,IAAjC38C,EAAE28C,UAAU,KAChB,IAAjC38C,EAAE28C,UAAU,IACd,OAAOzD,GAET,IAAKj4C,EAAI,GAAIA,EAAIo4C,GAAUp4C,IACzB,GAAoC,IAAhCjB,EAAE28C,UAAc,EAAJ17C,GACd,OAAOi4C,GAOX,OAAOD,EACT,CAuEyB+G,CAAiBhgD,IAItCg+C,GAAWh+C,EAAGA,EAAEs/C,QAIhBtB,GAAWh+C,EAAGA,EAAEu/C,QAUhBK,EAnMJ,SAAuB5/C,GACrB,IAAI4/C,EAgBJ,IAbArB,GAAUv+C,EAAGA,EAAE28C,UAAW38C,EAAEs/C,OAAO5D,UACnC6C,GAAUv+C,EAAGA,EAAE48C,UAAW58C,EAAEu/C,OAAO7D,UAGnCsC,GAAWh+C,EAAGA,EAAEw/C,SASXI,EAAcpG,GAAW,EAAGoG,GAAe,GACW,IAArD5/C,EAAE68C,QAAgC,EAAxBzC,GAASwF,GAAmB,GADOA,KAUnD,OAJA5/C,EAAE88C,SAAW,GAAK8C,EAAc,GAAK,EAAI,EAAI,EAItCA,CACT,CAuKkBK,CAAcjgD,GAG5B0/C,EAAY1/C,EAAE88C,QAAU,EAAI,IAAO,GACnC6C,EAAe3/C,EAAE+8C,WAAa,EAAI,IAAO,IAMtB2C,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcX,EAAa,EAGnCA,EAAa,GAAKU,IAAuB,IAATtH,EASnC2G,GAAiB/+C,EAAGo4C,EAAK4G,EAAYlxC,GA1kCb,IA4kCf9N,EAAEkgD,UAAwBP,IAAgBD,GAEnD1D,GAAUh8C,EAAG,GAAuB8N,EAAO,EAAI,GAAI,GACnD2vC,GAAez9C,EAAGq6C,GAAcE,MAGhCyB,GAAUh8C,EAAG,GAAoB8N,EAAO,EAAI,GAAI,GAjMpD,SAAwB9N,EAAGmgD,EAAQC,EAAQC,GAIzC,IAAIC,EASJ,IAHAtE,GAAUh8C,EAAGmgD,EAAS,IAAK,GAC3BnE,GAAUh8C,EAAGogD,EAAS,EAAK,GAC3BpE,GAAUh8C,EAAGqgD,EAAU,EAAI,GACtBC,EAAO,EAAGA,EAAOD,EAASC,IAE7BtE,GAAUh8C,EAAGA,EAAE68C,QAAyB,EAAjBzC,GAASkG,GAAY,GAAY,GAI1DzB,GAAU7+C,EAAGA,EAAE28C,UAAWwD,EAAS,GAGnCtB,GAAU7+C,EAAGA,EAAE48C,UAAWwD,EAAS,EAErC,CA0KIG,CAAevgD,EAAGA,EAAEs/C,OAAO5D,SAAW,EAAG17C,EAAEu/C,OAAO7D,SAAW,EAAGkE,EAAc,GAC9EnC,GAAez9C,EAAGA,EAAE28C,UAAW38C,EAAE48C,YAMnCF,GAAW18C,GAEP8N,GACFmvC,GAAUj9C,EAId,EAmEiBm/C,GAAAqB,UA7DjB,SAAmBxgD,EAAGd,EAAM0+C,GAmD1B,OA5CA59C,EAAE87C,YAAY97C,EAAE89C,MAAqB,EAAb99C,EAAEg9C,UAAqB99C,IAAS,EAAK,IAC7Dc,EAAE87C,YAAY97C,EAAE89C,MAAqB,EAAb99C,EAAEg9C,SAAe,GAAY,IAAP99C,EAE9Cc,EAAE87C,YAAY97C,EAAE+9C,MAAQ/9C,EAAEg9C,UAAiB,IAALY,EACtC59C,EAAEg9C,WAEW,IAAT99C,EAEFc,EAAE28C,UAAe,EAALiB,MAEZ59C,EAAEgoC,UAEF9oC,IAKAc,EAAE28C,UAA8C,GAAnClC,GAAamD,GAAMvE,GAAW,MAC3Cr5C,EAAE48C,UAAyB,EAAfjB,GAAOz8C,OA0Bbc,EAAEg9C,WAAah9C,EAAEygD,YAAc,CAKzC,EAMAtB,GAAAuB,UAhKA,SAAmB1gD,GACjBg8C,GAAUh8C,EAAG2gD,EAAmB,GAChCxE,GAAUn8C,EAAG65C,GAAWQ,IA5yB1B,SAAkBr6C,GACG,KAAfA,EAAEi8C,UACJL,GAAU57C,EAAGA,EAAEk8C,QACfl8C,EAAEk8C,OAAS,EACXl8C,EAAEi8C,SAAW,GAEJj8C,EAAEi8C,UAAY,IACvBj8C,EAAE87C,YAAY97C,EAAE+7C,WAAwB,IAAX/7C,EAAEk8C,OAC/Bl8C,EAAEk8C,SAAW,EACbl8C,EAAEi8C,UAAY,EAElB,CAkyBE2E,CAAS5gD,EACX,ECv/BA,IAAA6gD,GAzBA,SAAiBC,EAAO1I,EAAKt8B,EAAK1Q,GAKhC,IAJA,IAAI21C,EAAc,MAARD,EAAiB,EACvBE,EAAOF,IAAU,GAAM,MAAS,EAChC7/C,EAAI,EAEO,IAAR6a,GAAW,CAKhBA,GADA7a,EAAI6a,EAAM,IAAO,IAAOA,EAGxB,GAEEklC,EAAMA,GADND,EAAMA,EAAK3I,EAAIhtC,KAAS,GACR,UACPnK,GAEX8/C,GAAM,MACNC,GAAM,KACP,CAED,OAAQD,EAAMC,GAAM,GAAM,CAC5B,ECNA,IAAIC,GAfJ,WAGE,IAFA,IAAI7+C,EAAG8+C,EAAQ,GAENjgD,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BmB,EAAInB,EACJ,IAAK,IAAIquC,EAAI,EAAGA,EAAI,EAAGA,IACrBltC,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnD8+C,EAAMjgD,GAAKmB,CACZ,CAED,OAAO8+C,CACT,CAGeC,GAiBf,IC69BIC,GD79BJC,GAdA,SAAeC,EAAKlJ,EAAKt8B,EAAK1Q,GAC5B,IAAInL,EAAIghD,GACJp6C,EAAMuE,EAAM0Q,EAEhBwlC,IAAQ,EAER,IAAK,IAAIp/C,EAAIkJ,EAAKlJ,EAAI2E,EAAK3E,IACzBo/C,EAAOA,IAAQ,EAAKrhD,EAAmB,KAAhBqhD,EAAMlJ,EAAIl2C,KAGnC,OAAgB,EAARo/C,CACV,EElCAC,GAAiB,CACf,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,wBDTNvI,GAAUv9C,GACV+lD,GAAUhiD,GACViiD,GAAUhiD,GACViiD,GAAUhiD,GACVq7B,GAAUp7B,GAOVgiD,GAAkB,EAIlBC,GAAkB,EAQlBC,GAAkB,EAIlBC,IAAmB,EAWnBC,IAAyB,EAMzBC,GAAwB,EAOxBC,GAAwB,EAIxBC,GAAc,EAKdC,GAAgB,EAWhB7I,GAAgBD,IAEhBE,GAAgB,GAEhBC,GAAgB,GAEhBC,GAAgB,EAAIH,GAAU,EAE9BI,GAAY,GAGZ0I,GAAY,EACZ1H,GAAY,IACZ2H,GAAiB3H,GAAY0H,GAAY,EAIzCE,GAAa,GAIbC,GAAa,IACbC,GAAa,IACbC,GAAe,IAEfC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EAIxB,SAASnlD,GAAImiD,EAAMiD,GAEjB,OADAjD,EAAK9kB,IAAMA,GAAI+nB,GACRA,CACT,CAEA,SAASxC,GAAKhoC,GACZ,OAASA,GAAM,IAAOA,EAAK,EAAI,EAAI,EACrC,CAEA,SAASuT,GAAKusB,GAA6B,IAAtB,IAAIt8B,EAAMs8B,EAAIl9C,SAAiB4gB,GAAO,GAAKs8B,EAAIt8B,GAAO,CAAM,CASjF,SAASinC,GAAclD,GACrB,IAAI7/C,EAAI6/C,EAAKzjD,MAGT0f,EAAM9b,EAAE+7C,QACRjgC,EAAM+jC,EAAKmD,YACblnC,EAAM+jC,EAAKmD,WAED,IAARlnC,IAEJk9B,GAAM38B,SAASwjC,EAAKoD,OAAQjjD,EAAE87C,YAAa97C,EAAEkjD,YAAapnC,EAAK+jC,EAAKsD,UACpEtD,EAAKsD,UAAYrnC,EACjB9b,EAAEkjD,aAAepnC,EACjB+jC,EAAKuD,WAAatnC,EAClB+jC,EAAKmD,WAAalnC,EAClB9b,EAAE+7C,SAAWjgC,EACK,IAAd9b,EAAE+7C,UACJ/7C,EAAEkjD,YAAc,GAEpB,CAGA,SAASG,GAAiBrjD,EAAG8N,GAC3B0zC,GAAM/B,gBAAgBz/C,EAAIA,EAAEsjD,aAAe,EAAItjD,EAAEsjD,aAAe,EAAItjD,EAAEujD,SAAWvjD,EAAEsjD,YAAax1C,GAChG9N,EAAEsjD,YAActjD,EAAEujD,SAClBR,GAAc/iD,EAAE6/C,KAClB,CAGA,SAAS2D,GAASxjD,EAAG4vB,GACnB5vB,EAAE87C,YAAY97C,EAAE+7C,WAAansB,CAC/B,CAQA,SAAS6zB,GAAYzjD,EAAG4vB,GAGtB5vB,EAAE87C,YAAY97C,EAAE+7C,WAAcnsB,IAAM,EAAK,IACzC5vB,EAAE87C,YAAY97C,EAAE+7C,WAAiB,IAAJnsB,CAC/B,CA4CA,SAAS8zB,GAAc1jD,EAAG2jD,GACxB,IAEIvyC,EACA0K,EAHA8nC,EAAe5jD,EAAE6jD,iBACjBx4B,EAAOrrB,EAAEujD,SAGTO,EAAW9jD,EAAE+jD,YACbC,EAAahkD,EAAEgkD,WACfvkB,EAASz/B,EAAEujD,SAAYvjD,EAAEikD,OAAS5B,GAClCriD,EAAEujD,UAAYvjD,EAAEikD,OAAS5B,IAAiB,EAE1C6B,EAAOlkD,EAAEE,OAETikD,EAAQnkD,EAAEokD,OACVn3C,EAAQjN,EAAEiN,KAMVo3C,EAASrkD,EAAEujD,SAAW7I,GACtB4J,EAAaJ,EAAK74B,EAAOy4B,EAAW,GACpCS,EAAaL,EAAK74B,EAAOy4B,GAQzB9jD,EAAE+jD,aAAe/jD,EAAEwkD,aACrBZ,IAAiB,GAKfI,EAAahkD,EAAEykD,YAAaT,EAAahkD,EAAEykD,WAI/C,GAaE,GAAIP,GAXJ9yC,EAAQuyC,GAWSG,KAAkBS,GAC/BL,EAAK9yC,EAAQ0yC,EAAW,KAAOQ,GAC/BJ,EAAK9yC,KAA0B8yC,EAAK74B,IACpC64B,IAAO9yC,KAAwB8yC,EAAK74B,EAAO,GAH/C,CAaAA,GAAQ,EACRja,IAMA,UAES8yC,IAAO74B,KAAU64B,IAAO9yC,IAAU8yC,IAAO74B,KAAU64B,IAAO9yC,IAC1D8yC,IAAO74B,KAAU64B,IAAO9yC,IAAU8yC,IAAO74B,KAAU64B,IAAO9yC,IAC1D8yC,IAAO74B,KAAU64B,IAAO9yC,IAAU8yC,IAAO74B,KAAU64B,IAAO9yC,IAC1D8yC,IAAO74B,KAAU64B,IAAO9yC,IAAU8yC,IAAO74B,KAAU64B,IAAO9yC,IAC1Dia,EAAOg5B,GAOhB,GAHAvoC,EAAM4+B,IAAa2J,EAASh5B,GAC5BA,EAAOg5B,EAAS3J,GAEZ5+B,EAAMgoC,EAAU,CAGlB,GAFA9jD,EAAE0kD,YAAcf,EAChBG,EAAWhoC,EACPA,GAAOkoC,EACT,MAEFM,EAAaJ,EAAK74B,EAAOy4B,EAAW,GACpCS,EAAaL,EAAK74B,EAAOy4B,EAC1B,CApCA,SAqCOH,EAAY12C,EAAK02C,EAAYQ,IAAU1kB,GAA4B,KAAjBmkB,GAE5D,OAAIE,GAAY9jD,EAAEykD,UACTX,EAEF9jD,EAAEykD,SACX,CAaA,SAASE,GAAY3kD,GACnB,IACIk4C,EAAGj3C,EAAGoU,EAAGuvC,EAAM7vC,EArJH8qC,EAAMzH,EAAKxxC,EAAOsB,EAC9B4T,EAmJA+oC,EAAU7kD,EAAEikD,OAKhB,EAAG,CAqBD,GApBAW,EAAO5kD,EAAE8kD,YAAc9kD,EAAEykD,UAAYzkD,EAAEujD,SAoBnCvjD,EAAEujD,UAAYsB,GAAWA,EAAUxC,IAAgB,CAErDrJ,GAAM38B,SAASrc,EAAEE,OAAQF,EAAEE,OAAQ2kD,EAASA,EAAS,GACrD7kD,EAAE0kD,aAAeG,EACjB7kD,EAAEujD,UAAYsB,EAEd7kD,EAAEsjD,aAAeuB,EAUjB3M,EADAj3C,EAAIjB,EAAE+kD,UAEN,GACE1vC,EAAIrV,EAAEkN,OAAOgrC,GACbl4C,EAAEkN,KAAKgrC,GAAM7iC,GAAKwvC,EAAUxvC,EAAIwvC,EAAU,UACjC5jD,GAGXi3C,EADAj3C,EAAI4jD,EAEJ,GACExvC,EAAIrV,EAAEiN,OAAOirC,GACbl4C,EAAEiN,KAAKirC,GAAM7iC,GAAKwvC,EAAUxvC,EAAIwvC,EAAU,UAIjC5jD,GAEX2jD,GAAQC,CACT,CACD,GAAwB,IAApB7kD,EAAE6/C,KAAKmF,SACT,MAmBF,GApOcnF,EAgOD7/C,EAAE6/C,KAhOKzH,EAgOCp4C,EAAEE,OAhOE0G,EAgOM5G,EAAEujD,SAAWvjD,EAAEykD,UAhOdv8C,EAgOyB08C,EA/NvD9oC,YAAM+jC,EAAKmF,UAEL98C,IAAQ4T,EAAM5T,GA6NtBjH,EA5NU,IAAR6a,EAAoB,GAExB+jC,EAAKmF,UAAYlpC,EAGjBk9B,GAAM38B,SAAS+7B,EAAKyH,EAAK9mC,MAAO8mC,EAAKoF,QAASnpC,EAAKlV,GAC3B,IAApBi5C,EAAKzjD,MAAM8oD,KACbrF,EAAKiB,MAAQW,GAAQ5B,EAAKiB,MAAO1I,EAAKt8B,EAAKlV,GAGhB,IAApBi5C,EAAKzjD,MAAM8oD,OAClBrF,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO1I,EAAKt8B,EAAKlV,IAG3Ci5C,EAAKoF,SAAWnpC,EAChB+jC,EAAKsF,UAAYrpC,EAEVA,GA4ML9b,EAAEykD,WAAaxjD,EAGXjB,EAAEykD,UAAYzkD,EAAEoP,QAAUgzC,GAS5B,IARArtC,EAAM/U,EAAEujD,SAAWvjD,EAAEoP,OACrBpP,EAAEolD,MAAQplD,EAAEE,OAAO6U,GAGnB/U,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAO6U,EAAM,IAAM/U,EAAEslD,UAIvDtlD,EAAEoP,SAEPpP,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAO6U,EAAMqtC,GAAY,IAAMpiD,EAAEslD,UAE1EtlD,EAAEiN,KAAK8H,EAAM/U,EAAEokD,QAAUpkD,EAAEkN,KAAKlN,EAAEolD,OAClCplD,EAAEkN,KAAKlN,EAAEolD,OAASrwC,EAClBA,IACA/U,EAAEoP,WACEpP,EAAEykD,UAAYzkD,EAAEoP,OAASgzC,OASrC,OAAWpiD,EAAEykD,UAAYpC,IAAqC,IAApBriD,EAAE6/C,KAAKmF,SAsCjD,CA6GA,SAASO,GAAavlD,EAAGwlD,GAIvB,IAHA,IAAIC,EACAC,IAEK,CAMP,GAAI1lD,EAAEykD,UAAYpC,GAAe,CAE/B,GADAsC,GAAY3kD,GACRA,EAAEykD,UAAYpC,IAAiBmD,IAAU7D,GAC3C,OAAOe,GAET,GAAoB,IAAhB1iD,EAAEykD,UACJ,KAEH,CAyBD,GApBAgB,EAAY,EACRzlD,EAAEykD,WAAarC,KAEjBpiD,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAOF,EAAEujD,SAAWnB,GAAY,IAAMpiD,EAAEslD,UACjFG,EAAYzlD,EAAEiN,KAAKjN,EAAEujD,SAAWvjD,EAAEokD,QAAUpkD,EAAEkN,KAAKlN,EAAEolD,OACrDplD,EAAEkN,KAAKlN,EAAEolD,OAASplD,EAAEujD,UAOJ,IAAdkC,GAA4BzlD,EAAEujD,SAAWkC,GAAezlD,EAAEikD,OAAS5B,KAKrEriD,EAAE2lD,aAAejC,GAAc1jD,EAAGylD,IAGhCzlD,EAAE2lD,cAAgBvD,GAYpB,GAPAsD,EAASlE,GAAMhB,UAAUxgD,EAAGA,EAAEujD,SAAWvjD,EAAE0kD,YAAa1kD,EAAE2lD,aAAevD,IAEzEpiD,EAAEykD,WAAazkD,EAAE2lD,aAKb3lD,EAAE2lD,cAAgB3lD,EAAE4lD,gBAAuC5lD,EAAEykD,WAAarC,GAAW,CACvFpiD,EAAE2lD,eACF,GACE3lD,EAAEujD,WAEFvjD,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAOF,EAAEujD,SAAWnB,GAAY,IAAMpiD,EAAEslD,UACjFG,EAAYzlD,EAAEiN,KAAKjN,EAAEujD,SAAWvjD,EAAEokD,QAAUpkD,EAAEkN,KAAKlN,EAAEolD,OACrDplD,EAAEkN,KAAKlN,EAAEolD,OAASplD,EAAEujD,eAKQ,KAAnBvjD,EAAE2lD,cACb3lD,EAAEujD,UACH,MAECvjD,EAAEujD,UAAYvjD,EAAE2lD,aAChB3lD,EAAE2lD,aAAe,EACjB3lD,EAAEolD,MAAQplD,EAAEE,OAAOF,EAAEujD,UAErBvjD,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAOF,EAAEujD,SAAW,IAAMvjD,EAAEslD,eAavEI,EAASlE,GAAMhB,UAAUxgD,EAAG,EAAGA,EAAEE,OAAOF,EAAEujD,WAE1CvjD,EAAEykD,YACFzkD,EAAEujD,WAEJ,GAAImC,IAEFrC,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACT,OAAON,EAIZ,CAED,OADA1iD,EAAEoP,OAAWpP,EAAEujD,SAAYnB,GAAY,EAAMpiD,EAAEujD,SAAWnB,GAAY,EAClEoD,IAAU5D,IAEZyB,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,UACFJ,GAGFC,IAEL7iD,EAAEg9C,WAEJqG,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACFN,GAIJC,EACT,CAOA,SAASkD,GAAa7lD,EAAGwlD,GAOvB,IANA,IAAIC,EACAC,EAEAI,IAGK,CAMP,GAAI9lD,EAAEykD,UAAYpC,GAAe,CAE/B,GADAsC,GAAY3kD,GACRA,EAAEykD,UAAYpC,IAAiBmD,IAAU7D,GAC3C,OAAOe,GAET,GAAoB,IAAhB1iD,EAAEykD,UAAmB,KAC1B,CAyCD,GApCAgB,EAAY,EACRzlD,EAAEykD,WAAarC,KAEjBpiD,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAOF,EAAEujD,SAAWnB,GAAY,IAAMpiD,EAAEslD,UACjFG,EAAYzlD,EAAEiN,KAAKjN,EAAEujD,SAAWvjD,EAAEokD,QAAUpkD,EAAEkN,KAAKlN,EAAEolD,OACrDplD,EAAEkN,KAAKlN,EAAEolD,OAASplD,EAAEujD,UAMtBvjD,EAAE+jD,YAAc/jD,EAAE2lD,aAClB3lD,EAAE+lD,WAAa/lD,EAAE0kD,YACjB1kD,EAAE2lD,aAAevD,GAAY,EAEX,IAAdqD,GAA0BzlD,EAAE+jD,YAAc/jD,EAAE4lD,gBAC5C5lD,EAAEujD,SAAWkC,GAAczlD,EAAEikD,OAAS5B,KAKxCriD,EAAE2lD,aAAejC,GAAc1jD,EAAGylD,GAG9BzlD,EAAE2lD,cAAgB,IAvsBA,IAwsBlB3lD,EAAEkgD,UAA4BlgD,EAAE2lD,eAAiBvD,IAAapiD,EAAEujD,SAAWvjD,EAAE0kD,YAAc,QAK7F1kD,EAAE2lD,aAAevD,GAAY,IAM7BpiD,EAAE+jD,aAAe3B,IAAapiD,EAAE2lD,cAAgB3lD,EAAE+jD,YAAa,CACjE+B,EAAa9lD,EAAEujD,SAAWvjD,EAAEykD,UAAYrC,GAOxCsD,EAASlE,GAAMhB,UAAUxgD,EAAGA,EAAEujD,SAAW,EAAIvjD,EAAE+lD,WAAY/lD,EAAE+jD,YAAc3B,IAM3EpiD,EAAEykD,WAAazkD,EAAE+jD,YAAc,EAC/B/jD,EAAE+jD,aAAe,EACjB,KACQ/jD,EAAEujD,UAAYuC,IAElB9lD,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAOF,EAAEujD,SAAWnB,GAAY,IAAMpiD,EAAEslD,UACjFG,EAAYzlD,EAAEiN,KAAKjN,EAAEujD,SAAWvjD,EAAEokD,QAAUpkD,EAAEkN,KAAKlN,EAAEolD,OACrDplD,EAAEkN,KAAKlN,EAAEolD,OAASplD,EAAEujD,gBAGK,KAAlBvjD,EAAE+jD,aAKb,GAJA/jD,EAAEgmD,gBAAkB,EACpBhmD,EAAE2lD,aAAevD,GAAY,EAC7BpiD,EAAEujD,WAEEmC,IAEFrC,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACT,OAAON,EAKjB,MAAW,GAAI1iD,EAAEgmD,iBAgBX,IATAN,EAASlE,GAAMhB,UAAUxgD,EAAG,EAAGA,EAAEE,OAAOF,EAAEujD,SAAW,MAInDF,GAAiBrjD,GAAG,GAGtBA,EAAEujD,WACFvjD,EAAEykD,YACuB,IAArBzkD,EAAE6/C,KAAKmD,UACT,OAAON,QAMT1iD,EAAEgmD,gBAAkB,EACpBhmD,EAAEujD,WACFvjD,EAAEykD,WAEL,CAUD,OARIzkD,EAAEgmD,kBAGJN,EAASlE,GAAMhB,UAAUxgD,EAAG,EAAGA,EAAEE,OAAOF,EAAEujD,SAAW,IAErDvjD,EAAEgmD,gBAAkB,GAEtBhmD,EAAEoP,OAASpP,EAAEujD,SAAWnB,GAAY,EAAIpiD,EAAEujD,SAAWnB,GAAY,EAC7DoD,IAAU5D,IAEZyB,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,UACFJ,GAGFC,IAEL7iD,EAAEg9C,WAEJqG,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACFN,GAKJC,EACT,CAgKA,SAASsD,GAAOC,EAAaC,EAAUC,EAAaC,EAAWC,GAC7Dv9C,KAAKm9C,YAAcA,EACnBn9C,KAAKo9C,SAAWA,EAChBp9C,KAAKq9C,YAAcA,EACnBr9C,KAAKs9C,UAAYA,EACjBt9C,KAAKu9C,KAAOA,CACd,CA8CA,SAASC,KACPx9C,KAAK82C,KAAO,KACZ92C,KAAKpM,OAAS,EACdoM,KAAK+yC,YAAc,KACnB/yC,KAAKy9C,iBAAmB,EACxBz9C,KAAKm6C,YAAc,EACnBn6C,KAAKgzC,QAAU,EACfhzC,KAAKm8C,KAAO,EACZn8C,KAAK09C,OAAS,KACd19C,KAAK29C,QAAU,EACf39C,KAAK49C,OAASzE,GACdn5C,KAAK69C,YAAc,EAEnB79C,KAAKk7C,OAAS,EACdl7C,KAAK89C,OAAS,EACd99C,KAAKq7C,OAAS,EAEdr7C,KAAK7I,OAAS,KAQd6I,KAAK+7C,YAAc,EAKnB/7C,KAAKkE,KAAO,KAMZlE,KAAKmE,KAAO,KAEZnE,KAAKq8C,MAAQ,EACbr8C,KAAKg8C,UAAY,EACjBh8C,KAAK+9C,UAAY,EACjB/9C,KAAKu8C,UAAY,EAEjBv8C,KAAKs8C,WAAa,EAOlBt8C,KAAKu6C,YAAc,EAKnBv6C,KAAK48C,aAAe,EACpB58C,KAAKg9C,WAAa,EAClBh9C,KAAKi9C,gBAAkB,EACvBj9C,KAAKw6C,SAAW,EAChBx6C,KAAK27C,YAAc,EACnB37C,KAAK07C,UAAY,EAEjB17C,KAAKg7C,YAAc,EAKnBh7C,KAAK86C,iBAAmB,EAMxB96C,KAAK68C,eAAiB,EAYtB78C,KAAKuQ,MAAQ,EACbvQ,KAAKm3C,SAAW,EAEhBn3C,KAAKy7C,WAAa,EAGlBz7C,KAAKi7C,WAAa,EAYlBj7C,KAAK4zC,UAAa,IAAI3D,GAAMF,MAAkB,EAAZW,IAClC1wC,KAAK6zC,UAAa,IAAI5D,GAAMF,MAA0B,GAAnB,EAAIS,GAAU,IACjDxwC,KAAK8zC,QAAa,IAAI7D,GAAMF,MAA2B,GAApB,EAAIU,GAAW,IAClD3tB,GAAK9iB,KAAK4zC,WACV9wB,GAAK9iB,KAAK6zC,WACV/wB,GAAK9iB,KAAK8zC,SAEV9zC,KAAKu2C,OAAW,KAChBv2C,KAAKw2C,OAAW,KAChBx2C,KAAKy2C,QAAW,KAGhBz2C,KAAKwzC,SAAW,IAAIvD,GAAMF,MAAMY,GAAW,GAI3C3wC,KAAKw0C,KAAO,IAAIvE,GAAMF,MAAM,EAAIQ,GAAU,GAC1CztB,GAAK9iB,KAAKw0C,MAEVx0C,KAAKy0C,SAAW,EAChBz0C,KAAKo1C,SAAW,EAKhBp1C,KAAKo0C,MAAQ,IAAInE,GAAMF,MAAM,EAAIQ,GAAU,GAC3CztB,GAAK9iB,KAAKo0C,OAIVp0C,KAAKg1C,MAAQ,EAEbh1C,KAAK03C,YAAc,EAoBnB13C,KAAKi0C,SAAW,EAEhBj0C,KAAK+0C,MAAQ,EAMb/0C,KAAK+zC,QAAU,EACf/zC,KAAKg0C,WAAa,EAClBh0C,KAAKi/B,QAAU,EACfj/B,KAAKqG,OAAS,EAGdrG,KAAKmzC,OAAS,EAIdnzC,KAAKkzC,SAAW,CAalB,CAGA,SAAS8K,GAAiBlH,GACxB,IAAI7/C,EAEJ,OAAK6/C,GAASA,EAAKzjD,OAInByjD,EAAKsF,SAAWtF,EAAKuD,UAAY,EACjCvD,EAAKC,UAAYmC,IAEjBjiD,EAAI6/C,EAAKzjD,OACP2/C,QAAU,EACZ/7C,EAAEkjD,YAAc,EAEZljD,EAAEklD,KAAO,IACXllD,EAAEklD,MAAQllD,EAAEklD,MAGdllD,EAAErD,OAAUqD,EAAEklD,KAAO5C,GAAaE,GAClC3C,EAAKiB,MAAoB,IAAX9gD,EAAEklD,KACd,EAEA,EACFllD,EAAE4mD,WAAajF,GACfH,GAAMpC,SAASp/C,GACR6hD,IArBEnkD,GAAImiD,EAAMiC,GAsBrB,CAGA,SAASkF,GAAanH,GACpB,IAlPe7/C,EAkPX6lB,EAAMkhC,GAAiBlH,GAI3B,OAHIh6B,IAAQg8B,MAnPG7hD,EAoPL6/C,EAAKzjD,OAnPb0oD,YAAc,EAAI9kD,EAAEikD,OAGtBp4B,GAAK7rB,EAAEkN,MAIPlN,EAAE4lD,eAAiBxE,GAAoBphD,EAAEsZ,OAAO6sC,SAChDnmD,EAAEwkD,WAAapD,GAAoBphD,EAAEsZ,OAAO4sC,YAC5ClmD,EAAEgkD,WAAa5C,GAAoBphD,EAAEsZ,OAAO8sC,YAC5CpmD,EAAE6jD,iBAAmBzC,GAAoBphD,EAAEsZ,OAAO+sC,UAElDrmD,EAAEujD,SAAW,EACbvjD,EAAEsjD,YAAc,EAChBtjD,EAAEykD,UAAY,EACdzkD,EAAEoP,OAAS,EACXpP,EAAE2lD,aAAe3lD,EAAE+jD,YAAc3B,GAAY,EAC7CpiD,EAAEgmD,gBAAkB,EACpBhmD,EAAEolD,MAAQ,GAmOHv/B,CACT,CAWA,SAASohC,GAAapH,EAAMvmC,EAAOqtC,EAAQO,EAAYC,EAAUjH,GAC/D,IAAKL,EACH,OAAOiC,GAET,IAAIoD,EAAO,EAiBX,GAfI5rC,IAAUyoC,KACZzoC,EAAQ,GAGN4tC,EAAa,GACfhC,EAAO,EACPgC,GAAcA,GAGPA,EAAa,KACpBhC,EAAO,EACPgC,GAAc,IAIZC,EAAW,GAAKA,EAAWhF,IAAiBwE,IAAWzE,IACzDgF,EAAa,GAAKA,EAAa,IAAM5tC,EAAQ,GAAKA,EAAQ,GAC1D4mC,EAAW,GAAKA,EAAW8B,GAC3B,OAAOtkD,GAAImiD,EAAMiC,IAIA,IAAfoF,IACFA,EAAa,GAIf,IAAIlnD,EAAI,IAAIumD,GA0CZ,OAxCA1G,EAAKzjD,MAAQ4D,EACbA,EAAE6/C,KAAOA,EAET7/C,EAAEklD,KAAOA,EACTllD,EAAEymD,OAAS,KACXzmD,EAAE6mD,OAASK,EACXlnD,EAAEikD,OAAS,GAAKjkD,EAAE6mD,OAClB7mD,EAAEokD,OAASpkD,EAAEikD,OAAS,EAEtBjkD,EAAE8mD,UAAYK,EAAW,EACzBnnD,EAAE+kD,UAAY,GAAK/kD,EAAE8mD,UACrB9mD,EAAEslD,UAAYtlD,EAAE+kD,UAAY,EAC5B/kD,EAAEqlD,eAAiBrlD,EAAE8mD,UAAY1E,GAAY,GAAKA,IAElDpiD,EAAEE,OAAS,IAAI84C,GAAMH,KAAgB,EAAX74C,EAAEikD,QAC5BjkD,EAAEkN,KAAO,IAAI8rC,GAAMF,MAAM94C,EAAE+kD,WAC3B/kD,EAAEiN,KAAO,IAAI+rC,GAAMF,MAAM94C,EAAEikD,QAK3BjkD,EAAEygD,YAAc,GAAM0G,EAAW,EAEjCnnD,EAAEwmD,iBAAmC,EAAhBxmD,EAAEygD,YAIvBzgD,EAAE87C,YAAc,IAAI9C,GAAMH,KAAK74C,EAAEwmD,kBAIjCxmD,EAAE89C,MAAQ,EAAI99C,EAAEygD,YAGhBzgD,EAAE+9C,MAAQ,EAAU/9C,EAAEygD,YAEtBzgD,EAAEsZ,MAAQA,EACVtZ,EAAEkgD,SAAWA,EACblgD,EAAE2mD,OAASA,EAEJK,GAAanH,EACtB,CAjWAuB,GAAsB,CAEpB,IAAI6E,GAAO,EAAG,EAAG,EAAG,GAxiBtB,SAAwBjmD,EAAGwlD,GAIzB,IAAI4B,EAAiB,MAOrB,IALIA,EAAiBpnD,EAAEwmD,iBAAmB,IACxCY,EAAiBpnD,EAAEwmD,iBAAmB,KAI/B,CAEP,GAAIxmD,EAAEykD,WAAa,EAAG,CAUpB,GADAE,GAAY3kD,GACQ,IAAhBA,EAAEykD,WAAmBe,IAAU7D,GACjC,OAAOe,GAGT,GAAoB,IAAhB1iD,EAAEykD,UACJ,KAGH,CAIDzkD,EAAEujD,UAAYvjD,EAAEykD,UAChBzkD,EAAEykD,UAAY,EAGd,IAAI4C,EAAYrnD,EAAEsjD,YAAc8D,EAEhC,IAAmB,IAAfpnD,EAAEujD,UAAkBvjD,EAAEujD,UAAY8D,KAEpCrnD,EAAEykD,UAAYzkD,EAAEujD,SAAW8D,EAC3BrnD,EAAEujD,SAAW8D,EAEbhE,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACT,OAAON,GASX,GAAI1iD,EAAEujD,SAAWvjD,EAAEsjD,aAAgBtjD,EAAEikD,OAAS5B,KAE5CgB,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACT,OAAON,EAIZ,CAID,OAFA1iD,EAAEoP,OAAS,EAEPo2C,IAAU5D,IAEZyB,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,UACFJ,GAGFC,KAGL7iD,EAAEujD,SAAWvjD,EAAEsjD,cAEjBD,GAAiBrjD,GAAG,GAChBA,EAAE6/C,KAAKmD,WACFN,GAMb,IAgdE,IAAIuD,GAAO,EAAG,EAAG,EAAG,EAAGV,IACvB,IAAIU,GAAO,EAAG,EAAG,GAAI,EAAGV,IACxB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIV,IAEzB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIJ,IACzB,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,IAC1B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,IAC/B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,KA2xBdyB,GAAAC,YApcnB,SAAqB1H,EAAMvmC,GACzB,OAAO2tC,GAAapH,EAAMvmC,EAAO4oC,GA1yCnB,GAEI,EAnBQ,EA4zC5B,EAmcoBoF,GAAAL,aAAGA,GACHK,GAAAN,aAAGA,GACCM,GAAAP,iBAAGA,GACHO,GAAAE,iBA9hBxB,SAA0B3H,EAAM3yC,GAC9B,OAAK2yC,GAASA,EAAKzjD,MACK,IAApByjD,EAAKzjD,MAAM8oD,KAAqBpD,IACpCjC,EAAKzjD,MAAMqqD,OAASv5C,EACb20C,IAH4BC,EAIrC,EA0hBewF,GAAAG,QApcf,SAAiB5H,EAAM2F,GACrB,IAAIkC,EAAW1nD,EACX2nD,EAAKC,EAET,IAAK/H,IAASA,EAAKzjD,OACjBopD,EAj2CkB,GAi2CCA,EAAQ,EAC3B,OAAO3F,EAAOniD,GAAImiD,EAAMiC,IAAkBA,GAK5C,GAFA9hD,EAAI6/C,EAAKzjD,OAEJyjD,EAAKoD,SACJpD,EAAK9mC,OAA2B,IAAlB8mC,EAAKmF,UACpBhlD,EAAErD,SAAW8lD,IAAgB+C,IAAU5D,GAC1C,OAAOlkD,GAAImiD,EAA0B,IAAnBA,EAAKmD,WA51CL,EA41CsClB,IAQ1D,GALA9hD,EAAE6/C,KAAOA,EACT6H,EAAY1nD,EAAE4mD,WACd5mD,EAAE4mD,WAAapB,EAGXxlD,EAAErD,SAAW2lD,GAEf,GAAe,IAAXtiD,EAAEklD,KACJrF,EAAKiB,MAAQ,EACb0C,GAASxjD,EAAG,IACZwjD,GAASxjD,EAAG,KACZwjD,GAASxjD,EAAG,GACPA,EAAEymD,QAaLjD,GAASxjD,GAAIA,EAAEymD,OAAOoB,KAAO,EAAI,IACpB7nD,EAAEymD,OAAOqB,KAAO,EAAI,IACnB9nD,EAAEymD,OAAO3+B,MAAY,EAAJ,IACjB9nB,EAAEymD,OAAOplD,KAAW,EAAJ,IAChBrB,EAAEymD,OAAOsB,QAAc,GAAJ,IAEjCvE,GAASxjD,EAAmB,IAAhBA,EAAEymD,OAAO35B,MACrB02B,GAASxjD,EAAIA,EAAEymD,OAAO35B,MAAQ,EAAK,KACnC02B,GAASxjD,EAAIA,EAAEymD,OAAO35B,MAAQ,GAAM,KACpC02B,GAASxjD,EAAIA,EAAEymD,OAAO35B,MAAQ,GAAM,KACpC02B,GAASxjD,EAAe,IAAZA,EAAEsZ,MAAc,EACftZ,EAAEkgD,UAv3CK,GAu3CyBlgD,EAAEsZ,MAAQ,EAC1C,EAAI,GACjBkqC,GAASxjD,EAAiB,IAAdA,EAAEymD,OAAOuB,IACjBhoD,EAAEymD,OAAO3+B,OAAS9nB,EAAEymD,OAAO3+B,MAAM5sB,SACnCsoD,GAASxjD,EAA2B,IAAxBA,EAAEymD,OAAO3+B,MAAM5sB,QAC3BsoD,GAASxjD,EAAIA,EAAEymD,OAAO3+B,MAAM5sB,QAAU,EAAK,MAEzC8E,EAAEymD,OAAOqB,OACXjI,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO9gD,EAAE87C,YAAa97C,EAAE+7C,QAAS,IAE3D/7C,EAAE0mD,QAAU,EACZ1mD,EAAErD,OAn1CQ,KAizCV6mD,GAASxjD,EAAG,GACZwjD,GAASxjD,EAAG,GACZwjD,GAASxjD,EAAG,GACZwjD,GAASxjD,EAAG,GACZwjD,GAASxjD,EAAG,GACZwjD,GAASxjD,EAAe,IAAZA,EAAEsZ,MAAc,EACftZ,EAAEkgD,UAt2CK,GAs2CyBlgD,EAAEsZ,MAAQ,EAC1C,EAAI,GACjBkqC,GAASxjD,EA7yCH,GA8yCNA,EAAErD,OAAS6lD,QA6Bf,CACE,IAAIvD,EAAUiD,IAAeliD,EAAE6mD,OAAS,GAAM,IAAO,EAYrD5H,IATIj/C,EAAEkgD,UA14CgB,GA04CclgD,EAAEsZ,MAAQ,EAC9B,EACLtZ,EAAEsZ,MAAQ,EACL,EACO,IAAZtZ,EAAEsZ,MACG,EAEA,IAEU,EACP,IAAftZ,EAAEujD,WAAkBtE,GAx2CZ,IAy2CZA,GAAU,GAAMA,EAAS,GAEzBj/C,EAAErD,OAAS6lD,GACXiB,GAAYzjD,EAAGi/C,GAGI,IAAfj/C,EAAEujD,WACJE,GAAYzjD,EAAG6/C,EAAKiB,QAAU,IAC9B2C,GAAYzjD,EAAgB,MAAb6/C,EAAKiB,QAEtBjB,EAAKiB,MAAQ,CACd,CAIH,GAr3CgB,KAq3CZ9gD,EAAErD,OACJ,GAAIqD,EAAEymD,OAAO3+B,MAAqB,CAGhC,IAFA6/B,EAAM3nD,EAAE+7C,QAED/7C,EAAE0mD,SAAmC,MAAxB1mD,EAAEymD,OAAO3+B,MAAM5sB,UAC7B8E,EAAE+7C,UAAY/7C,EAAEwmD,mBACdxmD,EAAEymD,OAAOqB,MAAQ9nD,EAAE+7C,QAAU4L,IAC/B9H,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO9gD,EAAE87C,YAAa97C,EAAE+7C,QAAU4L,EAAKA,IAEjE5E,GAAclD,GACd8H,EAAM3nD,EAAE+7C,QACJ/7C,EAAE+7C,UAAY/7C,EAAEwmD,oBAItBhD,GAASxjD,EAA+B,IAA5BA,EAAEymD,OAAO3+B,MAAM9nB,EAAE0mD,UAC7B1mD,EAAE0mD,UAEA1mD,EAAEymD,OAAOqB,MAAQ9nD,EAAE+7C,QAAU4L,IAC/B9H,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO9gD,EAAE87C,YAAa97C,EAAE+7C,QAAU4L,EAAKA,IAE7D3nD,EAAE0mD,UAAY1mD,EAAEymD,OAAO3+B,MAAM5sB,SAC/B8E,EAAE0mD,QAAU,EACZ1mD,EAAErD,OA34CO,GA64CZ,MAECqD,EAAErD,OA/4CS,GAk5Cf,GAl5Ce,KAk5CXqD,EAAErD,OACJ,GAAIqD,EAAEymD,OAAOplD,KAAoB,CAC/BsmD,EAAM3nD,EAAE+7C,QAGR,EAAG,CACD,GAAI/7C,EAAE+7C,UAAY/7C,EAAEwmD,mBACdxmD,EAAEymD,OAAOqB,MAAQ9nD,EAAE+7C,QAAU4L,IAC/B9H,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO9gD,EAAE87C,YAAa97C,EAAE+7C,QAAU4L,EAAKA,IAEjE5E,GAAclD,GACd8H,EAAM3nD,EAAE+7C,QACJ/7C,EAAE+7C,UAAY/7C,EAAEwmD,kBAAkB,CACpCoB,EAAM,EACN,KACD,CAIDA,EADE5nD,EAAE0mD,QAAU1mD,EAAEymD,OAAOplD,KAAKnG,OACkB,IAAxC8E,EAAEymD,OAAOplD,KAAK3G,WAAWsF,EAAE0mD,WAE3B,EAERlD,GAASxjD,EAAG4nD,SACG,IAARA,GAEL5nD,EAAEymD,OAAOqB,MAAQ9nD,EAAE+7C,QAAU4L,IAC/B9H,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO9gD,EAAE87C,YAAa97C,EAAE+7C,QAAU4L,EAAKA,IAErD,IAARC,IACF5nD,EAAE0mD,QAAU,EACZ1mD,EAAErD,OAh7CU,GAk7Cf,MAECqD,EAAErD,OAp7CY,GAu7ClB,GAv7CkB,KAu7CdqD,EAAErD,OACJ,GAAIqD,EAAEymD,OAAOsB,QAAuB,CAClCJ,EAAM3nD,EAAE+7C,QAGR,EAAG,CACD,GAAI/7C,EAAE+7C,UAAY/7C,EAAEwmD,mBACdxmD,EAAEymD,OAAOqB,MAAQ9nD,EAAE+7C,QAAU4L,IAC/B9H,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO9gD,EAAE87C,YAAa97C,EAAE+7C,QAAU4L,EAAKA,IAEjE5E,GAAclD,GACd8H,EAAM3nD,EAAE+7C,QACJ/7C,EAAE+7C,UAAY/7C,EAAEwmD,kBAAkB,CACpCoB,EAAM,EACN,KACD,CAIDA,EADE5nD,EAAE0mD,QAAU1mD,EAAEymD,OAAOsB,QAAQ7sD,OACkB,IAA3C8E,EAAEymD,OAAOsB,QAAQrtD,WAAWsF,EAAE0mD,WAE9B,EAERlD,GAASxjD,EAAG4nD,SACG,IAARA,GAEL5nD,EAAEymD,OAAOqB,MAAQ9nD,EAAE+7C,QAAU4L,IAC/B9H,EAAKiB,MAAQY,GAAM7B,EAAKiB,MAAO9gD,EAAE87C,YAAa97C,EAAE+7C,QAAU4L,EAAKA,IAErD,IAARC,IACF5nD,EAAErD,OAAS4lD,GAEd,MAECviD,EAAErD,OAAS4lD,GAsBf,GAnBIviD,EAAErD,SAAW4lD,KACXviD,EAAEymD,OAAOqB,MACP9nD,EAAE+7C,QAAU,EAAI/7C,EAAEwmD,kBACpBzD,GAAclD,GAEZ7/C,EAAE+7C,QAAU,GAAK/7C,EAAEwmD,mBACrBhD,GAASxjD,EAAgB,IAAb6/C,EAAKiB,OACjB0C,GAASxjD,EAAI6/C,EAAKiB,OAAS,EAAK,KAChCjB,EAAKiB,MAAQ,EACb9gD,EAAErD,OAAS6lD,KAIbxiD,EAAErD,OAAS6lD,IAMG,IAAdxiD,EAAE+7C,SAEJ,GADAgH,GAAclD,GACS,IAAnBA,EAAKmD,UAQP,OADAhjD,EAAE4mD,YAAc,EACT/E,QAOJ,GAAsB,IAAlBhC,EAAKmF,UAAkB1E,GAAKkF,IAAUlF,GAAKoH,IACpDlC,IAAU5D,GACV,OAAOlkD,GAAImiD,GA/jDO,GAmkDpB,GAAI7/C,EAAErD,SAAW8lD,IAAkC,IAAlB5C,EAAKmF,SACpC,OAAOtnD,GAAImiD,GApkDO,GAykDpB,GAAsB,IAAlBA,EAAKmF,UAAkC,IAAhBhlD,EAAEykD,WAC1Be,IAAU7D,IAAc3hD,EAAErD,SAAW8lD,GAAe,CACrD,IAAIwF,EA/jDoB,IA+jDVjoD,EAAEkgD,SAxqBpB,SAAsBlgD,EAAGwlD,GAGvB,IAFA,IAAIE,IAEK,CAEP,GAAoB,IAAhB1lD,EAAEykD,YACJE,GAAY3kD,GACQ,IAAhBA,EAAEykD,WAAiB,CACrB,GAAIe,IAAU7D,GACZ,OAAOe,GAET,KACD,CAUH,GANA1iD,EAAE2lD,aAAe,EAGjBD,EAASlE,GAAMhB,UAAUxgD,EAAG,EAAGA,EAAEE,OAAOF,EAAEujD,WAC1CvjD,EAAEykD,YACFzkD,EAAEujD,WACEmC,IAEFrC,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACT,OAAON,EAIZ,CAED,OADA1iD,EAAEoP,OAAS,EACPo2C,IAAU5D,IAEZyB,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,UACFJ,GAGFC,IAEL7iD,EAAEg9C,WAEJqG,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACFN,GAIJC,EACT,CAsnBmDuF,CAAaloD,EAAGwlD,GA9jDvC,IA+jDrBxlD,EAAEkgD,SAxwBT,SAAqBlgD,EAAGwlD,GAOtB,IANA,IAAIE,EACAz4C,EACAoe,EAAMg5B,EAENH,EAAOlkD,EAAEE,SAEJ,CAKP,GAAIF,EAAEykD,WAAa/J,GAAW,CAE5B,GADAiK,GAAY3kD,GACRA,EAAEykD,WAAa/J,IAAa8K,IAAU7D,GACxC,OAAOe,GAET,GAAoB,IAAhB1iD,EAAEykD,UAAmB,KAC1B,CAID,GADAzkD,EAAE2lD,aAAe,EACb3lD,EAAEykD,WAAarC,IAAapiD,EAAEujD,SAAW,IAE3Ct2C,EAAOi3C,EADP74B,EAAOrrB,EAAEujD,SAAW,MAEPW,IAAO74B,IAASpe,IAASi3C,IAAO74B,IAASpe,IAASi3C,IAAO74B,GAAO,CAC3Eg5B,EAASrkD,EAAEujD,SAAW7I,GACtB,UAESztC,IAASi3C,IAAO74B,IAASpe,IAASi3C,IAAO74B,IACzCpe,IAASi3C,IAAO74B,IAASpe,IAASi3C,IAAO74B,IACzCpe,IAASi3C,IAAO74B,IAASpe,IAASi3C,IAAO74B,IACzCpe,IAASi3C,IAAO74B,IAASpe,IAASi3C,IAAO74B,IACzCA,EAAOg5B,GAChBrkD,EAAE2lD,aAAejL,IAAa2J,EAASh5B,GACnCrrB,EAAE2lD,aAAe3lD,EAAEykD,YACrBzkD,EAAE2lD,aAAe3lD,EAAEykD,UAEtB,CAuBH,GAlBIzkD,EAAE2lD,cAAgBvD,IAIpBsD,EAASlE,GAAMhB,UAAUxgD,EAAG,EAAGA,EAAE2lD,aAAevD,IAEhDpiD,EAAEykD,WAAazkD,EAAE2lD,aACjB3lD,EAAEujD,UAAYvjD,EAAE2lD,aAChB3lD,EAAE2lD,aAAe,IAKjBD,EAASlE,GAAMhB,UAAUxgD,EAAG,EAAGA,EAAEE,OAAOF,EAAEujD,WAE1CvjD,EAAEykD,YACFzkD,EAAEujD,YAEAmC,IAEFrC,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACT,OAAON,EAIZ,CAED,OADA1iD,EAAEoP,OAAS,EACPo2C,IAAU5D,IAEZyB,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,UACFJ,GAGFC,IAEL7iD,EAAEg9C,WAEJqG,GAAiBrjD,GAAG,GACK,IAArBA,EAAE6/C,KAAKmD,WACFN,GAIJC,EACT,CA+qB8BwF,CAAYnoD,EAAGwlD,GACrCpE,GAAoBphD,EAAEsZ,OAAOgtC,KAAKtmD,EAAGwlD,GAKzC,GAHIyC,IAAWrF,IAAqBqF,IAAWpF,KAC7C7iD,EAAErD,OAAS8lD,IAETwF,IAAWvF,IAAgBuF,IAAWrF,GAKxC,OAJuB,IAAnB/C,EAAKmD,YACPhjD,EAAE4mD,YAAc,GAGX/E,GAST,GAAIoG,IAAWtF,KAlnDG,IAmnDZ6C,EACFhE,GAAMd,UAAU1gD,GAhnDF,IAknDPwlD,IAEPhE,GAAMzC,iBAAiB/+C,EAAG,EAAG,GAAG,GAtnDlB,IA0nDVwlD,IAEF35B,GAAK7rB,EAAEkN,MAEa,IAAhBlN,EAAEykD,YACJzkD,EAAEujD,SAAW,EACbvjD,EAAEsjD,YAAc,EAChBtjD,EAAEoP,OAAS,KAIjB2zC,GAAclD,GACS,IAAnBA,EAAKmD,WAEP,OADAhjD,EAAE4mD,YAAc,EACT/E,EAGZ,CAID,OAAI2D,IAAU5D,GAAmBC,GAC7B7hD,EAAEklD,MAAQ,EAtoDM,GAyoDL,IAAXllD,EAAEklD,MACJ1B,GAASxjD,EAAgB,IAAb6/C,EAAKiB,OACjB0C,GAASxjD,EAAI6/C,EAAKiB,OAAS,EAAK,KAChC0C,GAASxjD,EAAI6/C,EAAKiB,OAAS,GAAM,KACjC0C,GAASxjD,EAAI6/C,EAAKiB,OAAS,GAAM,KACjC0C,GAASxjD,EAAmB,IAAhB6/C,EAAKsF,UACjB3B,GAASxjD,EAAI6/C,EAAKsF,UAAY,EAAK,KACnC3B,GAASxjD,EAAI6/C,EAAKsF,UAAY,GAAM,KACpC3B,GAASxjD,EAAI6/C,EAAKsF,UAAY,GAAM,OAIpC1B,GAAYzjD,EAAG6/C,EAAKiB,QAAU,IAC9B2C,GAAYzjD,EAAgB,MAAb6/C,EAAKiB,QAGtBiC,GAAclD,GAIV7/C,EAAEklD,KAAO,IAAKllD,EAAEklD,MAAQllD,EAAEklD,MAET,IAAdllD,EAAE+7C,QAAgB8F,GA/pDL,EAgqDtB,EAyHkByF,GAAAc,WAvHlB,SAAoBvI,GAClB,IAAIljD,EAEJ,OAAKkjD,GAAsBA,EAAKzjD,OAIhCO,EAASkjD,EAAKzjD,MAAMO,UACL2lD,IAzmDC,KA0mDd3lD,GAzmDa,KA0mDbA,GAzmDgB,KA0mDhBA,GACAA,IAAW4lD,IACX5lD,IAAW6lD,IACX7lD,IAAW8lD,GAEJ/kD,GAAImiD,EAAMiC,KAGnBjC,EAAKzjD,MAAQ,KAENO,IAAW6lD,GAAa9kD,GAAImiD,GAnrDf,GAmrDqCgC,IAjBhDC,EAkBX,EAkG4BwF,GAAAe,qBA3F5B,SAA8BxI,EAAMyI,GAClC,IAEItoD,EACA+U,EAAK9T,EACLikD,EACAqD,EACA79C,EACAqO,EACAyvC,EARAC,EAAaH,EAAWptD,OAU5B,IAAK2kD,IAAsBA,EAAKzjD,MAC9B,OAAO0lD,GAMT,GAAa,KAFboD,GADAllD,EAAI6/C,EAAKzjD,OACA8oD,OAEmB,IAATA,GAAcllD,EAAErD,SAAW2lD,IAAetiD,EAAEykD,UAC7D,OAAO3C,GAmCT,IA/Ba,IAAToD,IAEFrF,EAAKiB,MAAQW,GAAQ5B,EAAKiB,MAAOwH,EAAYG,EAAY,IAG3DzoD,EAAEklD,KAAO,EAGLuD,GAAczoD,EAAEikD,SACL,IAATiB,IAEFr5B,GAAK7rB,EAAEkN,MACPlN,EAAEujD,SAAW,EACbvjD,EAAEsjD,YAAc,EAChBtjD,EAAEoP,OAAS,GAIbo5C,EAAU,IAAIxP,GAAMH,KAAK74C,EAAEikD,QAC3BjL,GAAM38B,SAASmsC,EAASF,EAAYG,EAAazoD,EAAEikD,OAAQjkD,EAAEikD,OAAQ,GACrEqE,EAAaE,EACbC,EAAazoD,EAAEikD,QAGjBsE,EAAQ1I,EAAKmF,SACbt6C,EAAOm1C,EAAKoF,QACZlsC,EAAQ8mC,EAAK9mC,MACb8mC,EAAKmF,SAAWyD,EAChB5I,EAAKoF,QAAU,EACfpF,EAAK9mC,MAAQuvC,EACb3D,GAAY3kD,GACLA,EAAEykD,WAAarC,IAAW,CAC/BrtC,EAAM/U,EAAEujD,SACRtiD,EAAIjB,EAAEykD,WAAarC,GAAY,GAC/B,GAEEpiD,EAAEolD,OAAUplD,EAAEolD,OAASplD,EAAEqlD,WAAcrlD,EAAEE,OAAO6U,EAAMqtC,GAAY,IAAMpiD,EAAEslD,UAE1EtlD,EAAEiN,KAAK8H,EAAM/U,EAAEokD,QAAUpkD,EAAEkN,KAAKlN,EAAEolD,OAElCplD,EAAEkN,KAAKlN,EAAEolD,OAASrwC,EAClBA,YACS9T,GACXjB,EAAEujD,SAAWxuC,EACb/U,EAAEykD,UAAYrC,GAAY,EAC1BuC,GAAY3kD,EACb,CAWD,OAVAA,EAAEujD,UAAYvjD,EAAEykD,UAChBzkD,EAAEsjD,YAActjD,EAAEujD,SAClBvjD,EAAEoP,OAASpP,EAAEykD,UACbzkD,EAAEykD,UAAY,EACdzkD,EAAE2lD,aAAe3lD,EAAE+jD,YAAc3B,GAAY,EAC7CpiD,EAAEgmD,gBAAkB,EACpBnG,EAAKoF,QAAUv6C,EACfm1C,EAAK9mC,MAAQA,EACb8mC,EAAKmF,SAAWuD,EAChBvoD,EAAEklD,KAAOA,EACFrD,EACT,EAWmByF,GAAAoB,YAAG,+CEp0DlB1P,GAAQv9C,GAQRktD,IAAe,EACfC,IAAmB,EAEvB,IAAMvlD,OAAOqS,aAAamjB,MAAM,KAAM,CAAE,GAAK,CAAG,MAAOgwB,GAAMF,IAAe,CAAQ,CACpF,IAAMtlD,OAAOqS,aAAamjB,MAAM,KAAM,IAAIpK,WAAW,GAAM,CAAC,MAAOo6B,GAAMD,IAAmB,CAAQ,CAOpG,IADA,IAAIE,GAAW,IAAI9P,GAAMH,KAAK,KACrB/I,GAAI,EAAGA,GAAI,IAAKA,KACvBgZ,GAAShZ,IAAMA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAI,EA4D5F,SAASiZ,GAAc3Q,EAAKt8B,GAI1B,GAAIA,EAAM,QACHs8B,EAAIC,UAAYuQ,KAAuBxQ,EAAIC,UAAYsQ,IAC1D,OAAOtlD,OAAOqS,aAAamjB,MAAM,KAAMmgB,GAAMb,UAAUC,EAAKt8B,IAKhE,IADA,IAAI3f,EAAS,GACJ+F,EAAI,EAAGA,EAAI4Z,EAAK5Z,IACvB/F,GAAUkH,OAAOqS,aAAa0iC,EAAIl2C,IAEpC,OAAO/F,CACT,CAzEA2sD,GAAS,KAAOA,GAAS,KAAO,EAIdE,GAAAC,WAAG,SAAUl0C,GAC7B,IAAIqjC,EAAKh2C,EAAG8mD,EAAIC,EAAOjnD,EAAGknD,EAAUr0C,EAAI7Z,OAAQmuD,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAEV,QAAZ,OADT/mD,EAAI2S,EAAIra,WAAWyuD,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKn0C,EAAIra,WAAWyuD,EAAQ,OAE1B/mD,EAAI,OAAYA,EAAI,OAAW,KAAO8mD,EAAK,OAC3CC,KAGJE,GAAWjnD,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHAg2C,EAAM,IAAIY,GAAMH,KAAKwQ,GAGhBnnD,EAAI,EAAGinD,EAAQ,EAAGjnD,EAAImnD,EAASF,IAEb,QAAZ,OADT/mD,EAAI2S,EAAIra,WAAWyuD,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKn0C,EAAIra,WAAWyuD,EAAQ,OAE1B/mD,EAAI,OAAYA,EAAI,OAAW,KAAO8mD,EAAK,OAC3CC,KAGA/mD,EAAI,IAENg2C,EAAIl2C,KAAOE,EACFA,EAAI,MAEbg2C,EAAIl2C,KAAO,IAAQE,IAAM,EACzBg2C,EAAIl2C,KAAO,IAAY,GAAJE,GACVA,EAAI,OAEbg2C,EAAIl2C,KAAO,IAAQE,IAAM,GACzBg2C,EAAIl2C,KAAO,IAAQE,IAAM,EAAI,GAC7Bg2C,EAAIl2C,KAAO,IAAY,GAAJE,IAGnBg2C,EAAIl2C,KAAO,IAAQE,IAAM,GACzBg2C,EAAIl2C,KAAO,IAAQE,IAAM,GAAK,GAC9Bg2C,EAAIl2C,KAAO,IAAQE,IAAM,EAAI,GAC7Bg2C,EAAIl2C,KAAO,IAAY,GAAJE,GAIvB,OAAOg2C,CACT,EAsBqB4Q,GAAAD,cAAG,SAAU3Q,GAChC,OAAO2Q,GAAc3Q,EAAKA,EAAIl9C,OAChC,EAIqB8tD,GAAAM,cAAG,SAAUv0C,GAEhC,IADA,IAAIqjC,EAAM,IAAIY,GAAMH,KAAK9jC,EAAI7Z,QACpBgH,EAAI,EAAG4Z,EAAMs8B,EAAIl9C,OAAQgH,EAAI4Z,EAAK5Z,IACzCk2C,EAAIl2C,GAAK6S,EAAIra,WAAWwH,GAE1B,OAAOk2C,CACT,EAIA4Q,GAAAO,WAAqB,SAAUnR,EAAKjwC,GAClC,IAAIjG,EAAGsnD,EAAKpnD,EAAGqnD,EACX3tC,EAAM3T,GAAOiwC,EAAIl9C,OAKjBwuD,EAAW,IAAI5jD,MAAY,EAANgW,GAEzB,IAAK0tC,EAAM,EAAGtnD,EAAI,EAAGA,EAAI4Z,GAGvB,IAFA1Z,EAAIg2C,EAAIl2C,MAEA,IAAQwnD,EAASF,KAASpnD,OAIlC,IAFAqnD,EAAQX,GAAS1mD,IAEL,EAAKsnD,EAASF,KAAS,MAAQtnD,GAAKunD,EAAQ,MAAxD,CAKA,IAFArnD,GAAe,IAAVqnD,EAAc,GAAiB,IAAVA,EAAc,GAAO,EAExCA,EAAQ,GAAKvnD,EAAI4Z,GACtB1Z,EAAKA,GAAK,EAAiB,GAAXg2C,EAAIl2C,KACpBunD,IAIEA,EAAQ,EAAKC,EAASF,KAAS,MAE/BpnD,EAAI,MACNsnD,EAASF,KAASpnD,GAElBA,GAAK,MACLsnD,EAASF,KAAS,MAAWpnD,GAAK,GAAM,KACxCsnD,EAASF,KAAS,MAAc,KAAJpnD,EAlBwC,CAsBxE,OAAO2mD,GAAcW,EAAUF,EACjC,EASAR,GAAAW,WAAqB,SAAUvR,EAAKjwC,GAClC,IAAIiD,EAOJ,KALAjD,EAAMA,GAAOiwC,EAAIl9C,QACPk9C,EAAIl9C,SAAUiN,EAAMiwC,EAAIl9C,QAGlCkQ,EAAMjD,EAAM,EACLiD,GAAO,GAA2B,MAAV,IAAXgtC,EAAIhtC,KAAyBA,IAIjD,OAAIA,EAAM,GAIE,IAARA,EAJkBjD,EAMdiD,EAAM09C,GAAS1Q,EAAIhtC,IAAQjD,EAAOiD,EAAMjD,CAClD,EC5IA,IAAAyhD,GAzBA,WAEE7gD,KAAKgQ,MAAQ,KACbhQ,KAAKk8C,QAAU,EAEfl8C,KAAKi8C,SAAW,EAEhBj8C,KAAKo8C,SAAW,EAEhBp8C,KAAKk6C,OAAS,KACdl6C,KAAKo6C,SAAW,EAEhBp6C,KAAKi6C,UAAY,EAEjBj6C,KAAKq6C,UAAY,EAEjBr6C,KAAKgyB,IAAM,GAEXhyB,KAAK3M,MAAQ,KAEb2M,KAAK+2C,UAAY,EAEjB/2C,KAAK+3C,MAAQ,CACf,ECzCI+I,GAAepuD,GACfu9C,GAAex5C,GACfwpD,GAAevpD,GACfs7B,GAAer7B,GACfoqD,GAAenqD,GAEf8gB,GAAWzhB,OAAOoB,UAAUqgB,SAQ5BohC,GAAkB,EAIlBE,IAAyB,EAEzBgI,GAAwB,EAExB7H,GAAc,EA8FlB,SAAS8H,GAAQ9tD,GACf,KAAM6M,gBAAgBihD,IAAU,OAAO,IAAIA,GAAQ9tD,GAEnD6M,KAAK7M,QAAU88C,GAAM5oC,OAAO,CAC1BkJ,MAAOyoC,GACP4E,OAAQzE,GACR+H,UAAW,MACX/C,WAAY,GACZC,SAAU,EACVjH,SAAU6J,GACVG,GAAI,IACHhuD,GAAW,CAAA,GAEd,IAAIiuD,EAAMphD,KAAK7M,QAEXiuD,EAAIC,KAAQD,EAAIjD,WAAa,EAC/BiD,EAAIjD,YAAciD,EAAIjD,WAGfiD,EAAIE,MAASF,EAAIjD,WAAa,GAAOiD,EAAIjD,WAAa,KAC7DiD,EAAIjD,YAAc,IAGpBn+C,KAAKrL,IAAS,EACdqL,KAAKgyB,IAAS,GACdhyB,KAAKuhD,OAAS,EACdvhD,KAAK/N,OAAS,GAEd+N,KAAK82C,KAAO,IAAIiK,GAChB/gD,KAAK82C,KAAKmD,UAAY,EAEtB,IAAIrmD,EAASktD,GAAa5C,aACxBl+C,KAAK82C,KACLsK,EAAI7wC,MACJ6wC,EAAIxD,OACJwD,EAAIjD,WACJiD,EAAIhD,SACJgD,EAAIjK,UAGN,GAAIvjD,IAAWklD,GACb,MAAM,IAAIhhD,MAAMk6B,GAAIp+B,IAOtB,GAJIwtD,EAAIlL,QACN4K,GAAarC,iBAAiBz+C,KAAK82C,KAAMsK,EAAIlL,QAG3CkL,EAAI7B,WAAY,CAClB,IAAI/1C,EAaJ,GATEA,EAF4B,iBAAnB43C,EAAI7B,WAENU,GAAQC,WAAWkB,EAAI7B,YACa,yBAAlC7nC,GAAStf,KAAKgpD,EAAI7B,YACpB,IAAI75B,WAAW07B,EAAI7B,YAEnB6B,EAAI7B,YAGb3rD,EAASktD,GAAaxB,qBAAqBt/C,KAAK82C,KAAMttC,MAEvCsvC,GACb,MAAM,IAAIhhD,MAAMk6B,GAAIp+B,IAGtBoM,KAAKwhD,WAAY,CAClB,CACH,CAuKA,SAAS9C,GAAQ1uC,EAAO7c,GACtB,IAAIsuD,EAAW,IAAIR,GAAQ9tD,GAK3B,GAHAsuD,EAASpvD,KAAK2d,GAAO,GAGjByxC,EAAS9sD,IAAO,MAAM8sD,EAASzvB,KAAOA,GAAIyvB,EAAS9sD,KAEvD,OAAO8sD,EAASruD,MAClB,CAjJA6tD,GAAQ5pD,UAAUhF,KAAO,SAAU4R,EAAMiW,GACvC,IAEItmB,EAAQ8tD,EAFR5K,EAAO92C,KAAK82C,KACZoK,EAAYlhD,KAAK7M,QAAQ+tD,UAG7B,GAAIlhD,KAAKuhD,MAAS,OAAO,EAEzBG,EAASxnC,MAAWA,EAAQA,GAAkB,IAATA,EAlNjB,EADA,EAsNA,iBAATjW,EAET6yC,EAAK9mC,MAAQiwC,GAAQC,WAAWj8C,GACC,yBAAxByT,GAAStf,KAAK6L,GACvB6yC,EAAK9mC,MAAQ,IAAI0V,WAAWzhB,GAE5B6yC,EAAK9mC,MAAQ/L,EAGf6yC,EAAKoF,QAAU,EACfpF,EAAKmF,SAAWnF,EAAK9mC,MAAM7d,OAE3B,EAAG,CAQD,GAPuB,IAAnB2kD,EAAKmD,YACPnD,EAAKoD,OAAS,IAAIjK,GAAMH,KAAKoR,GAC7BpK,EAAKsD,SAAW,EAChBtD,EAAKmD,UAAYiH,GAlOD,KAoOlBttD,EAASktD,GAAapC,QAAQ5H,EAAM4K,KAEL9tD,IAAWklD,GAGxC,OAFA94C,KAAK2hD,MAAM/tD,GACXoM,KAAKuhD,OAAQ,GACN,EAEc,IAAnBzK,EAAKmD,YAAsC,IAAlBnD,EAAKmF,UA9OhB,IA8OmCyF,GA1OnC,IA0OyDA,KACjD,WAApB1hD,KAAK7M,QAAQguD,GACfnhD,KAAK4hD,OAAO3B,GAAQD,cAAc/P,GAAMb,UAAU0H,EAAKoD,OAAQpD,EAAKsD,YAEpEp6C,KAAK4hD,OAAO3R,GAAMb,UAAU0H,EAAKoD,OAAQpD,EAAKsD,WAGtD,QAAYtD,EAAKmF,SAAW,GAAwB,IAAnBnF,EAAKmD,YAlPhB,IAkPoCrmD,GAGxD,OAxPoB,IAwPhB8tD,GACF9tD,EAASktD,GAAazB,WAAWr/C,KAAK82C,MACtC92C,KAAK2hD,MAAM/tD,GACXoM,KAAKuhD,OAAQ,EACN3tD,IAAWklD,IAxPA,IA4PhB4I,IACF1hD,KAAK2hD,MAAM7I,IACXhC,EAAKmD,UAAY,GACV,EAIX,EAYAgH,GAAQ5pD,UAAUuqD,OAAS,SAAUx+C,GACnCpD,KAAK/N,OAAOI,KAAK+Q,EACnB,EAaA69C,GAAQ5pD,UAAUsqD,MAAQ,SAAU/tD,GAE9BA,IAAWklD,KACW,WAApB94C,KAAK7M,QAAQguD,GACfnhD,KAAK5M,OAAS4M,KAAK/N,OAAOsG,KAAK,IAE/ByH,KAAK5M,OAAS68C,GAAMP,cAAc1vC,KAAK/N,SAG3C+N,KAAK/N,OAAS,GACd+N,KAAKrL,IAAMf,EACXoM,KAAKgyB,IAAMhyB,KAAK82C,KAAK9kB,GACvB,EA+Ee6vB,GAAAZ,QAAGA,GACHY,GAAAnD,QAAGA,GACAmD,GAAAC,WAxBlB,SAAoB9xC,EAAO7c,GAGzB,OAFAA,EAAUA,GAAW,IACbkuD,KAAM,EACP3C,GAAQ1uC,EAAO7c,EACxB,EAqBA0uD,GAAAP,KAVA,SAActxC,EAAO7c,GAGnB,OAFAA,EAAUA,GAAW,IACbmuD,MAAO,EACR5C,GAAQ1uC,EAAO7c,EACxB,kBCpXI88C,GAAQv9C,GAERqvD,GAAU,GASVC,GAAQ,CACV,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,GAG3DC,GAAO,CACT,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,IAGtDC,GAAQ,CACV,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,GAG5BC,GAAO,CACT,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,IC9BlBlS,GAAgBv9C,GAChBgmD,GAAgBjiD,GAChBkiD,GAAgBjiD,GAChB0rD,GCoCa,SAAsBtL,EAAMj5C,GAC3C,IAAIxK,EACAgvD,EACAt9C,EACAu9C,EACA1D,EACA9gD,EAEAykD,EAEAC,EACAC,EACAC,EAEAC,EACAC,EACAnP,EACAoP,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAnwC,EACA5c,EACAzC,EACAyvD,EAGAnzC,EAAOkqC,EAGX7mD,EAAQyjD,EAAKzjD,MAEbgvD,EAAMvL,EAAKoF,QACXlsC,EAAQ8mC,EAAK9mC,MACbjL,EAAOs9C,GAAOvL,EAAKmF,SAAW,GAC9BqG,EAAOxL,EAAKsD,SACZF,EAASpD,EAAKoD,OACd0E,EAAM0D,GAAQzkD,EAAQi5C,EAAKmD,WAC3Bn8C,EAAMwkD,GAAQxL,EAAKmD,UAAY,KAE/BsI,EAAOlvD,EAAMkvD,KAEbC,EAAQnvD,EAAMmvD,MACdC,EAAQpvD,EAAMovD,MACdC,EAAQrvD,EAAMqvD,MACdC,EAAWtvD,EAAM8D,OACjByrD,EAAOvvD,EAAMuvD,KACbnP,EAAOpgD,EAAMogD,KACboP,EAAQxvD,EAAM+vD,QACdN,EAAQzvD,EAAMgwD,SACdN,GAAS,GAAK1vD,EAAMiwD,SAAW,EAC/BN,GAAS,GAAK3vD,EAAMkwD,UAAY,EAMhCvqB,EACA,EAAG,CACGya,EAAO,KACTmP,GAAQ5yC,EAAMqyC,MAAU5O,EACxBA,GAAQ,EACRmP,GAAQ5yC,EAAMqyC,MAAU5O,EACxBA,GAAQ,GAGVwP,EAAOJ,EAAMD,EAAOG,GAEpBS,EACA,OAAS,CAKP,GAHAZ,KADAM,EAAKD,IAAS,GAEdxP,GAAQyP,EAEG,KADXA,EAAMD,IAAS,GAAM,KAKnB/I,EAAOoI,KAAiB,MAAPW,MAEd,MAAS,GAALC,GAwKJ,IAAkB,IAAR,GAALA,GAAgB,CACxBD,EAAOJ,GAAc,MAAPI,IAA8BL,GAAS,GAAKM,GAAM,IAChE,SAASM,CACV,CACI,GAAS,GAALN,EAAS,CAEhB7vD,EAAM6mB,KAtSH,GAuSH,MAAM8e,CACP,CAEC8d,EAAK9kB,IAAM,8BACX3+B,EAAM6mB,KA5SJ,GA6SF,MAAM8e,CACP,CApLCjmB,EAAa,MAAPkwC,GACNC,GAAM,MAEAzP,EAAOyP,IACTN,GAAQ5yC,EAAMqyC,MAAU5O,EACxBA,GAAQ,GAEV1gC,GAAO6vC,GAAS,GAAKM,GAAM,EAC3BN,KAAUM,EACVzP,GAAQyP,GAGNzP,EAAO,KACTmP,GAAQ5yC,EAAMqyC,MAAU5O,EACxBA,GAAQ,EACRmP,GAAQ5yC,EAAMqyC,MAAU5O,EACxBA,GAAQ,GAEVwP,EAAOH,EAAMF,EAAOI,GAEpBS,EACA,OAAS,CAMP,GAJAb,KADAM,EAAKD,IAAS,GAEdxP,GAAQyP,IAGC,IAFTA,EAAMD,IAAS,GAAM,MAiIhB,IAAkB,IAAR,GAALC,GAAgB,CACxBD,EAAOH,GAAc,MAAPG,IAA8BL,GAAS,GAAKM,GAAM,IAChE,SAASO,CACV,CAEC3M,EAAK9kB,IAAM,wBACX3+B,EAAM6mB,KA1RR,GA2RE,MAAM8e,CACP,CA1HC,GAZA7iC,EAAc,MAAP8sD,EAEHxP,GADJyP,GAAM,MAEJN,GAAQ5yC,EAAMqyC,MAAU5O,GACxBA,GAAQ,GACGyP,IACTN,GAAQ5yC,EAAMqyC,MAAU5O,EACxBA,GAAQ,KAGZt9C,GAAQysD,GAAS,GAAKM,GAAM,GAEjBX,EAAM,CACfzL,EAAK9kB,IAAM,gCACX3+B,EAAM6mB,KApKV,GAqKI,MAAM8e,CACP,CAMD,GAJA4pB,KAAUM,EACVzP,GAAQyP,EAGJ/sD,GADJ+sD,EAAKZ,EAAO1D,GACG,CAEb,IADAsE,EAAK/sD,EAAO+sD,GACHT,GACHpvD,EAAMqwD,KAAM,CACd5M,EAAK9kB,IAAM,gCACX3+B,EAAM6mB,KAjLd,GAkLQ,MAAM8e,CACP,CA0BH,GAFAtlC,EAAO,EACPyvD,EAAcR,EACA,IAAVD,GAEF,GADAhvD,GAAQ8uD,EAAQU,EACZA,EAAKnwC,EAAK,CACZA,GAAOmwC,EACP,GACEhJ,EAAOoI,KAAUK,EAASjvD,aACjBwvD,GACXxvD,EAAO4uD,EAAOnsD,EACdgtD,EAAcjJ,CACf,OAEE,GAAIwI,EAAQQ,GAGf,GAFAxvD,GAAQ8uD,EAAQE,EAAQQ,GACxBA,GAAMR,GACG3vC,EAAK,CACZA,GAAOmwC,EACP,GACEhJ,EAAOoI,KAAUK,EAASjvD,aACjBwvD,GAEX,GADAxvD,EAAO,EACHgvD,EAAQ3vC,EAAK,CAEfA,GADAmwC,EAAKR,EAEL,GACExI,EAAOoI,KAAUK,EAASjvD,aACjBwvD,GACXxvD,EAAO4uD,EAAOnsD,EACdgtD,EAAcjJ,CACf,CACF,OAID,GADAxmD,GAAQgvD,EAAQQ,EACZA,EAAKnwC,EAAK,CACZA,GAAOmwC,EACP,GACEhJ,EAAOoI,KAAUK,EAASjvD,aACjBwvD,GACXxvD,EAAO4uD,EAAOnsD,EACdgtD,EAAcjJ,CACf,CAEH,KAAOnnC,EAAM,GACXmnC,EAAOoI,KAAUa,EAAYzvD,KAC7BwmD,EAAOoI,KAAUa,EAAYzvD,KAC7BwmD,EAAOoI,KAAUa,EAAYzvD,KAC7Bqf,GAAO,EAELA,IACFmnC,EAAOoI,KAAUa,EAAYzvD,KACzBqf,EAAM,IACRmnC,EAAOoI,KAAUa,EAAYzvD,MAGlC,KACI,CACHA,EAAO4uD,EAAOnsD,EACd,GACE+jD,EAAOoI,KAAUpI,EAAOxmD,KACxBwmD,EAAOoI,KAAUpI,EAAOxmD,KACxBwmD,EAAOoI,KAAUpI,EAAOxmD,KACxBqf,GAAO,QACAA,EAAM,GACXA,IACFmnC,EAAOoI,KAAUpI,EAAOxmD,KACpBqf,EAAM,IACRmnC,EAAOoI,KAAUpI,EAAOxmD,MAG7B,CAYH,KACD,CAeF,CAED,KACD,CACF,OAAQ2uD,EAAMt9C,GAAQu9C,EAAOxkD,GAI9BukD,GADAtvC,EAAM0gC,GAAQ,EAGdmP,IAAS,IADTnP,GAAQ1gC,GAAO,IACO,EAGtB+jC,EAAKoF,QAAUmG,EACfvL,EAAKsD,SAAWkI,EAChBxL,EAAKmF,SAAYoG,EAAMt9C,EAAYA,EAAOs9C,EAAZ,EAAmB,GAAKA,EAAMt9C,GAC5D+xC,EAAKmD,UAAaqI,EAAOxkD,EAAaA,EAAMwkD,EAAb,IAAqB,KAAOA,EAAOxkD,GAClEzK,EAAMuvD,KAAOA,EACbvvD,EAAMogD,KAAOA,CAEf,ED/TIkQ,GD6Ba,SAAuBniD,EAAMoiD,EAAMC,EAAYC,EAAO3L,EAAO4L,EAAaC,EAAMvlC,GAE/F,IAYIwlC,EACAtoB,EACAuoB,EACAv5B,EACAhpB,EAIA7D,EAMAqmD,EAAWC,EAASC,EA1BpB5Q,EAAOh1B,EAAKg1B,KAGZ1gC,EAAM,EACNuxC,EAAM,EACNhmD,EAAM,EAAGc,EAAM,EACfod,EAAO,EACP+nC,EAAO,EACPC,EAAO,EACPrvB,EAAO,EACPsvB,EAAO,EACPC,EAAO,EAMP7yB,EAAO,KACP8yB,EAAa,EAGbltB,EAAQ,IAAIwY,GAAMF,MAAMgS,IACxB6C,EAAO,IAAI3U,GAAMF,MAAMgS,IACvBhjC,EAAQ,KACR8lC,EAAc,EAoClB,IAAK9xC,EAAM,EAAGA,GAAOgvC,GAAShvC,IAC5B0kB,EAAM1kB,GAAO,EAEf,IAAKuxC,EAAM,EAAGA,EAAMR,EAAOQ,IACzB7sB,EAAMmsB,EAAKC,EAAaS,MAK1B,IADA9nC,EAAOi3B,EACFr0C,EAAM2iD,GAAS3iD,GAAO,GACN,IAAfq4B,EAAMr4B,GADkBA,KAM9B,GAHIod,EAAOpd,IACTod,EAAOpd,GAEG,IAARA,EAaF,OATA+4C,EAAM4L,KAAkB,SAMxB5L,EAAM4L,KAAkB,SAExBtlC,EAAKg1B,KAAO,EACL,EAET,IAAKn1C,EAAM,EAAGA,EAAMc,GACC,IAAfq4B,EAAMn5B,GADaA,KASzB,IANIke,EAAOle,IACTke,EAAOle,GAIT62B,EAAO,EACFpiB,EAAM,EAAGA,GAAOgvC,GAAShvC,IAG5B,GAFAoiB,IAAS,GACTA,GAAQsC,EAAM1kB,IACH,EACT,OAAQ,EAGZ,GAAIoiB,EAAO,IAtID,IAsIO3zB,GAA0B,IAARpC,GACjC,OAAQ,EAKV,IADAwlD,EAAK,GAAK,EACL7xC,EAAM,EAAGA,EAAMgvC,GAAShvC,IAC3B6xC,EAAK7xC,EAAM,GAAK6xC,EAAK7xC,GAAO0kB,EAAM1kB,GAIpC,IAAKuxC,EAAM,EAAGA,EAAMR,EAAOQ,IACM,IAA3BV,EAAKC,EAAaS,KACpBN,EAAKY,EAAKhB,EAAKC,EAAaS,OAAWA,GAmE3C,GAtNU,IAyLN9iD,GACFqwB,EAAO9S,EAAQilC,EACflmD,EAAM,IA1LC,IA4LE0D,GACTqwB,EAAOmwB,GACP2C,GAAc,IACd5lC,EAAQkjC,GACR4C,GAAe,IACf/mD,EAAM,MAGN+zB,EAAOqwB,GACPnjC,EAAQojC,GACRrkD,GAAO,GAIT4mD,EAAO,EACPJ,EAAM,EACNvxC,EAAMzU,EACNqD,EAAOoiD,EACPQ,EAAO/nC,EACPgoC,EAAO,EACPN,GAAO,EAEPv5B,GADA85B,EAAO,GAAKjoC,GACE,EAlNL,IAqNJhb,GAAiBijD,EA1NN,KAMN,IAqNPjjD,GAAkBijD,EA1NJ,IA2Nf,OAAO,EAIT,OAAS,CAEPN,EAAYpxC,EAAMyxC,EACdR,EAAKM,GAAOxmD,GACdsmD,EAAU,EACVC,EAAWL,EAAKM,IAETN,EAAKM,GAAOxmD,GACnBsmD,EAAUrlC,EAAM8lC,EAAcb,EAAKM,IACnCD,EAAWxyB,EAAK8yB,EAAaX,EAAKM,MAGlCF,EAAU,GACVC,EAAW,GAIbJ,EAAO,GAAMlxC,EAAMyxC,EAEnBlmD,EADAq9B,EAAO,GAAK4oB,EAEZ,GAEEpM,EAAMx2C,GAAQ+iD,GAAQF,IADtB7oB,GAAQsoB,IAC+BE,GAAa,GAAOC,GAAW,GAAMC,EAAU,QACtE,IAAT1oB,GAIT,IADAsoB,EAAO,GAAMlxC,EAAM,EACZ2xC,EAAOT,GACZA,IAAS,EAWX,GATa,IAATA,GACFS,GAAQT,EAAO,EACfS,GAAQT,GAERS,EAAO,EAITJ,IACqB,KAAf7sB,EAAM1kB,GAAY,CACtB,GAAIA,IAAQ3T,EAAO,MACnB2T,EAAM6wC,EAAKC,EAAaG,EAAKM,GAC9B,CAGD,GAAIvxC,EAAMyJ,IAASkoC,EAAO/5B,KAAUu5B,EAAK,CAYvC,IAVa,IAATM,IACFA,EAAOhoC,GAIT7a,GAAQrD,EAIR62B,EAAO,IADPovB,EAAOxxC,EAAMyxC,GAEND,EAAOC,EAAOplD,MACnB+1B,GAAQsC,EAAM8sB,EAAOC,KACT,IACZD,IACApvB,IAAS,EAKX,GADAsvB,GAAQ,GAAKF,EA5RR,IA6RA/iD,GAAiBijD,EAlSV,KAMN,IA6RHjjD,GAAkBijD,EAlSR,IAmSX,OAAO,EAQTtM,EAJA+L,EAAMQ,EAAO/5B,GAICnO,GAAQ,GAAO+nC,GAAQ,GAAO5iD,EAAOoiD,EAAc,CAClE,CACF,CAeD,OAVa,IAATW,IAIFvM,EAAMx2C,EAAO+iD,GAAU3xC,EAAMyxC,GAAS,GAAO,IAAM,GAAK,GAK1D/lC,EAAKg1B,KAAOj3B,EACL,CACT,EC1TIsoC,GAAO,EACPC,GAAQ,EAmBRjM,GAAkB,EAIlBC,IAAmB,EAchBiM,GAAO,EAWHzhD,GAAO,GAkBX0hD,GAAM,GAQTC,GAAc,IACdC,GAAe,IAQnB,SAASC,GAAQre,GACf,OAAWA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,GACzB,CAGA,SAASse,KACPrlD,KAAKka,KAAO,EACZla,KAAK+E,MAAO,EACZ/E,KAAKm8C,KAAO,EACZn8C,KAAKslD,UAAW,EAChBtlD,KAAKgzB,MAAQ,EACbhzB,KAAKuiD,KAAO,EACZviD,KAAKgtB,MAAQ,EACbhtB,KAAKulD,MAAQ,EAEbvlD,KAAKmE,KAAO,KAGZnE,KAAKwlD,MAAQ,EACbxlD,KAAKwiD,MAAQ,EACbxiD,KAAKyiD,MAAQ,EACbziD,KAAK0iD,MAAQ,EACb1iD,KAAK7I,OAAS,KAGd6I,KAAK4iD,KAAO,EACZ5iD,KAAKyzC,KAAO,EAGZzzC,KAAK7N,OAAS,EACd6N,KAAKzC,OAAS,EAGdyC,KAAK+e,MAAQ,EAGb/e,KAAKojD,QAAU,KACfpjD,KAAKqjD,SAAW,KAChBrjD,KAAKsjD,QAAU,EACftjD,KAAKujD,SAAW,EAGhBvjD,KAAKylD,MAAQ,EACbzlD,KAAK0lD,KAAO,EACZ1lD,KAAK2lD,MAAQ,EACb3lD,KAAK4lD,KAAO,EACZ5lD,KAAK2B,KAAO,KAEZ3B,KAAK4jD,KAAO,IAAI3T,GAAMF,MAAM,KAC5B/vC,KAAKgkD,KAAO,IAAI/T,GAAMF,MAAM,KAO5B/vC,KAAK6lD,OAAS,KACd7lD,KAAK8lD,QAAU,KACf9lD,KAAK0jD,KAAO,EACZ1jD,KAAK+lD,KAAO,EACZ/lD,KAAKgmD,IAAM,CACb,CAEA,SAASC,GAAiBnP,GACxB,IAAIzjD,EAEJ,OAAKyjD,GAASA,EAAKzjD,OACnBA,EAAQyjD,EAAKzjD,MACbyjD,EAAKsF,SAAWtF,EAAKuD,UAAYhnD,EAAMkyD,MAAQ,EAC/CzO,EAAK9kB,IAAM,GACP3+B,EAAM8oD,OACRrF,EAAKiB,MAAqB,EAAb1kD,EAAM8oD,MAErB9oD,EAAM6mB,KAAO8qC,GACb3xD,EAAM0R,KAAO,EACb1R,EAAMiyD,SAAW,EACjBjyD,EAAMkvD,KAAO,MACblvD,EAAM8Q,KAAO,KACb9Q,EAAMuvD,KAAO,EACbvvD,EAAMogD,KAAO,EAEbpgD,EAAM+vD,QAAU/vD,EAAMwyD,OAAS,IAAI5V,GAAMD,MAAMkV,IAC/C7xD,EAAMgwD,SAAWhwD,EAAMyyD,QAAU,IAAI7V,GAAMD,MAAMmV,IAEjD9xD,EAAMqwD,KAAO,EACbrwD,EAAM0yD,MAAQ,EAEPjN,IArB4BC,EAsBrC,CAEA,SAASmN,GAAapP,GACpB,IAAIzjD,EAEJ,OAAKyjD,GAASA,EAAKzjD,QACnBA,EAAQyjD,EAAKzjD,OACPmvD,MAAQ,EACdnvD,EAAMovD,MAAQ,EACdpvD,EAAMqvD,MAAQ,EACPuD,GAAiBnP,IALWiC,EAOrC,CAEA,SAASoN,GAAcrP,EAAMqH,GAC3B,IAAIhC,EACA9oD,EAGJ,OAAKyjD,GAASA,EAAKzjD,OACnBA,EAAQyjD,EAAKzjD,MAGT8qD,EAAa,GACfhC,EAAO,EACPgC,GAAcA,IAGdhC,EAA2B,GAAnBgC,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzCpF,IAEY,OAAjB1lD,EAAM8D,QAAmB9D,EAAMmyD,QAAUrH,IAC3C9qD,EAAM8D,OAAS,MAIjB9D,EAAM8oD,KAAOA,EACb9oD,EAAMmyD,MAAQrH,EACP+H,GAAapP,KA1BeiC,EA2BrC,CAEA,SAASqN,GAAatP,EAAMqH,GAC1B,IAAIrhC,EACAzpB,EAEJ,OAAKyjD,GAGLzjD,EAAQ,IAAIgyD,GAIZvO,EAAKzjD,MAAQA,EACbA,EAAM8D,OAAS,MACf2lB,EAAMqpC,GAAcrP,EAAMqH,MACdrF,KACVhC,EAAKzjD,MAAQ,MAERypB,GAbai8B,EActB,CAiBA,IAEIsN,GAAQC,GAFRC,IAAS,EAIb,SAASC,GAAYnzD,GAEnB,GAAIkzD,GAAQ,CACV,IAAIjC,EAOJ,IALA+B,GAAS,IAAIpW,GAAMD,MAAM,KACzBsW,GAAU,IAAIrW,GAAMD,MAAM,IAG1BsU,EAAM,EACCA,EAAM,KAAOjxD,EAAMuwD,KAAKU,KAAS,EACxC,KAAOA,EAAM,KAAOjxD,EAAMuwD,KAAKU,KAAS,EACxC,KAAOA,EAAM,KAAOjxD,EAAMuwD,KAAKU,KAAS,EACxC,KAAOA,EAAM,KAAOjxD,EAAMuwD,KAAKU,KAAS,EAMxC,IAJAX,GAAcmB,GAAOzxD,EAAMuwD,KAAM,EAAG,IAAKyC,GAAU,EAAGhzD,EAAM2wD,KAAM,CAAEvQ,KAAM,IAG1E6Q,EAAM,EACCA,EAAM,IAAMjxD,EAAMuwD,KAAKU,KAAS,EAEvCX,GAAcoB,GAAO1xD,EAAMuwD,KAAM,EAAG,GAAM0C,GAAS,EAAGjzD,EAAM2wD,KAAM,CAAEvQ,KAAM,IAG1E8S,IAAS,CACV,CAEDlzD,EAAM+vD,QAAUiD,GAChBhzD,EAAMiwD,QAAU,EAChBjwD,EAAMgwD,SAAWiD,GACjBjzD,EAAMkwD,SAAW,CACnB,CAiBA,SAASkD,GAAa3P,EAAM7lB,EAAKnzB,EAAKmI,GACpC,IAAI9P,EACA9C,EAAQyjD,EAAKzjD,MAqCjB,OAlCqB,OAAjBA,EAAM8D,SACR9D,EAAMmvD,MAAQ,GAAKnvD,EAAMmyD,MACzBnyD,EAAMqvD,MAAQ,EACdrvD,EAAMovD,MAAQ,EAEdpvD,EAAM8D,OAAS,IAAI84C,GAAMH,KAAKz8C,EAAMmvD,QAIlCv8C,GAAQ5S,EAAMmvD,OAChBvS,GAAM38B,SAASjgB,EAAM8D,OAAQ85B,EAAKnzB,EAAMzK,EAAMmvD,MAAOnvD,EAAMmvD,MAAO,GAClEnvD,EAAMqvD,MAAQ,EACdrvD,EAAMovD,MAAQpvD,EAAMmvD,SAGpBrsD,EAAO9C,EAAMmvD,MAAQnvD,EAAMqvD,OAChBz8C,IACT9P,EAAO8P,GAGTgqC,GAAM38B,SAASjgB,EAAM8D,OAAQ85B,EAAKnzB,EAAMmI,EAAM9P,EAAM9C,EAAMqvD,QAC1Dz8C,GAAQ9P,IAGN85C,GAAM38B,SAASjgB,EAAM8D,OAAQ85B,EAAKnzB,EAAMmI,EAAMA,EAAM,GACpD5S,EAAMqvD,MAAQz8C,EACd5S,EAAMovD,MAAQpvD,EAAMmvD,QAGpBnvD,EAAMqvD,OAASvsD,EACX9C,EAAMqvD,QAAUrvD,EAAMmvD,QAASnvD,EAAMqvD,MAAQ,GAC7CrvD,EAAMovD,MAAQpvD,EAAMmvD,QAASnvD,EAAMovD,OAAStsD,KAG7C,CACT,CAsoCoBuwD,GAAAR,aAAGA,GACFQ,GAAAP,cAAGA,GACAO,GAAAT,iBAAGA,GACRS,GAAAC,YApvCnB,SAAqB7P,GACnB,OAAOsP,GAAatP,EArKN,GAsKhB,EAmvCoB4P,GAAAN,aAAGA,GACRM,GAAAE,QAzoCf,SAAiB9P,EAAM2F,GACrB,IAAIppD,EACA2c,EAAOkqC,EACPv4C,EACAklD,EACAjB,EAAMzwB,EACNytB,EACAnP,EACA4O,EAAKC,EACLr8C,EACAvS,EACAyvD,EAEAgB,EAAWC,EAASC,EAEpByC,EAAWC,EAASC,EACpBj0C,EACA+J,EAEA2B,EAEAvmB,EATA+qD,EAAO,EAMPgE,EAAO,IAAIhX,GAAMH,KAAK,GAKtBvV,EACF,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAGlE,IAAKuc,IAASA,EAAKzjD,QAAUyjD,EAAKoD,SAC5BpD,EAAK9mC,OAA2B,IAAlB8mC,EAAKmF,SACvB,OAAOlD,IAGT1lD,EAAQyjD,EAAKzjD,OACH6mB,OAAS3W,KAAQlQ,EAAM6mB,KA/Uf,IAmVlB2sC,EAAM/P,EAAKsD,SACXF,EAASpD,EAAKoD,OACd/kB,EAAO2hB,EAAKmD,UACZt4C,EAAOm1C,EAAKoF,QACZlsC,EAAQ8mC,EAAK9mC,MACb41C,EAAO9O,EAAKmF,SACZ2G,EAAOvvD,EAAMuvD,KACbnP,EAAOpgD,EAAMogD,KAGb4O,EAAMuD,EACNtD,EAAOntB,EACPrY,EAAMg8B,GAENoO,EACA,OACE,OAAQ7zD,EAAM6mB,MACZ,KAAK8qC,GACH,GAAmB,IAAf3xD,EAAM8oD,KAAY,CACpB9oD,EAAM6mB,KAtWI,GAuWV,KACD,CAED,KAAOu5B,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAED,GAAkB,EAAbpgD,EAAM8oD,MAAsB,QAATyG,EAAiB,CACvCvvD,EAAM25B,MAAQ,EAEdi6B,EAAK,GAAY,IAAPrE,EACVqE,EAAK,GAAMrE,IAAS,EAAK,IACzBvvD,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOi6B,EAAM,EAAG,GAI1CrE,EAAO,EACPnP,EAAO,EAEPpgD,EAAM6mB,KAxYD,EAyYL,KACD,CAKD,GAJA7mB,EAAM2/B,MAAQ,EACV3/B,EAAM8Q,OACR9Q,EAAM8Q,KAAKlQ,MAAO,KAED,EAAbZ,EAAM8oD,UACA,IAAPyG,IAA2B,IAAMA,GAAQ,IAAM,GAAI,CACtD9L,EAAK9kB,IAAM,yBACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACD,GA7ZU,IA6ZE,GAAPrC,GAAwC,CAC3C9L,EAAK9kB,IAAM,6BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAMD,GAHAxR,GAAQ,EAER1gC,EAAiC,GAAnB,IAHd6vC,KAAU,IAIU,IAAhBvvD,EAAMmyD,MACRnyD,EAAMmyD,MAAQzyC,OAEX,GAAIA,EAAM1f,EAAMmyD,MAAO,CAC1B1O,EAAK9kB,IAAM,sBACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACD5xD,EAAMkvD,KAAO,GAAKxvC,EAElB+jC,EAAKiB,MAAQ1kD,EAAM25B,MAAQ,EAC3B35B,EAAM6mB,KAAc,IAAP0oC,EAlaL,GAka6Br/C,GAErCq/C,EAAO,EACPnP,EAAO,EAEP,MACF,KAhbS,EAkbP,KAAOA,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAGD,GADApgD,EAAM2/B,MAAQ4vB,EAjcJ,IAkcS,IAAdvvD,EAAM2/B,OAA8B,CACvC8jB,EAAK9kB,IAAM,6BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACD,GAAkB,MAAd5xD,EAAM2/B,MAAgB,CACxB8jB,EAAK9kB,IAAM,2BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACG5xD,EAAM8Q,OACR9Q,EAAM8Q,KAAK26C,KAAS8D,GAAQ,EAAK,GAEjB,IAAdvvD,EAAM2/B,QAERi0B,EAAK,GAAY,IAAPrE,EACVqE,EAAK,GAAMrE,IAAS,EAAK,IACzBvvD,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOi6B,EAAM,EAAG,IAI5CrE,EAAO,EACPnP,EAAO,EAEPpgD,EAAM6mB,KAjdA,EAmdR,KAndQ,EAqdN,KAAOu5B,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAEGpgD,EAAM8Q,OACR9Q,EAAM8Q,KAAK4f,KAAO6+B,GAEF,IAAdvvD,EAAM2/B,QAERi0B,EAAK,GAAY,IAAPrE,EACVqE,EAAK,GAAMrE,IAAS,EAAK,IACzBqE,EAAK,GAAMrE,IAAS,GAAM,IAC1BqE,EAAK,GAAMrE,IAAS,GAAM,IAC1BvvD,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOi6B,EAAM,EAAG,IAI5CrE,EAAO,EACPnP,EAAO,EAEPpgD,EAAM6mB,KA3eF,EA6eN,KA7eM,EA+eJ,KAAOu5B,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAEGpgD,EAAM8Q,OACR9Q,EAAM8Q,KAAKgjD,OAAiB,IAAPvE,EACrBvvD,EAAM8Q,KAAK86C,GAAM2D,GAAQ,GAET,IAAdvvD,EAAM2/B,QAERi0B,EAAK,GAAY,IAAPrE,EACVqE,EAAK,GAAMrE,IAAS,EAAK,IACzBvvD,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOi6B,EAAM,EAAG,IAI5CrE,EAAO,EACPnP,EAAO,EAEPpgD,EAAM6mB,KApgBC,EAsgBT,KAtgBS,EAugBP,GAAkB,KAAd7mB,EAAM2/B,MAAgB,CAExB,KAAOygB,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAEDpgD,EAAMlB,OAASywD,EACXvvD,EAAM8Q,OACR9Q,EAAM8Q,KAAKijD,UAAYxE,GAEP,IAAdvvD,EAAM2/B,QAERi0B,EAAK,GAAY,IAAPrE,EACVqE,EAAK,GAAMrE,IAAS,EAAK,IACzBvvD,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOi6B,EAAM,EAAG,IAI5CrE,EAAO,EACPnP,EAAO,CAER,MACQpgD,EAAM8Q,OACb9Q,EAAM8Q,KAAK4a,MAAQ,MAErB1rB,EAAM6mB,KAliBC,EAoiBT,KApiBS,EAqiBP,GAAkB,KAAd7mB,EAAM2/B,SACR/sB,EAAO5S,EAAMlB,QACFyzD,IAAQ3/C,EAAO2/C,GACtB3/C,IACE5S,EAAM8Q,OACR4O,EAAM1f,EAAM8Q,KAAKijD,UAAY/zD,EAAMlB,OAC9BkB,EAAM8Q,KAAK4a,QAEd1rB,EAAM8Q,KAAK4a,MAAQ,IAAIhiB,MAAM1J,EAAM8Q,KAAKijD,YAE1CnX,GAAM38B,SACJjgB,EAAM8Q,KAAK4a,MACX/O,EACArO,EAGAsE,EAEA8M,IAMc,IAAd1f,EAAM2/B,QACR3/B,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOhd,EAAO/J,EAAMtE,IAEhDikD,GAAQ3/C,EACRtE,GAAQsE,EACR5S,EAAMlB,QAAU8T,GAEd5S,EAAMlB,QAAU,MAAM+0D,EAE5B7zD,EAAMlB,OAAS,EACfkB,EAAM6mB,KAtkBA,EAwkBR,KAxkBQ,EAykBN,GAAkB,KAAd7mB,EAAM2/B,MAAgB,CACxB,GAAa,IAAT4yB,EAAc,MAAMsB,EACxBjhD,EAAO,EACP,GAEE8M,EAAM/C,EAAMrO,EAAOsE,KAEf5S,EAAM8Q,MAAQ4O,GACb1f,EAAMlB,OAAS,QAClBkB,EAAM8Q,KAAK7L,MAAQgC,OAAOqS,aAAaoG,UAElCA,GAAO9M,EAAO2/C,GAOvB,GALkB,IAAdvyD,EAAM2/B,QACR3/B,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOhd,EAAO/J,EAAMtE,IAEhDikD,GAAQ3/C,EACRtE,GAAQsE,EACJ8M,EAAO,MAAMm0C,CAClB,MACQ7zD,EAAM8Q,OACb9Q,EAAM8Q,KAAK7L,KAAO,MAEpBjF,EAAMlB,OAAS,EACfkB,EAAM6mB,KAhmBG,EAkmBX,KAlmBW,EAmmBT,GAAkB,KAAd7mB,EAAM2/B,MAAgB,CACxB,GAAa,IAAT4yB,EAAc,MAAMsB,EACxBjhD,EAAO,EACP,GACE8M,EAAM/C,EAAMrO,EAAOsE,KAEf5S,EAAM8Q,MAAQ4O,GACb1f,EAAMlB,OAAS,QAClBkB,EAAM8Q,KAAK66C,SAAW1kD,OAAOqS,aAAaoG,UAErCA,GAAO9M,EAAO2/C,GAMvB,GALkB,IAAdvyD,EAAM2/B,QACR3/B,EAAM25B,MAAQ2rB,GAAMtlD,EAAM25B,MAAOhd,EAAO/J,EAAMtE,IAEhDikD,GAAQ3/C,EACRtE,GAAQsE,EACJ8M,EAAO,MAAMm0C,CAClB,MACQ7zD,EAAM8Q,OACb9Q,EAAM8Q,KAAK66C,QAAU,MAEvB3rD,EAAM6mB,KAvnBA,EAynBR,KAznBQ,EA0nBN,GAAkB,IAAd7mB,EAAM2/B,MAAgB,CAExB,KAAOygB,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAED,GAAImP,KAAwB,MAAdvvD,EAAM25B,OAAiB,CACnC8pB,EAAK9kB,IAAM,sBACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAEDrC,EAAO,EACPnP,EAAO,CAER,CACGpgD,EAAM8Q,OACR9Q,EAAM8Q,KAAK46C,KAAS1rD,EAAM2/B,OAAS,EAAK,EACxC3/B,EAAM8Q,KAAKlQ,MAAO,GAEpB6iD,EAAKiB,MAAQ1kD,EAAM25B,MAAQ,EAC3B35B,EAAM6mB,KAAO3W,GACb,MACF,KAnpBU,GAqpBR,KAAOkwC,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAEDqD,EAAKiB,MAAQ1kD,EAAM25B,MAAQo4B,GAAQxC,GAEnCA,EAAO,EACPnP,EAAO,EAEPpgD,EAAM6mB,KAhqBA,GAkqBR,KAlqBQ,GAmqBN,GAAuB,IAAnB7mB,EAAMiyD,SASR,OAPAxO,EAAKsD,SAAWyM,EAChB/P,EAAKmD,UAAY9kB,EACjB2hB,EAAKoF,QAAUv6C,EACfm1C,EAAKmF,SAAW2J,EAChBvyD,EAAMuvD,KAAOA,EACbvvD,EAAMogD,KAAOA,EApsBD,EAwsBdqD,EAAKiB,MAAQ1kD,EAAM25B,MAAQ,EAC3B35B,EAAM6mB,KAAO3W,GAEf,KAAKA,GACH,GArtBc,IAqtBVk5C,GAptBU,IAotBWA,EAAqB,MAAMyK,EAEtD,KAlrBc,GAmrBZ,GAAI7zD,EAAM0R,KAAM,CAEd69C,KAAiB,EAAPnP,EACVA,GAAe,EAAPA,EAERpgD,EAAM6mB,KA1qBD,GA2qBL,KACD,CAED,KAAOu5B,EAAO,GAAG,CACf,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAQD,OANApgD,EAAM0R,KAAe,EAAP69C,EAGdnP,GAAQ,EAGQ,GAJhBmP,KAAU,IAKR,KAAK,EAGHvvD,EAAM6mB,KA5sBE,GA6sBR,MACF,KAAK,EAKH,GAJAssC,GAAYnzD,GAGZA,EAAM6mB,KA5sBI,GA3CA,IAwvBNuiC,EAAmB,CAErBmG,KAAU,EACVnP,GAAQ,EAER,MAAMyT,CACP,CACD,MACF,KAAK,EAGH7zD,EAAM6mB,KA3tBC,GA4tBP,MACF,KAAK,EACH48B,EAAK9kB,IAAM,qBACX3+B,EAAM6mB,KAAO+qC,GAGjBrC,KAAU,EACVnP,GAAQ,EAER,MACF,KAzuBc,GA+uBZ,IAJAmP,KAAiB,EAAPnP,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAED,IAAY,MAAPmP,KAAqBA,IAAS,GAAM,OAAS,CAChD9L,EAAK9kB,IAAM,+BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CASD,GARA5xD,EAAMlB,OAAgB,MAAPywD,EAIfA,EAAO,EACPnP,EAAO,EAEPpgD,EAAM6mB,KAjwBK,GAtCG,IAwyBVuiC,EAAqB,MAAMyK,EAEjC,KApwBa,GAqwBX7zD,EAAM6mB,KApwBI,GAswBZ,KAtwBY,GAwwBV,GADAjU,EAAO5S,EAAMlB,OACH,CAGR,GAFI8T,EAAO2/C,IAAQ3/C,EAAO2/C,GACtB3/C,EAAOkvB,IAAQlvB,EAAOkvB,GACb,IAATlvB,EAAc,MAAMihD,EAExBjX,GAAM38B,SAAS4mC,EAAQlqC,EAAOrO,EAAMsE,EAAM4gD,GAE1CjB,GAAQ3/C,EACRtE,GAAQsE,EACRkvB,GAAQlvB,EACR4gD,GAAO5gD,EACP5S,EAAMlB,QAAU8T,EAChB,KACD,CAED5S,EAAM6mB,KAAO3W,GACb,MACF,KAxxBa,GA0xBX,KAAOkwC,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAkBD,GAhBApgD,EAAMqyD,KAAkC,KAAnB,GAAP9C,GAEdA,KAAU,EACVnP,GAAQ,EAERpgD,EAAMsyD,MAAmC,GAAnB,GAAP/C,GAEfA,KAAU,EACVnP,GAAQ,EAERpgD,EAAMoyD,MAAmC,GAAnB,GAAP7C,GAEfA,KAAU,EACVnP,GAAQ,EAGJpgD,EAAMqyD,KAAO,KAAOryD,EAAMsyD,MAAQ,GAAI,CACxC7O,EAAK9kB,IAAM,sCACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAGD5xD,EAAMuyD,KAAO,EACbvyD,EAAM6mB,KAxzBO,GA0zBf,KA1zBe,GA2zBb,KAAO7mB,EAAMuyD,KAAOvyD,EAAMoyD,OAAO,CAE/B,KAAOhS,EAAO,GAAG,CACf,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAEDpgD,EAAMuwD,KAAKrpB,EAAMlnC,EAAMuyD,SAAmB,EAAPhD,EAEnCA,KAAU,EACVnP,GAAQ,CAET,CACD,KAAOpgD,EAAMuyD,KAAO,IAClBvyD,EAAMuwD,KAAKrpB,EAAMlnC,EAAMuyD,SAAW,EAapC,GAPAvyD,EAAM+vD,QAAU/vD,EAAMwyD,OACtBxyD,EAAMiwD,QAAU,EAEhB7kC,EAAO,CAAEg1B,KAAMpgD,EAAMiwD,SACrBxmC,EAAM6mC,GA74BF,EA64BuBtwD,EAAMuwD,KAAM,EAAG,GAAIvwD,EAAM+vD,QAAS,EAAG/vD,EAAM2wD,KAAMvlC,GAC5EprB,EAAMiwD,QAAU7kC,EAAKg1B,KAEjB32B,EAAK,CACPg6B,EAAK9kB,IAAM,2BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAED5xD,EAAMuyD,KAAO,EACbvyD,EAAM6mB,KA91BQ,GAg2BhB,KAh2BgB,GAi2Bd,KAAO7mB,EAAMuyD,KAAOvyD,EAAMqyD,KAAOryD,EAAMsyD,OAAO,CAC5C,KAGEvB,GAFAnB,EAAO5vD,EAAM+vD,QAAQR,GAAS,GAAKvvD,EAAMiwD,SAAW,MAEhC,GAAM,IAC1Be,EAAkB,MAAPpB,KAFXkB,EAAYlB,IAAS,KAIFxP,IANZ,CAQP,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CAET,CACD,GAAI4Q,EAAW,GAEbzB,KAAUuB,EACV1Q,GAAQ0Q,EAER9wD,EAAMuwD,KAAKvwD,EAAMuyD,QAAUvB,MAExB,CACH,GAAiB,KAAbA,EAAiB,CAGnB,IADAnsD,EAAIisD,EAAY,EACT1Q,EAAOv7C,GAAG,CACf,GAAa,IAAT0tD,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAMD,GAHAmP,KAAUuB,EACV1Q,GAAQ0Q,EAEW,IAAf9wD,EAAMuyD,KAAY,CACpB9O,EAAK9kB,IAAM,4BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACDlyC,EAAM1f,EAAMuwD,KAAKvwD,EAAMuyD,KAAO,GAC9B3/C,EAAO,GAAY,EAAP28C,GAEZA,KAAU,EACVnP,GAAQ,CAET,MACI,GAAiB,KAAb4Q,EAAiB,CAGxB,IADAnsD,EAAIisD,EAAY,EACT1Q,EAAOv7C,GAAG,CACf,GAAa,IAAT0tD,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAIDA,GAAQ0Q,EAERpxC,EAAM,EACN9M,EAAO,GAAY,GAJnB28C,KAAUuB,IAMVvB,KAAU,EACVnP,GAAQ,CAET,KACI,CAGH,IADAv7C,EAAIisD,EAAY,EACT1Q,EAAOv7C,GAAG,CACf,GAAa,IAAT0tD,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAIDA,GAAQ0Q,EAERpxC,EAAM,EACN9M,EAAO,IAAa,KAJpB28C,KAAUuB,IAMVvB,KAAU,EACVnP,GAAQ,CAET,CACD,GAAIpgD,EAAMuyD,KAAO3/C,EAAO5S,EAAMqyD,KAAOryD,EAAMsyD,MAAO,CAChD7O,EAAK9kB,IAAM,4BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACD,KAAOh/C,KACL5S,EAAMuwD,KAAKvwD,EAAMuyD,QAAU7yC,CAE9B,CACF,CAGD,GAAI1f,EAAM6mB,OAAS+qC,GAAO,MAG1B,GAAwB,IAApB5xD,EAAMuwD,KAAK,KAAY,CACzB9M,EAAK9kB,IAAM,uCACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAcD,GATA5xD,EAAMiwD,QAAU,EAEhB7kC,EAAO,CAAEg1B,KAAMpgD,EAAMiwD,SACrBxmC,EAAM6mC,GAAcmB,GAAMzxD,EAAMuwD,KAAM,EAAGvwD,EAAMqyD,KAAMryD,EAAM+vD,QAAS,EAAG/vD,EAAM2wD,KAAMvlC,GAGnFprB,EAAMiwD,QAAU7kC,EAAKg1B,KAGjB32B,EAAK,CACPg6B,EAAK9kB,IAAM,8BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAaD,GAXA5xD,EAAMkwD,SAAW,EAGjBlwD,EAAMgwD,SAAWhwD,EAAMyyD,QACvBrnC,EAAO,CAAEg1B,KAAMpgD,EAAMkwD,UACrBzmC,EAAM6mC,GAAcoB,GAAO1xD,EAAMuwD,KAAMvwD,EAAMqyD,KAAMryD,EAAMsyD,MAAOtyD,EAAMgwD,SAAU,EAAGhwD,EAAM2wD,KAAMvlC,GAG/FprB,EAAMkwD,SAAW9kC,EAAKg1B,KAGlB32B,EAAK,CACPg6B,EAAK9kB,IAAM,wBACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAGD,GADA5xD,EAAM6mB,KAn/BQ,GA3CA,IA+hCVuiC,EAAqB,MAAMyK,EAEjC,KAt/BgB,GAu/Bd7zD,EAAM6mB,KAt/BO,GAw/Bf,KAx/Be,GAy/Bb,GAAI0rC,GAAQ,GAAKzwB,GAAQ,IAAK,CAE5B2hB,EAAKsD,SAAWyM,EAChB/P,EAAKmD,UAAY9kB,EACjB2hB,EAAKoF,QAAUv6C,EACfm1C,EAAKmF,SAAW2J,EAChBvyD,EAAMuvD,KAAOA,EACbvvD,EAAMogD,KAAOA,EAEb2O,GAAatL,EAAMwL,GAEnBuE,EAAM/P,EAAKsD,SACXF,EAASpD,EAAKoD,OACd/kB,EAAO2hB,EAAKmD,UACZt4C,EAAOm1C,EAAKoF,QACZlsC,EAAQ8mC,EAAK9mC,MACb41C,EAAO9O,EAAKmF,SACZ2G,EAAOvvD,EAAMuvD,KACbnP,EAAOpgD,EAAMogD,KAGTpgD,EAAM6mB,OAAS3W,KACjBlQ,EAAM0yD,MAAQ,GAEhB,KACD,CAED,IADA1yD,EAAM0yD,KAAO,EAIX3B,GAFAnB,EAAO5vD,EAAM+vD,QAAQR,GAAS,GAAKvvD,EAAMiwD,SAAW,MAEhC,GAAM,IAC1Be,EAAkB,MAAPpB,KAFXkB,EAAYlB,IAAS,KAIJxP,IANV,CAQP,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CAET,CACD,GAAI2Q,GAAgC,IAAV,IAAVA,GAAuB,CAIrC,IAHA0C,EAAY3C,EACZ4C,EAAU3C,EACV4C,EAAW3C,EAKTD,GAHAnB,EAAO5vD,EAAM+vD,QAAQ4D,IACXpE,GAAS,GAAMkE,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BzC,EAAkB,MAAPpB,IAEN6D,GAJL3C,EAAYlB,IAAS,KAIUxP,IAPxB,CASP,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CAET,CAEDmP,KAAUkE,EACVrT,GAAQqT,EAERzzD,EAAM0yD,MAAQe,CACf,CAOD,GALAlE,KAAUuB,EACV1Q,GAAQ0Q,EAER9wD,EAAM0yD,MAAQ5B,EACd9wD,EAAMlB,OAASkyD,EACC,IAAZD,EAAe,CAIjB/wD,EAAM6mB,KAhkCK,GAikCX,KACD,CACD,GAAc,GAAVkqC,EAAc,CAEhB/wD,EAAM0yD,MAAQ,EACd1yD,EAAM6mB,KAAO3W,GACb,KACD,CACD,GAAc,GAAV6gD,EAAc,CAChBtN,EAAK9kB,IAAM,8BACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACD5xD,EAAM0rB,MAAkB,GAAVqlC,EACd/wD,EAAM6mB,KAnlCU,GAqlClB,KArlCkB,GAslChB,GAAI7mB,EAAM0rB,MAAO,CAGf,IADA7mB,EAAI7E,EAAM0rB,MACH00B,EAAOv7C,GAAG,CACf,GAAa,IAAT0tD,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAEDpgD,EAAMlB,QAAUywD,GAAS,GAAKvvD,EAAM0rB,OAAS,EAE7C6jC,KAAUvvD,EAAM0rB,MAChB00B,GAAQpgD,EAAM0rB,MAEd1rB,EAAM0yD,MAAQ1yD,EAAM0rB,KACrB,CAED1rB,EAAM2yD,IAAM3yD,EAAMlB,OAClBkB,EAAM6mB,KAxmCQ,GA0mChB,KA1mCgB,GA2mCd,KAGEkqC,GAFAnB,EAAO5vD,EAAMgwD,SAAST,GAAS,GAAKvvD,EAAMkwD,UAAY,MAElC,GAAM,IAC1Bc,EAAkB,MAAPpB,KAFXkB,EAAYlB,IAAS,KAIFxP,IANZ,CAQP,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CAET,CACD,GAAyB,IAAV,IAAV2Q,GAAuB,CAI1B,IAHA0C,EAAY3C,EACZ4C,EAAU3C,EACV4C,EAAW3C,EAKTD,GAHAnB,EAAO5vD,EAAMgwD,SAAS2D,IACZpE,GAAS,GAAMkE,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BzC,EAAkB,MAAPpB,IAEN6D,GAJL3C,EAAYlB,IAAS,KAIUxP,IAPxB,CASP,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CAET,CAEDmP,KAAUkE,EACVrT,GAAQqT,EAERzzD,EAAM0yD,MAAQe,CACf,CAMD,GAJAlE,KAAUuB,EACV1Q,GAAQ0Q,EAER9wD,EAAM0yD,MAAQ5B,EACA,GAAVC,EAAc,CAChBtN,EAAK9kB,IAAM,wBACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CACD5xD,EAAMkK,OAAS8mD,EACfhxD,EAAM0rB,MAAoB,GAAXqlC,EACf/wD,EAAM6mB,KA7pCW,GA+pCnB,KA/pCmB,GAgqCjB,GAAI7mB,EAAM0rB,MAAO,CAGf,IADA7mB,EAAI7E,EAAM0rB,MACH00B,EAAOv7C,GAAG,CACf,GAAa,IAAT0tD,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAEDpgD,EAAMkK,QAAUqlD,GAAS,GAAKvvD,EAAM0rB,OAAS,EAE7C6jC,KAAUvvD,EAAM0rB,MAChB00B,GAAQpgD,EAAM0rB,MAEd1rB,EAAM0yD,MAAQ1yD,EAAM0rB,KACrB,CAED,GAAI1rB,EAAMkK,OAASlK,EAAMkvD,KAAM,CAC7BzL,EAAK9kB,IAAM,gCACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAGD5xD,EAAM6mB,KAxrCS,GA0rCjB,KA1rCiB,GA2rCf,GAAa,IAATib,EAAc,MAAM+xB,EAExB,GADAjhD,EAAOq8C,EAAOntB,EACV9hC,EAAMkK,OAAS0I,EAAM,CAEvB,IADAA,EAAO5S,EAAMkK,OAAS0I,GACX5S,EAAMovD,OACXpvD,EAAMqwD,KAAM,CACd5M,EAAK9kB,IAAM,gCACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAiBCh/C,EAAO5S,EAAMqvD,OACfz8C,GAAQ5S,EAAMqvD,MACdhvD,EAAOL,EAAMmvD,MAAQv8C,GAGrBvS,EAAOL,EAAMqvD,MAAQz8C,EAEnBA,EAAO5S,EAAMlB,SAAU8T,EAAO5S,EAAMlB,QACxCgxD,EAAc9vD,EAAM8D,MACrB,MAECgsD,EAAcjJ,EACdxmD,EAAOmzD,EAAMxzD,EAAMkK,OACnB0I,EAAO5S,EAAMlB,OAEX8T,EAAOkvB,IAAQlvB,EAAOkvB,GAC1BA,GAAQlvB,EACR5S,EAAMlB,QAAU8T,EAChB,GACEi0C,EAAO2M,KAAS1D,EAAYzvD,aACnBuS,GACU,IAAjB5S,EAAMlB,SAAgBkB,EAAM6mB,KA9uCnB,IA+uCb,MACF,KA3uCe,GA4uCb,GAAa,IAATib,EAAc,MAAM+xB,EACxBhN,EAAO2M,KAASxzD,EAAMlB,OACtBgjC,IACA9hC,EAAM6mB,KApvCO,GAqvCb,MACF,KAhvCS,GAivCP,GAAI7mB,EAAM8oD,KAAM,CAEd,KAAO1I,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IAEAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAaD,GAXA6O,GAAQntB,EACR2hB,EAAKuD,WAAaiI,EAClBjvD,EAAMkyD,OAASjD,EACXA,IACFxL,EAAKiB,MAAQ1kD,EAAM25B,MAEd35B,EAAM2/B,MAAQ2lB,GAAMtlD,EAAM25B,MAAOktB,EAAQoI,EAAMuE,EAAMvE,GAAQ5J,GAAQrlD,EAAM25B,MAAOktB,EAAQoI,EAAMuE,EAAMvE,IAG7GA,EAAOntB,GAEF9hC,EAAM2/B,MAAQ4vB,EAAOwC,GAAQxC,MAAWvvD,EAAM25B,MAAO,CACxD8pB,EAAK9kB,IAAM,uBACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAEDrC,EAAO,EACPnP,EAAO,CAGR,CACDpgD,EAAM6mB,KAhxCE,GAkxCV,KAlxCU,GAmxCR,GAAI7mB,EAAM8oD,MAAQ9oD,EAAM2/B,MAAO,CAE7B,KAAOygB,EAAO,IAAI,CAChB,GAAa,IAATmS,EAAc,MAAMsB,EACxBtB,IACAhD,GAAQ5yC,EAAMrO,MAAW8xC,EACzBA,GAAQ,CACT,CAED,GAAImP,KAAwB,WAAdvvD,EAAMkyD,OAAqB,CACvCzO,EAAK9kB,IAAM,yBACX3+B,EAAM6mB,KAAO+qC,GACb,KACD,CAEDrC,EAAO,EACPnP,EAAO,CAGR,CACDpgD,EAAM6mB,KAtyCA,GAwyCR,KAxyCQ,GAyyCN4C,EAt1Cc,EAu1Cd,MAAMoqC,EACR,KAAKjC,GACHnoC,GAr1Cc,EAs1Cd,MAAMoqC,EACR,KA5yCO,GA6yCL,OAv1Cc,EA01ChB,QACE,OAAOnO,GA4Cb,OA9BAjC,EAAKsD,SAAWyM,EAChB/P,EAAKmD,UAAY9kB,EACjB2hB,EAAKoF,QAAUv6C,EACfm1C,EAAKmF,SAAW2J,EAChBvyD,EAAMuvD,KAAOA,EACbvvD,EAAMogD,KAAOA,GAGTpgD,EAAMmvD,OAAUF,IAASxL,EAAKmD,WAAa5mD,EAAM6mB,KAAO+qC,KACvC5xD,EAAM6mB,KA50Cd,IApDO,IAg4CuBuiC,KACrCgK,GAAa3P,EAAMA,EAAKoD,OAAQpD,EAAKsD,SAAUkI,EAAOxL,EAAKmD,WAKjEoI,GAAOvL,EAAKmF,SACZqG,GAAQxL,EAAKmD,UACbnD,EAAKsF,UAAYiG,EACjBvL,EAAKuD,WAAaiI,EAClBjvD,EAAMkyD,OAASjD,EACXjvD,EAAM8oD,MAAQmG,IAChBxL,EAAKiB,MAAQ1kD,EAAM25B,MAChB35B,EAAM2/B,MAAQ2lB,GAAMtlD,EAAM25B,MAAOktB,EAAQoI,EAAMxL,EAAKsD,SAAWkI,GAAQ5J,GAAQrlD,EAAM25B,MAAOktB,EAAQoI,EAAMxL,EAAKsD,SAAWkI,IAE/HxL,EAAKC,UAAY1jD,EAAMogD,MAAQpgD,EAAM0R,KAAO,GAAK,IAC9B1R,EAAM6mB,OAAS3W,GAAO,IAAM,IAn2C3B,KAo2CDlQ,EAAM6mB,MAz2CR,KAy2CyB7mB,EAAM6mB,KAAiB,IAAM,IACzD,IAARmoC,GAAsB,IAATC,GAl5CC,IAk5Cc7F,IAAuB3/B,IAAQg8B,KAC/Dh8B,GAp4CkB,GAs4CbA,CACT,EAwEkB4pC,GAAAW,WAtElB,SAAoBvQ,GAElB,IAAKA,IAASA,EAAKzjD,MACjB,OAAO0lD,GAGT,IAAI1lD,EAAQyjD,EAAKzjD,MAKjB,OAJIA,EAAM8D,SACR9D,EAAM8D,OAAS,MAEjB2/C,EAAKzjD,MAAQ,KACNylD,EACT,EA2DwB4N,GAAAY,iBAzDxB,SAA0BxQ,EAAM3yC,GAC9B,IAAI9Q,EAGJ,OAAKyjD,GAASA,EAAKzjD,MAEM,IAAP,GADlBA,EAAQyjD,EAAKzjD,OACF8oD,MAA0BpD,IAGrC1lD,EAAM8Q,KAAOA,EACbA,EAAKlQ,MAAO,EACL6kD,IAP4BC,EAQrC,EA8C4B2N,GAAAa,qBA5C5B,SAA8BzQ,EAAMyI,GAClC,IAEIlsD,EAFAqsD,EAAaH,EAAWptD,OAO5B,OAAK2kD,GAAyBA,EAAKzjD,MAGhB,KAFnBA,EAAQyjD,EAAKzjD,OAEH8oD,MA35CE,KA25CY9oD,EAAM6mB,KACrB6+B,GA55CG,KAg6CR1lD,EAAM6mB,MAGCw+B,GAFA,EAEgB6G,EAAYG,EAAY,KAClCrsD,EAAM25B,OA37CH,EAi8Cdy5B,GAAa3P,EAAMyI,EAAYG,EAAYA,IAE/CrsD,EAAM6mB,KAx5CG,IA1CS,IAq8CpB7mB,EAAMiyD,SAAW,EAEVxM,IAzB4DC,EA0BrE,EAWmB2N,GAAAc,YAAG,qCEp/CtB,IAAAC,GAAiB,CAGf7O,WAAoB,EACpB8O,gBAAoB,EACpBC,aAAoB,EACpBC,aAAoB,EACpB/O,SAAoB,EACpBgP,QAAoB,EACpBC,QAAoB,EAKpBhP,KAAoB,EACpBiP,aAAoB,EACpBC,YAAoB,EACpBC,SAAoB,EACpBlP,gBAAoB,EACpBmP,cAAoB,EAEpBC,aAAoB,EAIpBC,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1BtP,uBAA0B,EAG1BuP,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BxP,QAA0B,EAC1B+H,mBAA0B,EAG1B9Q,SAA0B,EAC1BC,OAA0B,EAE1B+I,UAA0B,EAG1BC,WAA0B,GCR5B,ICtDIuP,GAAeh2D,GACfu9C,GAAex5C,GACfwpD,GAAevpD,GACf2C,GAAe1C,GACfq7B,GAAep7B,GACfmqD,GAAelqD,GACf8xD,GDYJ,WAEE3oD,KAAK8+C,KAAa,EAElB9+C,KAAK+jB,KAAa,EAElB/jB,KAAKmnD,OAAa,EAElBnnD,KAAKi/C,GAAa,EAElBj/C,KAAK+e,MAAa,KAElB/e,KAAKonD,UAAa,EAWlBpnD,KAAK1H,KAAa,GAIlB0H,KAAKg/C,QAAa,GAIlBh/C,KAAK++C,KAAa,EAElB/+C,KAAK/L,MAAa,CACpB,EC5CIyjB,GAAWzhB,OAAOoB,UAAUqgB,SAiFhC,SAASkxC,GAAQz1D,GACf,KAAM6M,gBAAgB4oD,IAAU,OAAO,IAAIA,GAAQz1D,GAEnD6M,KAAK7M,QAAU88C,GAAM5oC,OAAO,CAC1B65C,UAAW,MACX/C,WAAY,EACZgD,GAAI,IACHhuD,GAAW,CAAA,GAEd,IAAIiuD,EAAMphD,KAAK7M,QAIXiuD,EAAIC,KAAQD,EAAIjD,YAAc,GAAOiD,EAAIjD,WAAa,KACxDiD,EAAIjD,YAAciD,EAAIjD,WACC,IAAnBiD,EAAIjD,aAAoBiD,EAAIjD,YAAc,OAI3CiD,EAAIjD,YAAc,GAAOiD,EAAIjD,WAAa,KACzChrD,GAAWA,EAAQgrD,aACvBiD,EAAIjD,YAAc,IAKfiD,EAAIjD,WAAa,IAAQiD,EAAIjD,WAAa,IAGf,IAAR,GAAjBiD,EAAIjD,cACPiD,EAAIjD,YAAc,IAItBn+C,KAAKrL,IAAS,EACdqL,KAAKgyB,IAAS,GACdhyB,KAAKuhD,OAAS,EACdvhD,KAAK/N,OAAS,GAEd+N,KAAK82C,KAAS,IAAIiK,GAClB/gD,KAAK82C,KAAKmD,UAAY,EAEtB,IAAIrmD,EAAU80D,GAAatC,aACzBpmD,KAAK82C,KACLsK,EAAIjD,YAGN,GAAIvqD,IAAWyF,GAAEy/C,KACf,MAAM,IAAIhhD,MAAMk6B,GAAIp+B,IAQtB,GALAoM,KAAKk2C,OAAS,IAAIyS,GAElBD,GAAapB,iBAAiBtnD,KAAK82C,KAAM92C,KAAKk2C,QAG1CkL,EAAI7B,aAEwB,iBAAnB6B,EAAI7B,WACb6B,EAAI7B,WAAaU,GAAQC,WAAWkB,EAAI7B,YACG,yBAAlC7nC,GAAStf,KAAKgpD,EAAI7B,cAC3B6B,EAAI7B,WAAa,IAAI75B,WAAW07B,EAAI7B,aAElC6B,EAAIC,MACNztD,EAAS80D,GAAanB,qBAAqBvnD,KAAK82C,KAAMsK,EAAI7B,eAC3ClmD,GAAEy/C,MACf,MAAM,IAAIhhD,MAAMk6B,GAAIp+B,GAI5B,CA4NA,SAASgzD,GAAQ52C,EAAO7c,GACtB,IAAI01D,EAAW,IAAID,GAAQz1D,GAK3B,GAHA01D,EAASx2D,KAAK2d,GAAO,GAGjB64C,EAASl0D,IAAO,MAAMk0D,EAAS72B,KAAOA,GAAI62B,EAASl0D,KAEvD,OAAOk0D,EAASz1D,MAClB,CAvMAw1D,GAAQvxD,UAAUhF,KAAO,SAAU4R,EAAMiW,GACvC,IAGItmB,EAAQ8tD,EACRoH,EAAe1kD,EAAM2kD,EAJrBjS,EAAO92C,KAAK82C,KACZoK,EAAYlhD,KAAK7M,QAAQ+tD,UACzB3B,EAAav/C,KAAK7M,QAAQosD,WAM1ByJ,GAAgB,EAEpB,GAAIhpD,KAAKuhD,MAAS,OAAO,EACzBG,EAASxnC,MAAWA,EAAQA,GAAkB,IAATA,EAAiB7gB,GAAEw/C,SAAWx/C,GAAEu/C,WAGjD,iBAAT30C,EAET6yC,EAAK9mC,MAAQiwC,GAAQM,cAAct8C,GACF,yBAAxByT,GAAStf,KAAK6L,GACvB6yC,EAAK9mC,MAAQ,IAAI0V,WAAWzhB,GAE5B6yC,EAAK9mC,MAAQ/L,EAGf6yC,EAAKoF,QAAU,EACfpF,EAAKmF,SAAWnF,EAAK9mC,MAAM7d,OAE3B,EAAG,CAkBD,GAjBuB,IAAnB2kD,EAAKmD,YACPnD,EAAKoD,OAAS,IAAIjK,GAAMH,KAAKoR,GAC7BpK,EAAKsD,SAAW,EAChBtD,EAAKmD,UAAYiH,IAGnBttD,EAAS80D,GAAa9B,QAAQ9P,EAAMz9C,GAAEu/C,eAEvBv/C,GAAE2uD,aAAezI,IAC9B3rD,EAAS80D,GAAanB,qBAAqBvnD,KAAK82C,KAAMyI,IAGpD3rD,IAAWyF,GAAE8uD,cAAiC,IAAlBa,IAC9Bp1D,EAASyF,GAAEy/C,KACXkQ,GAAgB,GAGdp1D,IAAWyF,GAAE0uD,cAAgBn0D,IAAWyF,GAAEy/C,KAG5C,OAFA94C,KAAK2hD,MAAM/tD,GACXoM,KAAKuhD,OAAQ,GACN,EAGLzK,EAAKsD,WACgB,IAAnBtD,EAAKmD,WAAmBrmD,IAAWyF,GAAE0uD,eAAmC,IAAlBjR,EAAKmF,UAAmByF,IAAUroD,GAAEw/C,UAAY6I,IAAUroD,GAAEsuD,gBAE5F,WAApB3nD,KAAK7M,QAAQguD,IAEf2H,EAAgB7I,GAAQW,WAAW9J,EAAKoD,OAAQpD,EAAKsD,UAErDh2C,EAAO0yC,EAAKsD,SAAW0O,EACvBC,EAAU9I,GAAQO,WAAW1J,EAAKoD,OAAQ4O,GAG1ChS,EAAKsD,SAAWh2C,EAChB0yC,EAAKmD,UAAYiH,EAAY98C,EACzBA,GAAQ6rC,GAAM38B,SAASwjC,EAAKoD,OAAQpD,EAAKoD,OAAQ4O,EAAe1kD,EAAM,GAE1EpE,KAAK4hD,OAAOmH,IAGZ/oD,KAAK4hD,OAAO3R,GAAMb,UAAU0H,EAAKoD,OAAQpD,EAAKsD,aAY9B,IAAlBtD,EAAKmF,UAAqC,IAAnBnF,EAAKmD,YAC9B+O,GAAgB,EAGtB,QAAYlS,EAAKmF,SAAW,GAAwB,IAAnBnF,EAAKmD,YAAoBrmD,IAAWyF,GAAE0uD,cAOrE,OALIn0D,IAAWyF,GAAE0uD,eACfrG,EAAQroD,GAAEw/C,UAIR6I,IAAUroD,GAAEw/C,UACdjlD,EAAS80D,GAAarB,WAAWrnD,KAAK82C,MACtC92C,KAAK2hD,MAAM/tD,GACXoM,KAAKuhD,OAAQ,EACN3tD,IAAWyF,GAAEy/C,MAIlB4I,IAAUroD,GAAEsuD,eACd3nD,KAAK2hD,MAAMtoD,GAAEy/C,MACbhC,EAAKmD,UAAY,GACV,EAIX,EAYA2O,GAAQvxD,UAAUuqD,OAAS,SAAUx+C,GACnCpD,KAAK/N,OAAOI,KAAK+Q,EACnB,EAaAwlD,GAAQvxD,UAAUsqD,MAAQ,SAAU/tD,GAE9BA,IAAWyF,GAAEy/C,OACS,WAApB94C,KAAK7M,QAAQguD,GAGfnhD,KAAK5M,OAAS4M,KAAK/N,OAAOsG,KAAK,IAE/ByH,KAAK5M,OAAS68C,GAAMP,cAAc1vC,KAAK/N,SAG3C+N,KAAK/N,OAAS,GACd+N,KAAKrL,IAAMf,EACXoM,KAAKgyB,IAAMhyB,KAAK82C,KAAK9kB,GACvB,EA+Eei3B,GAAAL,QAAGA,GACHK,GAAArC,QAAGA,GACAqC,GAAAC,WAnBlB,SAAoBl5C,EAAO7c,GAGzB,OAFAA,EAAUA,GAAW,IACbkuD,KAAM,EACPuF,GAAQ52C,EAAO7c,EACxB,EAgBA81D,GAAAE,OAAkBvC,GCnalB,IAMIwC,GAAO,CAAA,GAEX/hD,EARgB3U,GAA8B2U,QAQvC+hD,GANS3yD,GACAC,GACAC,IAMhB,IAAA0yD,GAAiBD,GCTjB,SAASE,IAAW9nD,KAACA,EAAIlO,MAAEA,EAAKi2D,SAAEA,EAAQC,UAAEA,IAC1C,MAAMC,EAAyB,CAACjoD,OAAMlO,SAStC,OARIi2D,IACFE,EAASn2D,MAAQorD,WAAQ,IAAIh5B,WAAW+jC,EAASn2D,QACjDm2D,EAASC,YAAa,GAEpBF,IACFC,EAASn2D,MCNb,SAA6Bq2D,GAC3B,MAAMC,EAAS,mEAAmE3hD,MAAM,IAElF4hD,EAAQ,IAAInkC,WAAWikC,GACvB52C,EAAM82C,EAAM13D,OACZ23D,EAAa/2C,EAAM,EACnBnD,EAAQ,GACRm6C,EAAiB,MAEvB,IAAIxiC,EAGJ,IAAK,IAAIpuB,EAAI,EAAG6wD,EAAOj3C,EAAM+2C,EAAY3wD,EAAI6wD,EAAM7wD,GAAK4wD,EACtDn6C,EAAMvd,KAAK43D,EAAY9wD,EAAGA,EAAI4wD,EAAiBC,EAAOA,EAAO7wD,EAAI4wD,IAYnE,OARmB,IAAfD,GACFviC,EAAMsiC,EAAM92C,EAAM,GAClBnD,EAAMvd,KAAKu3D,EAAOriC,GAAO,GAAKqiC,EAAQriC,GAAO,EAAK,IAAQ,OAClC,IAAfuiC,IACTviC,GAAOsiC,EAAM92C,EAAM,IAAM,GAAK82C,EAAM92C,EAAM,GAC1CnD,EAAMvd,KAAKu3D,EAAOriC,GAAO,IAAMqiC,EAAQriC,GAAO,EAAK,IAAQqiC,EAAQriC,GAAO,EAAK,IAAQ,MAGlF3X,EAAMrX,KAAK,IAMlB,SAAS0xD,EAAYpsD,EAAeC,GAClC,IAAIypB,EACJ,MAAM2yB,EAAS,GACf,IAAK,IAAI/gD,EAAI0E,EAAO1E,EAAI2E,EAAK3E,GAAK,EAChCouB,GAAQsiC,EAAM1wD,IAAM,GAAM,WAAc0wD,EAAM1wD,EAAI,IAAM,EAAK,QAA0B,IAAf0wD,EAAM1wD,EAAI,IAClF+gD,EAAO7nD,KARFu3D,GADgBznC,EASOoF,IARR,GAAM,IAAQqiC,EAAQznC,GAAO,GAAM,IAAQynC,EAAQznC,GAAO,EAAK,IAAQynC,EAAa,GAANznC,IADtG,IAAyBA,EAWvB,OAAO+3B,EAAO3hD,KAAK,GACpB,CACH,CDlCqB2xD,CAAoBT,EAASn2D,QAGzCm2D,CACT,CEbA,SAASU,GAAgB/0D,GACvB,MAAO,kBAAkBM,KAAKN,EAChC,CCJA,SAASg1D,GAAgBt1D,GACvB,MAAMwX,EAAIxX,GAAOA,EAAIuT,MAAM,YACrB2rB,EAAO1nB,GAAKA,EAAE,IAAOxX,EAC3B,OAAQk/B,GAAOA,EAAIltB,QAAQ,SAAU,MAAShS,CAChD,CCJA,SAASu1D,GAAQ9b,GACf,OAAOA,EAAIhpC,QAAO,CAAC+kD,EAAcrnD,IAASqnD,EAAQtyC,OAAO/U,IAAO,GAClE,CCQA,SAASsnD,IAA4BtgD,OAACA,EAAMugD,QAAEA,EAAOC,iCAAEA,IACrD,OAAO,SAAUC,GACf,MACMC,GADcH,GAAW,IAAII,YAAY,UACpBr9C,OAAOm9C,GAE5B70D,GADYoU,GAAU,IAAI4gD,WACVC,gBAAgBH,EAAQ,iBAExCI,EAAahuD,MAAMrJ,KAAKmC,EAAIqD,iBAAiB,gBAChDb,KAAK2yD,IACJ,MAAM7iB,EAAS6iB,EAAShyD,aAAa,UACrC,OAAOmvC,EAASA,EAAOlgC,MAAM,MAAM5P,KAAI2T,GAAOA,EAAI87B,OAAO7/B,MAAM,OAAO,KAAM,EAAE,IAE/E1C,QAAO,CAACE,EAAKsiC,IAAStiC,EAAIuS,OAAO+vB,IAAO,IAErCkjB,EAAUluD,MAAMrJ,KAAKmC,EAAIqD,iBAAiB,aAC7Cb,KAAK6yD,GAAmBA,EAAMlyD,aAAa,SAC3C6M,OAAO/P,SAEJq1D,EAAWpuD,MAAMrJ,KAAKmC,EAAIqD,iBAAiB,qCAC9Cb,KAAK1E,GAAeA,EAAEqF,aAAa,SAAWrF,EAAEqF,aAAa,gBAC7D6M,OAAO/P,SAEJs1D,EAAcruD,MAAMrJ,KAAKmC,EAAIw1D,qBAAqB,WACrDhzD,KAAK1E,GAAyBA,EAAEqF,aAAa,UAC7C6M,OAAO/P,SAEJw1D,EAAgBb,EAAiC50D,GAAK,GACtD01D,EAYV,SAAgC11D,GAC9B,OAAOw0D,GACLttD,MAAMrJ,KAAKmC,EAAIqD,iBAAiB,aAC7Bb,KAAK1E,GAAgBA,EAAkBgrC,MAAMsC,UAC7C5oC,KAAI4oC,GAAWsG,GAAkBtG,KACjCp7B,OAAO/P,SAEd,CAnB2B01D,CAAuB31D,GAE9C,OAAOk1D,EACJ/yC,OAAOizC,GACPjzC,OAAOmzC,GACPnzC,OAAOozC,GACPpzC,OAAOszC,GACPtzC,OAAOuzC,GACP1lD,QAAQzM,GAAuB,MAATA,EAAE,IAC7B,CACF,CCzCA,SAASqyD,IAAwBC,gBAACA,IAChC,OAAO,SAA6B52D,EAAa62D,GAC/C,MAAMC,EAAiBvB,GACrBsB,EAAUtzD,KAAImuC,IACZ,IACE,OAAOzpC,MAAMrJ,KAAK8yC,EAAEqlB,YACrB,CAAC,MAAOC,GAEP,MAAO,EACR,MAGL,OACEJ,EAAgB52D,IAChB82D,EAAepuC,MAAMuuC,IACnB,MAAMC,EAAWD,EAAW12D,MAAQ+0D,GAAgB2B,EAAW12D,MAC/D,OAAO22D,GCtBf,SAAyBC,GACvB,MAAMn3D,EAAM,IAAIE,IAAIi3D,GAOpB,OANIn3D,EAAI6E,WACN7E,EAAI6E,SAAW,IAEb7E,EAAI8E,WACN9E,EAAI8E,SAAW,IAEV9E,EAAIO,IACb,CDa2B62D,CAAgBF,KAAcl3D,CAAG,GAG1D,CACF,CExBA,SAASq3D,GAAoBC,GAC3B,MAAMnrB,EAAU,IAAI2pB,YAAY,SAASr9C,OAAO6+C,GAC1CjoD,EAAO5M,SAAS4M,MAAQ5M,SAAS2B,iBAAiB,QAAQ,GAC1DylC,EAAQpnC,SAAS80D,cAAc,SAWrC,OAVA1tB,EAAMn9B,KAAO,WACbm9B,EAAMnmC,aAAa,YAAa,mDAChC2L,EAAKmoD,YAAY3tB,GAGZA,EAAcotB,WACfptB,EAAcotB,WAAW9qB,QAAUA,EAErCtC,EAAM2tB,YAAY/0D,SAASg1D,eAAetrB,IAErCtC,EAAMwH,KACf,CCRA,SAASqmB,GACPJ,EACAL,EACAxmB,EAAMprB,IAEN,IAAIsyC,EACJ,GAAIV,EACF,IACEA,EAAWhqB,SACX0qB,EAAqBV,CACtB,CAAC,MAAOp4D,GACP4xC,EAAI,gDAAgDwmB,EAAW12D,QAAQ1B,sCACvE84D,EAAqBC,GAAqBN,EAC3C,MAEDK,EAAqBC,GAAqBN,GAG5C,MAAO,CAACK,qBAAoBE,gBAE5B,WACMF,IAAuBV,GACzBU,EAAmBG,UAAUh0D,WAAWi0D,YAAYJ,EAAmBG,UAE1E,EACH,CCzBA,SAASE,GACP9hB,GACAzF,IAACA,EAAGgkB,SAAEA,EAAQC,UAAEA,IAEhB,OAAOxe,EAAezlC,QAAOwnD,MAAOC,GAA+Bl4D,MAAKu0C,UAASwE,cAC/E,MAAMof,EAAgB,IAAI14D,SAAiCw4D,MAAMv4D,IAC/D,IACE,MAAM04D,EAAc7jB,EAAQtxC,WAAW,iBACnCm1D,EACF14D,QAdVu4D,eAAoCI,GAClC,MAAMn5B,QAAYo5B,MAAMD,GACxB,aAAan5B,EAAIq5B,aACnB,CAWwBC,CAAqBJ,EAAY55D,QAE/C+1C,EAAQkkB,QAAOC,GAASA,EAAOh5D,EAAQg5D,EAAKH,eAAiBI,KAAwB,YAExF,CAAC,MAAO94D,GACP84D,EAAoB94D,EACrB,CAED,SAAS84D,EAAoB94D,GA+BnC,IAA6BqwC,EA9BrBO,EACE,wBACA5wC,EAAMA,EAAIb,QAAU,GACpBu1C,GAAWA,EAAQtxC,aA2BAitC,EA3BkCqE,EA4BtD71C,KAAKC,UAAU,CAACuxC,EAAGjtC,YAAYwN,QAAO,CAAC3N,EAAQmB,IAAW9C,OAAOoR,OAAO,CAAC,CAACtO,EAAET,MAAOS,EAAEzF,OAAQsE,IAAI,CAAE,MA1BpGi2C,EAAQ91C,WAAWgY,OACjB89B,EAAQ91C,WAAW0qC,WAAUyC,GAAsB,wBAAdA,EAAK5sC,OAC1C,GAEFu1C,EAAQ91C,WAAW1F,KAAK,CAACiG,KAAM,iCAAkChF,MAAO,SACxEkB,OAAQsU,EACT,KAEH,OAAOkkD,EAAMv4D,MAAKu4D,GAChBC,EAAcx4D,MAAKnB,IACjB,GAAIA,EAAO,CACT,MAAMm2D,EAAWH,GAAW,CAAC9nD,KAAM,YAAalO,QAAOi2D,WAAUC,cAC3Dp2D,EAAqB,IACtBq2D,EACHn2D,MAAOm2D,EAASn2D,MAChBwB,IAAKA,GAEPk4D,EAAM36D,KAAKe,EACZ,CACD,OAAO45D,CAAK,KAEf,GACAz4D,QAAQC,QAAQ,IACrB,CCpDA,MAAMk5D,GAAuB,qBCsR7B,SAASC,GAA2Bv4D,GAClC,OAAOA,GAAe+0D,GAAgB/0D,EACxC,CCrRA+B,OAAOL,GAAkBK,OAAOL,IAAmB,CAAA,EAEnD,MAAM82D,GAAUr3D,GDkDhB,UAAqBV,IACnBA,EAAM0B,SAAQs2D,SACdA,EAAQC,gBACRA,EAAeC,mBACfA,EAAkBC,aAClBA,EAAYC,cACZA,EAAaC,kBACbA,EAAiBC,mBACjBA,EAAkB3mB,8BAClBA,EAA6B4mB,SAC7BA,GACsB,CAAA;;AAEtB,GAAIx/C,UAAU,aAAcy/C,SAAU,CACpCx4D,EAAM+Y,UAAU,GAEhB,MAAMzb,EAAUyb,UAAU,GAC1Bi/C,EAAW16D,EAAQ06D,SACnBC,EAAkB36D,EAAQ26D,gBAC1BC,EAAqB56D,EAAQ46D,mBAC7BC,EAAe76D,EAAQ66D,aACvBC,EAAgB96D,EAAQ86D,cACxBC,EAAoB/6D,EAAQ+6D,kBAC5BC,EAAqBh7D,EAAQg7D,mBAC7B3mB,EAAgCr0C,EAAQq0C,6BACzC,CACD,MAAMjC,EAAMsoB,GEhFGS,EFgFgBC,KAAKC,ME/E7B,YAAgBl6D,GACrB,MAAMm6D,EAAU,CAAC,iBAAkB,KAAKF,KAAKC,MAAQF,UAAuBh6D,GAC5E42B,QAAQqa,OAAOkpB,EACjB,GF4E6Ct0C,GEhF/C,IAAiBm0C,EFiFf/oB,EAAI,qBACJA,EAAI,yBAAyB0oB,GAAiBA,EAAc97D,UAC5D,MAAMu8D,EAAeZ,GDlFvB,UAA0BvoB,IAACA,EAAGopB,eAAEA,IAC9B,IAAIC,EACJ,IACE,MAAMC,EAAUF,IAAqC,oBAAXx3D,OAAyBA,OAAOw3D,oBAAiB7lD,GAC3F,GAAI+lD,EAAS,CACX,MAAMC,EAAyBD,EAAQE,QAAQrB,IAC/CkB,EAAsBE,EAAyBt7D,KAAKkW,MAAMolD,GAA0B,CAAA,CACrF,CACF,CAAC,MAAOE,GACPzpB,EAAI,+BAAgCypB,EACrC,CAED,MAAO,CACLD,QAMF,SAAiB77D,GACf,GAAI07D,EACF,OAAOA,EAAoB17D,EAE9B,EATC+7D,QAWF,SAAiB/7D,EAAaI,GACxBs7D,IACFrpB,EAAI,2CAA4CryC,EAAK,SAAUI,GAC/Ds7D,EAAoB17D,GAAOI,EAE9B,EAfCmW,KAiBF,WACE,OAAImlD,EACK34D,OAAOwT,KAAKmlD,GAEZ,EAEV,EAtBCM,QAwBF,WACE,GAAIN,EAAqB,CACvB,MAAMC,EAAUF,IAAqC,oBAAXx3D,OAAyBA,OAAOw3D,oBAAiB7lD,GACvF+lD,GACFA,EAAQI,QAAQvB,GAAsBl6D,KAAKC,UAAUm7D,GAExD,CACF,EACH,CCkC0CO,CAAiB,CAAC5pB,QACpDmmB,EAAkD,CAAA,EAClD0D,EG9ER,UAA4C1D,gBAC1CA,EAAe2D,QACfA,EAAUl4D,OAAOk4D,QAAO7nB,8BACxBA,IAEA,OAAO,SAAS4nB,EAA+BrD,GA2B7C,OA1Bazd,GACXvxC,MAAMrJ,KAAMq4D,EAA6BhqB,UAAY,IAAIx8B,QAAO,CAACE,EAAeyX,KAC9E,MAAMoyC,EAAc,CAClB,CAACD,EAAQE,aAAc,KACrB,MAAMC,EAAatyC,EACnB,OAAIsyC,EAAWzD,aACbL,EAAgB8D,EAAWzD,WAAW12D,MAAQm6D,EAAWzD,WACrDyD,EAAWzD,WAAW12D,MAAam6D,EAAWzD,WAAW12D,KAExDm6D,EAAWn6D,IAAI,EAExB,CAACg6D,EAAQI,gBAAiB,IAAMloB,GAAkBrqB,EAAK+jB,QAAS,CAACuG,kCACjE,CAAC6nB,EAAQK,eAAgB,IAAMN,EAA+BlyC,GAC9D,CAACmyC,EAAQM,YAAa,IAAMP,EAA+BlyC,GAC3D,CAACmyC,EAAQO,YAAa,IAAMjoB,GAA2BzqB,EAAsByhB,QAC7EzhB,EAAK1b,MAEDumC,EAAQunB,GAAeA,KAAkB,GAM/C,OAJKpyC,aAAI,EAAJA,EAAc6kB,WAEfgG,EAAe11C,QAAQ+8D,EAA+BlyC,IAEnDzX,EAAIuS,OAAO+vB,EAAK,GACtB,KAEOliC,QAAQzM,GAAuB,MAATA,EAAE,IACtC,CACF,CH4CyCy2D,CAAmC,CACxEnE,kBACAlkB,8BAA+B1xC,QAAQ0xC,aAAA,EAAAA,EAA+Br1C,UAElE29D,EAAsBrE,GAAwB,CAACC,oBAC/CjB,EI3FR,SAA8C2E,GAC5C,OAAO,SAA0Cv5D,EAAek6D,GAA6B,GAC3F,OAAOzhB,GACLvxC,MAAMrJ,KAAKmC,EAAIqD,iBAAiB,UAAUqM,QAAO,CAACopC,EAAwBqhB,KACxE,MAAMjE,EAAagE,EACfhzD,MAAMrJ,KAAKmC,EAAIg2D,aAAaruC,MAAMuuC,GAA8BA,EAAWa,YAAcoD,IACzFA,EAAQ7pB,MACZ,OAAO4lB,EAAapd,EAAa32B,OAAOo3C,EAA+BrD,IAAepd,CAAY,GACjG,IAEP,CACF,CJgF2CshB,CAAqCb,GACxEc,EK5FR,SACEd,GAEA,OAAO,SAAmDv5D,GACxD,OAAKA,EAAI61C,mBACF4C,GACLz4C,EAAI61C,mBAAmBnmC,QAAO,CAACopC,EAAwBod,IAC9Cpd,EAAa32B,OAAOo3C,EAA+BrD,KACzD,KAJ+B,EAMtC,CACF,CLkFIoE,CAA8Cf,GAE1CgB,EAA0B7F,GAA4B,CAACE,qCACvD4F,EMhGR,UAAsBjD,MACpBA,EAAQj2D,OAAOi2D,MAAKkD,gBACpBA,EAAkBn5D,OAAOm5D,gBAAeC,QACxCA,EAAU,IAAKC,qBACfA,EAAuB,KACJ,CAAA,GACnB,OAAO,SAAkB17D,GAIvB,OAAO,IAAIP,SAAQ,CAACC,EAASi8D,KAC3B,MAAMC,EAAa,IAAIJ,EACjBK,EAAgB,KACpB,MAAMh8D,EAAM,IAAImD,MAAM,4BACtBnD,EAAIi8D,WAAY,EAChBH,EAAO97D,GACP+7D,EAAWG,OAAO,EAGdC,EAAYC,WAAWJ,EAAeJ,GAE5C,OAAOnD,EAAMt4D,EAAK,CAChB0a,MAAO,cACPwhD,YAAa,cACbC,OAAQP,EAAWO,SAElBx8D,MAAMy8D,IAEL,GADAC,aAAaL,GACO,MAAhBI,EAAKt9D,OAAgB,CACvB,MAAMw9D,EAAcF,EAAKG,QAAQ3vD,IAAI,gBAK/BovD,GAHHI,EAAKG,QAAQ3vD,IAAI,mBAClB,CAAC,SAAU,UAAUiE,MAAK6a,GAAU4wC,GAAeA,EAAY9tC,WAAW9C,MAEnCuwC,WAAWJ,EAAeH,GAEnE,OAAOU,EAAK7D,cAAc54D,MAAKnB,IAC7Bw9D,GAAaK,aAAaL,GACnB,CACLh8D,MACAxB,QACAkO,KAAM4vD,KAGX,CACC,MAAO,CAACt8D,MAAKw8D,gBAAiBJ,EAAKt9D,OACpC,IAEFa,KAAKD,GACLE,OAAOC,GAAe87D,EAAO97D,IAAK,GAEzC,CACF,CN4CmB48D,CAAa,CAAChB,QAASvC,IAClCwD,EOpFR,UAA6BnB,SAC3BA,EAAQP,oBACRA,EAAmBtD,sBACnBA,EAAqB4C,+BACrBA,EAA8BgB,wBAC9BA,EAAuB1B,aACvBA,EAAYl/C,MACZA,EAAQ,CAAE,EAAA+5C,SACVA,EAAQC,UACRA,EAASjkB,IACTA,EAAMprB,KAEN,OAAO,UAAyBrlB,IAACA,EAAG62D,UAAEA,EAAS8F,wBAAEA,EAAuBC,iBAAEA,GAAmB,EAAKzD,cAAEA,IAClG,IAAKz+C,EAAM1a,GACT,GAAI45D,GAAgBA,EAAaK,QAAQj6D,GAAM,CAC7C,MAAM65C,EA8GV,SAASgjB,EAAgB78D,GACvB,MAAM88D,EAAgBlD,EAAaK,QAAQj6D,GAC3C,MAAO,CAACA,GAAKkjB,OAAO45C,EAAgBtjB,GAAK+b,GAAKuH,EAAcv5D,IAAIs5D,KAAqB,GACtF,CAjHwBA,CAAgB78D,GACrCywC,EAAI,wCAAyCzwC,EAAK,QAAS65C,EAAax2C,MAAM,IAC9EqX,EAAM1a,GAAOP,QAAQC,QAAQ,CAACm6C,gBAC/B,MAAM,GAAKsf,GAAiBA,EAAcp1D,QAAQ/D,IAAQ,GAAM,mCAAmCY,KAAKZ,GACvGywC,EAAI,2DAA4DzwC,GAChE0a,EAAM1a,GAAOP,QAAQC,QAAQ,CAACm6C,aAAc,CAAC75C,SACxC,CACL,MAAM05D,EAAMD,KAAKC,MACjBh/C,EAAM1a,GAQV,SAA2BA,GACzBywC,EAAI,WAAYzwC,GAChB,MAAM05D,EAAMD,KAAKC,MACjB,OAAO6B,EAASv7D,GACbJ,OAAMf,GAmFX,SAAsBgB,GACpB,MAAMq9B,EACJr9B,EAAIb,UAAYa,EAAIb,QAAQg9B,SAAS,oBAAsBn8B,EAAIb,QAAQg9B,SAAS,2BAC5Ex4B,EAAO3D,EAAI2D,MAAQ3D,EAAI2D,KAAKw4B,SAAS,aAC3C,OAAOkB,GAAO15B,CACf,CAvFSu5D,CAAal+D,GACR,CAACk+D,cAAc,EAAM/8D,OACnBnB,EAAEi9D,UACJ,CAACA,WAAW,EAAM97D,QAEzBywC,EAAI,iCAAiCzwC,KAAOnB,EAAI,WAAWA,EAAEG,kBAAkBH,EAAE2E,OAAS,KAAM3E,GACzF,CAAC29D,gBAAiB,IAAKx8D,UAGjCL,MAAK,EAAEK,MAAK0M,OAAMlO,QAAOu+D,eAAcP,kBAAiBV,gBACvD,GAAIiB,EAGF,OAFAtsB,EAAI,0BAA2B,IAAIgpB,KAAKC,MAAQA,OAAU15D,GAC1D45D,GAAgBA,EAAaO,QAAQn6D,EAAK,IACnC,CAAC65C,aAAc,CAAC75C,IAGzB,GAAIw8D,EAAiB,CACnB,MAAMziB,EAAW,CAAC/5C,CAACA,GAAM,CAACw8D,oBAE1B,OADA5C,GAAgBA,EAAaO,QAAQn6D,EAAK,IACnC,CAAC+5C,WACT,CAED,GAAI+hB,EAGF,OAFArrB,EAAI,iFACJmpB,GAAgBA,EAAaO,QAAQn6D,EAAK,IACnC,CACL+5C,SAAU,CAAC/5C,CAACA,GAAM,CAACw8D,gBAAiB,OAMxC,IAAIM,EACJ,GAHArsB,EAAI,YAAYgpB,KAAKC,MAAQA,QAAU15D,YAAcxB,EAAMw+D,cAGvD,YAAYp8D,KAAK8L,GAAO,CAC1B,MAAMuqD,EAAa+D,EAAoBh7D,EAAK62D,GAC5C,GAAII,GAAc2F,EAAkB,CAClC,MAAMjF,mBAACA,EAAkBE,gBAAEA,GAAmBH,EAAsBl5D,EAAOy4D,GAC3E6F,EAAgBxC,EAA+B3C,GAC/CE,GACD,CACF,MAAM,GAAI,aAAaj3D,KAAK8L,GAC3B,IACEowD,EAAgBxB,EAAwB98D,GACxCo+D,IAAqBE,CACtB,CAAC,MAAOj+D,GACP4xC,EAAI,8BAA+B5xC,EACpC,CAGH,MAAMo+D,EAAW,CAACj9D,CAACA,GAAMw0D,GAAW,CAAC9nD,OAAMlO,QAAOi2D,WAAUC,eAC5D,GAAIoI,EAAe,CACjB,MAAMI,EAAwBJ,EAC3Bv5D,KAAI45D,GAAe37D,EAAc27D,EAAan9D,EAAIgS,QAAQ,SAAU,OACpEzO,IAAI+xD,IACJvkD,OAAOskD,IAOV,OALI6H,EAAsB7/D,SACxB4/D,EAASj9D,GAAKo9D,aAAeF,GAE/BtD,GAAgBA,EAAaO,QAAQn6D,EAAKk9D,GAEnCP,EAAwB,CAC7B9F,YACA5jB,KAAMiqB,EACNN,mBACAzD,kBACCx5D,MAAK,EAAEk6C,eAAcE,eAAe,CACrCF,eACAE,SAAU54C,OAAOoR,OAAOwnC,EAAUkjB,MAErC,CAEC,OADArD,GAAgBA,EAAaO,QAAQn6D,EAAK,IACnC,CAAC+5C,SAAUkjB,EACnB,IAEFr9D,OAAMC,IACL4wC,EAAI,kCAAmCzwC,EAAKH,EAAKA,EAAM,WAAWA,EAAIb,kBAAkBa,EAAI2D,OAAS,IACrGo2D,GAAgByD,IACT,KAEZ,CA7FgBC,CAAkBt9D,GAAKL,MAAKrB,IACvCmyC,EAAI,oBAAqB,IAAIgpB,KAAKC,MAAQA,OAAU15D,GAC7C1B,IAEV,CAEH,OAAOoc,EAAM1a,GAqGb,SAASq9D,IACP5sB,EAAI,gCAAiCzwC,GACrC45D,EAAajlD,OAAOrE,SAAQlS,IAC1B,MAAM0+D,EAAgBlD,EAAaK,QAAQ77D,GAC3Cw7D,EAAaO,QACX/7D,EACA0+D,EAAc/rD,QAAOwsD,GAAOA,IAAQv9D,IACrC,IAEHywC,EAAI,+BAAgCzwC,EACrC,CACH,CACF,CP1D0Bw9D,CAAoB,CAC1CjC,WACAP,sBACAtD,yBACA4C,iCACAgB,0BACA7qB,MACAmpB,eACAnF,SAAU2E,EACV1E,UAAW2E,IAGPsD,EQxGR,UAAqCD,gBACnCA,EAAe/iB,8BACfA,IAEA,OAAO,SAASgjB,GAAwB9F,UACtCA,EAAS5jB,KACTA,EAAI2pB,iBACJA,GAAmB,EAAKzD,cACxBA,IAEA,OAAO15D,QAAQ8zB,IACb0f,EAAK1vC,KAAIvD,GAAO08D,EAAgB,CAAC18D,MAAK62D,YAAW8F,0BAAyBC,mBAAkBzD,qBAC5Fx5D,MAAKi6C,GAA2BD,EAA8BC,IAClE,CACF,CR0FkC6jB,CAA4B,CAC1Df,kBACA/iB,mCAGF,OAMA,SAAS+jB,EAAc38D,EAAe48D,EAAkB58D,EAAIJ,SAASJ,MACnE,MAAMN,ESzHV,SAAoBc,GAClB,MAAMd,EAAUc,EAAIqD,iBAAiB,QAAQ,IAAMrD,EAAIqD,iBAAiB,QAAQ,GAAG7D,KACnF,GAAIN,IAKSD,EALQC,KAMN,uCAAuCW,KAAKZ,GALzD,OAAO4E,EAAuB3E,GAIlC,IAAeD,CAFf,CToHoB49D,CAAW78D,IAAQ48D,EAC7BE,EU1HJ,SAAgCvE,GACpC,KAAKA,aAAA,EAAAA,EAAUj8D,QAAQ,OAGvB,MAAMygE,EAAyCxE,EAAS/1D,KAAIw6D,GAAsB,CAACA,EAqB5E,uCAAuC/rD,QAAQ,SAASzN,IAC7D,MAAM1B,EAAqB,GAAhB0G,KAAKy0D,SAAiB,EAGjC,OADgB,MAANz5D,EAAY1B,EAAS,EAAJA,EAAW,GAC7B+f,SAAS,GAAG,OAvBjBq7C,EAAqBh8D,EAAc67D,GAAiBvI,OAC1D,IAAI9sD,EAAS,EACb,MAAMo1D,EAAyCC,EAAgBv6D,KAAI,EAAEw6D,MACnE,GAAkC,IAA9BA,EAAmB1gE,OAAc,OAAO,KAC5C,MAAM6gE,EAAeD,EAAmBx1D,GAAQmI,aAAY,CAACyX,EAAoC7pB,IACxF6pB,EACH,CAAC3b,KAAM,MAAO2b,SAAU7pB,EAAOklC,OAAQrb,GACvC7pB,EAAMO,MACNP,EACA,CAACkO,KAAM,MAAO2b,SAAU7pB,SAC3BwV,GAEH,OADAvL,GAAUs1D,EAAmB1gE,OACtB6gE,CAAa,IAGtB,OAAOL,CACT,CVoG0BM,CAAsB7E,IACtCvjB,IAACA,EAAGE,SAAEA,EAAQC,eAAEA,EAAcE,OAAEA,EAAMD,aAAEA,EAAYE,YAAEA,EAAWC,SAAEA,EAAQC,WAAEA,EAAUC,WAAEA,GAC7FX,GAAc90C,EAAKd,EAASwwC,GACxB2tB,EAAe7I,GAAKtf,EAAS1yC,KAAI86D,GAAW1I,EAAiC0I,MAC7EC,EAAwB/I,GAC5Btf,EAAS1yC,KAAI86D,GAAWjD,EAA0CiD,MAE9DE,GA+HkBv+D,EA/HqBC,EAgIxC,SAAUu+D,GACf,IAEE,OAAO55D,EAAuBpD,EAAcg9D,EAASx+D,GACtD,CAAC,MAAOH,GAER,CACH,GAtIQozC,EAAOuG,GAAKvxC,MAAMrJ,KAAK03C,GAAUpzB,OAAOjb,MAAMrJ,KAAKw/D,IAAel7C,OAAOjb,MAAMrJ,KAAK0/D,KACvF/6D,KAAKvD,GAAgBA,EAAIgzC,SACzBviC,QAAO,CAACgpC,EAAez5C,KACtBy5C,EAAIl8C,KAAKyC,GACT,MAAMy+D,EWzId,SAAuBz+D,GAarB,OAXGA,GACCA,EAAIgS,QAAQ,4BAA4B7P,IACtC,MAAMu8D,EAAM30D,SAAS5H,EAAEmR,OAAO,GAAG0/B,OAAQ,IAGzC,OAAI0rB,EAAM,QACDv8D,EAEFqD,OAAOwE,cAAc00D,EAAI,KAEpC1+D,CAEJ,CX2H2B2+D,CAAc3+D,GAIjC,OAHIy+D,IAAez+D,GACjBy5C,EAAIl8C,KAAKkhE,GAEJhlB,CAAG,GACT,IACFl2C,IAAIg7D,GACJh7D,IAAI+xD,IACJvkD,OAAO8nD,IAEJ+F,EAA6D3F,EAC/Dx5D,QAAQC,QAAQ,CAACm6C,aAAc5G,EAAM8G,SAAU,CAAA,IAC/C4iB,EAAwB,CAAC9F,UAAW5gB,EAAwBhD,OAAMkmB,kBAAgBx5D,MAAKrB,IACrFs7D,GAAgBA,EAAaQ,UACtB97D,KAEPugE,EAAqB7G,GAAiB9hB,EAAgB,CAC1DzF,MACAgkB,SAAU2E,EACV1E,UAAW2E,IAEPyF,EAAoBF,EAA4Bj/D,MAAKo/D,GYxJ/D,SACExoB,GACAx1C,IAACA,EAAGi+D,aAAEA,EAAYvuB,IAAEA,EAAGgkB,SAAEA,EAAQC,UAAEA,EAASkF,aAAEA,IAE9C,IAAK74D,EAAIk+D,MAA8B,IAAtB1oB,EAAWl5C,OAC1B,OAAOoC,QAAQC,QAAQ,IAEzB,MAAMw/D,EAAkB,IAAIn8C,IAAI5hB,OAAOwT,KAAKqqD,IACtC9G,EAAQ3hB,EAAWxlC,QACvB,EAAE/Q,WAAUk/D,EAAgB1hD,IAAI,QAAUxd,IAAU45D,GAAiBA,EAAaK,QAAQ,QAAUj6D,MAGhGm/D,EAAgBp+D,EAAIw2D,cAAc,UACxC4H,EAAct1B,MAAM/E,QAAU,OAC9B,MAAMm6B,EAAOjqB,GAAgBj0C,EAAIk+D,MAGjC,OAFAA,EAAKzH,YAAY2H,GAEV1/D,QAAQ8zB,IACb2kC,EAAM30D,KAAI,EAAEgxC,UAASv0C,MAAK+4C,cACxBomB,EAAc14B,MAAQ8N,EAAQ6qB,aAC9BD,EAAch6B,OAASoP,EAAQ8qB,cACfF,EAAcG,WAAW,MACjCC,UAAUvqB,GAAgBS,OAAOlB,GAAU,EAAG,GAE/CyjB,GAAiB,CAAC,CAACh4D,MAAKu0C,QAAS4qB,EAAepmB,YAAW,CAChEtI,MACAgkB,WACAC,kBAIH/0D,MAAK6/D,IACJP,EAAKlH,YAAYoH,GACV5J,GAAKiK,MAEb5/D,OAAM,KACLq/D,EAAKlH,YAAYoH,EAAc,GAErC,CZmHMM,CAAgBlpB,EAAY,CAC1ByoB,aAAcD,EAAqBhlB,SACnCh5C,MACA0vC,MACAgkB,SAAU2E,EACV1E,UAAW2E,EACXO,mBAGE8F,EAAoBd,EAA4Bj/D,MAAKo/D,GapK/D,SACExoB,GACAx1C,IAACA,EAAGi+D,aAAEA,EAAYvK,SAAEA,EAAQC,UAAEA,EAASkF,aAAEA,IAEzC,IAAK74D,EAAIk+D,KAAM,OAAOx/D,QAAQC,QAAQ,IAEtC,MAAMw/D,EAAkB,IAAIn8C,IAAI5hB,OAAOwT,KAAKqqD,IACtC9G,EAAQ3hB,EAAWxlC,QACvB,EAAE/Q,WAAUk/D,EAAgB1hD,IAAI,QAAUxd,IAAU45D,GAAiBA,EAAaK,QAAQ,QAAUj6D,MAGtG,OAAOP,QAAQ8zB,IACb2kC,EAAM30D,KAAI,EAAEgxC,UAASv0C,UACnB,MAAM2/D,EAAUprB,EAAgBqrB,gBAChC,OAAuC,IAAnCD,EAAOE,iBAAiBxiE,OAAqB,GAC1C,IAAIoC,SAAoBC,IAC7B,MAAMogE,EAAgB,IAAIC,cAAcJ,EAAQ,CAACK,SAAU,eAU3DF,EAAcG,iBAAiB,iBATJphE,IACzBihE,EAAcI,OACd3rB,EAAQvN,QACRnoC,EAAEsQ,KAAKopD,cAAc54D,MAAKnB,IACxB,MAAMk6D,EAAOlE,GAAW,CAAC9nD,KAAM7N,EAAEsQ,KAAKzC,KAAMlO,QAAOi2D,WAAUC,cAC3DgE,EAAa14D,IAAMA,EACrBN,EAAQg5D,EAAY,GACpB,GAE+D,CAACyH,MAAM,IAC1E5rB,EAAQ6rB,OACRN,EAAc/2D,QACdkzD,YAAW,IAAM6D,EAAcO,eAAe,IAAK,GACnD,KAEJ1gE,MAAK6/D,GAAiBjK,GAAKiK,IAC/B,CboIMc,CAAgB9pB,EAAY,CAC1BwoB,aAAcD,EAAqBhlB,SACnCh5C,MACA0vC,MACAgkB,SAAU2E,EACV1E,UAAW2E,EACXO,mBAKE2G,EAAuBnqB,EAAO7yC,KAAI,EAAEgxC,UAASv0C,SACjD09D,EAAcnpB,EAAQ7zC,gBAAkBV,KAEpCwgE,EAA6BrqB,EAAa5yC,KAAI,EAAEgxC,UAASv0C,SAC7D09D,EAAcnpB,EAAQ7zC,gBAAkBV,KA2E9C,IAA4BA,EAxExB,OAAOP,QAAQ8zB,IAAI,CACjBqrC,EACAC,EACAC,EACAY,KACGa,KACAC,IACO7gE,MAAK,SAAU8gE,GACzB,MAAM5mB,aAACA,EAAYE,SAAEA,GAAY0mB,EAAwB,GACnDC,EAAcD,EAAwB,GACtClqB,EAAakqB,EAAwB,GACrCjqB,EAAaiqB,EAAwB,GACrCE,EAAgBF,EAAwBp9D,MAAM,GAE9Cu9D,EAAUC,EAAoB,OAC9BC,EAAeD,EAAoB,4BACnCx4C,EAAWy4C,EAAe,8BAA8BA,WAAmB9sD,EAC3EkkD,EAkEZ,SAAyBne,GACvB,OAAO54C,OAAOwT,KAAKolC,GAAUx2C,KAAIw9D,GAC/B5/D,OAAOoR,OACL,CACEvS,IAAK+gE,EAAQ/uD,QAAQ,SAAU,KAEjC+nC,EAASgnB,KAGf,CA3EoBC,CAAgBjnB,GAAU72B,OAAOw9C,GAAax9C,OAAOqzB,GAAYrzB,OAAOszB,GAEhFyqB,EAAqB,GAErBC,EAAmC,GACzC,IAAK,MAAMxI,KAAQR,EACY,MAAzBQ,EAAK8D,iBAAoD,MAAzB9D,EAAK8D,iBACvC3iB,EAAat8C,KAAKm7D,EAAK14D,KACvBihE,EAAS1jE,KAAK,GAAGm7D,EAAK8D,mBAAmB9D,EAAK14D,QAE9CkhE,EAA0B3jE,KAAKm7D,GAInC,MAAMyI,EAA8B,CAClCprB,MACA/1C,IAAK29D,EACLiD,UACA/mB,aAAcA,EAAat2C,KAAKvD,GAAgBA,EAAIgS,QAAQ,SAAU,MACtEkmD,MAAOgJ,EACP9qB,OAAQuqB,EACRtqB,oBAGoBriC,IAAlB6pD,IACFsD,EAAStD,cAAgBA,QAGV7pD,IAAbqU,IACF84C,EAAS94C,SAAWA,GAGlBpoB,IAAY09D,IACdwD,EAASC,QAAUnhE,GAGrB,IACMq5D,I7KjOuBp3D,E6KiOKo3D,I7KhOCl3D,EAAmG,SAASA,IAAIA,EAAEA,GAAGA,EAAE,KAAK,mBAAmBA,EAAEkO,SAASlO,EAAEkO,SAAS,SAASlO,GAAG,GAAGA,EAAEi/D,gBAAgB,4BAA4Bj/D,EAAEqC,YAAY,IAAI,IAAI,IAAI3B,EAAEV,EAAEqC,cAAc3B,IAAIL,UAAUK,EAAE4B,aAAa,eAAe5B,EAAE4B,YAAYlB,KAAKV,EAAEA,EAAE6B,KAAKF,cAAc3B,EAAE6B,KAAK08D,gBAAgB,4BAA4B,MAAMj/D,GAAI,CAAA,GAAG,IAAvZA,EAAE3E,YAAY0D,OAAOoB,UAAUiC,eAAelB,KAAKlB,EAAE,WAAWA,EAAE1E,QAAQ0E,GACvHF,G6KgOF,CAAC,MAAOrC,GACPohE,EAAS1jE,KAAKsC,EAAIb,QACnB,C7KpOmB,IAASkD,EACME,E6KyOnC,OAJI6+D,EAAS5jE,OAAS,IACpB8jE,EAASF,SAAWA,GAGfE,CACT,IAEA,SAASN,EAAoBS,GAC3B,OAAOvgE,EAAIE,aAAeF,EAAIE,YAAYC,cAAgBH,EAAIE,YAAYC,aAAagD,aAAao9D,EACrG,CACF,CA3IM5D,CAAc38D,GAAKpB,MAAKrB,IAC7BmyC,EAAI,mBACJnyC,EAAOijE,cAAgB,sBAChBjjE,IAyIX,GCzPqC+D,OAAOL,G/KPZ,4B+KShC,SAAyB3D,GACvB,IACE,OAAOK,KAAKC,UAAUm6D,GAAQz6D,EAARy6D,CAAiBz6D,GACxC,CAAC,MAAOwB,GACP,OAAOnB,KAAKC,UAAU,CACpBG,OAAQ,QACRC,MAAOc,EAAIb,SAEd,CACH","x_google_ignoreList":[24,25,26,27,28,29,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168]}