@anoki/fse-ui 2.2.0-RC3 → 2.2.0-RC5

package/dist/index.es647.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es647.js","sources":["../node_modules/postcss/lib/at-rule.js"],"sourcesContent":["'use strict'\n\nlet Container = require('./container')\n\nclass AtRule extends Container {\n  constructor(defaults) {\n    super(defaults)\n    this.type = 'atrule'\n  }\n\n  append(...children) {\n    if (!this.proxyOf.nodes) this.nodes = []\n    return super.append(...children)\n  }\n\n  prepend(...children) {\n    if (!this.proxyOf.nodes) this.nodes = []\n    return super.prepend(...children)\n  }\n}\n\nmodule.exports = AtRule\nAtRule.default = AtRule\n\nContainer.registerAtRule(AtRule)\n"],"names":["Container","require$$0","AtRule","defaults","children","atRule"],"mappings":";;;;;AAEA,MAAIA,IAAYC,EAAA;AAAA,EAEhB,MAAMC,UAAeF,EAAU;AAAA,IAC7B,YAAYG,GAAU;AACpB,YAAMA,CAAQ,GACd,KAAK,OAAO;AAAA,IAChB;AAAA,IAEE,UAAUC,GAAU;AAClB,aAAK,KAAK,QAAQ,UAAO,KAAK,QAAQ,CAAA,IAC/B,MAAM,OAAO,GAAGA,CAAQ;AAAA,IACnC;AAAA,IAEE,WAAWA,GAAU;AACnB,aAAK,KAAK,QAAQ,UAAO,KAAK,QAAQ,CAAA,IAC/B,MAAM,QAAQ,GAAGA,CAAQ;AAAA,IACpC;AAAA,EACA;AAEA,SAAAC,IAAiBH,GACjBA,EAAO,UAAUA,GAEjBF,EAAU,eAAeE,CAAM;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es647.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es648.js

@@ -1,17 +1,228 @@
-import { __require as n } from "./index.es657.js";
-var r, t;
-function s() {
-  if (t) return r;
-  t = 1;
-  let o = n();
-  class e extends o {
-    constructor(m) {
-      super(m), this.type = "comment";
-    }
-  }
-  return r = e, e.default = e, r;
+import { __exports as m } from "./index.es704.js";
+import { __require as Z } from "./index.es705.js";
+import { __require as X } from "./index.es706.js";
+import { __require as H } from "./index.es707.js";
+var b;
+function Q() {
+  return b ? m : (b = 1, (function(u) {
+    var S = m && m.__createBinding || (Object.create ? (function(e, t, i, r) {
+      r === void 0 && (r = i);
+      var n = Object.getOwnPropertyDescriptor(t, i);
+      (!n || ("get" in n ? !t.__esModule : n.writable || n.configurable)) && (n = { enumerable: !0, get: function() {
+        return t[i];
+      } }), Object.defineProperty(e, r, n);
+    }) : (function(e, t, i, r) {
+      r === void 0 && (r = i), e[r] = t[i];
+    })), D = m && m.__setModuleDefault || (Object.create ? (function(e, t) {
+      Object.defineProperty(e, "default", { enumerable: !0, value: t });
+    }) : function(e, t) {
+      e.default = t;
+    }), I = m && m.__importStar || function(e) {
+      if (e && e.__esModule) return e;
+      var t = {};
+      if (e != null) for (var i in e) i !== "default" && Object.prototype.hasOwnProperty.call(e, i) && S(t, e, i);
+      return D(t, e), t;
+    }, L = m && m.__importDefault || function(e) {
+      return e && e.__esModule ? e : { default: e };
+    };
+    Object.defineProperty(u, "__esModule", { value: !0 }), u.decodeXML = u.decodeHTMLStrict = u.decodeHTMLAttribute = u.decodeHTML = u.determineBranch = u.EntityDecoder = u.DecodingMode = u.BinTrieFlags = u.fromCodePoint = u.replaceCodePoint = u.decodeCodePoint = u.xmlDecodeTree = u.htmlDecodeTree = void 0;
+    var y = L(/* @__PURE__ */ Z());
+    u.htmlDecodeTree = y.default;
+    var P = L(/* @__PURE__ */ X());
+    u.xmlDecodeTree = P.default;
+    var N = I(/* @__PURE__ */ H());
+    u.decodeCodePoint = N.default;
+    var A = /* @__PURE__ */ H();
+    Object.defineProperty(u, "replaceCodePoint", { enumerable: !0, get: function() {
+      return A.replaceCodePoint;
+    } }), Object.defineProperty(u, "fromCodePoint", { enumerable: !0, get: function() {
+      return A.fromCodePoint;
+    } });
+    var c;
+    (function(e) {
+      e[e.NUM = 35] = "NUM", e[e.SEMI = 59] = "SEMI", e[e.EQUALS = 61] = "EQUALS", e[e.ZERO = 48] = "ZERO", e[e.NINE = 57] = "NINE", e[e.LOWER_A = 97] = "LOWER_A", e[e.LOWER_F = 102] = "LOWER_F", e[e.LOWER_X = 120] = "LOWER_X", e[e.LOWER_Z = 122] = "LOWER_Z", e[e.UPPER_A = 65] = "UPPER_A", e[e.UPPER_F = 70] = "UPPER_F", e[e.UPPER_Z = 90] = "UPPER_Z";
+    })(c || (c = {}));
+    var U = 32, l;
+    (function(e) {
+      e[e.VALUE_LENGTH = 49152] = "VALUE_LENGTH", e[e.BRANCH_LENGTH = 16256] = "BRANCH_LENGTH", e[e.JUMP_TABLE = 127] = "JUMP_TABLE";
+    })(l = u.BinTrieFlags || (u.BinTrieFlags = {}));
+    function f(e) {
+      return e >= c.ZERO && e <= c.NINE;
+    }
+    function p(e) {
+      return e >= c.UPPER_A && e <= c.UPPER_F || e >= c.LOWER_A && e <= c.LOWER_F;
+    }
+    function g(e) {
+      return e >= c.UPPER_A && e <= c.UPPER_Z || e >= c.LOWER_A && e <= c.LOWER_Z || f(e);
+    }
+    function W(e) {
+      return e === c.EQUALS || g(e);
+    }
+    var a;
+    (function(e) {
+      e[e.EntityStart = 0] = "EntityStart", e[e.NumericStart = 1] = "NumericStart", e[e.NumericDecimal = 2] = "NumericDecimal", e[e.NumericHex = 3] = "NumericHex", e[e.NamedEntity = 4] = "NamedEntity";
+    })(a || (a = {}));
+    var h;
+    (function(e) {
+      e[e.Legacy = 0] = "Legacy", e[e.Strict = 1] = "Strict", e[e.Attribute = 2] = "Attribute";
+    })(h = u.DecodingMode || (u.DecodingMode = {}));
+    var R = (
+      /** @class */
+      (function() {
+        function e(t, i, r) {
+          this.decodeTree = t, this.emitCodePoint = i, this.errors = r, this.state = a.EntityStart, this.consumed = 1, this.result = 0, this.treeIndex = 0, this.excess = 1, this.decodeMode = h.Strict;
+        }
+        return e.prototype.startEntity = function(t) {
+          this.decodeMode = t, this.state = a.EntityStart, this.result = 0, this.treeIndex = 0, this.excess = 1, this.consumed = 1;
+        }, e.prototype.write = function(t, i) {
+          switch (this.state) {
+            case a.EntityStart:
+              return t.charCodeAt(i) === c.NUM ? (this.state = a.NumericStart, this.consumed += 1, this.stateNumericStart(t, i + 1)) : (this.state = a.NamedEntity, this.stateNamedEntity(t, i));
+            case a.NumericStart:
+              return this.stateNumericStart(t, i);
+            case a.NumericDecimal:
+              return this.stateNumericDecimal(t, i);
+            case a.NumericHex:
+              return this.stateNumericHex(t, i);
+            case a.NamedEntity:
+              return this.stateNamedEntity(t, i);
+          }
+        }, e.prototype.stateNumericStart = function(t, i) {
+          return i >= t.length ? -1 : (t.charCodeAt(i) | U) === c.LOWER_X ? (this.state = a.NumericHex, this.consumed += 1, this.stateNumericHex(t, i + 1)) : (this.state = a.NumericDecimal, this.stateNumericDecimal(t, i));
+        }, e.prototype.addToNumericResult = function(t, i, r, n) {
+          if (i !== r) {
+            var d = r - i;
+            this.result = this.result * Math.pow(n, d) + parseInt(t.substr(i, d), n), this.consumed += d;
+          }
+        }, e.prototype.stateNumericHex = function(t, i) {
+          for (var r = i; i < t.length; ) {
+            var n = t.charCodeAt(i);
+            if (f(n) || p(n))
+              i += 1;
+            else
+              return this.addToNumericResult(t, r, i, 16), this.emitNumericEntity(n, 3);
+          }
+          return this.addToNumericResult(t, r, i, 16), -1;
+        }, e.prototype.stateNumericDecimal = function(t, i) {
+          for (var r = i; i < t.length; ) {
+            var n = t.charCodeAt(i);
+            if (f(n))
+              i += 1;
+            else
+              return this.addToNumericResult(t, r, i, 10), this.emitNumericEntity(n, 2);
+          }
+          return this.addToNumericResult(t, r, i, 10), -1;
+        }, e.prototype.emitNumericEntity = function(t, i) {
+          var r;
+          if (this.consumed <= i)
+            return (r = this.errors) === null || r === void 0 || r.absenceOfDigitsInNumericCharacterReference(this.consumed), 0;
+          if (t === c.SEMI)
+            this.consumed += 1;
+          else if (this.decodeMode === h.Strict)
+            return 0;
+          return this.emitCodePoint((0, N.replaceCodePoint)(this.result), this.consumed), this.errors && (t !== c.SEMI && this.errors.missingSemicolonAfterCharacterReference(), this.errors.validateNumericCharacterReference(this.result)), this.consumed;
+        }, e.prototype.stateNamedEntity = function(t, i) {
+          for (var r = this.decodeTree, n = r[this.treeIndex], d = (n & l.VALUE_LENGTH) >> 14; i < t.length; i++, this.excess++) {
+            var o = t.charCodeAt(i);
+            if (this.treeIndex = M(r, n, this.treeIndex + Math.max(1, d), o), this.treeIndex < 0)
+              return this.result === 0 || // If we are parsing an attribute
+              this.decodeMode === h.Attribute && // We shouldn't have consumed any characters after the entity,
+              (d === 0 || // And there should be no invalid characters.
+              W(o)) ? 0 : this.emitNotTerminatedNamedEntity();
+            if (n = r[this.treeIndex], d = (n & l.VALUE_LENGTH) >> 14, d !== 0) {
+              if (o === c.SEMI)
+                return this.emitNamedEntityData(this.treeIndex, d, this.consumed + this.excess);
+              this.decodeMode !== h.Strict && (this.result = this.treeIndex, this.consumed += this.excess, this.excess = 0);
+            }
+          }
+          return -1;
+        }, e.prototype.emitNotTerminatedNamedEntity = function() {
+          var t, i = this, r = i.result, n = i.decodeTree, d = (n[r] & l.VALUE_LENGTH) >> 14;
+          return this.emitNamedEntityData(r, d, this.consumed), (t = this.errors) === null || t === void 0 || t.missingSemicolonAfterCharacterReference(), this.consumed;
+        }, e.prototype.emitNamedEntityData = function(t, i, r) {
+          var n = this.decodeTree;
+          return this.emitCodePoint(i === 1 ? n[t] & ~l.VALUE_LENGTH : n[t + 1], r), i === 3 && this.emitCodePoint(n[t + 2], r), r;
+        }, e.prototype.end = function() {
+          var t;
+          switch (this.state) {
+            case a.NamedEntity:
+              return this.result !== 0 && (this.decodeMode !== h.Attribute || this.result === this.treeIndex) ? this.emitNotTerminatedNamedEntity() : 0;
+            // Otherwise, emit a numeric entity if we have one.
+            case a.NumericDecimal:
+              return this.emitNumericEntity(0, 2);
+            case a.NumericHex:
+              return this.emitNumericEntity(0, 3);
+            case a.NumericStart:
+              return (t = this.errors) === null || t === void 0 || t.absenceOfDigitsInNumericCharacterReference(this.consumed), 0;
+            case a.EntityStart:
+              return 0;
+          }
+        }, e;
+      })()
+    );
+    u.EntityDecoder = R;
+    function T(e) {
+      var t = "", i = new R(e, function(r) {
+        return t += (0, N.fromCodePoint)(r);
+      });
+      return function(n, d) {
+        for (var o = 0, s = 0; (s = n.indexOf("&", s)) >= 0; ) {
+          t += n.slice(o, s), i.startEntity(d);
+          var _ = i.write(
+            n,
+            // Skip the "&"
+            s + 1
+          );
+          if (_ < 0) {
+            o = s + i.end();
+            break;
+          }
+          o = s + _, s = _ === 0 ? o + 1 : o;
+        }
+        var E = t + n.slice(o);
+        return t = "", E;
+      };
+    }
+    function M(e, t, i, r) {
+      var n = (t & l.BRANCH_LENGTH) >> 7, d = t & l.JUMP_TABLE;
+      if (n === 0)
+        return d !== 0 && r === d ? i : -1;
+      if (d) {
+        var o = r - d;
+        return o < 0 || o >= n ? -1 : e[i + o] - 1;
+      }
+      for (var s = i, _ = s + n - 1; s <= _; ) {
+        var E = s + _ >>> 1, O = e[E];
+        if (O < r)
+          s = E + 1;
+        else if (O > r)
+          _ = E - 1;
+        else
+          return e[E + n];
+      }
+      return -1;
+    }
+    u.determineBranch = M;
+    var v = T(y.default), j = T(P.default);
+    function w(e, t) {
+      return t === void 0 && (t = h.Legacy), v(e, t);
+    }
+    u.decodeHTML = w;
+    function B(e) {
+      return v(e, h.Attribute);
+    }
+    u.decodeHTMLAttribute = B;
+    function q(e) {
+      return v(e, h.Strict);
+    }
+    u.decodeHTMLStrict = q;
+    function G(e) {
+      return j(e, h.Strict);
+    }
+    u.decodeXML = G;
+  })(m), m);
 }
 export {
-  s as __require
+  Q as __require
 };
 //# sourceMappingURL=index.es648.js.map

package/dist/index.es648.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es648.js","sources":["../node_modules/postcss/lib/comment.js"],"sourcesContent":["'use strict'\n\nlet Node = require('./node')\n\nclass Comment extends Node {\n  constructor(defaults) {\n    super(defaults)\n    this.type = 'comment'\n  }\n}\n\nmodule.exports = Comment\nComment.default = Comment\n"],"names":["Node","require$$0","Comment","defaults","comment"],"mappings":";;;;;AAEA,MAAIA,IAAOC,EAAA;AAAA,EAEX,MAAMC,UAAgBF,EAAK;AAAA,IACzB,YAAYG,GAAU;AACpB,YAAMA,CAAQ,GACd,KAAK,OAAO;AAAA,IAChB;AAAA,EACA;AAEA,SAAAC,IAAiBF,GACjBA,EAAQ,UAAUA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es648.js","sources":["../node_modules/htmlparser2/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":["__createBinding","this","o","m","k","k2","desc","__setModuleDefault","v","__importStar","mod","result","__importDefault","exports","decode_data_html_js_1","decode_data_xml_js_1","decode_codepoint_js_1","decode_codepoint_js_2","require$$2","CharCodes","TO_LOWER_BIT","BinTrieFlags","isNumber","code","isHexadecimalCharacter","isAsciiAlphaNumeric","isEntityInAttributeInvalidEnd","EntityDecoderState","DecodingMode","EntityDecoder","decodeTree","emitCodePoint","errors","decodeMode","str","offset","start","end","base","digitCount","startIdx","char","lastCp","expectedLength","_a","current","valueLength","determineBranch","_b","consumed","getDecoder","ret","decoder","lastIndex","len","nodeIdx","branchCount","jumpOffset","value","lo","hi","mid","midVal","htmlDecoder","xmlDecoder","decodeHTML","mode","decodeHTMLAttribute","decodeHTMLStrict","decodeXML"],"mappings":";;;;;;;AACA,QAAIA,IAAmBC,KAAQA,EAAK,oBAAqB,OAAO,UAAU,SAASC,GAAGC,GAAGC,GAAGC,GAAI;AAC5F,MAAIA,MAAO,WAAWA,IAAKD;AAC3B,UAAIE,IAAO,OAAO,yBAAyBH,GAAGC,CAAC;AAC/C,OAAI,CAACE,MAAS,SAASA,IAAO,CAACH,EAAE,aAAaG,EAAK,YAAYA,EAAK,mBAClEA,IAAO,EAAE,YAAY,IAAM,KAAK,WAAW;AAAE,eAAOH,EAAEC,CAAC;AAAA,QAAI,IAE7D,OAAO,eAAeF,GAAGG,GAAIC,CAAI;AAAA,IACrC,MAAM,SAASJ,GAAGC,GAAGC,GAAGC,GAAI;AACxB,MAAIA,MAAO,WAAWA,IAAKD,IAC3BF,EAAEG,CAAE,IAAIF,EAAEC,CAAC;AAAA,IACf,KACIG,IAAsBN,KAAQA,EAAK,uBAAwB,OAAO,UAAU,SAASC,GAAGM,GAAG;AAC3F,aAAO,eAAeN,GAAG,WAAW,EAAE,YAAY,IAAM,OAAOM,GAAG;AAAA,IACtE,KAAK,SAASN,GAAGM,GAAG;AAChB,MAAAN,EAAE,UAAaM;AAAA,IACnB,IACIC,IAAgBR,KAAQA,EAAK,gBAAiB,SAAUS,GAAK;AAC7D,UAAIA,KAAOA,EAAI,WAAY,QAAOA;AAClC,UAAIC,IAAS,CAAA;AACb,UAAID,KAAO,KAAM,UAASN,KAAKM,EAAK,CAAIN,MAAM,aAAa,OAAO,UAAU,eAAe,KAAKM,GAAKN,CAAC,KAAGJ,EAAgBW,GAAQD,GAAKN,CAAC;AACvI,aAAAG,EAAmBI,GAAQD,CAAG,GACvBC;AAAA,IACX,GACIC,IAAmBX,KAAQA,EAAK,mBAAoB,SAAUS,GAAK;AACnE,aAAQA,KAAOA,EAAI,aAAcA,IAAM,EAAE,SAAWA,EAAG;AAAA,IAC3D;AACA,WAAO,eAAcG,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,YAAoBA,EAAA,mBAA2BA,EAAA,sBAA8BA,EAAA,aAAqBA,EAAA,kBAA0BA,EAAA,gBAAwBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,gBAAwBA,EAAA,mBAA2BA,EAAA,kBAA0BA,EAAA,gBAAwBA,EAAA,iBAAyB;AAChU,QAAIC,IAAwBF,qBAA0D;AACtF,IAAAC,EAAA,iBAAyBC,EAAsB;AAC/C,QAAIC,IAAuBH,qBAAyD;AACpF,IAAAC,EAAA,gBAAwBE,EAAqB;AAC7C,QAAIC,IAAwBP,qBAA6C;AACzE,IAAAI,EAAA,kBAA0BG,EAAsB;AAChD,QAAIC,IAAwBC,gBAAAA,EAAA;AAC5B,WAAO,eAAeL,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOI,EAAsB;AAAA,IAAiB,EAAE,CAAE,GAC5I,OAAO,eAAeJ,GAAS,iBAAiB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOI,EAAsB;AAAA,IAAc,EAAE,CAAE;AACtI,QAAIE;AACJ,KAAC,SAAUA,GAAW;AAClB,MAAAA,EAAUA,EAAU,MAAS,EAAE,IAAI,OACnCA,EAAUA,EAAU,OAAU,EAAE,IAAI,QACpCA,EAAUA,EAAU,SAAY,EAAE,IAAI,UACtCA,EAAUA,EAAU,OAAU,EAAE,IAAI,QACpCA,EAAUA,EAAU,OAAU,EAAE,IAAI,QACpCA,EAAUA,EAAU,UAAa,EAAE,IAAI,WACvCA,EAAUA,EAAU,UAAa,GAAG,IAAI,WACxCA,EAAUA,EAAU,UAAa,GAAG,IAAI,WACxCA,EAAUA,EAAU,UAAa,GAAG,IAAI,WACxCA,EAAUA,EAAU,UAAa,EAAE,IAAI,WACvCA,EAAUA,EAAU,UAAa,EAAE,IAAI,WACvCA,EAAUA,EAAU,UAAa,EAAE,IAAI;AAAA,IAC3C,GAAGA,MAAcA,IAAY,CAAA,EAAG;AAEhC,QAAIC,IAAe,IACfC;AACJ,KAAC,SAAUA,GAAc;AACrB,MAAAA,EAAaA,EAAa,eAAkB,KAAK,IAAI,gBACrDA,EAAaA,EAAa,gBAAmB,KAAK,IAAI,iBACtDA,EAAaA,EAAa,aAAgB,GAAG,IAAI;AAAA,IACrD,GAAGA,IAAeR,EAAQ,iBAAiBA,EAAA,eAAuB,CAAA,EAAG;AACrE,aAASS,EAASC,GAAM;AACpB,aAAOA,KAAQJ,EAAU,QAAQI,KAAQJ,EAAU;AAAA,IACvD;AACA,aAASK,EAAuBD,GAAM;AAClC,aAASA,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WACnDI,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU;AAAA,IACxD;AACA,aAASM,EAAoBF,GAAM;AAC/B,aAASA,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WACnDI,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WAChDG,EAASC,CAAI;AAAA,IACrB;AAOA,aAASG,EAA8BH,GAAM;AACzC,aAAOA,MAASJ,EAAU,UAAUM,EAAoBF,CAAI;AAAA,IAChE;AACA,QAAII;AACJ,KAAC,SAAUA,GAAoB;AAC3B,MAAAA,EAAmBA,EAAmB,cAAiB,CAAC,IAAI,eAC5DA,EAAmBA,EAAmB,eAAkB,CAAC,IAAI,gBAC7DA,EAAmBA,EAAmB,iBAAoB,CAAC,IAAI,kBAC/DA,EAAmBA,EAAmB,aAAgB,CAAC,IAAI,cAC3DA,EAAmBA,EAAmB,cAAiB,CAAC,IAAI;AAAA,IAChE,GAAGA,MAAuBA,IAAqB,CAAA,EAAG;AAClD,QAAIC;AACJ,KAAC,SAAUA,GAAc;AAErB,MAAAA,EAAaA,EAAa,SAAY,CAAC,IAAI,UAE3CA,EAAaA,EAAa,SAAY,CAAC,IAAI,UAE3CA,EAAaA,EAAa,YAAe,CAAC,IAAI;AAAA,IAClD,GAAGA,IAAef,EAAQ,iBAAiBA,EAAA,eAAuB,CAAA,EAAG;AAIrE,QAAIgB;AAAA;AAAA,OAA+B,WAAY;AAC3C,iBAASA,EAETC,GAUAC,GAEAC,GAAQ;AACJ,eAAK,aAAaF,GAClB,KAAK,gBAAgBC,GACrB,KAAK,SAASC,GAEd,KAAK,QAAQL,EAAmB,aAEhC,KAAK,WAAW,GAOhB,KAAK,SAAS,GAEd,KAAK,YAAY,GAEjB,KAAK,SAAS,GAEd,KAAK,aAAaC,EAAa;AAAA,QACvC;AAEI,eAAAC,EAAc,UAAU,cAAc,SAAUI,GAAY;AACxD,eAAK,aAAaA,GAClB,KAAK,QAAQN,EAAmB,aAChC,KAAK,SAAS,GACd,KAAK,YAAY,GACjB,KAAK,SAAS,GACd,KAAK,WAAW;AAAA,QACxB,GAYIE,EAAc,UAAU,QAAQ,SAAUK,GAAKC,GAAQ;AACnD,kBAAQ,KAAK,OAAK;AAAA,YACd,KAAKR,EAAmB;AACpB,qBAAIO,EAAI,WAAWC,CAAM,MAAMhB,EAAU,OACrC,KAAK,QAAQQ,EAAmB,cAChC,KAAK,YAAY,GACV,KAAK,kBAAkBO,GAAKC,IAAS,CAAC,MAEjD,KAAK,QAAQR,EAAmB,aACzB,KAAK,iBAAiBO,GAAKC,CAAM;AAAA,YAE5C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,kBAAkBO,GAAKC,CAAM;AAAA,YAE7C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,oBAAoBO,GAAKC,CAAM;AAAA,YAE/C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,gBAAgBO,GAAKC,CAAM;AAAA,YAE3C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,iBAAiBO,GAAKC,CAAM;AAAA,UAExD;AAAA,QACA,GAUIN,EAAc,UAAU,oBAAoB,SAAUK,GAAKC,GAAQ;AAC/D,iBAAIA,KAAUD,EAAI,SACP,MAENA,EAAI,WAAWC,CAAM,IAAIf,OAAkBD,EAAU,WACtD,KAAK,QAAQQ,EAAmB,YAChC,KAAK,YAAY,GACV,KAAK,gBAAgBO,GAAKC,IAAS,CAAC,MAE/C,KAAK,QAAQR,EAAmB,gBACzB,KAAK,oBAAoBO,GAAKC,CAAM;AAAA,QACnD,GACIN,EAAc,UAAU,qBAAqB,SAAUK,GAAKE,GAAOC,GAAKC,GAAM;AAC1E,cAAIF,MAAUC,GAAK;AACf,gBAAIE,IAAaF,IAAMD;AACvB,iBAAK,SACD,KAAK,SAAS,KAAK,IAAIE,GAAMC,CAAU,IACnC,SAASL,EAAI,OAAOE,GAAOG,CAAU,GAAGD,CAAI,GACpD,KAAK,YAAYC;AAAA,UAC7B;AAAA,QACA,GAUIV,EAAc,UAAU,kBAAkB,SAAUK,GAAKC,GAAQ;AAE7D,mBADIK,IAAWL,GACRA,IAASD,EAAI,UAAQ;AACxB,gBAAIO,IAAOP,EAAI,WAAWC,CAAM;AAChC,gBAAIb,EAASmB,CAAI,KAAKjB,EAAuBiB,CAAI;AAC7C,cAAAN,KAAU;AAAA;AAGV,0BAAK,mBAAmBD,GAAKM,GAAUL,GAAQ,EAAE,GAC1C,KAAK,kBAAkBM,GAAM,CAAC;AAAA,UAErD;AACQ,sBAAK,mBAAmBP,GAAKM,GAAUL,GAAQ,EAAE,GAC1C;AAAA,QACf,GAUIN,EAAc,UAAU,sBAAsB,SAAUK,GAAKC,GAAQ;AAEjE,mBADIK,IAAWL,GACRA,IAASD,EAAI,UAAQ;AACxB,gBAAIO,IAAOP,EAAI,WAAWC,CAAM;AAChC,gBAAIb,EAASmB,CAAI;AACb,cAAAN,KAAU;AAAA;AAGV,0BAAK,mBAAmBD,GAAKM,GAAUL,GAAQ,EAAE,GAC1C,KAAK,kBAAkBM,GAAM,CAAC;AAAA,UAErD;AACQ,sBAAK,mBAAmBP,GAAKM,GAAUL,GAAQ,EAAE,GAC1C;AAAA,QACf,GAcIN,EAAc,UAAU,oBAAoB,SAAUa,GAAQC,GAAgB;AAC1E,cAAIC;AAEJ,cAAI,KAAK,YAAYD;AACjB,oBAACC,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,2CAA2C,KAAK,QAAQ,GAC5G;AAGX,cAAIF,MAAWvB,EAAU;AACrB,iBAAK,YAAY;AAAA,mBAEZ,KAAK,eAAeS,EAAa;AACtC,mBAAO;AAEX,sBAAK,kBAAkBZ,EAAsB,kBAAkB,KAAK,MAAM,GAAG,KAAK,QAAQ,GACtF,KAAK,WACD0B,MAAWvB,EAAU,QACrB,KAAK,OAAO,wCAAuC,GAEvD,KAAK,OAAO,kCAAkC,KAAK,MAAM,IAEtD,KAAK;AAAA,QACpB,GAUIU,EAAc,UAAU,mBAAmB,SAAUK,GAAKC,GAAQ;AAK9D,mBAJIL,IAAa,KAAK,YAClBe,IAAUf,EAAW,KAAK,SAAS,GAEnCgB,KAAeD,IAAUxB,EAAa,iBAAiB,IACpDc,IAASD,EAAI,QAAQC,KAAU,KAAK,UAAU;AACjD,gBAAIM,IAAOP,EAAI,WAAWC,CAAM;AAEhC,gBADA,KAAK,YAAYY,EAAgBjB,GAAYe,GAAS,KAAK,YAAY,KAAK,IAAI,GAAGC,CAAW,GAAGL,CAAI,GACjG,KAAK,YAAY;AACjB,qBAAO,KAAK,WAAW;AAAA,cAElB,KAAK,eAAeb,EAAa;AAAA,eAE7BkB,MAAgB;AAAA,cAEbpB,EAA8Be,CAAI,KACxC,IACA,KAAK,6BAA4B;AAK3C,gBAHAI,IAAUf,EAAW,KAAK,SAAS,GACnCgB,KAAeD,IAAUxB,EAAa,iBAAiB,IAEnDyB,MAAgB,GAAG;AAEnB,kBAAIL,MAAStB,EAAU;AACnB,uBAAO,KAAK,oBAAoB,KAAK,WAAW2B,GAAa,KAAK,WAAW,KAAK,MAAM;AAG5F,cAAI,KAAK,eAAelB,EAAa,WACjC,KAAK,SAAS,KAAK,WACnB,KAAK,YAAY,KAAK,QACtB,KAAK,SAAS;AAAA,YAElC;AAAA,UACA;AACQ,iBAAO;AAAA,QACf,GAMIC,EAAc,UAAU,+BAA+B,WAAY;AAC/D,cAAIe,GACAI,IAAK,MAAMrC,IAASqC,EAAG,QAAQlB,IAAakB,EAAG,YAC/CF,KAAehB,EAAWnB,CAAM,IAAIU,EAAa,iBAAiB;AACtE,sBAAK,oBAAoBV,GAAQmC,GAAa,KAAK,QAAQ,IAC1DF,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,wCAAuC,GAC3F,KAAK;AAAA,QACpB,GAUIf,EAAc,UAAU,sBAAsB,SAAUlB,GAAQmC,GAAaG,GAAU;AACnF,cAAInB,IAAa,KAAK;AACtB,sBAAK,cAAcgB,MAAgB,IAC7BhB,EAAWnB,CAAM,IAAI,CAACU,EAAa,eACnCS,EAAWnB,IAAS,CAAC,GAAGsC,CAAQ,GAClCH,MAAgB,KAEhB,KAAK,cAAchB,EAAWnB,IAAS,CAAC,GAAGsC,CAAQ,GAEhDA;AAAA,QACf,GAQIpB,EAAc,UAAU,MAAM,WAAY;AACtC,cAAIe;AACJ,kBAAQ,KAAK,OAAK;AAAA,YACd,KAAKjB,EAAmB;AAEpB,qBAAO,KAAK,WAAW,MAClB,KAAK,eAAeC,EAAa,aAC9B,KAAK,WAAW,KAAK,aACvB,KAAK,6BAA4B,IACjC;AAAA;AAAA,YAGV,KAAKD,EAAmB;AACpB,qBAAO,KAAK,kBAAkB,GAAG,CAAC;AAAA,YAEtC,KAAKA,EAAmB;AACpB,qBAAO,KAAK,kBAAkB,GAAG,CAAC;AAAA,YAEtC,KAAKA,EAAmB;AACpB,sBAACiB,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,2CAA2C,KAAK,QAAQ,GAC5G;AAAA,YAEX,KAAKjB,EAAmB;AAEpB,qBAAO;AAAA,UAEvB;AAAA,QACA,GACWE;AAAA,MACX;;AACA,IAAAhB,EAAA,gBAAwBgB;AAOxB,aAASqB,EAAWpB,GAAY;AAC5B,UAAIqB,IAAM,IACNC,IAAU,IAAIvB,EAAcC,GAAY,SAAUI,GAAK;AAAE,eAAQiB,SAAWnC,EAAsB,eAAekB,CAAG;AAAA,MAAG,CAAE;AAC7H,aAAO,SAAwBA,GAAKD,GAAY;AAG5C,iBAFIoB,IAAY,GACZlB,IAAS,IACLA,IAASD,EAAI,QAAQ,KAAKC,CAAM,MAAM,KAAG;AAC7C,UAAAgB,KAAOjB,EAAI,MAAMmB,GAAWlB,CAAM,GAClCiB,EAAQ,YAAYnB,CAAU;AAC9B,cAAIqB,IAAMF,EAAQ;AAAA,YAAMlB;AAAA;AAAA,YAExBC,IAAS;AAAA,UAAC;AACV,cAAImB,IAAM,GAAG;AACT,YAAAD,IAAYlB,IAASiB,EAAQ,IAAG;AAChC;AAAA,UAChB;AACY,UAAAC,IAAYlB,IAASmB,GAErBnB,IAASmB,MAAQ,IAAID,IAAY,IAAIA;AAAA,QACjD;AACQ,YAAI1C,IAASwC,IAAMjB,EAAI,MAAMmB,CAAS;AAEtC,eAAAF,IAAM,IACCxC;AAAA,MACf;AAAA,IACA;AAWA,aAASoC,EAAgBjB,GAAYe,GAASU,GAASd,GAAM;AACzD,UAAIe,KAAeX,IAAUxB,EAAa,kBAAkB,GACxDoC,IAAaZ,IAAUxB,EAAa;AAExC,UAAImC,MAAgB;AAChB,eAAOC,MAAe,KAAKhB,MAASgB,IAAaF,IAAU;AAG/D,UAAIE,GAAY;AACZ,YAAIC,IAAQjB,IAAOgB;AACnB,eAAOC,IAAQ,KAAKA,KAASF,IACvB,KACA1B,EAAWyB,IAAUG,CAAK,IAAI;AAAA,MAC5C;AAKI,eAFIC,IAAKJ,GACLK,IAAKD,IAAKH,IAAc,GACrBG,KAAMC,KAAI;AACb,YAAIC,IAAOF,IAAKC,MAAQ,GACpBE,IAAShC,EAAW+B,CAAG;AAC3B,YAAIC,IAASrB;AACT,UAAAkB,IAAKE,IAAM;AAAA,iBAENC,IAASrB;AACd,UAAAmB,IAAKC,IAAM;AAAA;AAGX,iBAAO/B,EAAW+B,IAAML,CAAW;AAAA,MAE/C;AACI,aAAO;AAAA,IACX;AACA,IAAA3C,EAAA,kBAA0BkC;AAC1B,QAAIgB,IAAcb,EAAWpC,EAAsB,OAAO,GACtDkD,IAAad,EAAWnC,EAAqB,OAAO;AAQxD,aAASkD,EAAW/B,GAAKgC,GAAM;AAC3B,aAAIA,MAAS,WAAUA,IAAOtC,EAAa,SACpCmC,EAAY7B,GAAKgC,CAAI;AAAA,IAChC;AACA,IAAArD,EAAA,aAAqBoD;AAOrB,aAASE,EAAoBjC,GAAK;AAC9B,aAAO6B,EAAY7B,GAAKN,EAAa,SAAS;AAAA,IAClD;AACA,IAAAf,EAAA,sBAA8BsD;AAO9B,aAASC,EAAiBlC,GAAK;AAC3B,aAAO6B,EAAY7B,GAAKN,EAAa,MAAM;AAAA,IAC/C;AACA,IAAAf,EAAA,mBAA2BuD;AAO3B,aAASC,EAAUnC,GAAK;AACpB,aAAO8B,EAAW9B,GAAKN,EAAa,MAAM;AAAA,IAC9C;AACA,IAAAf,EAAA,YAAoBwD;AAAA;;","x_google_ignoreList":[0]}

package/dist/index.es649.js

@@ -1,224 +1,5 @@
-import { __require as k } from "./index.es648.js";
-import { __require as D } from "./index.es651.js";
-import { __require as P } from "./index.es657.js";
-import { __require as q } from "./index.es684.js";
-var y, v;
-function j() {
-  if (v) return y;
-  v = 1;
-  let h = k(), p = D(), R = P(), { isClean: x, my: m } = q(), a, d, w, l;
-  function O(s) {
-    return s.map((e) => (e.nodes && (e.nodes = O(e.nodes)), delete e.source, e));
-  }
-  function g(s) {
-    if (s[x] = !1, s.proxyOf.nodes)
-      for (let e of s.proxyOf.nodes)
-        g(e);
-  }
-  class f extends R {
-    get first() {
-      if (this.proxyOf.nodes)
-        return this.proxyOf.nodes[0];
-    }
-    get last() {
-      if (this.proxyOf.nodes)
-        return this.proxyOf.nodes[this.proxyOf.nodes.length - 1];
-    }
-    append(...e) {
-      for (let t of e) {
-        let r = this.normalize(t, this.last);
-        for (let i of r) this.proxyOf.nodes.push(i);
-      }
-      return this.markDirty(), this;
-    }
-    cleanRaws(e) {
-      if (super.cleanRaws(e), this.nodes)
-        for (let t of this.nodes) t.cleanRaws(e);
-    }
-    each(e) {
-      if (!this.proxyOf.nodes) return;
-      let t = this.getIterator(), r, i;
-      for (; this.indexes[t] < this.proxyOf.nodes.length && (r = this.indexes[t], i = e(this.proxyOf.nodes[r], r), i !== !1); )
-        this.indexes[t] += 1;
-      return delete this.indexes[t], i;
-    }
-    every(e) {
-      return this.nodes.every(e);
-    }
-    getIterator() {
-      this.lastEach || (this.lastEach = 0), this.indexes || (this.indexes = {}), this.lastEach += 1;
-      let e = this.lastEach;
-      return this.indexes[e] = 0, e;
-    }
-    getProxyProcessor() {
-      return {
-        get(e, t) {
-          return t === "proxyOf" ? e : e[t] ? t === "each" || typeof t == "string" && t.startsWith("walk") ? (...r) => e[t](
-            ...r.map((i) => typeof i == "function" ? (n, o) => i(n.toProxy(), o) : i)
-          ) : t === "every" || t === "some" ? (r) => e[t](
-            (i, ...n) => r(i.toProxy(), ...n)
-          ) : t === "root" ? () => e.root().toProxy() : t === "nodes" ? e.nodes.map((r) => r.toProxy()) : t === "first" || t === "last" ? e[t].toProxy() : e[t] : e[t];
-        },
-        set(e, t, r) {
-          return e[t] === r || (e[t] = r, (t === "name" || t === "params" || t === "selector") && e.markDirty()), !0;
-        }
-      };
-    }
-    index(e) {
-      return typeof e == "number" ? e : (e.proxyOf && (e = e.proxyOf), this.proxyOf.nodes.indexOf(e));
-    }
-    insertAfter(e, t) {
-      let r = this.index(e), i = this.normalize(t, this.proxyOf.nodes[r]).reverse();
-      r = this.index(e);
-      for (let o of i) this.proxyOf.nodes.splice(r + 1, 0, o);
-      let n;
-      for (let o in this.indexes)
-        n = this.indexes[o], r < n && (this.indexes[o] = n + i.length);
-      return this.markDirty(), this;
-    }
-    insertBefore(e, t) {
-      let r = this.index(e), i = r === 0 ? "prepend" : !1, n = this.normalize(
-        t,
-        this.proxyOf.nodes[r],
-        i
-      ).reverse();
-      r = this.index(e);
-      for (let u of n) this.proxyOf.nodes.splice(r, 0, u);
-      let o;
-      for (let u in this.indexes)
-        o = this.indexes[u], r <= o && (this.indexes[u] = o + n.length);
-      return this.markDirty(), this;
-    }
-    normalize(e, t) {
-      if (typeof e == "string")
-        e = O(d(e).nodes);
-      else if (typeof e > "u")
-        e = [];
-      else if (Array.isArray(e)) {
-        e = e.slice(0);
-        for (let i of e)
-          i.parent && i.parent.removeChild(i, "ignore");
-      } else if (e.type === "root" && this.type !== "document") {
-        e = e.nodes.slice(0);
-        for (let i of e)
-          i.parent && i.parent.removeChild(i, "ignore");
-      } else if (e.type)
-        e = [e];
-      else if (e.prop) {
-        if (typeof e.value > "u")
-          throw new Error("Value field is missed in node creation");
-        typeof e.value != "string" && (e.value = String(e.value)), e = [new p(e)];
-      } else if (e.selector || e.selectors)
-        e = [new l(e)];
-      else if (e.name)
-        e = [new a(e)];
-      else if (e.text)
-        e = [new h(e)];
-      else
-        throw new Error("Unknown node type in node creation");
-      return e.map((i) => (i[m] || f.rebuild(i), i = i.proxyOf, i.parent && i.parent.removeChild(i), i[x] && g(i), i.raws || (i.raws = {}), typeof i.raws.before > "u" && t && typeof t.raws.before < "u" && (i.raws.before = t.raws.before.replace(/\S/g, "")), i.parent = this.proxyOf, i));
-    }
-    prepend(...e) {
-      e = e.reverse();
-      for (let t of e) {
-        let r = this.normalize(t, this.first, "prepend").reverse();
-        for (let i of r) this.proxyOf.nodes.unshift(i);
-        for (let i in this.indexes)
-          this.indexes[i] = this.indexes[i] + r.length;
-      }
-      return this.markDirty(), this;
-    }
-    push(e) {
-      return e.parent = this, this.proxyOf.nodes.push(e), this;
-    }
-    removeAll() {
-      for (let e of this.proxyOf.nodes) e.parent = void 0;
-      return this.proxyOf.nodes = [], this.markDirty(), this;
-    }
-    removeChild(e) {
-      e = this.index(e), this.proxyOf.nodes[e].parent = void 0, this.proxyOf.nodes.splice(e, 1);
-      let t;
-      for (let r in this.indexes)
-        t = this.indexes[r], t >= e && (this.indexes[r] = t - 1);
-      return this.markDirty(), this;
-    }
-    replaceValues(e, t, r) {
-      return r || (r = t, t = {}), this.walkDecls((i) => {
-        t.props && !t.props.includes(i.prop) || t.fast && !i.value.includes(t.fast) || (i.value = i.value.replace(e, r));
-      }), this.markDirty(), this;
-    }
-    some(e) {
-      return this.nodes.some(e);
-    }
-    walk(e) {
-      return this.each((t, r) => {
-        let i;
-        try {
-          i = e(t, r);
-        } catch (n) {
-          throw t.addToError(n);
-        }
-        return i !== !1 && t.walk && (i = t.walk(e)), i;
-      });
-    }
-    walkAtRules(e, t) {
-      return t ? e instanceof RegExp ? this.walk((r, i) => {
-        if (r.type === "atrule" && e.test(r.name))
-          return t(r, i);
-      }) : this.walk((r, i) => {
-        if (r.type === "atrule" && r.name === e)
-          return t(r, i);
-      }) : (t = e, this.walk((r, i) => {
-        if (r.type === "atrule")
-          return t(r, i);
-      }));
-    }
-    walkComments(e) {
-      return this.walk((t, r) => {
-        if (t.type === "comment")
-          return e(t, r);
-      });
-    }
-    walkDecls(e, t) {
-      return t ? e instanceof RegExp ? this.walk((r, i) => {
-        if (r.type === "decl" && e.test(r.prop))
-          return t(r, i);
-      }) : this.walk((r, i) => {
-        if (r.type === "decl" && r.prop === e)
-          return t(r, i);
-      }) : (t = e, this.walk((r, i) => {
-        if (r.type === "decl")
-          return t(r, i);
-      }));
-    }
-    walkRules(e, t) {
-      return t ? e instanceof RegExp ? this.walk((r, i) => {
-        if (r.type === "rule" && e.test(r.selector))
-          return t(r, i);
-      }) : this.walk((r, i) => {
-        if (r.type === "rule" && r.selector === e)
-          return t(r, i);
-      }) : (t = e, this.walk((r, i) => {
-        if (r.type === "rule")
-          return t(r, i);
-      }));
-    }
-  }
-  return f.registerParse = (s) => {
-    d = s;
-  }, f.registerRule = (s) => {
-    l = s;
-  }, f.registerAtRule = (s) => {
-    a = s;
-  }, f.registerRoot = (s) => {
-    w = s;
-  }, y = f, f.default = f, f.rebuild = (s) => {
-    s.type === "atrule" ? Object.setPrototypeOf(s, a.prototype) : s.type === "rule" ? Object.setPrototypeOf(s, l.prototype) : s.type === "decl" ? Object.setPrototypeOf(s, p.prototype) : s.type === "comment" ? Object.setPrototypeOf(s, h.prototype) : s.type === "root" && Object.setPrototypeOf(s, w.prototype), s[m] = !0, s.nodes && s.nodes.forEach((e) => {
-      f.rebuild(e);
-    });
-  }, y;
-}
+var r = {};
 export {
-  j as __require
+  r as __exports
 };
 //# sourceMappingURL=index.es649.js.map

package/dist/index.es649.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es649.js","sources":["../node_modules/postcss/lib/container.js"],"sourcesContent":["'use strict'\n\nlet Comment = require('./comment')\nlet Declaration = require('./declaration')\nlet Node = require('./node')\nlet { isClean, my } = require('./symbols')\n\nlet AtRule, parse, Root, Rule\n\nfunction cleanSource(nodes) {\n  return nodes.map(i => {\n    if (i.nodes) i.nodes = cleanSource(i.nodes)\n    delete i.source\n    return i\n  })\n}\n\nfunction markTreeDirty(node) {\n  node[isClean] = false\n  if (node.proxyOf.nodes) {\n    for (let i of node.proxyOf.nodes) {\n      markTreeDirty(i)\n    }\n  }\n}\n\nclass Container extends Node {\n  get first() {\n    if (!this.proxyOf.nodes) return undefined\n    return this.proxyOf.nodes[0]\n  }\n\n  get last() {\n    if (!this.proxyOf.nodes) return undefined\n    return this.proxyOf.nodes[this.proxyOf.nodes.length - 1]\n  }\n\n  append(...children) {\n    for (let child of children) {\n      let nodes = this.normalize(child, this.last)\n      for (let node of nodes) this.proxyOf.nodes.push(node)\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  cleanRaws(keepBetween) {\n    super.cleanRaws(keepBetween)\n    if (this.nodes) {\n      for (let node of this.nodes) node.cleanRaws(keepBetween)\n    }\n  }\n\n  each(callback) {\n    if (!this.proxyOf.nodes) return undefined\n    let iterator = this.getIterator()\n\n    let index, result\n    while (this.indexes[iterator] < this.proxyOf.nodes.length) {\n      index = this.indexes[iterator]\n      result = callback(this.proxyOf.nodes[index], index)\n      if (result === false) break\n\n      this.indexes[iterator] += 1\n    }\n\n    delete this.indexes[iterator]\n    return result\n  }\n\n  every(condition) {\n    return this.nodes.every(condition)\n  }\n\n  getIterator() {\n    if (!this.lastEach) this.lastEach = 0\n    if (!this.indexes) this.indexes = {}\n\n    this.lastEach += 1\n    let iterator = this.lastEach\n    this.indexes[iterator] = 0\n\n    return iterator\n  }\n\n  getProxyProcessor() {\n    return {\n      get(node, prop) {\n        if (prop === 'proxyOf') {\n          return node\n        } else if (!node[prop]) {\n          return node[prop]\n        } else if (\n          prop === 'each' ||\n          (typeof prop === 'string' && prop.startsWith('walk'))\n        ) {\n          return (...args) => {\n            return node[prop](\n              ...args.map(i => {\n                if (typeof i === 'function') {\n                  return (child, index) => i(child.toProxy(), index)\n                } else {\n                  return i\n                }\n              })\n            )\n          }\n        } else if (prop === 'every' || prop === 'some') {\n          return cb => {\n            return node[prop]((child, ...other) =>\n              cb(child.toProxy(), ...other)\n            )\n          }\n        } else if (prop === 'root') {\n          return () => node.root().toProxy()\n        } else if (prop === 'nodes') {\n          return node.nodes.map(i => i.toProxy())\n        } else if (prop === 'first' || prop === 'last') {\n          return node[prop].toProxy()\n        } else {\n          return node[prop]\n        }\n      },\n\n      set(node, prop, value) {\n        if (node[prop] === value) return true\n        node[prop] = value\n        if (prop === 'name' || prop === 'params' || prop === 'selector') {\n          node.markDirty()\n        }\n        return true\n      }\n    }\n  }\n\n  index(child) {\n    if (typeof child === 'number') return child\n    if (child.proxyOf) child = child.proxyOf\n    return this.proxyOf.nodes.indexOf(child)\n  }\n\n  insertAfter(exist, add) {\n    let existIndex = this.index(exist)\n    let nodes = this.normalize(add, this.proxyOf.nodes[existIndex]).reverse()\n    existIndex = this.index(exist)\n    for (let node of nodes) this.proxyOf.nodes.splice(existIndex + 1, 0, node)\n\n    let index\n    for (let id in this.indexes) {\n      index = this.indexes[id]\n      if (existIndex < index) {\n        this.indexes[id] = index + nodes.length\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  insertBefore(exist, add) {\n    let existIndex = this.index(exist)\n    let type = existIndex === 0 ? 'prepend' : false\n    let nodes = this.normalize(\n      add,\n      this.proxyOf.nodes[existIndex],\n      type\n    ).reverse()\n    existIndex = this.index(exist)\n    for (let node of nodes) this.proxyOf.nodes.splice(existIndex, 0, node)\n\n    let index\n    for (let id in this.indexes) {\n      index = this.indexes[id]\n      if (existIndex <= index) {\n        this.indexes[id] = index + nodes.length\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  normalize(nodes, sample) {\n    if (typeof nodes === 'string') {\n      nodes = cleanSource(parse(nodes).nodes)\n    } else if (typeof nodes === 'undefined') {\n      nodes = []\n    } else if (Array.isArray(nodes)) {\n      nodes = nodes.slice(0)\n      for (let i of nodes) {\n        if (i.parent) i.parent.removeChild(i, 'ignore')\n      }\n    } else if (nodes.type === 'root' && this.type !== 'document') {\n      nodes = nodes.nodes.slice(0)\n      for (let i of nodes) {\n        if (i.parent) i.parent.removeChild(i, 'ignore')\n      }\n    } else if (nodes.type) {\n      nodes = [nodes]\n    } else if (nodes.prop) {\n      if (typeof nodes.value === 'undefined') {\n        throw new Error('Value field is missed in node creation')\n      } else if (typeof nodes.value !== 'string') {\n        nodes.value = String(nodes.value)\n      }\n      nodes = [new Declaration(nodes)]\n    } else if (nodes.selector || nodes.selectors) {\n      nodes = [new Rule(nodes)]\n    } else if (nodes.name) {\n      nodes = [new AtRule(nodes)]\n    } else if (nodes.text) {\n      nodes = [new Comment(nodes)]\n    } else {\n      throw new Error('Unknown node type in node creation')\n    }\n\n    let processed = nodes.map(i => {\n      /* c8 ignore next */\n      if (!i[my]) Container.rebuild(i)\n      i = i.proxyOf\n      if (i.parent) i.parent.removeChild(i)\n      if (i[isClean]) markTreeDirty(i)\n\n      if (!i.raws) i.raws = {}\n      if (typeof i.raws.before === 'undefined') {\n        if (sample && typeof sample.raws.before !== 'undefined') {\n          i.raws.before = sample.raws.before.replace(/\\S/g, '')\n        }\n      }\n      i.parent = this.proxyOf\n      return i\n    })\n\n    return processed\n  }\n\n  prepend(...children) {\n    children = children.reverse()\n    for (let child of children) {\n      let nodes = this.normalize(child, this.first, 'prepend').reverse()\n      for (let node of nodes) this.proxyOf.nodes.unshift(node)\n      for (let id in this.indexes) {\n        this.indexes[id] = this.indexes[id] + nodes.length\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  push(child) {\n    child.parent = this\n    this.proxyOf.nodes.push(child)\n    return this\n  }\n\n  removeAll() {\n    for (let node of this.proxyOf.nodes) node.parent = undefined\n    this.proxyOf.nodes = []\n\n    this.markDirty()\n\n    return this\n  }\n\n  removeChild(child) {\n    child = this.index(child)\n    this.proxyOf.nodes[child].parent = undefined\n    this.proxyOf.nodes.splice(child, 1)\n\n    let index\n    for (let id in this.indexes) {\n      index = this.indexes[id]\n      if (index >= child) {\n        this.indexes[id] = index - 1\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  replaceValues(pattern, opts, callback) {\n    if (!callback) {\n      callback = opts\n      opts = {}\n    }\n\n    this.walkDecls(decl => {\n      if (opts.props && !opts.props.includes(decl.prop)) return\n      if (opts.fast && !decl.value.includes(opts.fast)) return\n\n      decl.value = decl.value.replace(pattern, callback)\n    })\n\n    this.markDirty()\n\n    return this\n  }\n\n  some(condition) {\n    return this.nodes.some(condition)\n  }\n\n  walk(callback) {\n    return this.each((child, i) => {\n      let result\n      try {\n        result = callback(child, i)\n      } catch (e) {\n        throw child.addToError(e)\n      }\n      if (result !== false && child.walk) {\n        result = child.walk(callback)\n      }\n\n      return result\n    })\n  }\n\n  walkAtRules(name, callback) {\n    if (!callback) {\n      callback = name\n      return this.walk((child, i) => {\n        if (child.type === 'atrule') {\n          return callback(child, i)\n        }\n      })\n    }\n    if (name instanceof RegExp) {\n      return this.walk((child, i) => {\n        if (child.type === 'atrule' && name.test(child.name)) {\n          return callback(child, i)\n        }\n      })\n    }\n    return this.walk((child, i) => {\n      if (child.type === 'atrule' && child.name === name) {\n        return callback(child, i)\n      }\n    })\n  }\n\n  walkComments(callback) {\n    return this.walk((child, i) => {\n      if (child.type === 'comment') {\n        return callback(child, i)\n      }\n    })\n  }\n\n  walkDecls(prop, callback) {\n    if (!callback) {\n      callback = prop\n      return this.walk((child, i) => {\n        if (child.type === 'decl') {\n          return callback(child, i)\n        }\n      })\n    }\n    if (prop instanceof RegExp) {\n      return this.walk((child, i) => {\n        if (child.type === 'decl' && prop.test(child.prop)) {\n          return callback(child, i)\n        }\n      })\n    }\n    return this.walk((child, i) => {\n      if (child.type === 'decl' && child.prop === prop) {\n        return callback(child, i)\n      }\n    })\n  }\n\n  walkRules(selector, callback) {\n    if (!callback) {\n      callback = selector\n\n      return this.walk((child, i) => {\n        if (child.type === 'rule') {\n          return callback(child, i)\n        }\n      })\n    }\n    if (selector instanceof RegExp) {\n      return this.walk((child, i) => {\n        if (child.type === 'rule' && selector.test(child.selector)) {\n          return callback(child, i)\n        }\n      })\n    }\n    return this.walk((child, i) => {\n      if (child.type === 'rule' && child.selector === selector) {\n        return callback(child, i)\n      }\n    })\n  }\n}\n\nContainer.registerParse = dependant => {\n  parse = dependant\n}\n\nContainer.registerRule = dependant => {\n  Rule = dependant\n}\n\nContainer.registerAtRule = dependant => {\n  AtRule = dependant\n}\n\nContainer.registerRoot = dependant => {\n  Root = dependant\n}\n\nmodule.exports = Container\nContainer.default = Container\n\n/* c8 ignore start */\nContainer.rebuild = node => {\n  if (node.type === 'atrule') {\n    Object.setPrototypeOf(node, AtRule.prototype)\n  } else if (node.type === 'rule') {\n    Object.setPrototypeOf(node, Rule.prototype)\n  } else if (node.type === 'decl') {\n    Object.setPrototypeOf(node, Declaration.prototype)\n  } else if (node.type === 'comment') {\n    Object.setPrototypeOf(node, Comment.prototype)\n  } else if (node.type === 'root') {\n    Object.setPrototypeOf(node, Root.prototype)\n  }\n\n  node[my] = true\n\n  if (node.nodes) {\n    node.nodes.forEach(child => {\n      Container.rebuild(child)\n    })\n  }\n}\n/* c8 ignore stop */\n"],"names":["Comment","require$$0","Declaration","require$$1","Node","require$$2","isClean","my","require$$3","AtRule","parse","Root","Rule","cleanSource","nodes","i","markTreeDirty","node","Container","children","child","keepBetween","callback","iterator","index","result","condition","prop","args","cb","other","value","exist","add","existIndex","id","type","sample","pattern","opts","decl","e","name","selector","dependant","container"],"mappings":";;;;;;;;AAEA,MAAIA,IAAUC,EAAA,GACVC,IAAcC,EAAA,GACdC,IAAOC,EAAA,GACP,EAAE,SAAAC,GAAS,IAAAC,EAAE,IAAKC,EAAA,GAElBC,GAAQC,GAAOC,GAAMC;AAEzB,WAASC,EAAYC,GAAO;AAC1B,WAAOA,EAAM,IAAI,CAAAC,OACXA,EAAE,UAAOA,EAAE,QAAQF,EAAYE,EAAE,KAAK,IAC1C,OAAOA,EAAE,QACFA,EACR;AAAA,EACH;AAEA,WAASC,EAAcC,GAAM;AAE3B,QADAA,EAAKX,CAAO,IAAI,IACZW,EAAK,QAAQ;AACf,eAASF,KAAKE,EAAK,QAAQ;AACzB,QAAAD,EAAcD,CAAC;AAAA,EAGrB;AAAA,EAEA,MAAMG,UAAkBd,EAAK;AAAA,IAC3B,IAAI,QAAQ;AACV,UAAK,KAAK,QAAQ;AAClB,eAAO,KAAK,QAAQ,MAAM,CAAC;AAAA,IAC/B;AAAA,IAEE,IAAI,OAAO;AACT,UAAK,KAAK,QAAQ;AAClB,eAAO,KAAK,QAAQ,MAAM,KAAK,QAAQ,MAAM,SAAS,CAAC;AAAA,IAC3D;AAAA,IAEE,UAAUe,GAAU;AAClB,eAASC,KAASD,GAAU;AAC1B,YAAIL,IAAQ,KAAK,UAAUM,GAAO,KAAK,IAAI;AAC3C,iBAASH,KAAQH,EAAO,MAAK,QAAQ,MAAM,KAAKG,CAAI;AAAA,MAC1D;AAEI,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,UAAUI,GAAa;AAErB,UADA,MAAM,UAAUA,CAAW,GACvB,KAAK;AACP,iBAASJ,KAAQ,KAAK,MAAO,CAAAA,EAAK,UAAUI,CAAW;AAAA,IAE7D;AAAA,IAEE,KAAKC,GAAU;AACb,UAAI,CAAC,KAAK,QAAQ,MAAO;AACzB,UAAIC,IAAW,KAAK,YAAW,GAE3BC,GAAOC;AACX,aAAO,KAAK,QAAQF,CAAQ,IAAI,KAAK,QAAQ,MAAM,WACjDC,IAAQ,KAAK,QAAQD,CAAQ,GAC7BE,IAASH,EAAS,KAAK,QAAQ,MAAME,CAAK,GAAGA,CAAK,GAC9CC,MAAW;AAEf,aAAK,QAAQF,CAAQ,KAAK;AAG5B,oBAAO,KAAK,QAAQA,CAAQ,GACrBE;AAAA,IACX;AAAA,IAEE,MAAMC,GAAW;AACf,aAAO,KAAK,MAAM,MAAMA,CAAS;AAAA,IACrC;AAAA,IAEE,cAAc;AACZ,MAAK,KAAK,aAAU,KAAK,WAAW,IAC/B,KAAK,YAAS,KAAK,UAAU,CAAA,IAElC,KAAK,YAAY;AACjB,UAAIH,IAAW,KAAK;AACpB,kBAAK,QAAQA,CAAQ,IAAI,GAElBA;AAAA,IACX;AAAA,IAEE,oBAAoB;AAClB,aAAO;AAAA,QACL,IAAIN,GAAMU,GAAM;AACd,iBAAIA,MAAS,YACJV,IACGA,EAAKU,CAAI,IAGnBA,MAAS,UACR,OAAOA,KAAS,YAAYA,EAAK,WAAW,MAAM,IAE5C,IAAIC,MACFX,EAAKU,CAAI;AAAA,YACd,GAAGC,EAAK,IAAI,OACN,OAAO,KAAM,aACR,CAACR,GAAOI,MAAU,EAAEJ,EAAM,QAAO,GAAII,CAAK,IAE1C,CAEV;AAAA,UACf,IAEmBG,MAAS,WAAWA,MAAS,SAC/B,CAAAE,MACEZ,EAAKU,CAAI;AAAA,YAAE,CAACP,MAAUU,MAC3BD,EAAGT,EAAM,QAAO,GAAI,GAAGU,CAAK;AAAA,UAC1C,IAEmBH,MAAS,SACX,MAAMV,EAAK,KAAI,EAAG,QAAO,IACvBU,MAAS,UACXV,EAAK,MAAM,IAAI,CAAAF,MAAKA,EAAE,QAAO,CAAE,IAC7BY,MAAS,WAAWA,MAAS,SAC/BV,EAAKU,CAAI,EAAE,QAAO,IAElBV,EAAKU,CAAI,IA7BTV,EAAKU,CAAI;AAAA,QA+B1B;AAAA,QAEM,IAAIV,GAAMU,GAAMI,GAAO;AACrB,iBAAId,EAAKU,CAAI,MAAMI,MACnBd,EAAKU,CAAI,IAAII,IACTJ,MAAS,UAAUA,MAAS,YAAYA,MAAS,eACnDV,EAAK,UAAS,IAET;AAAA,QACf;AAAA,MACA;AAAA,IACA;AAAA,IAEE,MAAMG,GAAO;AACX,aAAI,OAAOA,KAAU,WAAiBA,KAClCA,EAAM,YAASA,IAAQA,EAAM,UAC1B,KAAK,QAAQ,MAAM,QAAQA,CAAK;AAAA,IAC3C;AAAA,IAEE,YAAYY,GAAOC,GAAK;AACtB,UAAIC,IAAa,KAAK,MAAMF,CAAK,GAC7BlB,IAAQ,KAAK,UAAUmB,GAAK,KAAK,QAAQ,MAAMC,CAAU,CAAC,EAAE,QAAO;AACvE,MAAAA,IAAa,KAAK,MAAMF,CAAK;AAC7B,eAASf,KAAQH,EAAO,MAAK,QAAQ,MAAM,OAAOoB,IAAa,GAAG,GAAGjB,CAAI;AAEzE,UAAIO;AACJ,eAASW,KAAM,KAAK;AAClB,QAAAX,IAAQ,KAAK,QAAQW,CAAE,GACnBD,IAAaV,MACf,KAAK,QAAQW,CAAE,IAAIX,IAAQV,EAAM;AAIrC,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,aAAakB,GAAOC,GAAK;AACvB,UAAIC,IAAa,KAAK,MAAMF,CAAK,GAC7BI,IAAOF,MAAe,IAAI,YAAY,IACtCpB,IAAQ,KAAK;AAAA,QACfmB;AAAA,QACA,KAAK,QAAQ,MAAMC,CAAU;AAAA,QAC7BE;AAAA,MACN,EAAM,QAAO;AACT,MAAAF,IAAa,KAAK,MAAMF,CAAK;AAC7B,eAASf,KAAQH,EAAO,MAAK,QAAQ,MAAM,OAAOoB,GAAY,GAAGjB,CAAI;AAErE,UAAIO;AACJ,eAASW,KAAM,KAAK;AAClB,QAAAX,IAAQ,KAAK,QAAQW,CAAE,GACnBD,KAAcV,MAChB,KAAK,QAAQW,CAAE,IAAIX,IAAQV,EAAM;AAIrC,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,UAAUA,GAAOuB,GAAQ;AACvB,UAAI,OAAOvB,KAAU;AACnB,QAAAA,IAAQD,EAAYH,EAAMI,CAAK,EAAE,KAAK;AAAA,eAC7B,OAAOA,IAAU;AAC1B,QAAAA,IAAQ,CAAA;AAAA,eACC,MAAM,QAAQA,CAAK,GAAG;AAC/B,QAAAA,IAAQA,EAAM,MAAM,CAAC;AACrB,iBAAS,KAAKA;AACZ,UAAI,EAAE,UAAQ,EAAE,OAAO,YAAY,GAAG,QAAQ;AAAA,MAEtD,WAAeA,EAAM,SAAS,UAAU,KAAK,SAAS,YAAY;AAC5D,QAAAA,IAAQA,EAAM,MAAM,MAAM,CAAC;AAC3B,iBAAS,KAAKA;AACZ,UAAI,EAAE,UAAQ,EAAE,OAAO,YAAY,GAAG,QAAQ;AAAA,MAEtD,WAAeA,EAAM;AACf,QAAAA,IAAQ,CAACA,CAAK;AAAA,eACLA,EAAM,MAAM;AACrB,YAAI,OAAOA,EAAM,QAAU;AACzB,gBAAM,IAAI,MAAM,wCAAwC;AACnD,QAAI,OAAOA,EAAM,SAAU,aAChCA,EAAM,QAAQ,OAAOA,EAAM,KAAK,IAElCA,IAAQ,CAAC,IAAIZ,EAAYY,CAAK,CAAC;AAAA,MACrC,WAAeA,EAAM,YAAYA,EAAM;AACjC,QAAAA,IAAQ,CAAC,IAAIF,EAAKE,CAAK,CAAC;AAAA,eACfA,EAAM;AACf,QAAAA,IAAQ,CAAC,IAAIL,EAAOK,CAAK,CAAC;AAAA,eACjBA,EAAM;AACf,QAAAA,IAAQ,CAAC,IAAId,EAAQc,CAAK,CAAC;AAAA;AAE3B,cAAM,IAAI,MAAM,oCAAoC;AAoBtD,aAjBgBA,EAAM,IAAI,QAEnB,EAAEP,CAAE,KAAGW,EAAU,QAAQ,CAAC,GAC/B,IAAI,EAAE,SACF,EAAE,UAAQ,EAAE,OAAO,YAAY,CAAC,GAChC,EAAEZ,CAAO,KAAGU,EAAc,CAAC,GAE1B,EAAE,SAAM,EAAE,OAAO,CAAA,IAClB,OAAO,EAAE,KAAK,SAAW,OACvBqB,KAAU,OAAOA,EAAO,KAAK,SAAW,QAC1C,EAAE,KAAK,SAASA,EAAO,KAAK,OAAO,QAAQ,OAAO,EAAE,IAGxD,EAAE,SAAS,KAAK,SACT,EACR;AAAA,IAGL;AAAA,IAEE,WAAWlB,GAAU;AACnB,MAAAA,IAAWA,EAAS,QAAO;AAC3B,eAASC,KAASD,GAAU;AAC1B,YAAIL,IAAQ,KAAK,UAAUM,GAAO,KAAK,OAAO,SAAS,EAAE,QAAO;AAChE,iBAASH,KAAQH,EAAO,MAAK,QAAQ,MAAM,QAAQG,CAAI;AACvD,iBAASkB,KAAM,KAAK;AAClB,eAAK,QAAQA,CAAE,IAAI,KAAK,QAAQA,CAAE,IAAIrB,EAAM;AAAA,MAEpD;AAEI,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,KAAKM,GAAO;AACV,aAAAA,EAAM,SAAS,MACf,KAAK,QAAQ,MAAM,KAAKA,CAAK,GACtB;AAAA,IACX;AAAA,IAEE,YAAY;AACV,eAASH,KAAQ,KAAK,QAAQ,MAAO,CAAAA,EAAK,SAAS;AACnD,kBAAK,QAAQ,QAAQ,CAAA,GAErB,KAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,YAAYG,GAAO;AACjB,MAAAA,IAAQ,KAAK,MAAMA,CAAK,GACxB,KAAK,QAAQ,MAAMA,CAAK,EAAE,SAAS,QACnC,KAAK,QAAQ,MAAM,OAAOA,GAAO,CAAC;AAElC,UAAII;AACJ,eAASW,KAAM,KAAK;AAClB,QAAAX,IAAQ,KAAK,QAAQW,CAAE,GACnBX,KAASJ,MACX,KAAK,QAAQe,CAAE,IAAIX,IAAQ;AAI/B,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,cAAcc,GAASC,GAAMjB,GAAU;AACrC,aAAKA,MACHA,IAAWiB,GACXA,IAAO,CAAA,IAGT,KAAK,UAAU,CAAAC,MAAQ;AACrB,QAAID,EAAK,SAAS,CAACA,EAAK,MAAM,SAASC,EAAK,IAAI,KAC5CD,EAAK,QAAQ,CAACC,EAAK,MAAM,SAASD,EAAK,IAAI,MAE/CC,EAAK,QAAQA,EAAK,MAAM,QAAQF,GAAShB,CAAQ;AAAA,MACvD,CAAK,GAED,KAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,KAAKI,GAAW;AACd,aAAO,KAAK,MAAM,KAAKA,CAAS;AAAA,IACpC;AAAA,IAEE,KAAKJ,GAAU;AACb,aAAO,KAAK,KAAK,CAACF,GAAOL,MAAM;AAC7B,YAAIU;AACJ,YAAI;AACF,UAAAA,IAASH,EAASF,GAAOL,CAAC;AAAA,QAClC,SAAe0B,GAAG;AACV,gBAAMrB,EAAM,WAAWqB,CAAC;AAAA,QAChC;AACM,eAAIhB,MAAW,MAASL,EAAM,SAC5BK,IAASL,EAAM,KAAKE,CAAQ,IAGvBG;AAAA,MACb,CAAK;AAAA,IACL;AAAA,IAEE,YAAYiB,GAAMpB,GAAU;AAC1B,aAAKA,IAQDoB,aAAgB,SACX,KAAK,KAAK,CAACtB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,YAAYsB,EAAK,KAAKtB,EAAM,IAAI;AACjD,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO,IAEI,KAAK,KAAK,CAACA,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,YAAYA,EAAM,SAASsB;AAC5C,iBAAOpB,EAASF,GAAO,CAAC;AAAA,MAEhC,CAAK,KAlBCE,IAAWoB,GACJ,KAAK,KAAK,CAACtB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO;AAAA,IAcP;AAAA,IAEE,aAAaE,GAAU;AACrB,aAAO,KAAK,KAAK,CAACF,GAAOL,MAAM;AAC7B,YAAIK,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAOL,CAAC;AAAA,MAEhC,CAAK;AAAA,IACL;AAAA,IAEE,UAAUY,GAAML,GAAU;AACxB,aAAKA,IAQDK,aAAgB,SACX,KAAK,KAAK,CAACP,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUO,EAAK,KAAKP,EAAM,IAAI;AAC/C,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO,IAEI,KAAK,KAAK,CAACA,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUA,EAAM,SAASO;AAC1C,iBAAOL,EAASF,GAAO,CAAC;AAAA,MAEhC,CAAK,KAlBCE,IAAWK,GACJ,KAAK,KAAK,CAACP,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO;AAAA,IAcP;AAAA,IAEE,UAAUuB,GAAUrB,GAAU;AAC5B,aAAKA,IASDqB,aAAoB,SACf,KAAK,KAAK,CAACvB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUuB,EAAS,KAAKvB,EAAM,QAAQ;AACvD,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO,IAEI,KAAK,KAAK,CAACA,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUA,EAAM,aAAauB;AAC9C,iBAAOrB,EAASF,GAAO,CAAC;AAAA,MAEhC,CAAK,KAnBCE,IAAWqB,GAEJ,KAAK,KAAK,CAACvB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO;AAAA,IAcP;AAAA,EACA;AAEA,SAAAF,EAAU,gBAAgB,CAAA0B,MAAa;AACrC,IAAAlC,IAAQkC;AAAA,EACV,GAEA1B,EAAU,eAAe,CAAA0B,MAAa;AACpC,IAAAhC,IAAOgC;AAAA,EACT,GAEA1B,EAAU,iBAAiB,CAAA0B,MAAa;AACtC,IAAAnC,IAASmC;AAAA,EACX,GAEA1B,EAAU,eAAe,CAAA0B,MAAa;AACpC,IAAAjC,IAAOiC;AAAA,EACT,GAEAC,IAAiB3B,GACjBA,EAAU,UAAUA,GAGpBA,EAAU,UAAU,CAAAD,MAAQ;AAC1B,IAAIA,EAAK,SAAS,WAChB,OAAO,eAAeA,GAAMR,EAAO,SAAS,IACnCQ,EAAK,SAAS,SACvB,OAAO,eAAeA,GAAML,EAAK,SAAS,IACjCK,EAAK,SAAS,SACvB,OAAO,eAAeA,GAAMf,EAAY,SAAS,IACxCe,EAAK,SAAS,YACvB,OAAO,eAAeA,GAAMjB,EAAQ,SAAS,IACpCiB,EAAK,SAAS,UACvB,OAAO,eAAeA,GAAMN,EAAK,SAAS,GAG5CM,EAAKV,CAAE,IAAI,IAEPU,EAAK,SACPA,EAAK,MAAM,QAAQ,CAAAG,MAAS;AAC1B,MAAAF,EAAU,QAAQE,CAAK;AAAA,IAC7B,CAAK;AAAA,EAEL;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es649.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es65.js

@@ -1,7 +1,7 @@
 import { j as i } from "./index.es230.js";
 import { DateTime as n } from "./index.es3.js";
 import './components/ui/DatePicker/DatePicker.css';/* empty css            */
-import { clsx as h } from "./index.es231.js";
+import { clsx as h } from "./index.es232.js";
 import { useRef as j, useEffect as N } from "react";
 const F = ({
   label: s,