@sparrowengg/integrations-templates-frontend 1.2.4

package/dist/cjs/node_modules/html-dom-parser/node_modules/entities/lib/decode.js

@@ -0,0 +1,549 @@
+'use strict';
+
+var _commonjsHelpers = require('../../../../../_virtual/_commonjsHelpers.js');
+var decode = require('../../../../../_virtual/decode.js');
+require('./generated/decode-data-html.js');
+require('./generated/decode-data-xml.js');
+require('./decode_codepoint.js');
+var decodeDataHtml = require('../../../../../_virtual/decode-data-html.js');
+var decodeDataXml = require('../../../../../_virtual/decode-data-xml.js');
+var decode_codepoint = require('../../../../../_virtual/decode_codepoint.js');
+
+(function (exports) {
+	var __createBinding = (_commonjsHelpers.commonjsGlobal && _commonjsHelpers.commonjsGlobal.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+	    if (k2 === undefined) k2 = k;
+	    var desc = Object.getOwnPropertyDescriptor(m, k);
+	    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+	      desc = { enumerable: true, get: function() { return m[k]; } };
+	    }
+	    Object.defineProperty(o, k2, desc);
+	}) : (function(o, m, k, k2) {
+	    if (k2 === undefined) k2 = k;
+	    o[k2] = m[k];
+	}));
+	var __setModuleDefault = (_commonjsHelpers.commonjsGlobal && _commonjsHelpers.commonjsGlobal.__setModuleDefault) || (Object.create ? (function(o, v) {
+	    Object.defineProperty(o, "default", { enumerable: true, value: v });
+	}) : function(o, v) {
+	    o["default"] = v;
+	});
+	var __importStar = (_commonjsHelpers.commonjsGlobal && _commonjsHelpers.commonjsGlobal.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+	    __setModuleDefault(result, mod);
+	    return result;
+	};
+	var __importDefault = (_commonjsHelpers.commonjsGlobal && _commonjsHelpers.commonjsGlobal.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.decodeXML = exports.decodeHTMLStrict = exports.decodeHTMLAttribute = exports.decodeHTML = exports.determineBranch = exports.EntityDecoder = exports.DecodingMode = exports.BinTrieFlags = exports.fromCodePoint = exports.replaceCodePoint = exports.decodeCodePoint = exports.xmlDecodeTree = exports.htmlDecodeTree = void 0;
+	var decode_data_html_js_1 = __importDefault(decodeDataHtml.__exports);
+	exports.htmlDecodeTree = decode_data_html_js_1.default;
+	var decode_data_xml_js_1 = __importDefault(decodeDataXml.__exports);
+	exports.xmlDecodeTree = decode_data_xml_js_1.default;
+	var decode_codepoint_js_1 = __importStar(decode_codepoint.__exports);
+	exports.decodeCodePoint = decode_codepoint_js_1.default;
+	var decode_codepoint_js_2 = decode_codepoint.__exports;
+	Object.defineProperty(exports, "replaceCodePoint", { enumerable: true, get: function () { return decode_codepoint_js_2.replaceCodePoint; } });
+	Object.defineProperty(exports, "fromCodePoint", { enumerable: true, get: function () { return decode_codepoint_js_2.fromCodePoint; } });
+	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 */
+	var 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.BinTrieFlags || (exports.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.DecodingMode || (exports.DecodingMode = {}));
+	/**
+	 * Token decoder with support of writing partial entities.
+	 */
+	var EntityDecoder = /** @class */ (function () {
+	    function EntityDecoder(
+	    /** 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. */
+	    EntityDecoder.prototype.startEntity = function (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 string 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.
+	     */
+	    EntityDecoder.prototype.write = function (str, offset) {
+	        switch (this.state) {
+	            case EntityDecoderState.EntityStart: {
+	                if (str.charCodeAt(offset) === CharCodes.NUM) {
+	                    this.state = EntityDecoderState.NumericStart;
+	                    this.consumed += 1;
+	                    return this.stateNumericStart(str, offset + 1);
+	                }
+	                this.state = EntityDecoderState.NamedEntity;
+	                return this.stateNamedEntity(str, offset);
+	            }
+	            case EntityDecoderState.NumericStart: {
+	                return this.stateNumericStart(str, offset);
+	            }
+	            case EntityDecoderState.NumericDecimal: {
+	                return this.stateNumericDecimal(str, offset);
+	            }
+	            case EntityDecoderState.NumericHex: {
+	                return this.stateNumericHex(str, offset);
+	            }
+	            case EntityDecoderState.NamedEntity: {
+	                return this.stateNamedEntity(str, offset);
+	            }
+	        }
+	    };
+	    /**
+	     * Switches between the numeric decimal and hexadecimal states.
+	     *
+	     * Equivalent to the `Numeric character reference state` in the HTML spec.
+	     *
+	     * @param str 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.
+	     */
+	    EntityDecoder.prototype.stateNumericStart = function (str, offset) {
+	        if (offset >= str.length) {
+	            return -1;
+	        }
+	        if ((str.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) {
+	            this.state = EntityDecoderState.NumericHex;
+	            this.consumed += 1;
+	            return this.stateNumericHex(str, offset + 1);
+	        }
+	        this.state = EntityDecoderState.NumericDecimal;
+	        return this.stateNumericDecimal(str, offset);
+	    };
+	    EntityDecoder.prototype.addToNumericResult = function (str, start, end, base) {
+	        if (start !== end) {
+	            var digitCount = end - start;
+	            this.result =
+	                this.result * Math.pow(base, digitCount) +
+	                    parseInt(str.substr(start, digitCount), base);
+	            this.consumed += digitCount;
+	        }
+	    };
+	    /**
+	     * Parses a hexadecimal numeric entity.
+	     *
+	     * Equivalent to the `Hexademical character reference state` in the HTML spec.
+	     *
+	     * @param str 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.
+	     */
+	    EntityDecoder.prototype.stateNumericHex = function (str, offset) {
+	        var startIdx = offset;
+	        while (offset < str.length) {
+	            var char = str.charCodeAt(offset);
+	            if (isNumber(char) || isHexadecimalCharacter(char)) {
+	                offset += 1;
+	            }
+	            else {
+	                this.addToNumericResult(str, startIdx, offset, 16);
+	                return this.emitNumericEntity(char, 3);
+	            }
+	        }
+	        this.addToNumericResult(str, startIdx, offset, 16);
+	        return -1;
+	    };
+	    /**
+	     * Parses a decimal numeric entity.
+	     *
+	     * Equivalent to the `Decimal character reference state` in the HTML spec.
+	     *
+	     * @param str 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.
+	     */
+	    EntityDecoder.prototype.stateNumericDecimal = function (str, offset) {
+	        var startIdx = offset;
+	        while (offset < str.length) {
+	            var char = str.charCodeAt(offset);
+	            if (isNumber(char)) {
+	                offset += 1;
+	            }
+	            else {
+	                this.addToNumericResult(str, startIdx, offset, 10);
+	                return this.emitNumericEntity(char, 2);
+	            }
+	        }
+	        this.addToNumericResult(str, startIdx, 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.
+	     */
+	    EntityDecoder.prototype.emitNumericEntity = function (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 str 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.
+	     */
+	    EntityDecoder.prototype.stateNamedEntity = function (str, offset) {
+	        var decodeTree = this.decodeTree;
+	        var current = decodeTree[this.treeIndex];
+	        // The mask is the number of bytes of the value, including the current byte.
+	        var valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;
+	        for (; offset < str.length; offset++, this.excess++) {
+	            var char = str.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.
+	     */
+	    EntityDecoder.prototype.emitNotTerminatedNamedEntity = function () {
+	        var _a;
+	        var _b = this, result = _b.result, decodeTree = _b.decodeTree;
+	        var 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.
+	     */
+	    EntityDecoder.prototype.emitNamedEntityData = function (result, valueLength, consumed) {
+	        var decodeTree = this.decodeTree;
+	        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.
+	     */
+	    EntityDecoder.prototype.end = function () {
+	        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;
+	            }
+	        }
+	    };
+	    return EntityDecoder;
+	}());
+	exports.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) {
+	    var ret = "";
+	    var decoder = new EntityDecoder(decodeTree, function (str) { return (ret += (0, decode_codepoint_js_1.fromCodePoint)(str)); });
+	    return function decodeWithTrie(str, decodeMode) {
+	        var lastIndex = 0;
+	        var offset = 0;
+	        while ((offset = str.indexOf("&", offset)) >= 0) {
+	            ret += str.slice(lastIndex, offset);
+	            decoder.startEntity(decodeMode);
+	            var len = decoder.write(str, 
+	            // Skip the "&"
+	            offset + 1);
+	            if (len < 0) {
+	                lastIndex = offset + decoder.end();
+	                break;
+	            }
+	            lastIndex = offset + len;
+	            // If `len` is 0, skip the current `&` and continue.
+	            offset = len === 0 ? lastIndex + 1 : lastIndex;
+	        }
+	        var result = ret + str.slice(lastIndex);
+	        // Make sure we don't keep a reference to the final string.
+	        ret = "";
+	        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, nodeIdx, char) {
+	    var branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;
+	    var jumpOffset = current & BinTrieFlags.JUMP_TABLE;
+	    // Case 1: Single branch encoded in jump offset
+	    if (branchCount === 0) {
+	        return jumpOffset !== 0 && char === jumpOffset ? nodeIdx : -1;
+	    }
+	    // Case 2: Multiple branches encoded in jump table
+	    if (jumpOffset) {
+	        var value = char - jumpOffset;
+	        return value < 0 || value >= branchCount
+	            ? -1
+	            : decodeTree[nodeIdx + value] - 1;
+	    }
+	    // Case 3: Multiple branches encoded in dictionary
+	    // Binary search for the character.
+	    var lo = nodeIdx;
+	    var hi = lo + branchCount - 1;
+	    while (lo <= hi) {
+	        var mid = (lo + hi) >>> 1;
+	        var midVal = decodeTree[mid];
+	        if (midVal < char) {
+	            lo = mid + 1;
+	        }
+	        else if (midVal > char) {
+	            hi = mid - 1;
+	        }
+	        else {
+	            return decodeTree[mid + branchCount];
+	        }
+	    }
+	    return -1;
+	}
+	exports.determineBranch = determineBranch;
+	var htmlDecoder = getDecoder(decode_data_html_js_1.default);
+	var xmlDecoder = getDecoder(decode_data_xml_js_1.default);
+	/**
+	 * Decodes an HTML string.
+	 *
+	 * @param str The string to decode.
+	 * @param mode The decoding mode.
+	 * @returns The decoded string.
+	 */
+	function decodeHTML(str, mode) {
+	    if (mode === void 0) { mode = DecodingMode.Legacy; }
+	    return htmlDecoder(str, mode);
+	}
+	exports.decodeHTML = decodeHTML;
+	/**
+	 * Decodes an HTML string in an attribute.
+	 *
+	 * @param str The string to decode.
+	 * @returns The decoded string.
+	 */
+	function decodeHTMLAttribute(str) {
+	    return htmlDecoder(str, DecodingMode.Attribute);
+	}
+	exports.decodeHTMLAttribute = decodeHTMLAttribute;
+	/**
+	 * Decodes an HTML string, requiring all entities to be terminated by a semicolon.
+	 *
+	 * @param str The string to decode.
+	 * @returns The decoded string.
+	 */
+	function decodeHTMLStrict(str) {
+	    return htmlDecoder(str, DecodingMode.Strict);
+	}
+	exports.decodeHTMLStrict = decodeHTMLStrict;
+	/**
+	 * Decodes an XML string, requiring all entities to be terminated by a semicolon.
+	 *
+	 * @param str The string to decode.
+	 * @returns The decoded string.
+	 */
+	function decodeXML(str) {
+	    return xmlDecoder(str, DecodingMode.Strict);
+	}
+	exports.decodeXML = decodeXML;
+	
+} (decode.__exports));
+//# sourceMappingURL=decode.js.map

package/dist/cjs/node_modules/html-dom-parser/node_modules/entities/lib/decode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decode.js","sources":["../../../../../../../../../node_modules/html-dom-parser/node_modules/entities/lib/decode.js"],"sourcesContent":["\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeXML = exports.decodeHTMLStrict = exports.decodeHTMLAttribute = exports.decodeHTML = exports.determineBranch = exports.EntityDecoder = exports.DecodingMode = exports.BinTrieFlags = exports.fromCodePoint = exports.replaceCodePoint = exports.decodeCodePoint = exports.xmlDecodeTree = exports.htmlDecodeTree = void 0;\nvar decode_data_html_js_1 = __importDefault(require(\"./generated/decode-data-html.js\"));\nexports.htmlDecodeTree = decode_data_html_js_1.default;\nvar decode_data_xml_js_1 = __importDefault(require(\"./generated/decode-data-xml.js\"));\nexports.xmlDecodeTree = decode_data_xml_js_1.default;\nvar decode_codepoint_js_1 = __importStar(require(\"./decode_codepoint.js\"));\nexports.decodeCodePoint = decode_codepoint_js_1.default;\nvar decode_codepoint_js_2 = require(\"./decode_codepoint.js\");\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; } });\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 */\nvar 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 || (exports.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 || (exports.DecodingMode = {}));\n/**\n * Token decoder with support of writing partial entities.\n */\nvar EntityDecoder = /** @class */ (function () {\n    function EntityDecoder(\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    EntityDecoder.prototype.startEntity = function (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 string 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    EntityDecoder.prototype.write = function (str, offset) {\n        switch (this.state) {\n            case EntityDecoderState.EntityStart: {\n                if (str.charCodeAt(offset) === CharCodes.NUM) {\n                    this.state = EntityDecoderState.NumericStart;\n                    this.consumed += 1;\n                    return this.stateNumericStart(str, offset + 1);\n                }\n                this.state = EntityDecoderState.NamedEntity;\n                return this.stateNamedEntity(str, offset);\n            }\n            case EntityDecoderState.NumericStart: {\n                return this.stateNumericStart(str, offset);\n            }\n            case EntityDecoderState.NumericDecimal: {\n                return this.stateNumericDecimal(str, offset);\n            }\n            case EntityDecoderState.NumericHex: {\n                return this.stateNumericHex(str, offset);\n            }\n            case EntityDecoderState.NamedEntity: {\n                return this.stateNamedEntity(str, 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 str 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    EntityDecoder.prototype.stateNumericStart = function (str, offset) {\n        if (offset >= str.length) {\n            return -1;\n        }\n        if ((str.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) {\n            this.state = EntityDecoderState.NumericHex;\n            this.consumed += 1;\n            return this.stateNumericHex(str, offset + 1);\n        }\n        this.state = EntityDecoderState.NumericDecimal;\n        return this.stateNumericDecimal(str, offset);\n    };\n    EntityDecoder.prototype.addToNumericResult = function (str, start, end, base) {\n        if (start !== end) {\n            var digitCount = end - start;\n            this.result =\n                this.result * Math.pow(base, digitCount) +\n                    parseInt(str.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 str 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    EntityDecoder.prototype.stateNumericHex = function (str, offset) {\n        var startIdx = offset;\n        while (offset < str.length) {\n            var char = str.charCodeAt(offset);\n            if (isNumber(char) || isHexadecimalCharacter(char)) {\n                offset += 1;\n            }\n            else {\n                this.addToNumericResult(str, startIdx, offset, 16);\n                return this.emitNumericEntity(char, 3);\n            }\n        }\n        this.addToNumericResult(str, startIdx, 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 str 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    EntityDecoder.prototype.stateNumericDecimal = function (str, offset) {\n        var startIdx = offset;\n        while (offset < str.length) {\n            var char = str.charCodeAt(offset);\n            if (isNumber(char)) {\n                offset += 1;\n            }\n            else {\n                this.addToNumericResult(str, startIdx, offset, 10);\n                return this.emitNumericEntity(char, 2);\n            }\n        }\n        this.addToNumericResult(str, startIdx, 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    EntityDecoder.prototype.emitNumericEntity = function (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 str 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    EntityDecoder.prototype.stateNamedEntity = function (str, offset) {\n        var decodeTree = this.decodeTree;\n        var current = decodeTree[this.treeIndex];\n        // The mask is the number of bytes of the value, including the current byte.\n        var valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;\n        for (; offset < str.length; offset++, this.excess++) {\n            var char = str.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    EntityDecoder.prototype.emitNotTerminatedNamedEntity = function () {\n        var _a;\n        var _b = this, result = _b.result, decodeTree = _b.decodeTree;\n        var 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    EntityDecoder.prototype.emitNamedEntityData = function (result, valueLength, consumed) {\n        var decodeTree = this.decodeTree;\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    EntityDecoder.prototype.end = function () {\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    return EntityDecoder;\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    var ret = \"\";\n    var decoder = new EntityDecoder(decodeTree, function (str) { return (ret += (0, decode_codepoint_js_1.fromCodePoint)(str)); });\n    return function decodeWithTrie(str, decodeMode) {\n        var lastIndex = 0;\n        var offset = 0;\n        while ((offset = str.indexOf(\"&\", offset)) >= 0) {\n            ret += str.slice(lastIndex, offset);\n            decoder.startEntity(decodeMode);\n            var len = decoder.write(str, \n            // Skip the \"&\"\n            offset + 1);\n            if (len < 0) {\n                lastIndex = offset + decoder.end();\n                break;\n            }\n            lastIndex = offset + len;\n            // If `len` is 0, skip the current `&` and continue.\n            offset = len === 0 ? lastIndex + 1 : lastIndex;\n        }\n        var result = ret + str.slice(lastIndex);\n        // Make sure we don't keep a reference to the final string.\n        ret = \"\";\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, nodeIdx, char) {\n    var branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;\n    var jumpOffset = current & BinTrieFlags.JUMP_TABLE;\n    // Case 1: Single branch encoded in jump offset\n    if (branchCount === 0) {\n        return jumpOffset !== 0 && char === jumpOffset ? nodeIdx : -1;\n    }\n    // Case 2: Multiple branches encoded in jump table\n    if (jumpOffset) {\n        var value = char - jumpOffset;\n        return value < 0 || value >= branchCount\n            ? -1\n            : decodeTree[nodeIdx + value] - 1;\n    }\n    // Case 3: Multiple branches encoded in dictionary\n    // Binary search for the character.\n    var lo = nodeIdx;\n    var hi = lo + branchCount - 1;\n    while (lo <= hi) {\n        var mid = (lo + hi) >>> 1;\n        var midVal = decodeTree[mid];\n        if (midVal < char) {\n            lo = mid + 1;\n        }\n        else if (midVal > char) {\n            hi = mid - 1;\n        }\n        else {\n            return decodeTree[mid + branchCount];\n        }\n    }\n    return -1;\n}\nexports.determineBranch = determineBranch;\nvar htmlDecoder = getDecoder(decode_data_html_js_1.default);\nvar xmlDecoder = getDecoder(decode_data_xml_js_1.default);\n/**\n * Decodes an HTML string.\n *\n * @param str The string to decode.\n * @param mode The decoding mode.\n * @returns The decoded string.\n */\nfunction decodeHTML(str, mode) {\n    if (mode === void 0) { mode = DecodingMode.Legacy; }\n    return htmlDecoder(str, mode);\n}\nexports.decodeHTML = decodeHTML;\n/**\n * Decodes an HTML string in an attribute.\n *\n * @param str The string to decode.\n * @returns The decoded string.\n */\nfunction decodeHTMLAttribute(str) {\n    return htmlDecoder(str, DecodingMode.Attribute);\n}\nexports.decodeHTMLAttribute = decodeHTMLAttribute;\n/**\n * Decodes an HTML string, requiring all entities to be terminated by a semicolon.\n *\n * @param str The string to decode.\n * @returns The decoded string.\n */\nfunction decodeHTMLStrict(str) {\n    return htmlDecoder(str, DecodingMode.Strict);\n}\nexports.decodeHTMLStrict = decodeHTMLStrict;\n/**\n * Decodes an XML string, requiring all entities to be terminated by a semicolon.\n *\n * @param str The string to decode.\n * @returns The decoded string.\n */\nfunction decodeXML(str) {\n    return xmlDecoder(str, DecodingMode.Strict);\n}\nexports.decodeXML = decodeXML;\n//# sourceMappingURL=decode.js.map"],"names":["this","require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;;CACA,IAAI,eAAe,GAAG,CAACA,+BAAI,IAAIA,+BAAI,CAAC,eAAe,MAAM,MAAM,CAAC,MAAM,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;KAC5F,IAAI,EAAE,KAAK,SAAS,EAAE,EAAE,GAAG,CAAC,CAAC;KAC7B,IAAI,IAAI,GAAG,MAAM,CAAC,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KACjD,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,EAAE;AACvF,OAAM,IAAI,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;MAC/D;KACD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;EACtC,KAAK,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;KACxB,IAAI,EAAE,KAAK,SAAS,EAAE,EAAE,GAAG,CAAC,CAAC;KAC7B,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;EAChB,CAAC,CAAC,CAAC;AACJ,CAAA,IAAI,kBAAkB,GAAG,CAACA,+BAAI,IAAIA,+BAAI,CAAC,kBAAkB,MAAM,MAAM,CAAC,MAAM,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;AAC/F,KAAI,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AACxE,EAAC,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;AACpB,KAAI,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;AACrB,EAAC,CAAC,CAAC;CACH,IAAI,YAAY,GAAG,CAACA,+BAAI,IAAIA,+BAAI,CAAC,YAAY,KAAK,UAAU,GAAG,EAAE;KAC7D,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,EAAE,OAAO,GAAG,CAAC;AAC1C,KAAI,IAAI,MAAM,GAAG,EAAE,CAAC;AACpB,KAAI,IAAI,GAAG,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI,GAAG,EAAE,IAAI,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;AAC7I,KAAI,kBAAkB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;KAChC,OAAO,MAAM,CAAC;AAClB,EAAC,CAAC;CACF,IAAI,eAAe,GAAG,CAACA,+BAAI,IAAIA,+BAAI,CAAC,eAAe,KAAK,UAAU,GAAG,EAAE;AACvE,KAAI,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,IAAI,GAAG,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;AAC9D,EAAC,CAAC;CACF,MAAM,CAAC,cAAc,CAAA,OAAA,EAAU,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAC9D,CAAA,OAAA,CAAA,SAAA,GAAoB,OAA2B,CAAA,gBAAA,GAAA,OAAA,CAAA,mBAAA,GAA8B,OAAqB,CAAA,UAAA,GAAA,OAAA,CAAA,eAAA,GAA0B,wBAAwB,OAAuB,CAAA,YAAA,GAAA,OAAA,CAAA,YAAA,GAAuB,OAAwB,CAAA,aAAA,GAAA,OAAA,CAAA,gBAAA,GAA2B,OAA0B,CAAA,eAAA,GAAA,OAAA,CAAA,aAAA,GAAwB,OAAyB,CAAA,cAAA,GAAA,KAAK,CAAC,CAAC;AACvU,CAAA,IAAI,qBAAqB,GAAG,eAAe,CAACC,wBAA0C,CAAC,CAAC;CACxF,OAAyB,CAAA,cAAA,GAAA,qBAAqB,CAAC,OAAO,CAAC;AACvD,CAAA,IAAI,oBAAoB,GAAG,eAAe,CAACC,uBAAyC,CAAC,CAAC;CACtF,OAAwB,CAAA,aAAA,GAAA,oBAAoB,CAAC,OAAO,CAAC;AACrD,CAAA,IAAI,qBAAqB,GAAG,YAAY,CAACC,0BAAgC,CAAC,CAAC;CAC3E,OAA0B,CAAA,eAAA,GAAA,qBAAqB,CAAC,OAAO,CAAC;CACxD,IAAI,qBAAqB,GAAGA,0BAAgC,CAAC;CAC7D,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,kBAAkB,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,OAAO,qBAAqB,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC;CAC9I,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,eAAe,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,EAAE,OAAO,qBAAqB,CAAC,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC;AACxI,CAAA,IAAI,SAAS,CAAC;CACd,CAAC,UAAU,SAAS,EAAE;KAClB,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;KACzC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;KAC3C,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC;KAC/C,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;KAC3C,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;KAC3C,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS,CAAC;KACjD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,SAAS,CAAC;KAClD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,SAAS,CAAC;KAClD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,SAAS,CAAC;KAClD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS,CAAC;KACjD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS,CAAC;KACjD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS,CAAC;EACpD,EAAE,SAAS,KAAK,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC;AAClC;CACA,IAAI,YAAY,GAAG,EAAE,CAAC;AACtB,CAAA,IAAI,YAAY,CAAC;CACjB,CAAC,UAAU,YAAY,EAAE;KACrB,YAAY,CAAC,YAAY,CAAC,cAAc,CAAC,GAAG,KAAK,CAAC,GAAG,cAAc,CAAC;KACpE,YAAY,CAAC,YAAY,CAAC,eAAe,CAAC,GAAG,KAAK,CAAC,GAAG,eAAe,CAAC;KACtE,YAAY,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC,GAAG,YAAY,CAAC;EACjE,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,KAAK,OAAuB,CAAA,YAAA,GAAA,EAAE,CAAC,CAAC,CAAC;CACvE,SAAS,QAAQ,CAAC,IAAI,EAAE;AACxB,KAAI,OAAO,IAAI,IAAI,SAAS,CAAC,IAAI,IAAI,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC;EAC3D;CACD,SAAS,sBAAsB,CAAC,IAAI,EAAE;AACtC,KAAI,QAAQ,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,IAAI,IAAI,SAAS,CAAC,OAAO;AACnE,UAAS,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE;EACjE;CACD,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;AAChE,SAAQ,QAAQ,CAAC,IAAI,CAAC,EAAE;EACvB;AACD;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,6BAA6B,CAAC,IAAI,EAAE;KACzC,OAAO,IAAI,KAAK,SAAS,CAAC,MAAM,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC;EACjE;AACD,CAAA,IAAI,kBAAkB,CAAC;CACvB,CAAC,UAAU,kBAAkB,EAAE;KAC3B,kBAAkB,CAAC,kBAAkB,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC;KAC1E,kBAAkB,CAAC,kBAAkB,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC;KAC5E,kBAAkB,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,GAAG,gBAAgB,CAAC;KAChF,kBAAkB,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC;KACxE,kBAAkB,CAAC,kBAAkB,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC;EAC7E,EAAE,kBAAkB,KAAK,kBAAkB,GAAG,EAAE,CAAC,CAAC,CAAC;AACpD,CAAA,IAAI,YAAY,CAAC;CACjB,CAAC,UAAU,YAAY,EAAE;AACzB;KACI,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;AACxD;KACI,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;AACxD;KACI,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;EAC7D,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,KAAK,OAAuB,CAAA,YAAA,GAAA,EAAE,CAAC,CAAC,CAAC;AACvE;AACA;AACA;CACA,IAAI,aAAa,kBAAkB,YAAY;AAC/C,KAAI,SAAS,aAAa;AAC1B;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,CAAC;AACrC,SAAQ,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;AAC3C,SAAQ,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AAC7B;AACA,SAAQ,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,WAAW,CAAC;AACpD;AACA,SAAQ,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxB;AACA,SAAQ,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;AAC3B;AACA,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxB;AACA,SAAQ,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC;MACzC;AACL;KACI,aAAa,CAAC,SAAS,CAAC,WAAW,GAAG,UAAU,UAAU,EAAE;AAChE,SAAQ,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;AACrC,SAAQ,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,WAAW,CAAC;AACpD,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxB,SAAQ,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;AAC3B,SAAQ,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxB,SAAQ,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;AAC1B,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;KACI,aAAa,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,GAAG,EAAE,MAAM,EAAE;SACnD,QAAQ,IAAI,CAAC,KAAK;AAC1B,aAAY,KAAK,kBAAkB,CAAC,WAAW,EAAE;iBACjC,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,GAAG,EAAE;AAC9D,qBAAoB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,YAAY,CAAC;AACjE,qBAAoB,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;qBACnB,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;kBAClD;AACjB,iBAAgB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,WAAW,CAAC;iBAC5C,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;cAC7C;AACb,aAAY,KAAK,kBAAkB,CAAC,YAAY,EAAE;iBAClC,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;cAC9C;AACb,aAAY,KAAK,kBAAkB,CAAC,cAAc,EAAE;iBACpC,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;cAChD;AACb,aAAY,KAAK,kBAAkB,CAAC,UAAU,EAAE;iBAChC,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;cAC5C;AACb,aAAY,KAAK,kBAAkB,CAAC,WAAW,EAAE;iBACjC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;cAC7C;UACJ;AACT,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;KACI,aAAa,CAAC,SAAS,CAAC,iBAAiB,GAAG,UAAU,GAAG,EAAE,MAAM,EAAE;AACvE,SAAQ,IAAI,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE;aACtB,OAAO,CAAC,CAAC,CAAC;UACb;AACT,SAAQ,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,YAAY,MAAM,SAAS,CAAC,OAAO,EAAE;AAC3E,aAAY,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,UAAU,CAAC;AACvD,aAAY,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;aACnB,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;UAChD;AACT,SAAQ,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,cAAc,CAAC;SAC/C,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;AACrD,MAAK,CAAC;AACN,KAAI,aAAa,CAAC,SAAS,CAAC,kBAAkB,GAAG,UAAU,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE;AAClF,SAAQ,IAAI,KAAK,KAAK,GAAG,EAAE;AAC3B,aAAY,IAAI,UAAU,GAAG,GAAG,GAAG,KAAK,CAAC;aAC7B,IAAI,CAAC,MAAM;iBACP,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC;AACxD,qBAAoB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC;AAClE,aAAY,IAAI,CAAC,QAAQ,IAAI,UAAU,CAAC;UAC/B;AACT,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;KACI,aAAa,CAAC,SAAS,CAAC,eAAe,GAAG,UAAU,GAAG,EAAE,MAAM,EAAE;AACrE,SAAQ,IAAI,QAAQ,GAAG,MAAM,CAAC;AAC9B,SAAQ,OAAO,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE;aACxB,IAAI,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;aAClC,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,sBAAsB,CAAC,IAAI,CAAC,EAAE;iBAChD,MAAM,IAAI,CAAC,CAAC;cACf;kBACI;AACjB,iBAAgB,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;iBACnD,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;cAC1C;UACJ;AACT,SAAQ,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;SACnD,OAAO,CAAC,CAAC,CAAC;AAClB,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;KACI,aAAa,CAAC,SAAS,CAAC,mBAAmB,GAAG,UAAU,GAAG,EAAE,MAAM,EAAE;AACzE,SAAQ,IAAI,QAAQ,GAAG,MAAM,CAAC;AAC9B,SAAQ,OAAO,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE;aACxB,IAAI,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;AAC9C,aAAY,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE;iBAChB,MAAM,IAAI,CAAC,CAAC;cACf;kBACI;AACjB,iBAAgB,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;iBACnD,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;cAC1C;UACJ;AACT,SAAQ,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;SACnD,OAAO,CAAC,CAAC,CAAC;AAClB,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;KACI,aAAa,CAAC,SAAS,CAAC,iBAAiB,GAAG,UAAU,MAAM,EAAE,cAAc,EAAE;SAC1E,IAAI,EAAE,CAAC;AACf;AACA,SAAQ,IAAI,IAAI,CAAC,QAAQ,IAAI,cAAc,EAAE;aACjC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,MAAM,IAAI,IAAI,EAAE,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,0CAA0C,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACrH,OAAO,CAAC,CAAC;UACZ;AACT;AACA,SAAQ,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI,EAAE;AACvC,aAAY,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;UACtB;cACI,IAAI,IAAI,CAAC,UAAU,KAAK,YAAY,CAAC,MAAM,EAAE;aAC9C,OAAO,CAAC,CAAC;UACZ;SACD,IAAI,CAAC,aAAa,CAAC,IAAI,qBAAqB,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AACpG,SAAQ,IAAI,IAAI,CAAC,MAAM,EAAE;AACzB,aAAY,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI,EAAE;AAC3C,iBAAgB,IAAI,CAAC,MAAM,CAAC,uCAAuC,EAAE,CAAC;cACzD;aACD,IAAI,CAAC,MAAM,CAAC,iCAAiC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;UAC9D;AACT,SAAQ,OAAO,IAAI,CAAC,QAAQ,CAAC;AAC7B,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;KACI,aAAa,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAU,GAAG,EAAE,MAAM,EAAE;AACtE,SAAQ,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;SACjC,IAAI,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACjD;SACQ,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,YAAY,CAAC,YAAY,KAAK,EAAE,CAAC;AACtE,SAAQ,OAAO,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;aACjD,IAAI,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;aAClC,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,CAAC;AACnH,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,CAAC;AACjE,uBAAsB,CAAC;AACvB,uBAAsB,IAAI,CAAC,4BAA4B,EAAE,CAAC;cAC7C;aACD,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aACrC,WAAW,GAAG,CAAC,OAAO,GAAG,YAAY,CAAC,YAAY,KAAK,EAAE,CAAC;AACtE;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,CAAC;kBAC7F;AACjB;iBACgB,IAAI,IAAI,CAAC,UAAU,KAAK,YAAY,CAAC,MAAM,EAAE;AAC7D,qBAAoB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;AACjD,qBAAoB,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC;AACjD,qBAAoB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;kBACnB;cACJ;UACJ;SACD,OAAO,CAAC,CAAC,CAAC;AAClB,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA,KAAI,aAAa,CAAC,SAAS,CAAC,4BAA4B,GAAG,YAAY;SAC/D,IAAI,EAAE,CAAC;AACf,SAAQ,IAAI,EAAE,GAAG,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC,MAAM,EAAE,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC;AACtE,SAAQ,IAAI,WAAW,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,YAAY,KAAK,EAAE,CAAC;AACjF,SAAQ,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;SAC7D,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,MAAM,IAAI,IAAI,EAAE,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,uCAAuC,EAAE,CAAC;AAC7G,SAAQ,OAAO,IAAI,CAAC,QAAQ,CAAC;AAC7B,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,aAAa,CAAC,SAAS,CAAC,mBAAmB,GAAG,UAAU,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE;AAC3F,SAAQ,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;AACzC,SAAQ,IAAI,CAAC,aAAa,CAAC,WAAW,KAAK,CAAC;eAC9B,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,YAAY;eAC/C,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAChD,SAAQ,IAAI,WAAW,KAAK,CAAC,EAAE;AAC/B;AACA,aAAY,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;UACxD;SACD,OAAO,QAAQ,CAAC;AACxB,MAAK,CAAC;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,aAAa,CAAC,SAAS,CAAC,GAAG,GAAG,YAAY;SACtC,IAAI,EAAE,CAAC;SACP,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,CAAC;uBACjC,IAAI,CAAC,4BAA4B,EAAE;AACzD,uBAAsB,CAAC,CAAC;cACX;AACb;AACA,aAAY,KAAK,kBAAkB,CAAC,cAAc,EAAE;iBACpC,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;cACvC;AACb,aAAY,KAAK,kBAAkB,CAAC,UAAU,EAAE;iBAChC,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;cACvC;AACb,aAAY,KAAK,kBAAkB,CAAC,YAAY,EAAE;iBAClC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,MAAM,IAAI,IAAI,EAAE,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,0CAA0C,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACrH,OAAO,CAAC,CAAC;cACZ;AACb,aAAY,KAAK,kBAAkB,CAAC,WAAW,EAAE;AACjD;iBACgB,OAAO,CAAC,CAAC;cACZ;UACJ;AACT,MAAK,CAAC;KACF,OAAO,aAAa,CAAC;EACxB,EAAE,CAAC,CAAC;AACL,CAAA,OAAA,CAAA,aAAA,GAAwB,aAAa,CAAC;AACtC;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,UAAU,CAAC,UAAU,EAAE;AAChC,KAAI,IAAI,GAAG,GAAG,EAAE,CAAC;KACb,IAAI,OAAO,GAAG,IAAI,aAAa,CAAC,UAAU,EAAE,UAAU,GAAG,EAAE,EAAE,QAAQ,GAAG,IAAI,IAAI,qBAAqB,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;AACnI,KAAI,OAAO,SAAS,cAAc,CAAC,GAAG,EAAE,UAAU,EAAE;AACpD,SAAQ,IAAI,SAAS,GAAG,CAAC,CAAC;AAC1B,SAAQ,IAAI,MAAM,GAAG,CAAC,CAAC;AACvB,SAAQ,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE;aAC7C,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;AAChD,aAAY,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;AAC5C,aAAY,IAAI,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG;AACvC;AACA,aAAY,MAAM,GAAG,CAAC,CAAC,CAAC;AACxB,aAAY,IAAI,GAAG,GAAG,CAAC,EAAE;iBACT,SAAS,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;AACnD,iBAAgB,MAAM;cACT;AACb,aAAY,SAAS,GAAG,MAAM,GAAG,GAAG,CAAC;AACrC;aACY,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC;UAClD;SACD,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;AAChD;SACQ,GAAG,GAAG,EAAE,CAAC;SACT,OAAO,MAAM,CAAC;AACtB,MAAK,CAAC;EACL;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE;KACzD,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,YAAY,CAAC,aAAa,KAAK,CAAC,CAAC;KAC9D,IAAI,UAAU,GAAG,OAAO,GAAG,YAAY,CAAC,UAAU,CAAC;AACvD;AACA,KAAI,IAAI,WAAW,KAAK,CAAC,EAAE;AAC3B,SAAQ,OAAO,UAAU,KAAK,CAAC,IAAI,IAAI,KAAK,UAAU,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;MACjE;AACL;KACI,IAAI,UAAU,EAAE;AACpB,SAAQ,IAAI,KAAK,GAAG,IAAI,GAAG,UAAU,CAAC;AACtC,SAAQ,OAAO,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,WAAW;AAChD,eAAc,CAAC,CAAC;eACF,UAAU,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;MACzC;AACL;AACA;AACA,KAAI,IAAI,EAAE,GAAG,OAAO,CAAC;KACjB,IAAI,EAAE,GAAG,EAAE,GAAG,WAAW,GAAG,CAAC,CAAC;AAClC,KAAI,OAAO,EAAE,IAAI,EAAE,EAAE;SACb,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;AAClC,SAAQ,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;AACrC,SAAQ,IAAI,MAAM,GAAG,IAAI,EAAE;AAC3B,aAAY,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;UAChB;AACT,cAAa,IAAI,MAAM,GAAG,IAAI,EAAE;AAChC,aAAY,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;UAChB;cACI;AACb,aAAY,OAAO,UAAU,CAAC,GAAG,GAAG,WAAW,CAAC,CAAC;UACxC;MACJ;KACD,OAAO,CAAC,CAAC,CAAC;EACb;AACD,CAAA,OAAA,CAAA,eAAA,GAA0B,eAAe,CAAC;CAC1C,IAAI,WAAW,GAAG,UAAU,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;CAC5D,IAAI,UAAU,GAAG,UAAU,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE;AAC/B,KAAI,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE,EAAE,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,EAAE;AACxD,KAAI,OAAO,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;EACjC;AACD,CAAA,OAAA,CAAA,UAAA,GAAqB,UAAU,CAAC;AAChC;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,mBAAmB,CAAC,GAAG,EAAE;KAC9B,OAAO,WAAW,CAAC,GAAG,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;EACnD;AACD,CAAA,OAAA,CAAA,mBAAA,GAA8B,mBAAmB,CAAC;AAClD;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,gBAAgB,CAAC,GAAG,EAAE;KAC3B,OAAO,WAAW,CAAC,GAAG,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;EAChD;AACD,CAAA,OAAA,CAAA,gBAAA,GAA2B,gBAAgB,CAAC;AAC5C;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,SAAS,CAAC,GAAG,EAAE;KACpB,OAAO,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;EAC/C;AACD,CAAA,OAAA,CAAA,SAAA,GAAoB,SAAS,CAAC;AAC9B,CAAA;;;","x_google_ignoreList":[0]}