@sparrowengg/integrations-templates-frontend 6.0.4 → 6.0.7

package/dist/es/node_modules/html-dom-parser/node_modules/htmlparser2/node_modules/entities/dist/commonjs/decode.js

@@ -1,521 +0,0 @@
-import { __exports as decode } from '../../../../../../../../_virtual/decode.js';
-import './generated/decode-data-html.js';
-import './generated/decode-data-xml.js';
-import './decode-codepoint.js';
-import { __exports as decodeDataHtml } from '../../../../../../../../_virtual/decode-data-html.js';
-import { __exports as decodeDataXml } from '../../../../../../../../_virtual/decode-data-xml.js';
-import { __exports as decodeCodepoint } from '../../../../../../../../_virtual/decode-codepoint.js';
-
-(function (exports$1) {
-	Object.defineProperty(exports$1, "__esModule", { value: true });
-	exports$1.fromCodePoint = exports$1.replaceCodePoint = exports$1.decodeCodePoint = exports$1.xmlDecodeTree = exports$1.htmlDecodeTree = exports$1.EntityDecoder = exports$1.DecodingMode = exports$1.BinTrieFlags = void 0;
-	exports$1.determineBranch = determineBranch;
-	exports$1.decodeHTML = decodeHTML;
-	exports$1.decodeHTMLAttribute = decodeHTMLAttribute;
-	exports$1.decodeHTMLStrict = decodeHTMLStrict;
-	exports$1.decodeXML = decodeXML;
-	const decode_data_html_js_1 = decodeDataHtml;
-	const decode_data_xml_js_1 = decodeDataXml;
-	const decode_codepoint_js_1 = decodeCodepoint;
-	var CharCodes;
-	(function (CharCodes) {
-	    CharCodes[CharCodes["NUM"] = 35] = "NUM";
-	    CharCodes[CharCodes["SEMI"] = 59] = "SEMI";
-	    CharCodes[CharCodes["EQUALS"] = 61] = "EQUALS";
-	    CharCodes[CharCodes["ZERO"] = 48] = "ZERO";
-	    CharCodes[CharCodes["NINE"] = 57] = "NINE";
-	    CharCodes[CharCodes["LOWER_A"] = 97] = "LOWER_A";
-	    CharCodes[CharCodes["LOWER_F"] = 102] = "LOWER_F";
-	    CharCodes[CharCodes["LOWER_X"] = 120] = "LOWER_X";
-	    CharCodes[CharCodes["LOWER_Z"] = 122] = "LOWER_Z";
-	    CharCodes[CharCodes["UPPER_A"] = 65] = "UPPER_A";
-	    CharCodes[CharCodes["UPPER_F"] = 70] = "UPPER_F";
-	    CharCodes[CharCodes["UPPER_Z"] = 90] = "UPPER_Z";
-	})(CharCodes || (CharCodes = {}));
-	/** Bit that needs to be set to convert an upper case ASCII character to lower case */
-	const TO_LOWER_BIT = 32;
-	var BinTrieFlags;
-	(function (BinTrieFlags) {
-	    BinTrieFlags[BinTrieFlags["VALUE_LENGTH"] = 49152] = "VALUE_LENGTH";
-	    BinTrieFlags[BinTrieFlags["BRANCH_LENGTH"] = 16256] = "BRANCH_LENGTH";
-	    BinTrieFlags[BinTrieFlags["JUMP_TABLE"] = 127] = "JUMP_TABLE";
-	})(BinTrieFlags || (exports$1.BinTrieFlags = BinTrieFlags = {}));
-	function isNumber(code) {
-	    return code >= CharCodes.ZERO && code <= CharCodes.NINE;
-	}
-	function isHexadecimalCharacter(code) {
-	    return ((code >= CharCodes.UPPER_A && code <= CharCodes.UPPER_F) ||
-	        (code >= CharCodes.LOWER_A && code <= CharCodes.LOWER_F));
-	}
-	function isAsciiAlphaNumeric(code) {
-	    return ((code >= CharCodes.UPPER_A && code <= CharCodes.UPPER_Z) ||
-	        (code >= CharCodes.LOWER_A && code <= CharCodes.LOWER_Z) ||
-	        isNumber(code));
-	}
-	/**
-	 * Checks if the given character is a valid end character for an entity in an attribute.
-	 *
-	 * Attribute values that aren't terminated properly aren't parsed, and shouldn't lead to a parser error.
-	 * See the example in https://html.spec.whatwg.org/multipage/parsing.html#named-character-reference-state
-	 */
-	function isEntityInAttributeInvalidEnd(code) {
-	    return code === CharCodes.EQUALS || isAsciiAlphaNumeric(code);
-	}
-	var EntityDecoderState;
-	(function (EntityDecoderState) {
-	    EntityDecoderState[EntityDecoderState["EntityStart"] = 0] = "EntityStart";
-	    EntityDecoderState[EntityDecoderState["NumericStart"] = 1] = "NumericStart";
-	    EntityDecoderState[EntityDecoderState["NumericDecimal"] = 2] = "NumericDecimal";
-	    EntityDecoderState[EntityDecoderState["NumericHex"] = 3] = "NumericHex";
-	    EntityDecoderState[EntityDecoderState["NamedEntity"] = 4] = "NamedEntity";
-	})(EntityDecoderState || (EntityDecoderState = {}));
-	var DecodingMode;
-	(function (DecodingMode) {
-	    /** Entities in text nodes that can end with any character. */
-	    DecodingMode[DecodingMode["Legacy"] = 0] = "Legacy";
-	    /** Only allow entities terminated with a semicolon. */
-	    DecodingMode[DecodingMode["Strict"] = 1] = "Strict";
-	    /** Entities in attributes have limitations on ending characters. */
-	    DecodingMode[DecodingMode["Attribute"] = 2] = "Attribute";
-	})(DecodingMode || (exports$1.DecodingMode = DecodingMode = {}));
-	/**
-	 * Token decoder with support of writing partial entities.
-	 */
-	class EntityDecoder {
-	    constructor(
-	    /** The tree used to decode entities. */
-	    decodeTree, 
-	    /**
-	     * The function that is called when a codepoint is decoded.
-	     *
-	     * For multi-byte named entities, this will be called multiple times,
-	     * with the second codepoint, and the same `consumed` value.
-	     *
-	     * @param codepoint The decoded codepoint.
-	     * @param consumed The number of bytes consumed by the decoder.
-	     */
-	    emitCodePoint, 
-	    /** An object that is used to produce errors. */
-	    errors) {
-	        this.decodeTree = decodeTree;
-	        this.emitCodePoint = emitCodePoint;
-	        this.errors = errors;
-	        /** The current state of the decoder. */
-	        this.state = EntityDecoderState.EntityStart;
-	        /** Characters that were consumed while parsing an entity. */
-	        this.consumed = 1;
-	        /**
-	         * The result of the entity.
-	         *
-	         * Either the result index of a numeric entity, or the codepoint of a
-	         * numeric entity.
-	         */
-	        this.result = 0;
-	        /** The current index in the decode tree. */
-	        this.treeIndex = 0;
-	        /** The number of characters that were consumed in excess. */
-	        this.excess = 1;
-	        /** The mode in which the decoder is operating. */
-	        this.decodeMode = DecodingMode.Strict;
-	    }
-	    /** Resets the instance to make it reusable. */
-	    startEntity(decodeMode) {
-	        this.decodeMode = decodeMode;
-	        this.state = EntityDecoderState.EntityStart;
-	        this.result = 0;
-	        this.treeIndex = 0;
-	        this.excess = 1;
-	        this.consumed = 1;
-	    }
-	    /**
-	     * Write an entity to the decoder. This can be called multiple times with partial entities.
-	     * If the entity is incomplete, the decoder will return -1.
-	     *
-	     * Mirrors the implementation of `getDecoder`, but with the ability to stop decoding if the
-	     * entity is incomplete, and resume when the next string is written.
-	     *
-	     * @param input The string containing the entity (or a continuation of the entity).
-	     * @param offset The offset at which the entity begins. Should be 0 if this is not the first call.
-	     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.
-	     */
-	    write(input, offset) {
-	        switch (this.state) {
-	            case EntityDecoderState.EntityStart: {
-	                if (input.charCodeAt(offset) === CharCodes.NUM) {
-	                    this.state = EntityDecoderState.NumericStart;
-	                    this.consumed += 1;
-	                    return this.stateNumericStart(input, offset + 1);
-	                }
-	                this.state = EntityDecoderState.NamedEntity;
-	                return this.stateNamedEntity(input, offset);
-	            }
-	            case EntityDecoderState.NumericStart: {
-	                return this.stateNumericStart(input, offset);
-	            }
-	            case EntityDecoderState.NumericDecimal: {
-	                return this.stateNumericDecimal(input, offset);
-	            }
-	            case EntityDecoderState.NumericHex: {
-	                return this.stateNumericHex(input, offset);
-	            }
-	            case EntityDecoderState.NamedEntity: {
-	                return this.stateNamedEntity(input, offset);
-	            }
-	        }
-	    }
-	    /**
-	     * Switches between the numeric decimal and hexadecimal states.
-	     *
-	     * Equivalent to the `Numeric character reference state` in the HTML spec.
-	     *
-	     * @param input The string containing the entity (or a continuation of the entity).
-	     * @param offset The current offset.
-	     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.
-	     */
-	    stateNumericStart(input, offset) {
-	        if (offset >= input.length) {
-	            return -1;
-	        }
-	        if ((input.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) {
-	            this.state = EntityDecoderState.NumericHex;
-	            this.consumed += 1;
-	            return this.stateNumericHex(input, offset + 1);
-	        }
-	        this.state = EntityDecoderState.NumericDecimal;
-	        return this.stateNumericDecimal(input, offset);
-	    }
-	    addToNumericResult(input, start, end, base) {
-	        if (start !== end) {
-	            const digitCount = end - start;
-	            this.result =
-	                this.result * Math.pow(base, digitCount) +
-	                    Number.parseInt(input.substr(start, digitCount), base);
-	            this.consumed += digitCount;
-	        }
-	    }
-	    /**
-	     * Parses a hexadecimal numeric entity.
-	     *
-	     * Equivalent to the `Hexademical character reference state` in the HTML spec.
-	     *
-	     * @param input The string containing the entity (or a continuation of the entity).
-	     * @param offset The current offset.
-	     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.
-	     */
-	    stateNumericHex(input, offset) {
-	        const startIndex = offset;
-	        while (offset < input.length) {
-	            const char = input.charCodeAt(offset);
-	            if (isNumber(char) || isHexadecimalCharacter(char)) {
-	                offset += 1;
-	            }
-	            else {
-	                this.addToNumericResult(input, startIndex, offset, 16);
-	                return this.emitNumericEntity(char, 3);
-	            }
-	        }
-	        this.addToNumericResult(input, startIndex, offset, 16);
-	        return -1;
-	    }
-	    /**
-	     * Parses a decimal numeric entity.
-	     *
-	     * Equivalent to the `Decimal character reference state` in the HTML spec.
-	     *
-	     * @param input The string containing the entity (or a continuation of the entity).
-	     * @param offset The current offset.
-	     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.
-	     */
-	    stateNumericDecimal(input, offset) {
-	        const startIndex = offset;
-	        while (offset < input.length) {
-	            const char = input.charCodeAt(offset);
-	            if (isNumber(char)) {
-	                offset += 1;
-	            }
-	            else {
-	                this.addToNumericResult(input, startIndex, offset, 10);
-	                return this.emitNumericEntity(char, 2);
-	            }
-	        }
-	        this.addToNumericResult(input, startIndex, offset, 10);
-	        return -1;
-	    }
-	    /**
-	     * Validate and emit a numeric entity.
-	     *
-	     * Implements the logic from the `Hexademical character reference start
-	     * state` and `Numeric character reference end state` in the HTML spec.
-	     *
-	     * @param lastCp The last code point of the entity. Used to see if the
-	     *               entity was terminated with a semicolon.
-	     * @param expectedLength The minimum number of characters that should be
-	     *                       consumed. Used to validate that at least one digit
-	     *                       was consumed.
-	     * @returns The number of characters that were consumed.
-	     */
-	    emitNumericEntity(lastCp, expectedLength) {
-	        var _a;
-	        // Ensure we consumed at least one digit.
-	        if (this.consumed <= expectedLength) {
-	            (_a = this.errors) === null || _a === void 0 ? void 0 : _a.absenceOfDigitsInNumericCharacterReference(this.consumed);
-	            return 0;
-	        }
-	        // Figure out if this is a legit end of the entity
-	        if (lastCp === CharCodes.SEMI) {
-	            this.consumed += 1;
-	        }
-	        else if (this.decodeMode === DecodingMode.Strict) {
-	            return 0;
-	        }
-	        this.emitCodePoint((0, decode_codepoint_js_1.replaceCodePoint)(this.result), this.consumed);
-	        if (this.errors) {
-	            if (lastCp !== CharCodes.SEMI) {
-	                this.errors.missingSemicolonAfterCharacterReference();
-	            }
-	            this.errors.validateNumericCharacterReference(this.result);
-	        }
-	        return this.consumed;
-	    }
-	    /**
-	     * Parses a named entity.
-	     *
-	     * Equivalent to the `Named character reference state` in the HTML spec.
-	     *
-	     * @param input The string containing the entity (or a continuation of the entity).
-	     * @param offset The current offset.
-	     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.
-	     */
-	    stateNamedEntity(input, offset) {
-	        const { decodeTree } = this;
-	        let current = decodeTree[this.treeIndex];
-	        // The mask is the number of bytes of the value, including the current byte.
-	        let valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;
-	        for (; offset < input.length; offset++, this.excess++) {
-	            const char = input.charCodeAt(offset);
-	            this.treeIndex = determineBranch(decodeTree, current, this.treeIndex + Math.max(1, valueLength), char);
-	            if (this.treeIndex < 0) {
-	                return this.result === 0 ||
-	                    // If we are parsing an attribute
-	                    (this.decodeMode === DecodingMode.Attribute &&
-	                        // We shouldn't have consumed any characters after the entity,
-	                        (valueLength === 0 ||
-	                            // And there should be no invalid characters.
-	                            isEntityInAttributeInvalidEnd(char)))
-	                    ? 0
-	                    : this.emitNotTerminatedNamedEntity();
-	            }
-	            current = decodeTree[this.treeIndex];
-	            valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;
-	            // If the branch is a value, store it and continue
-	            if (valueLength !== 0) {
-	                // If the entity is terminated by a semicolon, we are done.
-	                if (char === CharCodes.SEMI) {
-	                    return this.emitNamedEntityData(this.treeIndex, valueLength, this.consumed + this.excess);
-	                }
-	                // If we encounter a non-terminated (legacy) entity while parsing strictly, then ignore it.
-	                if (this.decodeMode !== DecodingMode.Strict) {
-	                    this.result = this.treeIndex;
-	                    this.consumed += this.excess;
-	                    this.excess = 0;
-	                }
-	            }
-	        }
-	        return -1;
-	    }
-	    /**
-	     * Emit a named entity that was not terminated with a semicolon.
-	     *
-	     * @returns The number of characters consumed.
-	     */
-	    emitNotTerminatedNamedEntity() {
-	        var _a;
-	        const { result, decodeTree } = this;
-	        const valueLength = (decodeTree[result] & BinTrieFlags.VALUE_LENGTH) >> 14;
-	        this.emitNamedEntityData(result, valueLength, this.consumed);
-	        (_a = this.errors) === null || _a === void 0 ? void 0 : _a.missingSemicolonAfterCharacterReference();
-	        return this.consumed;
-	    }
-	    /**
-	     * Emit a named entity.
-	     *
-	     * @param result The index of the entity in the decode tree.
-	     * @param valueLength The number of bytes in the entity.
-	     * @param consumed The number of characters consumed.
-	     *
-	     * @returns The number of characters consumed.
-	     */
-	    emitNamedEntityData(result, valueLength, consumed) {
-	        const { decodeTree } = this;
-	        this.emitCodePoint(valueLength === 1
-	            ? decodeTree[result] & ~BinTrieFlags.VALUE_LENGTH
-	            : decodeTree[result + 1], consumed);
-	        if (valueLength === 3) {
-	            // For multi-byte values, we need to emit the second byte.
-	            this.emitCodePoint(decodeTree[result + 2], consumed);
-	        }
-	        return consumed;
-	    }
-	    /**
-	     * Signal to the parser that the end of the input was reached.
-	     *
-	     * Remaining data will be emitted and relevant errors will be produced.
-	     *
-	     * @returns The number of characters consumed.
-	     */
-	    end() {
-	        var _a;
-	        switch (this.state) {
-	            case EntityDecoderState.NamedEntity: {
-	                // Emit a named entity if we have one.
-	                return this.result !== 0 &&
-	                    (this.decodeMode !== DecodingMode.Attribute ||
-	                        this.result === this.treeIndex)
-	                    ? this.emitNotTerminatedNamedEntity()
-	                    : 0;
-	            }
-	            // Otherwise, emit a numeric entity if we have one.
-	            case EntityDecoderState.NumericDecimal: {
-	                return this.emitNumericEntity(0, 2);
-	            }
-	            case EntityDecoderState.NumericHex: {
-	                return this.emitNumericEntity(0, 3);
-	            }
-	            case EntityDecoderState.NumericStart: {
-	                (_a = this.errors) === null || _a === void 0 ? void 0 : _a.absenceOfDigitsInNumericCharacterReference(this.consumed);
-	                return 0;
-	            }
-	            case EntityDecoderState.EntityStart: {
-	                // Return 0 if we have no entity.
-	                return 0;
-	            }
-	        }
-	    }
-	}
-	exports$1.EntityDecoder = EntityDecoder;
-	/**
-	 * Creates a function that decodes entities in a string.
-	 *
-	 * @param decodeTree The decode tree.
-	 * @returns A function that decodes entities in a string.
-	 */
-	function getDecoder(decodeTree) {
-	    let returnValue = "";
-	    const decoder = new EntityDecoder(decodeTree, (data) => (returnValue += (0, decode_codepoint_js_1.fromCodePoint)(data)));
-	    return function decodeWithTrie(input, decodeMode) {
-	        let lastIndex = 0;
-	        let offset = 0;
-	        while ((offset = input.indexOf("&", offset)) >= 0) {
-	            returnValue += input.slice(lastIndex, offset);
-	            decoder.startEntity(decodeMode);
-	            const length = decoder.write(input, 
-	            // Skip the "&"
-	            offset + 1);
-	            if (length < 0) {
-	                lastIndex = offset + decoder.end();
-	                break;
-	            }
-	            lastIndex = offset + length;
-	            // If `length` is 0, skip the current `&` and continue.
-	            offset = length === 0 ? lastIndex + 1 : lastIndex;
-	        }
-	        const result = returnValue + input.slice(lastIndex);
-	        // Make sure we don't keep a reference to the final string.
-	        returnValue = "";
-	        return result;
-	    };
-	}
-	/**
-	 * Determines the branch of the current node that is taken given the current
-	 * character. This function is used to traverse the trie.
-	 *
-	 * @param decodeTree The trie.
-	 * @param current The current node.
-	 * @param nodeIdx The index right after the current node and its value.
-	 * @param char The current character.
-	 * @returns The index of the next node, or -1 if no branch is taken.
-	 */
-	function determineBranch(decodeTree, current, nodeIndex, char) {
-	    const branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;
-	    const jumpOffset = current & BinTrieFlags.JUMP_TABLE;
-	    // Case 1: Single branch encoded in jump offset
-	    if (branchCount === 0) {
-	        return jumpOffset !== 0 && char === jumpOffset ? nodeIndex : -1;
-	    }
-	    // Case 2: Multiple branches encoded in jump table
-	    if (jumpOffset) {
-	        const value = char - jumpOffset;
-	        return value < 0 || value >= branchCount
-	            ? -1
-	            : decodeTree[nodeIndex + value] - 1;
-	    }
-	    // Case 3: Multiple branches encoded in dictionary
-	    // Binary search for the character.
-	    let lo = nodeIndex;
-	    let hi = lo + branchCount - 1;
-	    while (lo <= hi) {
-	        const mid = (lo + hi) >>> 1;
-	        const midValue = decodeTree[mid];
-	        if (midValue < char) {
-	            lo = mid + 1;
-	        }
-	        else if (midValue > char) {
-	            hi = mid - 1;
-	        }
-	        else {
-	            return decodeTree[mid + branchCount];
-	        }
-	    }
-	    return -1;
-	}
-	const htmlDecoder = /* #__PURE__ */ getDecoder(decode_data_html_js_1.htmlDecodeTree);
-	const xmlDecoder = /* #__PURE__ */ getDecoder(decode_data_xml_js_1.xmlDecodeTree);
-	/**
-	 * Decodes an HTML string.
-	 *
-	 * @param htmlString The string to decode.
-	 * @param mode The decoding mode.
-	 * @returns The decoded string.
-	 */
-	function decodeHTML(htmlString, mode = DecodingMode.Legacy) {
-	    return htmlDecoder(htmlString, mode);
-	}
-	/**
-	 * Decodes an HTML string in an attribute.
-	 *
-	 * @param htmlAttribute The string to decode.
-	 * @returns The decoded string.
-	 */
-	function decodeHTMLAttribute(htmlAttribute) {
-	    return htmlDecoder(htmlAttribute, DecodingMode.Attribute);
-	}
-	/**
-	 * Decodes an HTML string, requiring all entities to be terminated by a semicolon.
-	 *
-	 * @param htmlString The string to decode.
-	 * @returns The decoded string.
-	 */
-	function decodeHTMLStrict(htmlString) {
-	    return htmlDecoder(htmlString, DecodingMode.Strict);
-	}
-	/**
-	 * Decodes an XML string, requiring all entities to be terminated by a semicolon.
-	 *
-	 * @param xmlString The string to decode.
-	 * @returns The decoded string.
-	 */
-	function decodeXML(xmlString) {
-	    return xmlDecoder(xmlString, DecodingMode.Strict);
-	}
-	// Re-export for use by eg. htmlparser2
-	var decode_data_html_js_2 = decodeDataHtml;
-	Object.defineProperty(exports$1, "htmlDecodeTree", { enumerable: true, get: function () { return decode_data_html_js_2.htmlDecodeTree; } });
-	var decode_data_xml_js_2 = decodeDataXml;
-	Object.defineProperty(exports$1, "xmlDecodeTree", { enumerable: true, get: function () { return decode_data_xml_js_2.xmlDecodeTree; } });
-	var decode_codepoint_js_2 = decodeCodepoint;
-	Object.defineProperty(exports$1, "decodeCodePoint", { enumerable: true, get: function () { return decode_codepoint_js_2.decodeCodePoint; } });
-	Object.defineProperty(exports$1, "replaceCodePoint", { enumerable: true, get: function () { return decode_codepoint_js_2.replaceCodePoint; } });
-	Object.defineProperty(exports$1, "fromCodePoint", { enumerable: true, get: function () { return decode_codepoint_js_2.fromCodePoint; } });
-	
-} (decode));
-//# sourceMappingURL=decode.js.map

package/dist/es/node_modules/html-dom-parser/node_modules/htmlparser2/node_modules/entities/dist/commonjs/decode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"decode.js","sources":["../../../../../../../../../../../../node_modules/html-dom-parser/node_modules/htmlparser2/node_modules/entities/dist/commonjs/decode.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.fromCodePoint = exports.replaceCodePoint = exports.decodeCodePoint = exports.xmlDecodeTree = exports.htmlDecodeTree = exports.EntityDecoder = exports.DecodingMode = exports.BinTrieFlags = void 0;\nexports.determineBranch = determineBranch;\nexports.decodeHTML = decodeHTML;\nexports.decodeHTMLAttribute = decodeHTMLAttribute;\nexports.decodeHTMLStrict = decodeHTMLStrict;\nexports.decodeXML = decodeXML;\nconst decode_data_html_js_1 = require(\"./generated/decode-data-html.js\");\nconst decode_data_xml_js_1 = require(\"./generated/decode-data-xml.js\");\nconst decode_codepoint_js_1 = require(\"./decode-codepoint.js\");\nvar CharCodes;\n(function (CharCodes) {\n    CharCodes[CharCodes[\"NUM\"] = 35] = \"NUM\";\n    CharCodes[CharCodes[\"SEMI\"] = 59] = \"SEMI\";\n    CharCodes[CharCodes[\"EQUALS\"] = 61] = \"EQUALS\";\n    CharCodes[CharCodes[\"ZERO\"] = 48] = \"ZERO\";\n    CharCodes[CharCodes[\"NINE\"] = 57] = \"NINE\";\n    CharCodes[CharCodes[\"LOWER_A\"] = 97] = \"LOWER_A\";\n    CharCodes[CharCodes[\"LOWER_F\"] = 102] = \"LOWER_F\";\n    CharCodes[CharCodes[\"LOWER_X\"] = 120] = \"LOWER_X\";\n    CharCodes[CharCodes[\"LOWER_Z\"] = 122] = \"LOWER_Z\";\n    CharCodes[CharCodes[\"UPPER_A\"] = 65] = \"UPPER_A\";\n    CharCodes[CharCodes[\"UPPER_F\"] = 70] = \"UPPER_F\";\n    CharCodes[CharCodes[\"UPPER_Z\"] = 90] = \"UPPER_Z\";\n})(CharCodes || (CharCodes = {}));\n/** Bit that needs to be set to convert an upper case ASCII character to lower case */\nconst TO_LOWER_BIT = 32;\nvar BinTrieFlags;\n(function (BinTrieFlags) {\n    BinTrieFlags[BinTrieFlags[\"VALUE_LENGTH\"] = 49152] = \"VALUE_LENGTH\";\n    BinTrieFlags[BinTrieFlags[\"BRANCH_LENGTH\"] = 16256] = \"BRANCH_LENGTH\";\n    BinTrieFlags[BinTrieFlags[\"JUMP_TABLE\"] = 127] = \"JUMP_TABLE\";\n})(BinTrieFlags || (exports.BinTrieFlags = BinTrieFlags = {}));\nfunction isNumber(code) {\n    return code >= CharCodes.ZERO && code <= CharCodes.NINE;\n}\nfunction isHexadecimalCharacter(code) {\n    return ((code >= CharCodes.UPPER_A && code <= CharCodes.UPPER_F) ||\n        (code >= CharCodes.LOWER_A && code <= CharCodes.LOWER_F));\n}\nfunction isAsciiAlphaNumeric(code) {\n    return ((code >= CharCodes.UPPER_A && code <= CharCodes.UPPER_Z) ||\n        (code >= CharCodes.LOWER_A && code <= CharCodes.LOWER_Z) ||\n        isNumber(code));\n}\n/**\n * Checks if the given character is a valid end character for an entity in an attribute.\n *\n * Attribute values that aren't terminated properly aren't parsed, and shouldn't lead to a parser error.\n * See the example in https://html.spec.whatwg.org/multipage/parsing.html#named-character-reference-state\n */\nfunction isEntityInAttributeInvalidEnd(code) {\n    return code === CharCodes.EQUALS || isAsciiAlphaNumeric(code);\n}\nvar EntityDecoderState;\n(function (EntityDecoderState) {\n    EntityDecoderState[EntityDecoderState[\"EntityStart\"] = 0] = \"EntityStart\";\n    EntityDecoderState[EntityDecoderState[\"NumericStart\"] = 1] = \"NumericStart\";\n    EntityDecoderState[EntityDecoderState[\"NumericDecimal\"] = 2] = \"NumericDecimal\";\n    EntityDecoderState[EntityDecoderState[\"NumericHex\"] = 3] = \"NumericHex\";\n    EntityDecoderState[EntityDecoderState[\"NamedEntity\"] = 4] = \"NamedEntity\";\n})(EntityDecoderState || (EntityDecoderState = {}));\nvar DecodingMode;\n(function (DecodingMode) {\n    /** Entities in text nodes that can end with any character. */\n    DecodingMode[DecodingMode[\"Legacy\"] = 0] = \"Legacy\";\n    /** Only allow entities terminated with a semicolon. */\n    DecodingMode[DecodingMode[\"Strict\"] = 1] = \"Strict\";\n    /** Entities in attributes have limitations on ending characters. */\n    DecodingMode[DecodingMode[\"Attribute\"] = 2] = \"Attribute\";\n})(DecodingMode || (exports.DecodingMode = DecodingMode = {}));\n/**\n * Token decoder with support of writing partial entities.\n */\nclass EntityDecoder {\n    constructor(\n    /** The tree used to decode entities. */\n    decodeTree, \n    /**\n     * The function that is called when a codepoint is decoded.\n     *\n     * For multi-byte named entities, this will be called multiple times,\n     * with the second codepoint, and the same `consumed` value.\n     *\n     * @param codepoint The decoded codepoint.\n     * @param consumed The number of bytes consumed by the decoder.\n     */\n    emitCodePoint, \n    /** An object that is used to produce errors. */\n    errors) {\n        this.decodeTree = decodeTree;\n        this.emitCodePoint = emitCodePoint;\n        this.errors = errors;\n        /** The current state of the decoder. */\n        this.state = EntityDecoderState.EntityStart;\n        /** Characters that were consumed while parsing an entity. */\n        this.consumed = 1;\n        /**\n         * The result of the entity.\n         *\n         * Either the result index of a numeric entity, or the codepoint of a\n         * numeric entity.\n         */\n        this.result = 0;\n        /** The current index in the decode tree. */\n        this.treeIndex = 0;\n        /** The number of characters that were consumed in excess. */\n        this.excess = 1;\n        /** The mode in which the decoder is operating. */\n        this.decodeMode = DecodingMode.Strict;\n    }\n    /** Resets the instance to make it reusable. */\n    startEntity(decodeMode) {\n        this.decodeMode = decodeMode;\n        this.state = EntityDecoderState.EntityStart;\n        this.result = 0;\n        this.treeIndex = 0;\n        this.excess = 1;\n        this.consumed = 1;\n    }\n    /**\n     * Write an entity to the decoder. This can be called multiple times with partial entities.\n     * If the entity is incomplete, the decoder will return -1.\n     *\n     * Mirrors the implementation of `getDecoder`, but with the ability to stop decoding if the\n     * entity is incomplete, and resume when the next string is written.\n     *\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The offset at which the entity begins. Should be 0 if this is not the first call.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    write(input, offset) {\n        switch (this.state) {\n            case EntityDecoderState.EntityStart: {\n                if (input.charCodeAt(offset) === CharCodes.NUM) {\n                    this.state = EntityDecoderState.NumericStart;\n                    this.consumed += 1;\n                    return this.stateNumericStart(input, offset + 1);\n                }\n                this.state = EntityDecoderState.NamedEntity;\n                return this.stateNamedEntity(input, offset);\n            }\n            case EntityDecoderState.NumericStart: {\n                return this.stateNumericStart(input, offset);\n            }\n            case EntityDecoderState.NumericDecimal: {\n                return this.stateNumericDecimal(input, offset);\n            }\n            case EntityDecoderState.NumericHex: {\n                return this.stateNumericHex(input, offset);\n            }\n            case EntityDecoderState.NamedEntity: {\n                return this.stateNamedEntity(input, offset);\n            }\n        }\n    }\n    /**\n     * Switches between the numeric decimal and hexadecimal states.\n     *\n     * Equivalent to the `Numeric character reference state` in the HTML spec.\n     *\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    stateNumericStart(input, offset) {\n        if (offset >= input.length) {\n            return -1;\n        }\n        if ((input.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) {\n            this.state = EntityDecoderState.NumericHex;\n            this.consumed += 1;\n            return this.stateNumericHex(input, offset + 1);\n        }\n        this.state = EntityDecoderState.NumericDecimal;\n        return this.stateNumericDecimal(input, offset);\n    }\n    addToNumericResult(input, start, end, base) {\n        if (start !== end) {\n            const digitCount = end - start;\n            this.result =\n                this.result * Math.pow(base, digitCount) +\n                    Number.parseInt(input.substr(start, digitCount), base);\n            this.consumed += digitCount;\n        }\n    }\n    /**\n     * Parses a hexadecimal numeric entity.\n     *\n     * Equivalent to the `Hexademical character reference state` in the HTML spec.\n     *\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    stateNumericHex(input, offset) {\n        const startIndex = offset;\n        while (offset < input.length) {\n            const char = input.charCodeAt(offset);\n            if (isNumber(char) || isHexadecimalCharacter(char)) {\n                offset += 1;\n            }\n            else {\n                this.addToNumericResult(input, startIndex, offset, 16);\n                return this.emitNumericEntity(char, 3);\n            }\n        }\n        this.addToNumericResult(input, startIndex, offset, 16);\n        return -1;\n    }\n    /**\n     * Parses a decimal numeric entity.\n     *\n     * Equivalent to the `Decimal character reference state` in the HTML spec.\n     *\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    stateNumericDecimal(input, offset) {\n        const startIndex = offset;\n        while (offset < input.length) {\n            const char = input.charCodeAt(offset);\n            if (isNumber(char)) {\n                offset += 1;\n            }\n            else {\n                this.addToNumericResult(input, startIndex, offset, 10);\n                return this.emitNumericEntity(char, 2);\n            }\n        }\n        this.addToNumericResult(input, startIndex, offset, 10);\n        return -1;\n    }\n    /**\n     * Validate and emit a numeric entity.\n     *\n     * Implements the logic from the `Hexademical character reference start\n     * state` and `Numeric character reference end state` in the HTML spec.\n     *\n     * @param lastCp The last code point of the entity. Used to see if the\n     *               entity was terminated with a semicolon.\n     * @param expectedLength The minimum number of characters that should be\n     *                       consumed. Used to validate that at least one digit\n     *                       was consumed.\n     * @returns The number of characters that were consumed.\n     */\n    emitNumericEntity(lastCp, expectedLength) {\n        var _a;\n        // Ensure we consumed at least one digit.\n        if (this.consumed <= expectedLength) {\n            (_a = this.errors) === null || _a === void 0 ? void 0 : _a.absenceOfDigitsInNumericCharacterReference(this.consumed);\n            return 0;\n        }\n        // Figure out if this is a legit end of the entity\n        if (lastCp === CharCodes.SEMI) {\n            this.consumed += 1;\n        }\n        else if (this.decodeMode === DecodingMode.Strict) {\n            return 0;\n        }\n        this.emitCodePoint((0, decode_codepoint_js_1.replaceCodePoint)(this.result), this.consumed);\n        if (this.errors) {\n            if (lastCp !== CharCodes.SEMI) {\n                this.errors.missingSemicolonAfterCharacterReference();\n            }\n            this.errors.validateNumericCharacterReference(this.result);\n        }\n        return this.consumed;\n    }\n    /**\n     * Parses a named entity.\n     *\n     * Equivalent to the `Named character reference state` in the HTML spec.\n     *\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    stateNamedEntity(input, offset) {\n        const { decodeTree } = this;\n        let current = decodeTree[this.treeIndex];\n        // The mask is the number of bytes of the value, including the current byte.\n        let valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;\n        for (; offset < input.length; offset++, this.excess++) {\n            const char = input.charCodeAt(offset);\n            this.treeIndex = determineBranch(decodeTree, current, this.treeIndex + Math.max(1, valueLength), char);\n            if (this.treeIndex < 0) {\n                return this.result === 0 ||\n                    // If we are parsing an attribute\n                    (this.decodeMode === DecodingMode.Attribute &&\n                        // We shouldn't have consumed any characters after the entity,\n                        (valueLength === 0 ||\n                            // And there should be no invalid characters.\n                            isEntityInAttributeInvalidEnd(char)))\n                    ? 0\n                    : this.emitNotTerminatedNamedEntity();\n            }\n            current = decodeTree[this.treeIndex];\n            valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;\n            // If the branch is a value, store it and continue\n            if (valueLength !== 0) {\n                // If the entity is terminated by a semicolon, we are done.\n                if (char === CharCodes.SEMI) {\n                    return this.emitNamedEntityData(this.treeIndex, valueLength, this.consumed + this.excess);\n                }\n                // If we encounter a non-terminated (legacy) entity while parsing strictly, then ignore it.\n                if (this.decodeMode !== DecodingMode.Strict) {\n                    this.result = this.treeIndex;\n                    this.consumed += this.excess;\n                    this.excess = 0;\n                }\n            }\n        }\n        return -1;\n    }\n    /**\n     * Emit a named entity that was not terminated with a semicolon.\n     *\n     * @returns The number of characters consumed.\n     */\n    emitNotTerminatedNamedEntity() {\n        var _a;\n        const { result, decodeTree } = this;\n        const valueLength = (decodeTree[result] & BinTrieFlags.VALUE_LENGTH) >> 14;\n        this.emitNamedEntityData(result, valueLength, this.consumed);\n        (_a = this.errors) === null || _a === void 0 ? void 0 : _a.missingSemicolonAfterCharacterReference();\n        return this.consumed;\n    }\n    /**\n     * Emit a named entity.\n     *\n     * @param result The index of the entity in the decode tree.\n     * @param valueLength The number of bytes in the entity.\n     * @param consumed The number of characters consumed.\n     *\n     * @returns The number of characters consumed.\n     */\n    emitNamedEntityData(result, valueLength, consumed) {\n        const { decodeTree } = this;\n        this.emitCodePoint(valueLength === 1\n            ? decodeTree[result] & ~BinTrieFlags.VALUE_LENGTH\n            : decodeTree[result + 1], consumed);\n        if (valueLength === 3) {\n            // For multi-byte values, we need to emit the second byte.\n            this.emitCodePoint(decodeTree[result + 2], consumed);\n        }\n        return consumed;\n    }\n    /**\n     * Signal to the parser that the end of the input was reached.\n     *\n     * Remaining data will be emitted and relevant errors will be produced.\n     *\n     * @returns The number of characters consumed.\n     */\n    end() {\n        var _a;\n        switch (this.state) {\n            case EntityDecoderState.NamedEntity: {\n                // Emit a named entity if we have one.\n                return this.result !== 0 &&\n                    (this.decodeMode !== DecodingMode.Attribute ||\n                        this.result === this.treeIndex)\n                    ? this.emitNotTerminatedNamedEntity()\n                    : 0;\n            }\n            // Otherwise, emit a numeric entity if we have one.\n            case EntityDecoderState.NumericDecimal: {\n                return this.emitNumericEntity(0, 2);\n            }\n            case EntityDecoderState.NumericHex: {\n                return this.emitNumericEntity(0, 3);\n            }\n            case EntityDecoderState.NumericStart: {\n                (_a = this.errors) === null || _a === void 0 ? void 0 : _a.absenceOfDigitsInNumericCharacterReference(this.consumed);\n                return 0;\n            }\n            case EntityDecoderState.EntityStart: {\n                // Return 0 if we have no entity.\n                return 0;\n            }\n        }\n    }\n}\nexports.EntityDecoder = EntityDecoder;\n/**\n * Creates a function that decodes entities in a string.\n *\n * @param decodeTree The decode tree.\n * @returns A function that decodes entities in a string.\n */\nfunction getDecoder(decodeTree) {\n    let returnValue = \"\";\n    const decoder = new EntityDecoder(decodeTree, (data) => (returnValue += (0, decode_codepoint_js_1.fromCodePoint)(data)));\n    return function decodeWithTrie(input, decodeMode) {\n        let lastIndex = 0;\n        let offset = 0;\n        while ((offset = input.indexOf(\"&\", offset)) >= 0) {\n            returnValue += input.slice(lastIndex, offset);\n            decoder.startEntity(decodeMode);\n            const length = decoder.write(input, \n            // Skip the \"&\"\n            offset + 1);\n            if (length < 0) {\n                lastIndex = offset + decoder.end();\n                break;\n            }\n            lastIndex = offset + length;\n            // If `length` is 0, skip the current `&` and continue.\n            offset = length === 0 ? lastIndex + 1 : lastIndex;\n        }\n        const result = returnValue + input.slice(lastIndex);\n        // Make sure we don't keep a reference to the final string.\n        returnValue = \"\";\n        return result;\n    };\n}\n/**\n * Determines the branch of the current node that is taken given the current\n * character. This function is used to traverse the trie.\n *\n * @param decodeTree The trie.\n * @param current The current node.\n * @param nodeIdx The index right after the current node and its value.\n * @param char The current character.\n * @returns The index of the next node, or -1 if no branch is taken.\n */\nfunction determineBranch(decodeTree, current, nodeIndex, char) {\n    const branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;\n    const jumpOffset = current & BinTrieFlags.JUMP_TABLE;\n    // Case 1: Single branch encoded in jump offset\n    if (branchCount === 0) {\n        return jumpOffset !== 0 && char === jumpOffset ? nodeIndex : -1;\n    }\n    // Case 2: Multiple branches encoded in jump table\n    if (jumpOffset) {\n        const value = char - jumpOffset;\n        return value < 0 || value >= branchCount\n            ? -1\n            : decodeTree[nodeIndex + value] - 1;\n    }\n    // Case 3: Multiple branches encoded in dictionary\n    // Binary search for the character.\n    let lo = nodeIndex;\n    let hi = lo + branchCount - 1;\n    while (lo <= hi) {\n        const mid = (lo + hi) >>> 1;\n        const midValue = decodeTree[mid];\n        if (midValue < char) {\n            lo = mid + 1;\n        }\n        else if (midValue > char) {\n            hi = mid - 1;\n        }\n        else {\n            return decodeTree[mid + branchCount];\n        }\n    }\n    return -1;\n}\nconst htmlDecoder = /* #__PURE__ */ getDecoder(decode_data_html_js_1.htmlDecodeTree);\nconst xmlDecoder = /* #__PURE__ */ getDecoder(decode_data_xml_js_1.xmlDecodeTree);\n/**\n * Decodes an HTML string.\n *\n * @param htmlString The string to decode.\n * @param mode The decoding mode.\n * @returns The decoded string.\n */\nfunction decodeHTML(htmlString, mode = DecodingMode.Legacy) {\n    return htmlDecoder(htmlString, mode);\n}\n/**\n * Decodes an HTML string in an attribute.\n *\n * @param htmlAttribute The string to decode.\n * @returns The decoded string.\n */\nfunction decodeHTMLAttribute(htmlAttribute) {\n    return htmlDecoder(htmlAttribute, DecodingMode.Attribute);\n}\n/**\n * Decodes an HTML string, requiring all entities to be terminated by a semicolon.\n *\n * @param htmlString The string to decode.\n * @returns The decoded string.\n */\nfunction decodeHTMLStrict(htmlString) {\n    return htmlDecoder(htmlString, DecodingMode.Strict);\n}\n/**\n * Decodes an XML string, requiring all entities to be terminated by a semicolon.\n *\n * @param xmlString The string to decode.\n * @returns The decoded string.\n */\nfunction decodeXML(xmlString) {\n    return xmlDecoder(xmlString, DecodingMode.Strict);\n}\n// Re-export for use by eg. htmlparser2\nvar decode_data_html_js_2 = require(\"./generated/decode-data-html.js\");\nObject.defineProperty(exports, \"htmlDecodeTree\", { enumerable: true, get: function () { return decode_data_html_js_2.htmlDecodeTree; } });\nvar decode_data_xml_js_2 = require(\"./generated/decode-data-xml.js\");\nObject.defineProperty(exports, \"xmlDecodeTree\", { enumerable: true, get: function () { return decode_data_xml_js_2.xmlDecodeTree; } });\nvar decode_codepoint_js_2 = require(\"./decode-codepoint.js\");\nObject.defineProperty(exports, \"decodeCodePoint\", { enumerable: true, get: function () { return decode_codepoint_js_2.decodeCodePoint; } });\nObject.defineProperty(exports, \"replaceCodePoint\", { enumerable: true, get: function () { return decode_codepoint_js_2.replaceCodePoint; } });\nObject.defineProperty(exports, \"fromCodePoint\", { enumerable: true, get: function () { return decode_codepoint_js_2.fromCodePoint; } });\n//# sourceMappingURL=decode.js.map"],"names":["exports","require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;CACA,MAAM,CAAC,cAAc,CAAAA,SAAA,EAAU,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;CAC7DA,SAAA,CAAA,aAAA,GAAwBA,SAAA,CAAA,gBAAA,GAA2BA,4BAA0BA,SAAA,CAAA,aAAA,GAAwBA,SAAA,CAAA,cAAA,GAAyBA,0BAAwBA,SAAA,CAAA,YAAA,GAAuBA,SAAA,CAAA,YAAA,GAAuB,MAAM;AAC1M,CAAAA,SAAA,CAAA,eAAA,GAA0B,eAAe;AACzC,CAAAA,SAAA,CAAA,UAAA,GAAqB,UAAU;AAC/B,CAAAA,SAAA,CAAA,mBAAA,GAA8B,mBAAmB;AACjD,CAAAA,SAAA,CAAA,gBAAA,GAA2B,gBAAgB;AAC3C,CAAAA,SAAA,CAAA,SAAA,GAAoB,SAAS;CAC7B,MAAM,qBAAqB,GAAGC,cAA0C;CACxE,MAAM,oBAAoB,GAAGC,aAAyC;CACtE,MAAM,qBAAqB,GAAGC,eAAgC;AAC9D,CAAA,IAAI,SAAS;CACb,CAAC,UAAU,SAAS,EAAE;KAClB,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK;KACxC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM;KAC1C,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ;KAC9C,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM;KAC1C,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM;KAC1C,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS;KAChD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,SAAS;KACjD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,SAAS;KACjD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,SAAS;KACjD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS;KAChD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS;KAChD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS;AACpD,CAAA,CAAC,EAAE,SAAS,KAAK,SAAS,GAAG,EAAE,CAAC,CAAC;AACjC;CACA,MAAM,YAAY,GAAG,EAAE;AACvB,CAAA,IAAI,YAAY;CAChB,CAAC,UAAU,YAAY,EAAE;KACrB,YAAY,CAAC,YAAY,CAAC,cAAc,CAAC,GAAG,KAAK,CAAC,GAAG,cAAc;KACnE,YAAY,CAAC,YAAY,CAAC,eAAe,CAAC,GAAG,KAAK,CAAC,GAAG,eAAe;KACrE,YAAY,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC,GAAG,YAAY;CACjE,CAAC,EAAE,YAAY,KAAKH,SAAA,CAAA,YAAA,GAAuB,YAAY,GAAG,EAAE,CAAC,CAAC;CAC9D,SAAS,QAAQ,CAAC,IAAI,EAAE;KACpB,OAAO,IAAI,IAAI,SAAS,CAAC,IAAI,IAAI,IAAI,IAAI,SAAS,CAAC,IAAI;AAC3D,CAAA;CACA,SAAS,sBAAsB,CAAC,IAAI,EAAE;AACtC,KAAI,QAAQ,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,IAAI,IAAI,SAAS,CAAC,OAAO;UAC1D,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC;AAChE,CAAA;CACA,SAAS,mBAAmB,CAAC,IAAI,EAAE;AACnC,KAAI,QAAQ,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,IAAI,IAAI,SAAS,CAAC,OAAO;UAC1D,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC;SACxD,QAAQ,CAAC,IAAI,CAAC;AACtB,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,6BAA6B,CAAC,IAAI,EAAE;KACzC,OAAO,IAAI,KAAK,SAAS,CAAC,MAAM,IAAI,mBAAmB,CAAC,IAAI,CAAC;AACjE,CAAA;AACA,CAAA,IAAI,kBAAkB;CACtB,CAAC,UAAU,kBAAkB,EAAE;KAC3B,kBAAkB,CAAC,kBAAkB,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa;KACzE,kBAAkB,CAAC,kBAAkB,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,cAAc;KAC3E,kBAAkB,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,GAAG,gBAAgB;KAC/E,kBAAkB,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,YAAY;KACvE,kBAAkB,CAAC,kBAAkB,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa;AAC7E,CAAA,CAAC,EAAE,kBAAkB,KAAK,kBAAkB,GAAG,EAAE,CAAC,CAAC;AACnD,CAAA,IAAI,YAAY;CAChB,CAAC,UAAU,YAAY,EAAE;AACzB;KACI,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ;AACvD;KACI,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ;AACvD;KACI,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW;CAC7D,CAAC,EAAE,YAAY,KAAKA,SAAA,CAAA,YAAA,GAAuB,YAAY,GAAG,EAAE,CAAC,CAAC;AAC9D;AACA;AACA;AACA,CAAA,MAAM,aAAa,CAAC;AACpB,KAAI,WAAW;AACf;AACA,KAAI,UAAU;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,aAAa;AACjB;AACA,KAAI,MAAM,EAAE;AACZ,SAAQ,IAAI,CAAC,UAAU,GAAG,UAAU;AACpC,SAAQ,IAAI,CAAC,aAAa,GAAG,aAAa;AAC1C,SAAQ,IAAI,CAAC,MAAM,GAAG,MAAM;AAC5B;AACA,SAAQ,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,WAAW;AACnD;AACA,SAAQ,IAAI,CAAC,QAAQ,GAAG,CAAC;AACzB;AACA;AACA;AACA;AACA;AACA;AACA,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC;AACvB;AACA,SAAQ,IAAI,CAAC,SAAS,GAAG,CAAC;AAC1B;AACA,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC;AACvB;AACA,SAAQ,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM;AAC7C,KAAA;AACA;KACI,WAAW,CAAC,UAAU,EAAE;AAC5B,SAAQ,IAAI,CAAC,UAAU,GAAG,UAAU;AACpC,SAAQ,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,WAAW;AACnD,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC;AACvB,SAAQ,IAAI,CAAC,SAAS,GAAG,CAAC;AAC1B,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC;AACvB,SAAQ,IAAI,CAAC,QAAQ,GAAG,CAAC;AACzB,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE;SACjB,QAAQ,IAAI,CAAC,KAAK;AAC1B,aAAY,KAAK,kBAAkB,CAAC,WAAW,EAAE;iBACjC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,GAAG,EAAE;AAChE,qBAAoB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,YAAY;AAChE,qBAAoB,IAAI,CAAC,QAAQ,IAAI,CAAC;qBAClB,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;AACpE,iBAAA;AACA,iBAAgB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,WAAW;iBAC3C,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC;AAC3D,aAAA;AACA,aAAY,KAAK,kBAAkB,CAAC,YAAY,EAAE;iBAClC,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC;AAC5D,aAAA;AACA,aAAY,KAAK,kBAAkB,CAAC,cAAc,EAAE;iBACpC,OAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC;AAC9D,aAAA;AACA,aAAY,KAAK,kBAAkB,CAAC,UAAU,EAAE;iBAChC,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;AAC1D,aAAA;AACA,aAAY,KAAK,kBAAkB,CAAC,WAAW,EAAE;iBACjC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC;AAC3D,aAAA;AACA;AACA,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE;AACrC,SAAQ,IAAI,MAAM,IAAI,KAAK,CAAC,MAAM,EAAE;aACxB,OAAO,EAAE;AACrB,SAAA;AACA,SAAQ,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,YAAY,MAAM,SAAS,CAAC,OAAO,EAAE;AAC7E,aAAY,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,UAAU;AACtD,aAAY,IAAI,CAAC,QAAQ,IAAI,CAAC;aAClB,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;AAC1D,SAAA;AACA,SAAQ,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,cAAc;SAC9C,OAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC;AACtD,KAAA;KACI,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE;AAChD,SAAQ,IAAI,KAAK,KAAK,GAAG,EAAE;AAC3B,aAAY,MAAM,UAAU,GAAG,GAAG,GAAG,KAAK;aAC9B,IAAI,CAAC,MAAM;iBACP,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC;AACxD,qBAAoB,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC;AAC1E,aAAY,IAAI,CAAC,QAAQ,IAAI,UAAU;AACvC,SAAA;AACA,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE;SAC3B,MAAM,UAAU,GAAG,MAAM;AACjC,SAAQ,OAAO,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE;aAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;aACrC,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,sBAAsB,CAAC,IAAI,CAAC,EAAE;iBAChD,MAAM,IAAI,CAAC;AAC3B,aAAA;kBACiB;iBACD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;iBACtD,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC;AACtD,aAAA;AACA,SAAA;SACQ,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;SACtD,OAAO,EAAE;AACjB,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE;SAC/B,MAAM,UAAU,GAAG,MAAM;AACjC,SAAQ,OAAO,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE;aAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;AACjD,aAAY,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE;iBAChB,MAAM,IAAI,CAAC;AAC3B,aAAA;kBACiB;iBACD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;iBACtD,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC;AACtD,aAAA;AACA,SAAA;SACQ,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;SACtD,OAAO,EAAE;AACjB,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,iBAAiB,CAAC,MAAM,EAAE,cAAc,EAAE;AAC9C,SAAQ,IAAI,EAAE;AACd;AACA,SAAQ,IAAI,IAAI,CAAC,QAAQ,IAAI,cAAc,EAAE;aACjC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,MAAM,IAAI,IAAI,EAAE,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE,CAAC,0CAA0C,CAAC,IAAI,CAAC,QAAQ,CAAC;AAChI,aAAY,OAAO,CAAC;AACpB,SAAA;AACA;AACA,SAAQ,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI,EAAE;AACvC,aAAY,IAAI,CAAC,QAAQ,IAAI,CAAC;AAC9B,SAAA;cACa,IAAI,IAAI,CAAC,UAAU,KAAK,YAAY,CAAC,MAAM,EAAE;AAC1D,aAAY,OAAO,CAAC;AACpB,SAAA;AACA,SAAQ,IAAI,CAAC,aAAa,CAAC,IAAI,qBAAqB,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC;AACnG,SAAQ,IAAI,IAAI,CAAC,MAAM,EAAE;AACzB,aAAY,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI,EAAE;AAC3C,iBAAgB,IAAI,CAAC,MAAM,CAAC,uCAAuC,EAAE;AACrE,aAAA;aACY,IAAI,CAAC,MAAM,CAAC,iCAAiC,CAAC,IAAI,CAAC,MAAM,CAAC;AACtE,SAAA;SACQ,OAAO,IAAI,CAAC,QAAQ;AAC5B,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE;AACpC,SAAQ,MAAM,EAAE,UAAU,EAAE,GAAG,IAAI;SAC3B,IAAI,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;AAChD;SACQ,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,YAAY,CAAC,YAAY,KAAK,EAAE;AACrE,SAAQ,OAAO,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;aACnD,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;aACrC,IAAI,CAAC,SAAS,GAAG,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,IAAI,CAAC;AAClH,aAAY,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE;AACpC,iBAAgB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC;AACxC;AACA,sBAAqB,IAAI,CAAC,UAAU,KAAK,YAAY,CAAC,SAAS;AAC/D;0BACyB,WAAW,KAAK,CAAC;AAC1C;AACA,6BAA4B,6BAA6B,CAAC,IAAI,CAAC,CAAC;uBAC1C;uBACA,IAAI,CAAC,4BAA4B,EAAE;AACzD,aAAA;AACA,aAAY,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;aACpC,WAAW,GAAG,CAAC,OAAO,GAAG,YAAY,CAAC,YAAY,KAAK,EAAE;AACrE;AACA,aAAY,IAAI,WAAW,KAAK,CAAC,EAAE;AACnC;AACA,iBAAgB,IAAI,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE;AAC7C,qBAAoB,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;AAC7G,iBAAA;AACA;iBACgB,IAAI,IAAI,CAAC,UAAU,KAAK,YAAY,CAAC,MAAM,EAAE;AAC7D,qBAAoB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS;AAChD,qBAAoB,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM;AAChD,qBAAoB,IAAI,CAAC,MAAM,GAAG,CAAC;AACnC,iBAAA;AACA,aAAA;AACA,SAAA;SACQ,OAAO,EAAE;AACjB,KAAA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,4BAA4B,GAAG;AACnC,SAAQ,IAAI,EAAE;AACd,SAAQ,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAI;AAC3C,SAAQ,MAAM,WAAW,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,YAAY,KAAK,EAAE;SAC1E,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC;SAC5D,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,MAAM,IAAI,IAAI,EAAE,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE,CAAC,uCAAuC,EAAE;SACpG,OAAO,IAAI,CAAC,QAAQ;AAC5B,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,mBAAmB,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE;AACvD,SAAQ,MAAM,EAAE,UAAU,EAAE,GAAG,IAAI;AACnC,SAAQ,IAAI,CAAC,aAAa,CAAC,WAAW,KAAK;AAC3C,eAAc,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC;eACnC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC;AAC/C,SAAQ,IAAI,WAAW,KAAK,CAAC,EAAE;AAC/B;AACA,aAAY,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC;AAChE,SAAA;AACA,SAAQ,OAAO,QAAQ;AACvB,KAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,GAAG,GAAG;AACV,SAAQ,IAAI,EAAE;SACN,QAAQ,IAAI,CAAC,KAAK;AAC1B,aAAY,KAAK,kBAAkB,CAAC,WAAW,EAAE;AACjD;AACA,iBAAgB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC;AACxC,sBAAqB,IAAI,CAAC,UAAU,KAAK,YAAY,CAAC,SAAS;AAC/D,yBAAwB,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS;uBAChC,IAAI,CAAC,4BAA4B;AACvD,uBAAsB,CAAC;AACvB,aAAA;AACA;AACA,aAAY,KAAK,kBAAkB,CAAC,cAAc,EAAE;iBACpC,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC;AACnD,aAAA;AACA,aAAY,KAAK,kBAAkB,CAAC,UAAU,EAAE;iBAChC,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC;AACnD,aAAA;AACA,aAAY,KAAK,kBAAkB,CAAC,YAAY,EAAE;iBAClC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,MAAM,IAAI,IAAI,EAAE,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE,CAAC,0CAA0C,CAAC,IAAI,CAAC,QAAQ,CAAC;AACpI,iBAAgB,OAAO,CAAC;AACxB,aAAA;AACA,aAAY,KAAK,kBAAkB,CAAC,WAAW,EAAE;AACjD;AACA,iBAAgB,OAAO,CAAC;AACxB,aAAA;AACA;AACA,KAAA;AACA;AACA,CAAAA,SAAA,CAAA,aAAA,GAAwB,aAAa;AACrC;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,UAAU,CAAC,UAAU,EAAE;KAC5B,IAAI,WAAW,GAAG,EAAE;KACpB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,UAAU,EAAE,CAAC,IAAI,MAAM,WAAW,IAAI,IAAI,qBAAqB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5H,KAAI,OAAO,SAAS,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE;SAC9C,IAAI,SAAS,GAAG,CAAC;SACjB,IAAI,MAAM,GAAG,CAAC;AACtB,SAAQ,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE;aAC/C,WAAW,IAAI,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC;AACzD,aAAY,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC;AAC3C,aAAY,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK;AAC9C;aACY,MAAM,GAAG,CAAC,CAAC;AACvB,aAAY,IAAI,MAAM,GAAG,CAAC,EAAE;AAC5B,iBAAgB,SAAS,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE;iBAClC;AAChB,aAAA;AACA,aAAY,SAAS,GAAG,MAAM,GAAG,MAAM;AACvC;aACY,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS;AAC7D,SAAA;SACQ,MAAM,MAAM,GAAG,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC;AAC3D;SACQ,WAAW,GAAG,EAAE;AACxB,SAAQ,OAAO,MAAM;KACrB,CAAK;AACL,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE;KAC3D,MAAM,WAAW,GAAG,CAAC,OAAO,GAAG,YAAY,CAAC,aAAa,KAAK,CAAC;AACnE,KAAI,MAAM,UAAU,GAAG,OAAO,GAAG,YAAY,CAAC,UAAU;AACxD;AACA,KAAI,IAAI,WAAW,KAAK,CAAC,EAAE;AAC3B,SAAQ,OAAO,UAAU,KAAK,CAAC,IAAI,IAAI,KAAK,UAAU,GAAG,SAAS,GAAG,EAAE;AACvE,KAAA;AACA;KACI,IAAI,UAAU,EAAE;AACpB,SAAQ,MAAM,KAAK,GAAG,IAAI,GAAG,UAAU;AACvC,SAAQ,OAAO,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI;AACrC,eAAc;AACd,eAAc,UAAU,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC;AAC/C,KAAA;AACA;AACA;KACI,IAAI,EAAE,GAAG,SAAS;AACtB,KAAI,IAAI,EAAE,GAAG,EAAE,GAAG,WAAW,GAAG,CAAC;AACjC,KAAI,OAAO,EAAE,IAAI,EAAE,EAAE;SACb,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;AACnC,SAAQ,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC;AACxC,SAAQ,IAAI,QAAQ,GAAG,IAAI,EAAE;AAC7B,aAAY,EAAE,GAAG,GAAG,GAAG,CAAC;AACxB,SAAA;AACA,cAAa,IAAI,QAAQ,GAAG,IAAI,EAAE;AAClC,aAAY,EAAE,GAAG,GAAG,GAAG,CAAC;AACxB,SAAA;cACa;AACb,aAAY,OAAO,UAAU,CAAC,GAAG,GAAG,WAAW,CAAC;AAChD,SAAA;AACA,KAAA;KACI,OAAO,EAAE;AACb,CAAA;CACA,MAAM,WAAW,mBAAmB,UAAU,CAAC,qBAAqB,CAAC,cAAc,CAAC;CACpF,MAAM,UAAU,mBAAmB,UAAU,CAAC,oBAAoB,CAAC,aAAa,CAAC;AACjF;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,UAAU,CAAC,UAAU,EAAE,IAAI,GAAG,YAAY,CAAC,MAAM,EAAE;AAC5D,KAAI,OAAO,WAAW,CAAC,UAAU,EAAE,IAAI,CAAC;AACxC,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,mBAAmB,CAAC,aAAa,EAAE;KACxC,OAAO,WAAW,CAAC,aAAa,EAAE,YAAY,CAAC,SAAS,CAAC;AAC7D,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,gBAAgB,CAAC,UAAU,EAAE;KAClC,OAAO,WAAW,CAAC,UAAU,EAAE,YAAY,CAAC,MAAM,CAAC;AACvD,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,SAAS,CAAC,SAAS,EAAE;KAC1B,OAAO,UAAU,CAAC,SAAS,EAAE,YAAY,CAAC,MAAM,CAAC;AACrD,CAAA;AACA;CACA,IAAI,qBAAqB,GAAGC,cAA0C;CACtE,MAAM,CAAC,cAAc,CAACD,SAAO,EAAE,gBAAgB,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,OAAO,qBAAqB,CAAC,cAAc,CAAC,CAAA,CAAE,EAAE,CAAC;CACzI,IAAI,oBAAoB,GAAGE,aAAyC;CACpE,MAAM,CAAC,cAAc,CAACF,SAAO,EAAE,eAAe,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,OAAO,oBAAoB,CAAC,aAAa,CAAC,CAAA,CAAE,EAAE,CAAC;CACtI,IAAI,qBAAqB,GAAGG,eAAgC;CAC5D,MAAM,CAAC,cAAc,CAACH,SAAO,EAAE,iBAAiB,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,OAAO,qBAAqB,CAAC,eAAe,CAAC,CAAA,CAAE,EAAE,CAAC;CAC3I,MAAM,CAAC,cAAc,CAACA,SAAO,EAAE,kBAAkB,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,OAAO,qBAAqB,CAAC,gBAAgB,CAAC,CAAA,CAAE,EAAE,CAAC;CAC7I,MAAM,CAAC,cAAc,CAACA,SAAO,EAAE,eAAe,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,OAAO,qBAAqB,CAAC,aAAa,CAAC,CAAA,CAAE,EAAE,CAAC;AACvI;","x_google_ignoreList":[0]}