@performant-software/core-data 2.2.2-beta.3 → 2.2.2-beta.4

package/dist/index.es411.js

@@ -1,322 +1,64 @@
-import { d as g } from "./index.es309.js";
-import { t as b } from "./index.es479.js";
-import { c as y } from "./index.es317.js";
-import { a as F } from "./index.es318.js";
-import { r as x } from "./index.es324.js";
-import { r as z } from "./index.es323.js";
-let C = g, P = b, S = y, A = F, T = x, m = z;
-const d = {
-  empty: !0,
-  space: !0
-};
-function O(p) {
-  for (let e = p.length - 1; e >= 0; e--) {
-    let t = p[e], s = t[3] || t[2];
-    if (s)
-      return s;
-  }
+import { __exports as e } from "./index.es418.js";
+import "./index.es304.js";
+import { __exports as v } from "./index.es311.js";
+Object.defineProperty(e, "__esModule", { value: !0 });
+e.findAll = e.existsOne = e.findOne = e.findOneChild = e.find = e.filter = void 0;
+var a = v;
+function c(t, f, i, n) {
+  return i === void 0 && (i = !0), n === void 0 && (n = 1 / 0), d(t, Array.isArray(f) ? f : [f], i, n);
 }
-class v {
-  constructor(e) {
-    this.input = e, this.root = new T(), this.current = this.root, this.spaces = "", this.semicolon = !1, this.customProperty = !1, this.createTokenizer(), this.root.source = { input: e, start: { column: 1, line: 1, offset: 0 } };
-  }
-  atrule(e) {
-    let t = new A();
-    t.name = e[1].slice(1), t.name === "" && this.unnamedAtrule(t, e), this.init(t, e[2]);
-    let s, i, r, o = !1, h = !1, n = [], l = [];
-    for (; !this.tokenizer.endOfFile(); ) {
-      if (e = this.tokenizer.nextToken(), s = e[0], s === "(" || s === "[" ? l.push(s === "(" ? ")" : "]") : s === "{" && l.length > 0 ? l.push("}") : s === l[l.length - 1] && l.pop(), l.length === 0)
-        if (s === ";") {
-          t.source.end = this.getPosition(e[2]), t.source.end.offset++, this.semicolon = !0;
-          break;
-        } else if (s === "{") {
-          h = !0;
-          break;
-        } else if (s === "}") {
-          if (n.length > 0) {
-            for (r = n.length - 1, i = n[r]; i && i[0] === "space"; )
-              i = n[--r];
-            i && (t.source.end = this.getPosition(i[3] || i[2]), t.source.end.offset++);
-          }
-          this.end(e);
-          break;
-        } else
-          n.push(e);
-      else
-        n.push(e);
-      if (this.tokenizer.endOfFile()) {
-        o = !0;
-        break;
-      }
-    }
-    t.raws.between = this.spacesAndCommentsFromEnd(n), n.length ? (t.raws.afterName = this.spacesAndCommentsFromStart(n), this.raw(t, "params", n), o && (e = n[n.length - 1], t.source.end = this.getPosition(e[3] || e[2]), t.source.end.offset++, this.spaces = t.raws.between, t.raws.between = "")) : (t.raws.afterName = "", t.params = ""), h && (t.nodes = [], this.current = t);
-  }
-  checkMissedSemicolon(e) {
-    let t = this.colon(e);
-    if (t === !1)
-      return;
-    let s = 0, i;
-    for (let r = t - 1; r >= 0 && (i = e[r], !(i[0] !== "space" && (s += 1, s === 2))); r--)
-      ;
-    throw this.input.error(
-      "Missed semicolon",
-      i[0] === "word" ? i[3] + 1 : i[2]
-    );
-  }
-  colon(e) {
-    let t = 0, s, i, r;
-    for (let [o, h] of e.entries()) {
-      if (s = h, i = s[0], i === "(" && (t += 1), i === ")" && (t -= 1), t === 0 && i === ":")
-        if (!r)
-          this.doubleColon(s);
-        else {
-          if (r[0] === "word" && r[1] === "progid")
-            continue;
-          return o;
-        }
-      r = s;
-    }
-    return !1;
-  }
-  comment(e) {
-    let t = new S();
-    this.init(t, e[2]), t.source.end = this.getPosition(e[3] || e[2]), t.source.end.offset++;
-    let s = e[1].slice(2, -2);
-    if (/^\s*$/.test(s))
-      t.text = "", t.raws.left = s, t.raws.right = "";
-    else {
-      let i = s.match(/^(\s*)([^]*\S)(\s*)$/);
-      t.text = i[2], t.raws.left = i[1], t.raws.right = i[3];
-    }
-  }
-  createTokenizer() {
-    this.tokenizer = P(this.input);
-  }
-  decl(e, t) {
-    let s = new C();
-    this.init(s, e[0][2]);
-    let i = e[e.length - 1];
-    for (i[0] === ";" && (this.semicolon = !0, e.pop()), s.source.end = this.getPosition(
-      i[3] || i[2] || O(e)
-    ), s.source.end.offset++; e[0][0] !== "word"; )
-      e.length === 1 && this.unknownWord(e), s.raws.before += e.shift()[1];
-    for (s.source.start = this.getPosition(e[0][2]), s.prop = ""; e.length; ) {
-      let l = e[0][0];
-      if (l === ":" || l === "space" || l === "comment")
-        break;
-      s.prop += e.shift()[1];
-    }
-    s.raws.between = "";
-    let r;
-    for (; e.length; )
-      if (r = e.shift(), r[0] === ":") {
-        s.raws.between += r[1];
-        break;
-      } else
-        r[0] === "word" && /\w/.test(r[1]) && this.unknownWord([r]), s.raws.between += r[1];
-    (s.prop[0] === "_" || s.prop[0] === "*") && (s.raws.before += s.prop[0], s.prop = s.prop.slice(1));
-    let o = [], h;
-    for (; e.length && (h = e[0][0], !(h !== "space" && h !== "comment")); )
-      o.push(e.shift());
-    this.precheckMissedSemicolon(e);
-    for (let l = e.length - 1; l >= 0; l--) {
-      if (r = e[l], r[1].toLowerCase() === "!important") {
-        s.important = !0;
-        let c = this.stringFrom(e, l);
-        c = this.spacesFromEnd(e) + c, c !== " !important" && (s.raws.important = c);
-        break;
-      } else if (r[1].toLowerCase() === "important") {
-        let c = e.slice(0), f = "";
-        for (let a = l; a > 0; a--) {
-          let u = c[a][0];
-          if (f.trim().indexOf("!") === 0 && u !== "space")
-            break;
-          f = c.pop()[1] + f;
-        }
-        f.trim().indexOf("!") === 0 && (s.important = !0, s.raws.important = f, e = c);
-      }
-      if (r[0] !== "space" && r[0] !== "comment")
-        break;
-    }
-    e.some((l) => l[0] !== "space" && l[0] !== "comment") && (s.raws.between += o.map((l) => l[1]).join(""), o = []), this.raw(s, "value", o.concat(e), t), s.value.includes(":") && !t && this.checkMissedSemicolon(e);
-  }
-  doubleColon(e) {
-    throw this.input.error(
-      "Double colon",
-      { offset: e[2] },
-      { offset: e[2] + e[1].length }
-    );
-  }
-  emptyRule(e) {
-    let t = new m();
-    this.init(t, e[2]), t.selector = "", t.raws.between = "", this.current = t;
-  }
-  end(e) {
-    this.current.nodes && this.current.nodes.length && (this.current.raws.semicolon = this.semicolon), this.semicolon = !1, this.current.raws.after = (this.current.raws.after || "") + this.spaces, this.spaces = "", this.current.parent ? (this.current.source.end = this.getPosition(e[2]), this.current.source.end.offset++, this.current = this.current.parent) : this.unexpectedClose(e);
-  }
-  endFile() {
-    this.current.parent && this.unclosedBlock(), this.current.nodes && this.current.nodes.length && (this.current.raws.semicolon = this.semicolon), this.current.raws.after = (this.current.raws.after || "") + this.spaces, this.root.source.end = this.getPosition(this.tokenizer.position());
-  }
-  freeSemicolon(e) {
-    if (this.spaces += e[1], this.current.nodes) {
-      let t = this.current.nodes[this.current.nodes.length - 1];
-      t && t.type === "rule" && !t.raws.ownSemicolon && (t.raws.ownSemicolon = this.spaces, this.spaces = "");
-    }
-  }
-  // Helpers
-  getPosition(e) {
-    let t = this.input.fromOffset(e);
-    return {
-      column: t.col,
-      line: t.line,
-      offset: e
-    };
-  }
-  init(e, t) {
-    this.current.push(e), e.source = {
-      input: this.input,
-      start: this.getPosition(t)
-    }, e.raws.before = this.spaces, this.spaces = "", e.type !== "comment" && (this.semicolon = !1);
-  }
-  other(e) {
-    let t = !1, s = null, i = !1, r = null, o = [], h = e[1].startsWith("--"), n = [], l = e;
-    for (; l; ) {
-      if (s = l[0], n.push(l), s === "(" || s === "[")
-        r || (r = l), o.push(s === "(" ? ")" : "]");
-      else if (h && i && s === "{")
-        r || (r = l), o.push("}");
-      else if (o.length === 0)
-        if (s === ";")
-          if (i) {
-            this.decl(n, h);
-            return;
-          } else
-            break;
-        else if (s === "{") {
-          this.rule(n);
-          return;
-        } else if (s === "}") {
-          this.tokenizer.back(n.pop()), t = !0;
-          break;
-        } else
-          s === ":" && (i = !0);
-      else
-        s === o[o.length - 1] && (o.pop(), o.length === 0 && (r = null));
-      l = this.tokenizer.nextToken();
+e.filter = c;
+function d(t, f, i, n) {
+  for (var u = [], r = [f], l = [0]; ; ) {
+    if (l[0] >= r[0].length) {
+      if (l.length === 1)
+        return u;
+      r.shift(), l.shift();
+      continue;
     }
-    if (this.tokenizer.endOfFile() && (t = !0), o.length > 0 && this.unclosedBracket(r), t && i) {
-      if (!h)
-        for (; n.length && (l = n[n.length - 1][0], !(l !== "space" && l !== "comment")); )
-          this.tokenizer.back(n.pop());
-      this.decl(n, h);
-    } else
-      this.unknownWord(n);
-  }
-  parse() {
-    let e;
-    for (; !this.tokenizer.endOfFile(); )
-      switch (e = this.tokenizer.nextToken(), e[0]) {
-        case "space":
-          this.spaces += e[1];
-          break;
-        case ";":
-          this.freeSemicolon(e);
-          break;
-        case "}":
-          this.end(e);
-          break;
-        case "comment":
-          this.comment(e);
-          break;
-        case "at-word":
-          this.atrule(e);
-          break;
-        case "{":
-          this.emptyRule(e);
-          break;
-        default:
-          this.other(e);
-          break;
-      }
-    this.endFile();
-  }
-  precheckMissedSemicolon() {
+    var h = r[0][l[0]++];
+    if (t(h) && (u.push(h), --n <= 0))
+      return u;
+    i && (0, a.hasChildren)(h) && h.children.length > 0 && (l.unshift(0), r.unshift(h.children));
   }
-  raw(e, t, s, i) {
-    let r, o, h = s.length, n = "", l = !0, c, f;
-    for (let a = 0; a < h; a += 1)
-      r = s[a], o = r[0], o === "space" && a === h - 1 && !i ? l = !1 : o === "comment" ? (f = s[a - 1] ? s[a - 1][0] : "empty", c = s[a + 1] ? s[a + 1][0] : "empty", !d[f] && !d[c] ? n.slice(-1) === "," ? l = !1 : n += r[1] : l = !1) : n += r[1];
-    if (!l) {
-      let a = s.reduce((u, w) => u + w[1], "");
-      e.raws[t] = { raw: a, value: n };
+}
+e.find = d;
+function g(t, f) {
+  return f.find(t);
+}
+e.findOneChild = g;
+function o(t, f, i) {
+  i === void 0 && (i = !0);
+  for (var n = null, u = 0; u < f.length && !n; u++) {
+    var r = f[u];
+    if ((0, a.isTag)(r))
+      t(r) ? n = r : i && r.children.length > 0 && (n = o(t, r.children, !0));
+    else
+      continue;
+  }
+  return n;
+}
+e.findOne = o;
+function s(t, f) {
+  return f.some(function(i) {
+    return (0, a.isTag)(i) && (t(i) || s(t, i.children));
+  });
+}
+e.existsOne = s;
+function O(t, f) {
+  for (var i = [], n = [f], u = [0]; ; ) {
+    if (u[0] >= n[0].length) {
+      if (n.length === 1)
+        return i;
+      n.shift(), u.shift();
+      continue;
     }
-    e[t] = n;
-  }
-  rule(e) {
-    e.pop();
-    let t = new m();
-    this.init(t, e[0][2]), t.raws.between = this.spacesAndCommentsFromEnd(e), this.raw(t, "selector", e), this.current = t;
-  }
-  spacesAndCommentsFromEnd(e) {
-    let t, s = "";
-    for (; e.length && (t = e[e.length - 1][0], !(t !== "space" && t !== "comment")); )
-      s = e.pop()[1] + s;
-    return s;
-  }
-  // Errors
-  spacesAndCommentsFromStart(e) {
-    let t, s = "";
-    for (; e.length && (t = e[0][0], !(t !== "space" && t !== "comment")); )
-      s += e.shift()[1];
-    return s;
-  }
-  spacesFromEnd(e) {
-    let t, s = "";
-    for (; e.length && (t = e[e.length - 1][0], t === "space"); )
-      s = e.pop()[1] + s;
-    return s;
-  }
-  stringFrom(e, t) {
-    let s = "";
-    for (let i = t; i < e.length; i++)
-      s += e[i][1];
-    return e.splice(t, e.length - t), s;
-  }
-  unclosedBlock() {
-    let e = this.current.source.start;
-    throw this.input.error("Unclosed block", e.line, e.column);
-  }
-  unclosedBracket(e) {
-    throw this.input.error(
-      "Unclosed bracket",
-      { offset: e[2] },
-      { offset: e[2] + 1 }
-    );
-  }
-  unexpectedClose(e) {
-    throw this.input.error(
-      "Unexpected }",
-      { offset: e[2] },
-      { offset: e[2] + 1 }
-    );
-  }
-  unknownWord(e) {
-    throw this.input.error(
-      "Unknown word",
-      { offset: e[0][2] },
-      { offset: e[0][2] + e[0][1].length }
-    );
-  }
-  unnamedAtrule(e, t) {
-    throw this.input.error(
-      "At-rule without name",
-      { offset: t[2] },
-      { offset: t[2] + t[1].length }
-    );
+    var r = n[0][u[0]++];
+    (0, a.isTag)(r) && (t(r) && i.push(r), r.children.length > 0 && (u.unshift(0), n.unshift(r.children)));
   }
 }
-var U = v;
+e.findAll = O;
 export {
-  U as p
+  e as default
 };
 //# sourceMappingURL=index.es411.js.map

package/dist/index.es411.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es411.js","sources":["../../../node_modules/sanitize-html/node_modules/postcss/lib/parser.js"],"sourcesContent":["'use strict'\n\nlet Declaration = require('./declaration')\nlet tokenizer = require('./tokenize')\nlet Comment = require('./comment')\nlet AtRule = require('./at-rule')\nlet Root = require('./root')\nlet Rule = require('./rule')\n\nconst SAFE_COMMENT_NEIGHBOR = {\n  empty: true,\n  space: true\n}\n\nfunction findLastWithPosition(tokens) {\n  for (let i = tokens.length - 1; i >= 0; i--) {\n    let token = tokens[i]\n    let pos = token[3] || token[2]\n    if (pos) return pos\n  }\n}\n\nclass Parser {\n  constructor(input) {\n    this.input = input\n\n    this.root = new Root()\n    this.current = this.root\n    this.spaces = ''\n    this.semicolon = false\n    this.customProperty = false\n\n    this.createTokenizer()\n    this.root.source = { input, start: { column: 1, line: 1, offset: 0 } }\n  }\n\n  atrule(token) {\n    let node = new AtRule()\n    node.name = token[1].slice(1)\n    if (node.name === '') {\n      this.unnamedAtrule(node, token)\n    }\n    this.init(node, token[2])\n\n    let type\n    let prev\n    let shift\n    let last = false\n    let open = false\n    let params = []\n    let brackets = []\n\n    while (!this.tokenizer.endOfFile()) {\n      token = this.tokenizer.nextToken()\n      type = token[0]\n\n      if (type === '(' || type === '[') {\n        brackets.push(type === '(' ? ')' : ']')\n      } else if (type === '{' && brackets.length > 0) {\n        brackets.push('}')\n      } else if (type === brackets[brackets.length - 1]) {\n        brackets.pop()\n      }\n\n      if (brackets.length === 0) {\n        if (type === ';') {\n          node.source.end = this.getPosition(token[2])\n          node.source.end.offset++\n          this.semicolon = true\n          break\n        } else if (type === '{') {\n          open = true\n          break\n        } else if (type === '}') {\n          if (params.length > 0) {\n            shift = params.length - 1\n            prev = params[shift]\n            while (prev && prev[0] === 'space') {\n              prev = params[--shift]\n            }\n            if (prev) {\n              node.source.end = this.getPosition(prev[3] || prev[2])\n              node.source.end.offset++\n            }\n          }\n          this.end(token)\n          break\n        } else {\n          params.push(token)\n        }\n      } else {\n        params.push(token)\n      }\n\n      if (this.tokenizer.endOfFile()) {\n        last = true\n        break\n      }\n    }\n\n    node.raws.between = this.spacesAndCommentsFromEnd(params)\n    if (params.length) {\n      node.raws.afterName = this.spacesAndCommentsFromStart(params)\n      this.raw(node, 'params', params)\n      if (last) {\n        token = params[params.length - 1]\n        node.source.end = this.getPosition(token[3] || token[2])\n        node.source.end.offset++\n        this.spaces = node.raws.between\n        node.raws.between = ''\n      }\n    } else {\n      node.raws.afterName = ''\n      node.params = ''\n    }\n\n    if (open) {\n      node.nodes = []\n      this.current = node\n    }\n  }\n\n  checkMissedSemicolon(tokens) {\n    let colon = this.colon(tokens)\n    if (colon === false) return\n\n    let founded = 0\n    let token\n    for (let j = colon - 1; j >= 0; j--) {\n      token = tokens[j]\n      if (token[0] !== 'space') {\n        founded += 1\n        if (founded === 2) break\n      }\n    }\n    // If the token is a word, e.g. `!important`, `red` or any other valid property's value.\n    // Then we need to return the colon after that word token. [3] is the \"end\" colon of that word.\n    // And because we need it after that one we do +1 to get the next one.\n    throw this.input.error(\n      'Missed semicolon',\n      token[0] === 'word' ? token[3] + 1 : token[2]\n    )\n  }\n\n  colon(tokens) {\n    let brackets = 0\n    let token, type, prev\n    for (let [i, element] of tokens.entries()) {\n      token = element\n      type = token[0]\n\n      if (type === '(') {\n        brackets += 1\n      }\n      if (type === ')') {\n        brackets -= 1\n      }\n      if (brackets === 0 && type === ':') {\n        if (!prev) {\n          this.doubleColon(token)\n        } else if (prev[0] === 'word' && prev[1] === 'progid') {\n          continue\n        } else {\n          return i\n        }\n      }\n\n      prev = token\n    }\n    return false\n  }\n\n  comment(token) {\n    let node = new Comment()\n    this.init(node, token[2])\n    node.source.end = this.getPosition(token[3] || token[2])\n    node.source.end.offset++\n\n    let text = token[1].slice(2, -2)\n    if (/^\\s*$/.test(text)) {\n      node.text = ''\n      node.raws.left = text\n      node.raws.right = ''\n    } else {\n      let match = text.match(/^(\\s*)([^]*\\S)(\\s*)$/)\n      node.text = match[2]\n      node.raws.left = match[1]\n      node.raws.right = match[3]\n    }\n  }\n\n  createTokenizer() {\n    this.tokenizer = tokenizer(this.input)\n  }\n\n  decl(tokens, customProperty) {\n    let node = new Declaration()\n    this.init(node, tokens[0][2])\n\n    let last = tokens[tokens.length - 1]\n    if (last[0] === ';') {\n      this.semicolon = true\n      tokens.pop()\n    }\n\n    node.source.end = this.getPosition(\n      last[3] || last[2] || findLastWithPosition(tokens)\n    )\n    node.source.end.offset++\n\n    while (tokens[0][0] !== 'word') {\n      if (tokens.length === 1) this.unknownWord(tokens)\n      node.raws.before += tokens.shift()[1]\n    }\n    node.source.start = this.getPosition(tokens[0][2])\n\n    node.prop = ''\n    while (tokens.length) {\n      let type = tokens[0][0]\n      if (type === ':' || type === 'space' || type === 'comment') {\n        break\n      }\n      node.prop += tokens.shift()[1]\n    }\n\n    node.raws.between = ''\n\n    let token\n    while (tokens.length) {\n      token = tokens.shift()\n\n      if (token[0] === ':') {\n        node.raws.between += token[1]\n        break\n      } else {\n        if (token[0] === 'word' && /\\w/.test(token[1])) {\n          this.unknownWord([token])\n        }\n        node.raws.between += token[1]\n      }\n    }\n\n    if (node.prop[0] === '_' || node.prop[0] === '*') {\n      node.raws.before += node.prop[0]\n      node.prop = node.prop.slice(1)\n    }\n\n    let firstSpaces = []\n    let next\n    while (tokens.length) {\n      next = tokens[0][0]\n      if (next !== 'space' && next !== 'comment') break\n      firstSpaces.push(tokens.shift())\n    }\n\n    this.precheckMissedSemicolon(tokens)\n\n    for (let i = tokens.length - 1; i >= 0; i--) {\n      token = tokens[i]\n      if (token[1].toLowerCase() === '!important') {\n        node.important = true\n        let string = this.stringFrom(tokens, i)\n        string = this.spacesFromEnd(tokens) + string\n        if (string !== ' !important') node.raws.important = string\n        break\n      } else if (token[1].toLowerCase() === 'important') {\n        let cache = tokens.slice(0)\n        let str = ''\n        for (let j = i; j > 0; j--) {\n          let type = cache[j][0]\n          if (str.trim().indexOf('!') === 0 && type !== 'space') {\n            break\n          }\n          str = cache.pop()[1] + str\n        }\n        if (str.trim().indexOf('!') === 0) {\n          node.important = true\n          node.raws.important = str\n          tokens = cache\n        }\n      }\n\n      if (token[0] !== 'space' && token[0] !== 'comment') {\n        break\n      }\n    }\n\n    let hasWord = tokens.some(i => i[0] !== 'space' && i[0] !== 'comment')\n\n    if (hasWord) {\n      node.raws.between += firstSpaces.map(i => i[1]).join('')\n      firstSpaces = []\n    }\n    this.raw(node, 'value', firstSpaces.concat(tokens), customProperty)\n\n    if (node.value.includes(':') && !customProperty) {\n      this.checkMissedSemicolon(tokens)\n    }\n  }\n\n  doubleColon(token) {\n    throw this.input.error(\n      'Double colon',\n      { offset: token[2] },\n      { offset: token[2] + token[1].length }\n    )\n  }\n\n  emptyRule(token) {\n    let node = new Rule()\n    this.init(node, token[2])\n    node.selector = ''\n    node.raws.between = ''\n    this.current = node\n  }\n\n  end(token) {\n    if (this.current.nodes && this.current.nodes.length) {\n      this.current.raws.semicolon = this.semicolon\n    }\n    this.semicolon = false\n\n    this.current.raws.after = (this.current.raws.after || '') + this.spaces\n    this.spaces = ''\n\n    if (this.current.parent) {\n      this.current.source.end = this.getPosition(token[2])\n      this.current.source.end.offset++\n      this.current = this.current.parent\n    } else {\n      this.unexpectedClose(token)\n    }\n  }\n\n  endFile() {\n    if (this.current.parent) this.unclosedBlock()\n    if (this.current.nodes && this.current.nodes.length) {\n      this.current.raws.semicolon = this.semicolon\n    }\n    this.current.raws.after = (this.current.raws.after || '') + this.spaces\n    this.root.source.end = this.getPosition(this.tokenizer.position())\n  }\n\n  freeSemicolon(token) {\n    this.spaces += token[1]\n    if (this.current.nodes) {\n      let prev = this.current.nodes[this.current.nodes.length - 1]\n      if (prev && prev.type === 'rule' && !prev.raws.ownSemicolon) {\n        prev.raws.ownSemicolon = this.spaces\n        this.spaces = ''\n      }\n    }\n  }\n\n  // Helpers\n\n  getPosition(offset) {\n    let pos = this.input.fromOffset(offset)\n    return {\n      column: pos.col,\n      line: pos.line,\n      offset\n    }\n  }\n\n  init(node, offset) {\n    this.current.push(node)\n    node.source = {\n      input: this.input,\n      start: this.getPosition(offset)\n    }\n    node.raws.before = this.spaces\n    this.spaces = ''\n    if (node.type !== 'comment') this.semicolon = false\n  }\n\n  other(start) {\n    let end = false\n    let type = null\n    let colon = false\n    let bracket = null\n    let brackets = []\n    let customProperty = start[1].startsWith('--')\n\n    let tokens = []\n    let token = start\n    while (token) {\n      type = token[0]\n      tokens.push(token)\n\n      if (type === '(' || type === '[') {\n        if (!bracket) bracket = token\n        brackets.push(type === '(' ? ')' : ']')\n      } else if (customProperty && colon && type === '{') {\n        if (!bracket) bracket = token\n        brackets.push('}')\n      } else if (brackets.length === 0) {\n        if (type === ';') {\n          if (colon) {\n            this.decl(tokens, customProperty)\n            return\n          } else {\n            break\n          }\n        } else if (type === '{') {\n          this.rule(tokens)\n          return\n        } else if (type === '}') {\n          this.tokenizer.back(tokens.pop())\n          end = true\n          break\n        } else if (type === ':') {\n          colon = true\n        }\n      } else if (type === brackets[brackets.length - 1]) {\n        brackets.pop()\n        if (brackets.length === 0) bracket = null\n      }\n\n      token = this.tokenizer.nextToken()\n    }\n\n    if (this.tokenizer.endOfFile()) end = true\n    if (brackets.length > 0) this.unclosedBracket(bracket)\n\n    if (end && colon) {\n      if (!customProperty) {\n        while (tokens.length) {\n          token = tokens[tokens.length - 1][0]\n          if (token !== 'space' && token !== 'comment') break\n          this.tokenizer.back(tokens.pop())\n        }\n      }\n      this.decl(tokens, customProperty)\n    } else {\n      this.unknownWord(tokens)\n    }\n  }\n\n  parse() {\n    let token\n    while (!this.tokenizer.endOfFile()) {\n      token = this.tokenizer.nextToken()\n\n      switch (token[0]) {\n        case 'space':\n          this.spaces += token[1]\n          break\n\n        case ';':\n          this.freeSemicolon(token)\n          break\n\n        case '}':\n          this.end(token)\n          break\n\n        case 'comment':\n          this.comment(token)\n          break\n\n        case 'at-word':\n          this.atrule(token)\n          break\n\n        case '{':\n          this.emptyRule(token)\n          break\n\n        default:\n          this.other(token)\n          break\n      }\n    }\n    this.endFile()\n  }\n\n  precheckMissedSemicolon(/* tokens */) {\n    // Hook for Safe Parser\n  }\n\n  raw(node, prop, tokens, customProperty) {\n    let token, type\n    let length = tokens.length\n    let value = ''\n    let clean = true\n    let next, prev\n\n    for (let i = 0; i < length; i += 1) {\n      token = tokens[i]\n      type = token[0]\n      if (type === 'space' && i === length - 1 && !customProperty) {\n        clean = false\n      } else if (type === 'comment') {\n        prev = tokens[i - 1] ? tokens[i - 1][0] : 'empty'\n        next = tokens[i + 1] ? tokens[i + 1][0] : 'empty'\n        if (!SAFE_COMMENT_NEIGHBOR[prev] && !SAFE_COMMENT_NEIGHBOR[next]) {\n          if (value.slice(-1) === ',') {\n            clean = false\n          } else {\n            value += token[1]\n          }\n        } else {\n          clean = false\n        }\n      } else {\n        value += token[1]\n      }\n    }\n    if (!clean) {\n      let raw = tokens.reduce((all, i) => all + i[1], '')\n      node.raws[prop] = { raw, value }\n    }\n    node[prop] = value\n  }\n\n  rule(tokens) {\n    tokens.pop()\n\n    let node = new Rule()\n    this.init(node, tokens[0][2])\n\n    node.raws.between = this.spacesAndCommentsFromEnd(tokens)\n    this.raw(node, 'selector', tokens)\n    this.current = node\n  }\n\n  spacesAndCommentsFromEnd(tokens) {\n    let lastTokenType\n    let spaces = ''\n    while (tokens.length) {\n      lastTokenType = tokens[tokens.length - 1][0]\n      if (lastTokenType !== 'space' && lastTokenType !== 'comment') break\n      spaces = tokens.pop()[1] + spaces\n    }\n    return spaces\n  }\n\n  // Errors\n\n  spacesAndCommentsFromStart(tokens) {\n    let next\n    let spaces = ''\n    while (tokens.length) {\n      next = tokens[0][0]\n      if (next !== 'space' && next !== 'comment') break\n      spaces += tokens.shift()[1]\n    }\n    return spaces\n  }\n\n  spacesFromEnd(tokens) {\n    let lastTokenType\n    let spaces = ''\n    while (tokens.length) {\n      lastTokenType = tokens[tokens.length - 1][0]\n      if (lastTokenType !== 'space') break\n      spaces = tokens.pop()[1] + spaces\n    }\n    return spaces\n  }\n\n  stringFrom(tokens, from) {\n    let result = ''\n    for (let i = from; i < tokens.length; i++) {\n      result += tokens[i][1]\n    }\n    tokens.splice(from, tokens.length - from)\n    return result\n  }\n\n  unclosedBlock() {\n    let pos = this.current.source.start\n    throw this.input.error('Unclosed block', pos.line, pos.column)\n  }\n\n  unclosedBracket(bracket) {\n    throw this.input.error(\n      'Unclosed bracket',\n      { offset: bracket[2] },\n      { offset: bracket[2] + 1 }\n    )\n  }\n\n  unexpectedClose(token) {\n    throw this.input.error(\n      'Unexpected }',\n      { offset: token[2] },\n      { offset: token[2] + 1 }\n    )\n  }\n\n  unknownWord(tokens) {\n    throw this.input.error(\n      'Unknown word',\n      { offset: tokens[0][2] },\n      { offset: tokens[0][2] + tokens[0][1].length }\n    )\n  }\n\n  unnamedAtrule(node, token) {\n    throw this.input.error(\n      'At-rule without name',\n      { offset: token[2] },\n      { offset: token[2] + token[1].length }\n    )\n  }\n}\n\nmodule.exports = Parser\n"],"names":["Declaration","require$$0","tokenizer","require$$1","Comment","require$$2","AtRule","require$$3","Root","require$$4","Rule","require$$5","SAFE_COMMENT_NEIGHBOR","findLastWithPosition","tokens","i","token","pos","Parser","input","node","type","prev","shift","last","open","params","brackets","colon","founded","j","element","text","match","customProperty","firstSpaces","next","string","cache","str","offset","start","end","bracket","prop","length","value","clean","raw","all","lastTokenType","spaces","from","result","parser"],"mappings":";;;;;;AAEA,IAAIA,IAAcC,GACdC,IAAYC,GACZC,IAAUC,GACVC,IAASC,GACTC,IAAOC,GACPC,IAAOC;AAEX,MAAMC,IAAwB;AAAA,EAC5B,OAAO;AAAA,EACP,OAAO;AACT;AAEA,SAASC,EAAqBC,GAAQ;AACpC,WAASC,IAAID,EAAO,SAAS,GAAGC,KAAK,GAAGA,KAAK;AACvC,QAAAC,IAAQF,EAAOC,CAAC,GAChBE,IAAMD,EAAM,CAAC,KAAKA,EAAM,CAAC;AACzB,QAAAC;AAAY,aAAAA;AAAA,EAClB;AACF;AAEA,MAAMC,EAAO;AAAA,EACX,YAAYC,GAAO;AACjB,SAAK,QAAQA,GAER,KAAA,OAAO,IAAIX,KAChB,KAAK,UAAU,KAAK,MACpB,KAAK,SAAS,IACd,KAAK,YAAY,IACjB,KAAK,iBAAiB,IAEtB,KAAK,gBAAgB,GACrB,KAAK,KAAK,SAAS,EAAE,OAAAW,GAAO,OAAO,EAAE,QAAQ,GAAG,MAAM,GAAG,QAAQ,EAAI,EAAA;AAAA,EACvE;AAAA,EAEA,OAAOH,GAAO;AACR,QAAAI,IAAO,IAAId;AACf,IAAAc,EAAK,OAAOJ,EAAM,CAAC,EAAE,MAAM,CAAC,GACxBI,EAAK,SAAS,MACX,KAAA,cAAcA,GAAMJ,CAAK,GAEhC,KAAK,KAAKI,GAAMJ,EAAM,CAAC,CAAC;AAEpB,QAAAK,GACAC,GACAC,GACAC,IAAO,IACPC,IAAO,IACPC,IAAS,CAAA,GACTC,IAAW,CAAA;AAEf,WAAO,CAAC,KAAK,UAAU,eAAa;AAY9B,UAXIX,IAAA,KAAK,UAAU,aACvBK,IAAOL,EAAM,CAAC,GAEVK,MAAS,OAAOA,MAAS,MAC3BM,EAAS,KAAKN,MAAS,MAAM,MAAM,GAAG,IAC7BA,MAAS,OAAOM,EAAS,SAAS,IAC3CA,EAAS,KAAK,GAAG,IACRN,MAASM,EAASA,EAAS,SAAS,CAAC,KAC9CA,EAAS,IAAI,GAGXA,EAAS,WAAW;AACtB,YAAIN,MAAS,KAAK;AAChB,UAAAD,EAAK,OAAO,MAAM,KAAK,YAAYJ,EAAM,CAAC,CAAC,GAC3CI,EAAK,OAAO,IAAI,UAChB,KAAK,YAAY;AACjB;AAAA,QAAA,WACSC,MAAS,KAAK;AAChB,UAAAI,IAAA;AACP;AAAA,QAAA,WACSJ,MAAS,KAAK;AACnB,cAAAK,EAAO,SAAS,GAAG;AAGrB,iBAFAH,IAAQG,EAAO,SAAS,GACxBJ,IAAOI,EAAOH,CAAK,GACZD,KAAQA,EAAK,CAAC,MAAM;AAClB,cAAAA,IAAAI,EAAO,EAAEH,CAAK;AAEvB,YAAID,MACGF,EAAA,OAAO,MAAM,KAAK,YAAYE,EAAK,CAAC,KAAKA,EAAK,CAAC,CAAC,GACrDF,EAAK,OAAO,IAAI;AAAA,UAEpB;AACA,eAAK,IAAIJ,CAAK;AACd;AAAA,QAAA;AAEA,UAAAU,EAAO,KAAKV,CAAK;AAAA;AAGnB,QAAAU,EAAO,KAAKV,CAAK;AAGf,UAAA,KAAK,UAAU,aAAa;AACvB,QAAAQ,IAAA;AACP;AAAA,MACF;AAAA,IACF;AAEA,IAAAJ,EAAK,KAAK,UAAU,KAAK,yBAAyBM,CAAM,GACpDA,EAAO,UACTN,EAAK,KAAK,YAAY,KAAK,2BAA2BM,CAAM,GACvD,KAAA,IAAIN,GAAM,UAAUM,CAAM,GAC3BF,MACMR,IAAAU,EAAOA,EAAO,SAAS,CAAC,GAC3BN,EAAA,OAAO,MAAM,KAAK,YAAYJ,EAAM,CAAC,KAAKA,EAAM,CAAC,CAAC,GACvDI,EAAK,OAAO,IAAI,UACX,KAAA,SAASA,EAAK,KAAK,SACxBA,EAAK,KAAK,UAAU,QAGtBA,EAAK,KAAK,YAAY,IACtBA,EAAK,SAAS,KAGZK,MACFL,EAAK,QAAQ,IACb,KAAK,UAAUA;AAAA,EAEnB;AAAA,EAEA,qBAAqBN,GAAQ;AACvB,QAAAc,IAAQ,KAAK,MAAMd,CAAM;AAC7B,QAAIc,MAAU;AAAO;AAErB,QAAIC,IAAU,GACVb;AACJ,aAASc,IAAIF,IAAQ,GAAGE,KAAK,MAC3Bd,IAAQF,EAAOgB,CAAC,GACZ,EAAAd,EAAM,CAAC,MAAM,YACJa,KAAA,GACPA,MAAY,MAJYC;AAE1B;AAQN,UAAM,KAAK,MAAM;AAAA,MACf;AAAA,MACAd,EAAM,CAAC,MAAM,SAASA,EAAM,CAAC,IAAI,IAAIA,EAAM,CAAC;AAAA,IAAA;AAAA,EAEhD;AAAA,EAEA,MAAMF,GAAQ;AACZ,QAAIa,IAAW,GACXX,GAAOK,GAAMC;AACjB,aAAS,CAACP,GAAGgB,CAAO,KAAKjB,EAAO,WAAW;AAUrC,UATIE,IAAAe,GACRV,IAAOL,EAAM,CAAC,GAEVK,MAAS,QACCM,KAAA,IAEVN,MAAS,QACCM,KAAA,IAEVA,MAAa,KAAKN,MAAS;AAC7B,YAAI,CAACC;AACH,eAAK,YAAYN,CAAK;AAAA,aACxB;AAAA,cAAWM,EAAK,CAAC,MAAM,UAAUA,EAAK,CAAC,MAAM;AAC3C;AAEO,iBAAAP;AAAA;AAIJ,MAAAO,IAAAN;AAAA,IACT;AACO,WAAA;AAAA,EACT;AAAA,EAEA,QAAQA,GAAO;AACT,QAAAI,IAAO,IAAIhB;AACf,SAAK,KAAKgB,GAAMJ,EAAM,CAAC,CAAC,GACnBI,EAAA,OAAO,MAAM,KAAK,YAAYJ,EAAM,CAAC,KAAKA,EAAM,CAAC,CAAC,GACvDI,EAAK,OAAO,IAAI;AAEhB,QAAIY,IAAOhB,EAAM,CAAC,EAAE,MAAM,GAAG,EAAE;AAC3B,QAAA,QAAQ,KAAKgB,CAAI;AACnB,MAAAZ,EAAK,OAAO,IACZA,EAAK,KAAK,OAAOY,GACjBZ,EAAK,KAAK,QAAQ;AAAA,SACb;AACD,UAAAa,IAAQD,EAAK,MAAM,sBAAsB;AACxC,MAAAZ,EAAA,OAAOa,EAAM,CAAC,GACdb,EAAA,KAAK,OAAOa,EAAM,CAAC,GACnBb,EAAA,KAAK,QAAQa,EAAM,CAAC;AAAA,IAC3B;AAAA,EACF;AAAA,EAEA,kBAAkB;AACX,SAAA,YAAY/B,EAAU,KAAK,KAAK;AAAA,EACvC;AAAA,EAEA,KAAKY,GAAQoB,GAAgB;AACvB,QAAAd,IAAO,IAAIpB;AACf,SAAK,KAAKoB,GAAMN,EAAO,CAAC,EAAE,CAAC,CAAC;AAE5B,QAAIU,IAAOV,EAAOA,EAAO,SAAS,CAAC;AAWnC,SAVIU,EAAK,CAAC,MAAM,QACd,KAAK,YAAY,IACjBV,EAAO,IAAI,IAGRM,EAAA,OAAO,MAAM,KAAK;AAAA,MACrBI,EAAK,CAAC,KAAKA,EAAK,CAAC,KAAKX,EAAqBC,CAAM;AAAA,IAAA,GAEnDM,EAAK,OAAO,IAAI,UAETN,EAAO,CAAC,EAAE,CAAC,MAAM;AACtB,MAAIA,EAAO,WAAW,KAAG,KAAK,YAAYA,CAAM,GAChDM,EAAK,KAAK,UAAUN,EAAO,MAAA,EAAQ,CAAC;AAKtC,SAHKM,EAAA,OAAO,QAAQ,KAAK,YAAYN,EAAO,CAAC,EAAE,CAAC,CAAC,GAEjDM,EAAK,OAAO,IACLN,EAAO,UAAQ;AACpB,UAAIO,IAAOP,EAAO,CAAC,EAAE,CAAC;AACtB,UAAIO,MAAS,OAAOA,MAAS,WAAWA,MAAS;AAC/C;AAEF,MAAAD,EAAK,QAAQN,EAAO,MAAM,EAAE,CAAC;AAAA,IAC/B;AAEA,IAAAM,EAAK,KAAK,UAAU;AAEhB,QAAAJ;AACJ,WAAOF,EAAO;AAGR,UAFJE,IAAQF,EAAO,SAEXE,EAAM,CAAC,MAAM,KAAK;AACf,QAAAI,EAAA,KAAK,WAAWJ,EAAM,CAAC;AAC5B;AAAA,MAAA;AAEI,QAAAA,EAAM,CAAC,MAAM,UAAU,KAAK,KAAKA,EAAM,CAAC,CAAC,KACtC,KAAA,YAAY,CAACA,CAAK,CAAC,GAErBI,EAAA,KAAK,WAAWJ,EAAM,CAAC;AAI5B,KAAAI,EAAK,KAAK,CAAC,MAAM,OAAOA,EAAK,KAAK,CAAC,MAAM,SAC3CA,EAAK,KAAK,UAAUA,EAAK,KAAK,CAAC,GAC/BA,EAAK,OAAOA,EAAK,KAAK,MAAM,CAAC;AAG/B,QAAIe,IAAc,CAAA,GACdC;AACJ,WAAOtB,EAAO,WACLsB,IAAAtB,EAAO,CAAC,EAAE,CAAC,GACd,EAAAsB,MAAS,WAAWA,MAAS;AACrB,MAAAD,EAAA,KAAKrB,EAAO,MAAO,CAAA;AAGjC,SAAK,wBAAwBA,CAAM;AAEnC,aAASC,IAAID,EAAO,SAAS,GAAGC,KAAK,GAAGA,KAAK;AAE3C,UADAC,IAAQF,EAAOC,CAAC,GACZC,EAAM,CAAC,EAAE,YAAA,MAAkB,cAAc;AAC3C,QAAAI,EAAK,YAAY;AACjB,YAAIiB,IAAS,KAAK,WAAWvB,GAAQC,CAAC;AAC7B,QAAAsB,IAAA,KAAK,cAAcvB,CAAM,IAAIuB,GAClCA,MAAW,kBAAejB,EAAK,KAAK,YAAYiB;AACpD;AAAA,iBACSrB,EAAM,CAAC,EAAE,YAAA,MAAkB,aAAa;AAC7C,YAAAsB,IAAQxB,EAAO,MAAM,CAAC,GACtByB,IAAM;AACV,iBAAST,IAAIf,GAAGe,IAAI,GAAGA,KAAK;AAC1B,cAAIT,IAAOiB,EAAMR,CAAC,EAAE,CAAC;AACjB,cAAAS,EAAI,OAAO,QAAQ,GAAG,MAAM,KAAKlB,MAAS;AAC5C;AAEF,UAAAkB,IAAMD,EAAM,IAAM,EAAA,CAAC,IAAIC;AAAA,QACzB;AACA,QAAIA,EAAI,KAAK,EAAE,QAAQ,GAAG,MAAM,MAC9BnB,EAAK,YAAY,IACjBA,EAAK,KAAK,YAAYmB,GACbzB,IAAAwB;AAAA,MAEb;AAEA,UAAItB,EAAM,CAAC,MAAM,WAAWA,EAAM,CAAC,MAAM;AACvC;AAAA,IAEJ;AAIA,IAFcF,EAAO,KAAK,CAAKC,MAAAA,EAAE,CAAC,MAAM,WAAWA,EAAE,CAAC,MAAM,SAAS,MAG9DK,EAAA,KAAK,WAAWe,EAAY,IAAI,CAAApB,MAAKA,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GACvDoB,IAAc,CAAA,IAEhB,KAAK,IAAIf,GAAM,SAASe,EAAY,OAAOrB,CAAM,GAAGoB,CAAc,GAE9Dd,EAAK,MAAM,SAAS,GAAG,KAAK,CAACc,KAC/B,KAAK,qBAAqBpB,CAAM;AAAA,EAEpC;AAAA,EAEA,YAAYE,GAAO;AACjB,UAAM,KAAK,MAAM;AAAA,MACf;AAAA,MACA,EAAE,QAAQA,EAAM,CAAC,EAAE;AAAA,MACnB,EAAE,QAAQA,EAAM,CAAC,IAAIA,EAAM,CAAC,EAAE,OAAO;AAAA,IAAA;AAAA,EAEzC;AAAA,EAEA,UAAUA,GAAO;AACX,QAAAI,IAAO,IAAIV;AACf,SAAK,KAAKU,GAAMJ,EAAM,CAAC,CAAC,GACxBI,EAAK,WAAW,IAChBA,EAAK,KAAK,UAAU,IACpB,KAAK,UAAUA;AAAA,EACjB;AAAA,EAEA,IAAIJ,GAAO;AACT,IAAI,KAAK,QAAQ,SAAS,KAAK,QAAQ,MAAM,WACtC,KAAA,QAAQ,KAAK,YAAY,KAAK,YAErC,KAAK,YAAY,IAEZ,KAAA,QAAQ,KAAK,SAAS,KAAK,QAAQ,KAAK,SAAS,MAAM,KAAK,QACjE,KAAK,SAAS,IAEV,KAAK,QAAQ,UACf,KAAK,QAAQ,OAAO,MAAM,KAAK,YAAYA,EAAM,CAAC,CAAC,GAC9C,KAAA,QAAQ,OAAO,IAAI,UACnB,KAAA,UAAU,KAAK,QAAQ,UAE5B,KAAK,gBAAgBA,CAAK;AAAA,EAE9B;AAAA,EAEA,UAAU;AACR,IAAI,KAAK,QAAQ,UAAQ,KAAK,cAAc,GACxC,KAAK,QAAQ,SAAS,KAAK,QAAQ,MAAM,WACtC,KAAA,QAAQ,KAAK,YAAY,KAAK,YAEhC,KAAA,QAAQ,KAAK,SAAS,KAAK,QAAQ,KAAK,SAAS,MAAM,KAAK,QAC5D,KAAA,KAAK,OAAO,MAAM,KAAK,YAAY,KAAK,UAAU,UAAU;AAAA,EACnE;AAAA,EAEA,cAAcA,GAAO;AAEf,QADC,KAAA,UAAUA,EAAM,CAAC,GAClB,KAAK,QAAQ,OAAO;AAClB,UAAAM,IAAO,KAAK,QAAQ,MAAM,KAAK,QAAQ,MAAM,SAAS,CAAC;AAC3D,MAAIA,KAAQA,EAAK,SAAS,UAAU,CAACA,EAAK,KAAK,iBACxCA,EAAA,KAAK,eAAe,KAAK,QAC9B,KAAK,SAAS;AAAA,IAElB;AAAA,EACF;AAAA;AAAA,EAIA,YAAYkB,GAAQ;AAClB,QAAIvB,IAAM,KAAK,MAAM,WAAWuB,CAAM;AAC/B,WAAA;AAAA,MACL,QAAQvB,EAAI;AAAA,MACZ,MAAMA,EAAI;AAAA,MACV,QAAAuB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEA,KAAKpB,GAAMoB,GAAQ;AACZ,SAAA,QAAQ,KAAKpB,CAAI,GACtBA,EAAK,SAAS;AAAA,MACZ,OAAO,KAAK;AAAA,MACZ,OAAO,KAAK,YAAYoB,CAAM;AAAA,IAAA,GAE3BpB,EAAA,KAAK,SAAS,KAAK,QACxB,KAAK,SAAS,IACVA,EAAK,SAAS,cAAW,KAAK,YAAY;AAAA,EAChD;AAAA,EAEA,MAAMqB,GAAO;AACX,QAAIC,IAAM,IACNrB,IAAO,MACPO,IAAQ,IACRe,IAAU,MACVhB,IAAW,CAAA,GACXO,IAAiBO,EAAM,CAAC,EAAE,WAAW,IAAI,GAEzC3B,IAAS,CAAA,GACTE,IAAQyB;AACZ,WAAOzB,KAAO;AAIR,UAHJK,IAAOL,EAAM,CAAC,GACdF,EAAO,KAAKE,CAAK,GAEbK,MAAS,OAAOA,MAAS;AAC3B,QAAKsB,MAAmBA,IAAA3B,IACxBW,EAAS,KAAKN,MAAS,MAAM,MAAM,GAAG;AAAA,eAC7Ba,KAAkBN,KAASP,MAAS;AAC7C,QAAKsB,MAAmBA,IAAA3B,IACxBW,EAAS,KAAK,GAAG;AAAA,eACRA,EAAS,WAAW;AAC7B,YAAIN,MAAS;AACX,cAAIO,GAAO;AACJ,iBAAA,KAAKd,GAAQoB,CAAc;AAChC;AAAA,UAAA;AAEA;AAAA,iBAEOb,MAAS,KAAK;AACvB,eAAK,KAAKP,CAAM;AAChB;AAAA,QAAA,WACSO,MAAS,KAAK;AACvB,eAAK,UAAU,KAAKP,EAAO,IAAK,CAAA,GAC1B4B,IAAA;AACN;AAAA,QAAA;AACF,UAAWrB,MAAS,QACVO,IAAA;AAAA;QAEDP,MAASM,EAASA,EAAS,SAAS,CAAC,MAC9CA,EAAS,IAAI,GACTA,EAAS,WAAW,MAAagB,IAAA;AAG/B,MAAA3B,IAAA,KAAK,UAAU;IACzB;AAKA,QAHI,KAAK,UAAU,UAAU,MAAS0B,IAAA,KAClCf,EAAS,SAAS,KAAG,KAAK,gBAAgBgB,CAAO,GAEjDD,KAAOd,GAAO;AAChB,UAAI,CAACM;AACH,eAAOpB,EAAO,WACZE,IAAQF,EAAOA,EAAO,SAAS,CAAC,EAAE,CAAC,GAC/B,EAAAE,MAAU,WAAWA,MAAU;AACnC,eAAK,UAAU,KAAKF,EAAO,IAAK,CAAA;AAG/B,WAAA,KAAKA,GAAQoB,CAAc;AAAA,IAAA;AAEhC,WAAK,YAAYpB,CAAM;AAAA,EAE3B;AAAA,EAEA,QAAQ;AACF,QAAAE;AACJ,WAAO,CAAC,KAAK,UAAU;AAGb,cAFAA,IAAA,KAAK,UAAU,aAEfA,EAAM,CAAC,GAAG;AAAA,QAChB,KAAK;AACE,eAAA,UAAUA,EAAM,CAAC;AACtB;AAAA,QAEF,KAAK;AACH,eAAK,cAAcA,CAAK;AACxB;AAAA,QAEF,KAAK;AACH,eAAK,IAAIA,CAAK;AACd;AAAA,QAEF,KAAK;AACH,eAAK,QAAQA,CAAK;AAClB;AAAA,QAEF,KAAK;AACH,eAAK,OAAOA,CAAK;AACjB;AAAA,QAEF,KAAK;AACH,eAAK,UAAUA,CAAK;AACpB;AAAA,QAEF;AACE,eAAK,MAAMA,CAAK;AAChB;AAAA,MACJ;AAEF,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,0BAAsC;AAAA,EAEtC;AAAA,EAEA,IAAII,GAAMwB,GAAM9B,GAAQoB,GAAgB;AACtC,QAAIlB,GAAOK,GACPwB,IAAS/B,EAAO,QAChBgC,IAAQ,IACRC,IAAQ,IACRX,GAAMd;AAEV,aAASP,IAAI,GAAGA,IAAI8B,GAAQ9B,KAAK;AAC/B,MAAAC,IAAQF,EAAOC,CAAC,GAChBM,IAAOL,EAAM,CAAC,GACVK,MAAS,WAAWN,MAAM8B,IAAS,KAAK,CAACX,IACnCa,IAAA,KACC1B,MAAS,aACXC,IAAAR,EAAOC,IAAI,CAAC,IAAID,EAAOC,IAAI,CAAC,EAAE,CAAC,IAAI,SACnCqB,IAAAtB,EAAOC,IAAI,CAAC,IAAID,EAAOC,IAAI,CAAC,EAAE,CAAC,IAAI,SACtC,CAACH,EAAsBU,CAAI,KAAK,CAACV,EAAsBwB,CAAI,IACzDU,EAAM,MAAM,EAAE,MAAM,MACdC,IAAA,KAERD,KAAS9B,EAAM,CAAC,IAGV+B,IAAA,MAGVD,KAAS9B,EAAM,CAAC;AAGpB,QAAI,CAAC+B,GAAO;AACN,UAAAC,IAAMlC,EAAO,OAAO,CAACmC,GAAKlC,MAAMkC,IAAMlC,EAAE,CAAC,GAAG,EAAE;AAClD,MAAAK,EAAK,KAAKwB,CAAI,IAAI,EAAE,KAAAI,GAAK,OAAAF,EAAM;AAAA,IACjC;AACA,IAAA1B,EAAKwB,CAAI,IAAIE;AAAA,EACf;AAAA,EAEA,KAAKhC,GAAQ;AACX,IAAAA,EAAO,IAAI;AAEP,QAAAM,IAAO,IAAIV;AACf,SAAK,KAAKU,GAAMN,EAAO,CAAC,EAAE,CAAC,CAAC,GAE5BM,EAAK,KAAK,UAAU,KAAK,yBAAyBN,CAAM,GACnD,KAAA,IAAIM,GAAM,YAAYN,CAAM,GACjC,KAAK,UAAUM;AAAA,EACjB;AAAA,EAEA,yBAAyBN,GAAQ;AAC3B,QAAAoC,GACAC,IAAS;AACb,WAAOrC,EAAO,WACZoC,IAAgBpC,EAAOA,EAAO,SAAS,CAAC,EAAE,CAAC,GACvC,EAAAoC,MAAkB,WAAWA,MAAkB;AACnD,MAAAC,IAASrC,EAAO,IAAM,EAAA,CAAC,IAAIqC;AAEtB,WAAAA;AAAA,EACT;AAAA;AAAA,EAIA,2BAA2BrC,GAAQ;AAC7B,QAAAsB,GACAe,IAAS;AACb,WAAOrC,EAAO,WACLsB,IAAAtB,EAAO,CAAC,EAAE,CAAC,GACd,EAAAsB,MAAS,WAAWA,MAAS;AACvB,MAAAe,KAAArC,EAAO,MAAM,EAAE,CAAC;AAErB,WAAAqC;AAAA,EACT;AAAA,EAEA,cAAcrC,GAAQ;AAChB,QAAAoC,GACAC,IAAS;AACb,WAAOrC,EAAO,WACZoC,IAAgBpC,EAAOA,EAAO,SAAS,CAAC,EAAE,CAAC,GACvCoC,MAAkB;AACtB,MAAAC,IAASrC,EAAO,IAAM,EAAA,CAAC,IAAIqC;AAEtB,WAAAA;AAAA,EACT;AAAA,EAEA,WAAWrC,GAAQsC,GAAM;AACvB,QAAIC,IAAS;AACb,aAAS,IAAID,GAAM,IAAItC,EAAO,QAAQ;AAC1B,MAAAuC,KAAAvC,EAAO,CAAC,EAAE,CAAC;AAEvB,WAAAA,EAAO,OAAOsC,GAAMtC,EAAO,SAASsC,CAAI,GACjCC;AAAA,EACT;AAAA,EAEA,gBAAgB;AACV,QAAApC,IAAM,KAAK,QAAQ,OAAO;AAC9B,UAAM,KAAK,MAAM,MAAM,kBAAkBA,EAAI,MAAMA,EAAI,MAAM;AAAA,EAC/D;AAAA,EAEA,gBAAgB0B,GAAS;AACvB,UAAM,KAAK,MAAM;AAAA,MACf;AAAA,MACA,EAAE,QAAQA,EAAQ,CAAC,EAAE;AAAA,MACrB,EAAE,QAAQA,EAAQ,CAAC,IAAI,EAAE;AAAA,IAAA;AAAA,EAE7B;AAAA,EAEA,gBAAgB3B,GAAO;AACrB,UAAM,KAAK,MAAM;AAAA,MACf;AAAA,MACA,EAAE,QAAQA,EAAM,CAAC,EAAE;AAAA,MACnB,EAAE,QAAQA,EAAM,CAAC,IAAI,EAAE;AAAA,IAAA;AAAA,EAE3B;AAAA,EAEA,YAAYF,GAAQ;AAClB,UAAM,KAAK,MAAM;AAAA,MACf;AAAA,MACA,EAAE,QAAQA,EAAO,CAAC,EAAE,CAAC,EAAE;AAAA,MACvB,EAAE,QAAQA,EAAO,CAAC,EAAE,CAAC,IAAIA,EAAO,CAAC,EAAE,CAAC,EAAE,OAAO;AAAA,IAAA;AAAA,EAEjD;AAAA,EAEA,cAAcM,GAAMJ,GAAO;AACzB,UAAM,KAAK,MAAM;AAAA,MACf;AAAA,MACA,EAAE,QAAQA,EAAM,CAAC,EAAE;AAAA,MACnB,EAAE,QAAQA,EAAM,CAAC,IAAIA,EAAM,CAAC,EAAE,OAAO;AAAA,IAAA;AAAA,EAEzC;AACF;AAEA,IAAAsC,IAAiBpC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es411.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/querying.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.findAll = exports.existsOne = exports.findOne = exports.findOneChild = exports.find = exports.filter = void 0;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Search a node and its children for nodes passing a test function. If `node` is not an array, it will be wrapped in one.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param node Node to search. Will be included in the result set if it matches.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction filter(test, node, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return find(test, Array.isArray(node) ? node : [node], recurse, limit);\n}\nexports.filter = filter;\n/**\n * Search an array of nodes and their children for nodes passing a test function.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction find(test, nodes, recurse, limit) {\n    var result = [];\n    /** Stack of the arrays we are looking at. */\n    var nodeStack = [nodes];\n    /** Stack of the indices within the arrays. */\n    var indexStack = [0];\n    for (;;) {\n        // First, check if the current array has any more elements to look at.\n        if (indexStack[0] >= nodeStack[0].length) {\n            // If we have no more arrays to look at, we are done.\n            if (indexStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if (test(elem)) {\n            result.push(elem);\n            if (--limit <= 0)\n                return result;\n        }\n        if (recurse && (0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {\n            /*\n             * Add the children to the stack. We are depth-first, so this is\n             * the next array we look at.\n             */\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\nexports.find = find;\n/**\n * Finds the first element inside of an array that matches a test function. This is an alias for `Array.prototype.find`.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns The first node in the array that passes `test`.\n * @deprecated Use `Array.prototype.find` directly.\n */\nfunction findOneChild(test, nodes) {\n    return nodes.find(test);\n}\nexports.findOneChild = findOneChild;\n/**\n * Finds one element in a tree that passes a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Node or array of nodes to search.\n * @param recurse Also consider child nodes.\n * @returns The first node that passes `test`.\n */\nfunction findOne(test, nodes, recurse) {\n    if (recurse === void 0) { recurse = true; }\n    var elem = null;\n    for (var i = 0; i < nodes.length && !elem; i++) {\n        var node = nodes[i];\n        if (!(0, domhandler_1.isTag)(node)) {\n            continue;\n        }\n        else if (test(node)) {\n            elem = node;\n        }\n        else if (recurse && node.children.length > 0) {\n            elem = findOne(test, node.children, true);\n        }\n    }\n    return elem;\n}\nexports.findOne = findOne;\n/**\n * Checks if a tree of nodes contains at least one node passing a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns Whether a tree of nodes contains at least one node passing the test.\n */\nfunction existsOne(test, nodes) {\n    return nodes.some(function (checked) {\n        return (0, domhandler_1.isTag)(checked) &&\n            (test(checked) || existsOne(test, checked.children));\n    });\n}\nexports.existsOne = existsOne;\n/**\n * Search an array of nodes and their children for elements passing a test function.\n *\n * Same as `find`, but limited to elements and with less options, leading to reduced complexity.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns All nodes passing `test`.\n */\nfunction findAll(test, nodes) {\n    var result = [];\n    var nodeStack = [nodes];\n    var indexStack = [0];\n    for (;;) {\n        if (indexStack[0] >= nodeStack[0].length) {\n            if (nodeStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if (!(0, domhandler_1.isTag)(elem))\n            continue;\n        if (test(elem))\n            result.push(elem);\n        if (elem.children.length > 0) {\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\nexports.findAll = findAll;\n//# sourceMappingURL=querying.js.map"],"names":["querying","domhandler_1","require$$0","filter","test","node","recurse","limit","find","nodes","result","nodeStack","indexStack","elem","findOneChild","findOne","i","existsOne","checked","findAll"],"mappings":";;;AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5DA,EAAA,UAAkBA,EAAA,YAAoBA,EAAA,UAAkBA,EAAA,eAAuBA,EAAA,OAAeA,EAAA,SAAiB;AAC/G,IAAIC,IAAeC;AAWnB,SAASC,EAAOC,GAAMC,GAAMC,GAASC,GAAO;AACxC,SAAID,MAAY,WAAoBA,IAAA,KAChCC,MAAU,WAAkBA,IAAA,QACzBC,EAAKJ,GAAM,MAAM,QAAQC,CAAI,IAAIA,IAAO,CAACA,CAAI,GAAGC,GAASC,CAAK;AACzE;AACiBP,EAAA,SAAAG;AAWjB,SAASK,EAAKJ,GAAMK,GAAOH,GAASC,GAAO;AAM9B,WALLG,IAAS,CAAA,GAETC,IAAY,CAACF,CAAK,GAElBG,IAAa,CAAC,CAAC,OACV;AAEL,QAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAElC,UAAAC,EAAW,WAAW;AACf,eAAAF;AAGX,MAAAC,EAAU,MAAM,GAChBC,EAAW,MAAM;AAEjB;AAAA,IACJ;AACA,QAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACnC,QAAAR,EAAKS,CAAI,MACTH,EAAO,KAAKG,CAAI,GACZ,EAAEN,KAAS;AACJ,aAAAG;AAEX,IAAAJ,SAAeL,EAAa,aAAaY,CAAI,KAAKA,EAAK,SAAS,SAAS,MAKzED,EAAW,QAAQ,CAAC,GACVD,EAAA,QAAQE,EAAK,QAAQ;AAAA,EAEvC;AACJ;AACeb,EAAA,OAAAQ;AAUf,SAASM,EAAaV,GAAMK,GAAO;AACxB,SAAAA,EAAM,KAAKL,CAAI;AAC1B;AACuBJ,EAAA,eAAAc;AAUvB,SAASC,EAAQX,GAAMK,GAAOH,GAAS;AACnC,EAAIA,MAAY,WAAoBA,IAAA;AAEpC,WADIO,IAAO,MACFG,IAAI,GAAGA,IAAIP,EAAM,UAAU,CAACI,GAAMG,KAAK;AACxC,QAAAX,IAAOI,EAAMO,CAAC;AAClB,YAASf,EAAa,OAAOI,CAAI;AAEjC,MACSD,EAAKC,CAAI,IACPQ,IAAAR,IAEFC,KAAWD,EAAK,SAAS,SAAS,MACvCQ,IAAOE,EAAQX,GAAMC,EAAK,UAAU,EAAI;AAAA;AANxC;AAAA,EAQR;AACO,SAAAQ;AACX;AACkBb,EAAA,UAAAe;AASlB,SAASE,EAAUb,GAAMK,GAAO;AACrB,SAAAA,EAAM,KAAK,SAAUS,GAAS;AACzB,eAAGjB,EAAa,OAAOiB,CAAO,MACjCd,EAAKc,CAAO,KAAKD,EAAUb,GAAMc,EAAQ,QAAQ;AAAA,EAAA,CACzD;AACL;AACoBlB,EAAA,YAAAiB;AAWpB,SAASE,EAAQf,GAAMK,GAAO;AAIjB,WAHLC,IAAS,CAAA,GACTC,IAAY,CAACF,CAAK,GAClBG,IAAa,CAAC,CAAC,OACV;AACL,QAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAClC,UAAAA,EAAU,WAAW;AACd,eAAAD;AAGX,MAAAC,EAAU,MAAM,GAChBC,EAAW,MAAM;AAEjB;AAAA,IACJ;AACA,QAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,QAASX,EAAa,OAAOY,CAAI,MAE7BT,EAAKS,CAAI,KACTH,EAAO,KAAKG,CAAI,GAChBA,EAAK,SAAS,SAAS,MACvBD,EAAW,QAAQ,CAAC,GACVD,EAAA,QAAQE,EAAK,QAAQ;AAAA,EAEvC;AACJ;AACAb,EAAA,UAAkBmB;","x_google_ignoreList":[0]}

package/dist/index.es412.js

@@ -1,8 +1,76 @@
-var r = "right-scroll-bar-position", a = "width-before-scroll-bar", l = "with-scroll-bars-hidden", e = "--removed-body-scroll-bar-size";
+import { __exports as i } from "./index.es419.js";
+import "./index.es304.js";
+import "./index.es411.js";
+import { __exports as s } from "./index.es418.js";
+import { __exports as y } from "./index.es311.js";
+Object.defineProperty(i, "__esModule", { value: !0 });
+i.getElementsByTagType = i.getElementsByTagName = i.getElementById = i.getElements = i.testElement = void 0;
+var u = y, o = s, f = {
+  tag_name: function(n) {
+    return typeof n == "function" ? function(t) {
+      return (0, u.isTag)(t) && n(t.name);
+    } : n === "*" ? u.isTag : function(t) {
+      return (0, u.isTag)(t) && t.name === n;
+    };
+  },
+  tag_type: function(n) {
+    return typeof n == "function" ? function(t) {
+      return n(t.type);
+    } : function(t) {
+      return t.type === n;
+    };
+  },
+  tag_contains: function(n) {
+    return typeof n == "function" ? function(t) {
+      return (0, u.isText)(t) && n(t.data);
+    } : function(t) {
+      return (0, u.isText)(t) && t.data === n;
+    };
+  }
+};
+function g(n, t) {
+  return typeof t == "function" ? function(e) {
+    return (0, u.isTag)(e) && t(e.attribs[n]);
+  } : function(e) {
+    return (0, u.isTag)(e) && e.attribs[n] === t;
+  };
+}
+function p(n, t) {
+  return function(e) {
+    return n(e) || t(e);
+  };
+}
+function c(n) {
+  var t = Object.keys(n).map(function(e) {
+    var r = n[e];
+    return Object.prototype.hasOwnProperty.call(f, e) ? f[e](r) : g(e, r);
+  });
+  return t.length === 0 ? null : t.reduce(p);
+}
+function m(n, t) {
+  var e = c(n);
+  return e ? e(t) : !0;
+}
+i.testElement = m;
+function l(n, t, e, r) {
+  r === void 0 && (r = 1 / 0);
+  var a = c(n);
+  return a ? (0, o.filter)(a, t, e, r) : [];
+}
+i.getElements = l;
+function T(n, t, e) {
+  return e === void 0 && (e = !0), Array.isArray(t) || (t = [t]), (0, o.findOne)(g("id", n), t, e);
+}
+i.getElementById = T;
+function _(n, t, e, r) {
+  return e === void 0 && (e = !0), r === void 0 && (r = 1 / 0), (0, o.filter)(f.tag_name(n), t, e, r);
+}
+i.getElementsByTagName = _;
+function d(n, t, e, r) {
+  return e === void 0 && (e = !0), r === void 0 && (r = 1 / 0), (0, o.filter)(f.tag_type(n), t, e, r);
+}
+i.getElementsByTagType = d;
 export {
-  a as fullWidthClassName,
-  l as noScrollbarsClassName,
-  e as removedBarSizeVariable,
-  r as zeroRightClassName
+  i as default
 };
 //# sourceMappingURL=index.es412.js.map

package/dist/index.es412.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es412.js","sources":["../../../node_modules/react-remove-scroll-bar/dist/es2015/constants.js"],"sourcesContent":["export var zeroRightClassName = 'right-scroll-bar-position';\nexport var fullWidthClassName = 'width-before-scroll-bar';\nexport var noScrollbarsClassName = 'with-scroll-bars-hidden';\n/**\n * Name of a CSS variable containing the amount of \"hidden\" scrollbar\n * ! might be undefined ! use will fallback!\n */\nexport var removedBarSizeVariable = '--removed-body-scroll-bar-size';\n"],"names":["zeroRightClassName","fullWidthClassName","noScrollbarsClassName","removedBarSizeVariable"],"mappings":"AAAO,IAAIA,IAAqB,6BACrBC,IAAqB,2BACrBC,IAAwB,2BAKxBC,IAAyB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es412.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/legacy.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getElementsByTagType = exports.getElementsByTagName = exports.getElementById = exports.getElements = exports.testElement = void 0;\nvar domhandler_1 = require(\"domhandler\");\nvar querying_js_1 = require(\"./querying.js\");\n/**\n * A map of functions to check nodes against.\n */\nvar Checks = {\n    tag_name: function (name) {\n        if (typeof name === \"function\") {\n            return function (elem) { return (0, domhandler_1.isTag)(elem) && name(elem.name); };\n        }\n        else if (name === \"*\") {\n            return domhandler_1.isTag;\n        }\n        return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.name === name; };\n    },\n    tag_type: function (type) {\n        if (typeof type === \"function\") {\n            return function (elem) { return type(elem.type); };\n        }\n        return function (elem) { return elem.type === type; };\n    },\n    tag_contains: function (data) {\n        if (typeof data === \"function\") {\n            return function (elem) { return (0, domhandler_1.isText)(elem) && data(elem.data); };\n        }\n        return function (elem) { return (0, domhandler_1.isText)(elem) && elem.data === data; };\n    },\n};\n/**\n * Returns a function to check whether a node has an attribute with a particular\n * value.\n *\n * @param attrib Attribute to check.\n * @param value Attribute value to look for.\n * @returns A function to check whether the a node has an attribute with a\n *   particular value.\n */\nfunction getAttribCheck(attrib, value) {\n    if (typeof value === \"function\") {\n        return function (elem) { return (0, domhandler_1.isTag)(elem) && value(elem.attribs[attrib]); };\n    }\n    return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.attribs[attrib] === value; };\n}\n/**\n * Returns a function that returns `true` if either of the input functions\n * returns `true` for a node.\n *\n * @param a First function to combine.\n * @param b Second function to combine.\n * @returns A function taking a node and returning `true` if either of the input\n *   functions returns `true` for the node.\n */\nfunction combineFuncs(a, b) {\n    return function (elem) { return a(elem) || b(elem); };\n}\n/**\n * Returns a function that executes all checks in `options` and returns `true`\n * if any of them match a node.\n *\n * @param options An object describing nodes to look for.\n * @returns A function that executes all checks in `options` and returns `true`\n *   if any of them match a node.\n */\nfunction compileTest(options) {\n    var funcs = Object.keys(options).map(function (key) {\n        var value = options[key];\n        return Object.prototype.hasOwnProperty.call(Checks, key)\n            ? Checks[key](value)\n            : getAttribCheck(key, value);\n    });\n    return funcs.length === 0 ? null : funcs.reduce(combineFuncs);\n}\n/**\n * Checks whether a node matches the description in `options`.\n *\n * @category Legacy Query Functions\n * @param options An object describing nodes to look for.\n * @param node The element to test.\n * @returns Whether the element matches the description in `options`.\n */\nfunction testElement(options, node) {\n    var test = compileTest(options);\n    return test ? test(node) : true;\n}\nexports.testElement = testElement;\n/**\n * Returns all nodes that match `options`.\n *\n * @category Legacy Query Functions\n * @param options An object describing nodes to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes that match `options`.\n */\nfunction getElements(options, nodes, recurse, limit) {\n    if (limit === void 0) { limit = Infinity; }\n    var test = compileTest(options);\n    return test ? (0, querying_js_1.filter)(test, nodes, recurse, limit) : [];\n}\nexports.getElements = getElements;\n/**\n * Returns the node with the supplied ID.\n *\n * @category Legacy Query Functions\n * @param id The unique ID attribute value to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @returns The node with the supplied ID.\n */\nfunction getElementById(id, nodes, recurse) {\n    if (recurse === void 0) { recurse = true; }\n    if (!Array.isArray(nodes))\n        nodes = [nodes];\n    return (0, querying_js_1.findOne)(getAttribCheck(\"id\", id), nodes, recurse);\n}\nexports.getElementById = getElementById;\n/**\n * Returns all nodes with the supplied `tagName`.\n *\n * @category Legacy Query Functions\n * @param tagName Tag name to search for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes with the supplied `tagName`.\n */\nfunction getElementsByTagName(tagName, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(Checks[\"tag_name\"](tagName), nodes, recurse, limit);\n}\nexports.getElementsByTagName = getElementsByTagName;\n/**\n * Returns all nodes with the supplied `type`.\n *\n * @category Legacy Query Functions\n * @param type Element type to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes with the supplied `type`.\n */\nfunction getElementsByTagType(type, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(Checks[\"tag_type\"](type), nodes, recurse, limit);\n}\nexports.getElementsByTagType = getElementsByTagType;\n//# sourceMappingURL=legacy.js.map"],"names":["legacy","domhandler_1","require$$0","querying_js_1","require$$1","Checks","name","elem","type","data","getAttribCheck","attrib","value","combineFuncs","a","b","compileTest","options","funcs","key","testElement","node","test","getElements","nodes","recurse","limit","getElementById","id","getElementsByTagName","tagName","getElementsByTagType"],"mappings":";;;;;AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AACpDA,EAAA,uBAAsDA,EAAA,0CAAiCA,EAAA,cAAoCA,EAAA,cAAA;AACnI,IAAIC,IAAeC,GACfC,IAAgBC,GAIhBC,IAAS;AAAA,EACT,UAAU,SAAUC,GAAM;AAClB,WAAA,OAAOA,KAAS,aACT,SAAUC,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKD,EAAKC,EAAK,IAAI;AAAA,IAAA,IAE1ED,MAAS,MACPL,EAAa,QAEjB,SAAUM,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKA,EAAK,SAASD;AAAA,IAAA;AAAA,EACnF;AAAA,EACA,UAAU,SAAUE,GAAM;AAClB,WAAA,OAAOA,KAAS,aACT,SAAUD,GAAM;AAAS,aAAAC,EAAKD,EAAK,IAAI;AAAA,IAAA,IAE3C,SAAUA,GAAM;AAAE,aAAOA,EAAK,SAASC;AAAA,IAAA;AAAA,EAClD;AAAA,EACA,cAAc,SAAUC,GAAM;AACtB,WAAA,OAAOA,KAAS,aACT,SAAUF,GAAM;AAAE,iBAAWN,EAAa,QAAQM,CAAI,KAAKE,EAAKF,EAAK,IAAI;AAAA,IAAA,IAE7E,SAAUA,GAAM;AAAE,iBAAWN,EAAa,QAAQM,CAAI,KAAKA,EAAK,SAASE;AAAA,IAAA;AAAA,EACpF;AACJ;AAUA,SAASC,EAAeC,GAAQC,GAAO;AAC/B,SAAA,OAAOA,KAAU,aACV,SAAUL,GAAM;AAAU,eAAGN,EAAa,OAAOM,CAAI,KAAKK,EAAML,EAAK,QAAQI,CAAM,CAAC;AAAA,EAAA,IAExF,SAAUJ,GAAM;AAAU,eAAGN,EAAa,OAAOM,CAAI,KAAKA,EAAK,QAAQI,CAAM,MAAMC;AAAA,EAAA;AAC9F;AAUA,SAASC,EAAaC,GAAGC,GAAG;AACxB,SAAO,SAAUR,GAAM;AAAE,WAAOO,EAAEP,CAAI,KAAKQ,EAAER,CAAI;AAAA,EAAA;AACrD;AASA,SAASS,EAAYC,GAAS;AAC1B,MAAIC,IAAQ,OAAO,KAAKD,CAAO,EAAE,IAAI,SAAUE,GAAK;AAC5C,QAAAP,IAAQK,EAAQE,CAAG;AACvB,WAAO,OAAO,UAAU,eAAe,KAAKd,GAAQc,CAAG,IACjDd,EAAOc,CAAG,EAAEP,CAAK,IACjBF,EAAeS,GAAKP,CAAK;AAAA,EAAA,CAClC;AACD,SAAOM,EAAM,WAAW,IAAI,OAAOA,EAAM,OAAOL,CAAY;AAChE;AASA,SAASO,EAAYH,GAASI,GAAM;AAC5B,MAAAC,IAAON,EAAYC,CAAO;AACvB,SAAAK,IAAOA,EAAKD,CAAI,IAAI;AAC/B;AACsBrB,EAAA,cAAAoB;AAWtB,SAASG,EAAYN,GAASO,GAAOC,GAASC,GAAO;AACjD,EAAIA,MAAU,WAAkBA,IAAA;AAC5B,MAAAJ,IAAON,EAAYC,CAAO;AACvB,SAAAK,QAAWnB,EAAc,QAAQmB,GAAME,GAAOC,GAASC,CAAK,IAAI;AAC3E;AACsB1B,EAAA,cAAAuB;AAUtB,SAASI,EAAeC,GAAIJ,GAAOC,GAAS;AACxC,SAAIA,MAAY,WAAoBA,IAAA,KAC/B,MAAM,QAAQD,CAAK,MACpBA,IAAQ,CAACA,CAAK,QACPrB,EAAc,SAASO,EAAe,MAAMkB,CAAE,GAAGJ,GAAOC,CAAO;AAC9E;AACyBzB,EAAA,iBAAA2B;AAWzB,SAASE,EAAqBC,GAASN,GAAOC,GAASC,GAAO;AAC1D,SAAID,MAAY,WAAoBA,IAAA,KAChCC,MAAU,WAAkBA,IAAA,YACrBvB,EAAc,QAAQE,EAAO,SAAYyB,CAAO,GAAGN,GAAOC,GAASC,CAAK;AACvF;AAC+B1B,EAAA,uBAAA6B;AAW/B,SAASE,EAAqBvB,GAAMgB,GAAOC,GAASC,GAAO;AACvD,SAAID,MAAY,WAAoBA,IAAA,KAChCC,MAAU,WAAkBA,IAAA,YACrBvB,EAAc,QAAQE,EAAO,SAAYG,CAAI,GAAGgB,GAAOC,GAASC,CAAK;AACpF;AACA1B,EAAA,uBAA+B+B;","x_google_ignoreList":[0]}

package/dist/index.es413.js

@@ -1,6 +1,53 @@
-import { createSidecarMedium as e } from "./index.es480.js";
-var a = e();
-export {
-  a as effectCar
-};
+import { __exports as c } from "./index.es420.js";
+import "./index.es304.js";
+import { __exports as m } from "./index.es311.js";
+(function(t) {
+  Object.defineProperty(t, "__esModule", { value: !0 }), t.uniqueSort = t.compareDocumentPosition = t.DocumentPosition = t.removeSubsets = void 0;
+  var l = m;
+  function I(r) {
+    for (var i = r.length; --i >= 0; ) {
+      var a = r[i];
+      if (i > 0 && r.lastIndexOf(a, i - 1) >= 0) {
+        r.splice(i, 1);
+        continue;
+      }
+      for (var e = a.parent; e; e = e.parent)
+        if (r.includes(e)) {
+          r.splice(i, 1);
+          break;
+        }
+    }
+    return r;
+  }
+  t.removeSubsets = I;
+  var n;
+  (function(r) {
+    r[r.DISCONNECTED = 1] = "DISCONNECTED", r[r.PRECEDING = 2] = "PRECEDING", r[r.FOLLOWING = 4] = "FOLLOWING", r[r.CONTAINS = 8] = "CONTAINS", r[r.CONTAINED_BY = 16] = "CONTAINED_BY";
+  })(n = t.DocumentPosition || (t.DocumentPosition = {}));
+  function O(r, i) {
+    var a = [], e = [];
+    if (r === i)
+      return 0;
+    for (var u = (0, l.hasChildren)(r) ? r : r.parent; u; )
+      a.unshift(u), u = u.parent;
+    for (u = (0, l.hasChildren)(i) ? i : i.parent; u; )
+      e.unshift(u), u = u.parent;
+    for (var E = Math.min(a.length, e.length), N = 0; N < E && a[N] === e[N]; )
+      N++;
+    if (N === 0)
+      return n.DISCONNECTED;
+    var f = a[N - 1], v = f.children, h = a[N], S = e[N];
+    return v.indexOf(h) > v.indexOf(S) ? f === i ? n.FOLLOWING | n.CONTAINED_BY : n.FOLLOWING : f === r ? n.PRECEDING | n.CONTAINS : n.PRECEDING;
+  }
+  t.compareDocumentPosition = O;
+  function C(r) {
+    return r = r.filter(function(i, a, e) {
+      return !e.includes(i, a + 1);
+    }), r.sort(function(i, a) {
+      var e = O(i, a);
+      return e & n.PRECEDING ? -1 : e & n.FOLLOWING ? 1 : 0;
+    }), r;
+  }
+  t.uniqueSort = C;
+})(c);
 //# sourceMappingURL=index.es413.js.map

package/dist/index.es413.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es413.js","sources":["../../../node_modules/react-remove-scroll/dist/es2015/medium.js"],"sourcesContent":["import { createSidecarMedium } from 'use-sidecar';\nexport var effectCar = createSidecarMedium();\n"],"names":["effectCar","createSidecarMedium"],"mappings":";AACO,IAAIA,IAAYC,EAAoB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es413.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/helpers.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.uniqueSort = exports.compareDocumentPosition = exports.DocumentPosition = exports.removeSubsets = void 0;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Given an array of nodes, remove any member that is contained by another\n * member.\n *\n * @category Helpers\n * @param nodes Nodes to filter.\n * @returns Remaining nodes that aren't contained by other nodes.\n */\nfunction removeSubsets(nodes) {\n    var idx = nodes.length;\n    /*\n     * Check if each node (or one of its ancestors) is already contained in the\n     * array.\n     */\n    while (--idx >= 0) {\n        var node = nodes[idx];\n        /*\n         * Remove the node if it is not unique.\n         * We are going through the array from the end, so we only\n         * have to check nodes that preceed the node under consideration in the array.\n         */\n        if (idx > 0 && nodes.lastIndexOf(node, idx - 1) >= 0) {\n            nodes.splice(idx, 1);\n            continue;\n        }\n        for (var ancestor = node.parent; ancestor; ancestor = ancestor.parent) {\n            if (nodes.includes(ancestor)) {\n                nodes.splice(idx, 1);\n                break;\n            }\n        }\n    }\n    return nodes;\n}\nexports.removeSubsets = removeSubsets;\n/**\n * @category Helpers\n * @see {@link http://dom.spec.whatwg.org/#dom-node-comparedocumentposition}\n */\nvar DocumentPosition;\n(function (DocumentPosition) {\n    DocumentPosition[DocumentPosition[\"DISCONNECTED\"] = 1] = \"DISCONNECTED\";\n    DocumentPosition[DocumentPosition[\"PRECEDING\"] = 2] = \"PRECEDING\";\n    DocumentPosition[DocumentPosition[\"FOLLOWING\"] = 4] = \"FOLLOWING\";\n    DocumentPosition[DocumentPosition[\"CONTAINS\"] = 8] = \"CONTAINS\";\n    DocumentPosition[DocumentPosition[\"CONTAINED_BY\"] = 16] = \"CONTAINED_BY\";\n})(DocumentPosition = exports.DocumentPosition || (exports.DocumentPosition = {}));\n/**\n * Compare the position of one node against another node in any other document,\n * returning a bitmask with the values from {@link DocumentPosition}.\n *\n * Document order:\n * > There is an ordering, document order, defined on all the nodes in the\n * > document corresponding to the order in which the first character of the\n * > XML representation of each node occurs in the XML representation of the\n * > document after expansion of general entities. Thus, the document element\n * > node will be the first node. Element nodes occur before their children.\n * > Thus, document order orders element nodes in order of the occurrence of\n * > their start-tag in the XML (after expansion of entities). The attribute\n * > nodes of an element occur after the element and before its children. The\n * > relative order of attribute nodes is implementation-dependent.\n *\n * Source:\n * http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order\n *\n * @category Helpers\n * @param nodeA The first node to use in the comparison\n * @param nodeB The second node to use in the comparison\n * @returns A bitmask describing the input nodes' relative position.\n *\n * See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for\n * a description of these values.\n */\nfunction compareDocumentPosition(nodeA, nodeB) {\n    var aParents = [];\n    var bParents = [];\n    if (nodeA === nodeB) {\n        return 0;\n    }\n    var current = (0, domhandler_1.hasChildren)(nodeA) ? nodeA : nodeA.parent;\n    while (current) {\n        aParents.unshift(current);\n        current = current.parent;\n    }\n    current = (0, domhandler_1.hasChildren)(nodeB) ? nodeB : nodeB.parent;\n    while (current) {\n        bParents.unshift(current);\n        current = current.parent;\n    }\n    var maxIdx = Math.min(aParents.length, bParents.length);\n    var idx = 0;\n    while (idx < maxIdx && aParents[idx] === bParents[idx]) {\n        idx++;\n    }\n    if (idx === 0) {\n        return DocumentPosition.DISCONNECTED;\n    }\n    var sharedParent = aParents[idx - 1];\n    var siblings = sharedParent.children;\n    var aSibling = aParents[idx];\n    var bSibling = bParents[idx];\n    if (siblings.indexOf(aSibling) > siblings.indexOf(bSibling)) {\n        if (sharedParent === nodeB) {\n            return DocumentPosition.FOLLOWING | DocumentPosition.CONTAINED_BY;\n        }\n        return DocumentPosition.FOLLOWING;\n    }\n    if (sharedParent === nodeA) {\n        return DocumentPosition.PRECEDING | DocumentPosition.CONTAINS;\n    }\n    return DocumentPosition.PRECEDING;\n}\nexports.compareDocumentPosition = compareDocumentPosition;\n/**\n * Sort an array of nodes based on their relative position in the document,\n * removing any duplicate nodes. If the array contains nodes that do not belong\n * to the same document, sort order is unspecified.\n *\n * @category Helpers\n * @param nodes Array of DOM nodes.\n * @returns Collection of unique nodes, sorted in document order.\n */\nfunction uniqueSort(nodes) {\n    nodes = nodes.filter(function (node, i, arr) { return !arr.includes(node, i + 1); });\n    nodes.sort(function (a, b) {\n        var relative = compareDocumentPosition(a, b);\n        if (relative & DocumentPosition.PRECEDING) {\n            return -1;\n        }\n        else if (relative & DocumentPosition.FOLLOWING) {\n            return 1;\n        }\n        return 0;\n    });\n    return nodes;\n}\nexports.uniqueSort = uniqueSort;\n//# sourceMappingURL=helpers.js.map"],"names":["exports","domhandler_1","require$$0","removeSubsets","nodes","idx","node","ancestor","DocumentPosition","compareDocumentPosition","nodeA","nodeB","aParents","bParents","current","maxIdx","sharedParent","siblings","aSibling","bSibling","uniqueSort","i","arr","a","b","relative"],"mappings":";;;;AACA,SAAO,kBAAwB,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,aAAqBA,EAAkC,0BAAAA,EAAA,mBAA2BA,EAAwB,gBAAA;AAC1G,MAAIC,IAAeC;AASnB,WAASC,EAAcC,GAAO;AAMnB,aALHC,IAAMD,EAAM,QAKT,EAAEC,KAAO,KAAG;AACX,UAAAC,IAAOF,EAAMC,CAAG;AAMhB,UAAAA,IAAM,KAAKD,EAAM,YAAYE,GAAMD,IAAM,CAAC,KAAK,GAAG;AAC5C,QAAAD,EAAA,OAAOC,GAAK,CAAC;AACnB;AAAA,MACJ;AACA,eAASE,IAAWD,EAAK,QAAQC,GAAUA,IAAWA,EAAS;AACvD,YAAAH,EAAM,SAASG,CAAQ,GAAG;AACpB,UAAAH,EAAA,OAAOC,GAAK,CAAC;AACnB;AAAA,QACJ;AAAA,IAER;AACO,WAAAD;AAAA,EACX;AACA,EAAAJ,EAAA,gBAAwBG;AAKxB,MAAIK;AAAA,GACH,SAAUA,GAAkB;AACzBA,IAAAA,EAAiBA,EAAiB,eAAkB,CAAC,IAAI,gBACzDA,EAAiBA,EAAiB,YAAe,CAAC,IAAI,aACtDA,EAAiBA,EAAiB,YAAe,CAAC,IAAI,aACtDA,EAAiBA,EAAiB,WAAc,CAAC,IAAI,YACrDA,EAAiBA,EAAiB,eAAkB,EAAE,IAAI;AAAA,KAC3DA,IAAmBR,EAAQ,qBAAqBA,EAA2B,mBAAA,CAAG,EAAA;AA2BjF,WAASS,EAAwBC,GAAOC,GAAO;AAC3C,QAAIC,IAAW,CAAA,GACXC,IAAW,CAAA;AACf,QAAIH,MAAUC;AACH,aAAA;AAGX,aADIG,QAAcb,EAAa,aAAaS,CAAK,IAAIA,IAAQA,EAAM,QAC5DI;AACH,MAAAF,EAAS,QAAQE,CAAO,GACxBA,IAAUA,EAAQ;AAGtB,SADAA,QAAcb,EAAa,aAAaU,CAAK,IAAIA,IAAQA,EAAM,QACxDG;AACH,MAAAD,EAAS,QAAQC,CAAO,GACxBA,IAAUA,EAAQ;AAItB,aAFIC,IAAS,KAAK,IAAIH,EAAS,QAAQC,EAAS,MAAM,GAClDR,IAAM,GACHA,IAAMU,KAAUH,EAASP,CAAG,MAAMQ,EAASR,CAAG;AACjD,MAAAA;AAEJ,QAAIA,MAAQ;AACR,aAAOG,EAAiB;AAExB,QAAAQ,IAAeJ,EAASP,IAAM,CAAC,GAC/BY,IAAWD,EAAa,UACxBE,IAAWN,EAASP,CAAG,GACvBc,IAAWN,EAASR,CAAG;AAC3B,WAAIY,EAAS,QAAQC,CAAQ,IAAID,EAAS,QAAQE,CAAQ,IAClDH,MAAiBL,IACVH,EAAiB,YAAYA,EAAiB,eAElDA,EAAiB,YAExBQ,MAAiBN,IACVF,EAAiB,YAAYA,EAAiB,WAElDA,EAAiB;AAAA,EAC5B;AACA,EAAAR,EAAA,0BAAkCS;AAUlC,WAASW,EAAWhB,GAAO;AACvB,WAAAA,IAAQA,EAAM,OAAO,SAAUE,GAAMe,GAAGC,GAAK;AAAE,aAAO,CAACA,EAAI,SAAShB,GAAMe,IAAI,CAAC;AAAA,IAAA,CAAI,GAC7EjB,EAAA,KAAK,SAAUmB,GAAGC,GAAG;AACnB,UAAAC,IAAWhB,EAAwBc,GAAGC,CAAC;AACvC,aAAAC,IAAWjB,EAAiB,YACrB,KAEFiB,IAAWjB,EAAiB,YAC1B,IAEJ;AAAA,IAAA,CACV,GACMJ;AAAA,EACX;AACA,EAAAJ,EAAA,aAAqBoB;;","x_google_ignoreList":[0]}