@performant-software/core-data 2.2.3-beta.1 → 2.2.3-beta.2

package/dist/index.es395.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es395.js","sources":["../../../node_modules/sanitize-html/node_modules/postcss/lib/stringifier.js"],"sourcesContent":["'use strict'\n\nconst DEFAULT_RAW = {\n  after: '\\n',\n  beforeClose: '\\n',\n  beforeComment: '\\n',\n  beforeDecl: '\\n',\n  beforeOpen: ' ',\n  beforeRule: '\\n',\n  colon: ': ',\n  commentLeft: ' ',\n  commentRight: ' ',\n  emptyBody: '',\n  indent: '    ',\n  semicolon: false\n}\n\nfunction capitalize(str) {\n  return str[0].toUpperCase() + str.slice(1)\n}\n\nclass Stringifier {\n  constructor(builder) {\n    this.builder = builder\n  }\n\n  atrule(node, semicolon) {\n    let name = '@' + node.name\n    let params = node.params ? this.rawValue(node, 'params') : ''\n\n    if (typeof node.raws.afterName !== 'undefined') {\n      name += node.raws.afterName\n    } else if (params) {\n      name += ' '\n    }\n\n    if (node.nodes) {\n      this.block(node, name + params)\n    } else {\n      let end = (node.raws.between || '') + (semicolon ? ';' : '')\n      this.builder(name + params + end, node)\n    }\n  }\n\n  beforeAfter(node, detect) {\n    let value\n    if (node.type === 'decl') {\n      value = this.raw(node, null, 'beforeDecl')\n    } else if (node.type === 'comment') {\n      value = this.raw(node, null, 'beforeComment')\n    } else if (detect === 'before') {\n      value = this.raw(node, null, 'beforeRule')\n    } else {\n      value = this.raw(node, null, 'beforeClose')\n    }\n\n    let buf = node.parent\n    let depth = 0\n    while (buf && buf.type !== 'root') {\n      depth += 1\n      buf = buf.parent\n    }\n\n    if (value.includes('\\n')) {\n      let indent = this.raw(node, null, 'indent')\n      if (indent.length) {\n        for (let step = 0; step < depth; step++) value += indent\n      }\n    }\n\n    return value\n  }\n\n  block(node, start) {\n    let between = this.raw(node, 'between', 'beforeOpen')\n    this.builder(start + between + '{', node, 'start')\n\n    let after\n    if (node.nodes && node.nodes.length) {\n      this.body(node)\n      after = this.raw(node, 'after')\n    } else {\n      after = this.raw(node, 'after', 'emptyBody')\n    }\n\n    if (after) this.builder(after)\n    this.builder('}', node, 'end')\n  }\n\n  body(node) {\n    let last = node.nodes.length - 1\n    while (last > 0) {\n      if (node.nodes[last].type !== 'comment') break\n      last -= 1\n    }\n\n    let semicolon = this.raw(node, 'semicolon')\n    for (let i = 0; i < node.nodes.length; i++) {\n      let child = node.nodes[i]\n      let before = this.raw(child, 'before')\n      if (before) this.builder(before)\n      this.stringify(child, last !== i || semicolon)\n    }\n  }\n\n  comment(node) {\n    let left = this.raw(node, 'left', 'commentLeft')\n    let right = this.raw(node, 'right', 'commentRight')\n    this.builder('/*' + left + node.text + right + '*/', node)\n  }\n\n  decl(node, semicolon) {\n    let between = this.raw(node, 'between', 'colon')\n    let string = node.prop + between + this.rawValue(node, 'value')\n\n    if (node.important) {\n      string += node.raws.important || ' !important'\n    }\n\n    if (semicolon) string += ';'\n    this.builder(string, node)\n  }\n\n  document(node) {\n    this.body(node)\n  }\n\n  raw(node, own, detect) {\n    let value\n    if (!detect) detect = own\n\n    // Already had\n    if (own) {\n      value = node.raws[own]\n      if (typeof value !== 'undefined') return value\n    }\n\n    let parent = node.parent\n\n    if (detect === 'before') {\n      // Hack for first rule in CSS\n      if (!parent || (parent.type === 'root' && parent.first === node)) {\n        return ''\n      }\n\n      // `root` nodes in `document` should use only their own raws\n      if (parent && parent.type === 'document') {\n        return ''\n      }\n    }\n\n    // Floating child without parent\n    if (!parent) return DEFAULT_RAW[detect]\n\n    // Detect style by other nodes\n    let root = node.root()\n    if (!root.rawCache) root.rawCache = {}\n    if (typeof root.rawCache[detect] !== 'undefined') {\n      return root.rawCache[detect]\n    }\n\n    if (detect === 'before' || detect === 'after') {\n      return this.beforeAfter(node, detect)\n    } else {\n      let method = 'raw' + capitalize(detect)\n      if (this[method]) {\n        value = this[method](root, node)\n      } else {\n        root.walk(i => {\n          value = i.raws[own]\n          if (typeof value !== 'undefined') return false\n        })\n      }\n    }\n\n    if (typeof value === 'undefined') value = DEFAULT_RAW[detect]\n\n    root.rawCache[detect] = value\n    return value\n  }\n\n  rawBeforeClose(root) {\n    let value\n    root.walk(i => {\n      if (i.nodes && i.nodes.length > 0) {\n        if (typeof i.raws.after !== 'undefined') {\n          value = i.raws.after\n          if (value.includes('\\n')) {\n            value = value.replace(/[^\\n]+$/, '')\n          }\n          return false\n        }\n      }\n    })\n    if (value) value = value.replace(/\\S/g, '')\n    return value\n  }\n\n  rawBeforeComment(root, node) {\n    let value\n    root.walkComments(i => {\n      if (typeof i.raws.before !== 'undefined') {\n        value = i.raws.before\n        if (value.includes('\\n')) {\n          value = value.replace(/[^\\n]+$/, '')\n        }\n        return false\n      }\n    })\n    if (typeof value === 'undefined') {\n      value = this.raw(node, null, 'beforeDecl')\n    } else if (value) {\n      value = value.replace(/\\S/g, '')\n    }\n    return value\n  }\n\n  rawBeforeDecl(root, node) {\n    let value\n    root.walkDecls(i => {\n      if (typeof i.raws.before !== 'undefined') {\n        value = i.raws.before\n        if (value.includes('\\n')) {\n          value = value.replace(/[^\\n]+$/, '')\n        }\n        return false\n      }\n    })\n    if (typeof value === 'undefined') {\n      value = this.raw(node, null, 'beforeRule')\n    } else if (value) {\n      value = value.replace(/\\S/g, '')\n    }\n    return value\n  }\n\n  rawBeforeOpen(root) {\n    let value\n    root.walk(i => {\n      if (i.type !== 'decl') {\n        value = i.raws.between\n        if (typeof value !== 'undefined') return false\n      }\n    })\n    return value\n  }\n\n  rawBeforeRule(root) {\n    let value\n    root.walk(i => {\n      if (i.nodes && (i.parent !== root || root.first !== i)) {\n        if (typeof i.raws.before !== 'undefined') {\n          value = i.raws.before\n          if (value.includes('\\n')) {\n            value = value.replace(/[^\\n]+$/, '')\n          }\n          return false\n        }\n      }\n    })\n    if (value) value = value.replace(/\\S/g, '')\n    return value\n  }\n\n  rawColon(root) {\n    let value\n    root.walkDecls(i => {\n      if (typeof i.raws.between !== 'undefined') {\n        value = i.raws.between.replace(/[^\\s:]/g, '')\n        return false\n      }\n    })\n    return value\n  }\n\n  rawEmptyBody(root) {\n    let value\n    root.walk(i => {\n      if (i.nodes && i.nodes.length === 0) {\n        value = i.raws.after\n        if (typeof value !== 'undefined') return false\n      }\n    })\n    return value\n  }\n\n  rawIndent(root) {\n    if (root.raws.indent) return root.raws.indent\n    let value\n    root.walk(i => {\n      let p = i.parent\n      if (p && p !== root && p.parent && p.parent === root) {\n        if (typeof i.raws.before !== 'undefined') {\n          let parts = i.raws.before.split('\\n')\n          value = parts[parts.length - 1]\n          value = value.replace(/\\S/g, '')\n          return false\n        }\n      }\n    })\n    return value\n  }\n\n  rawSemicolon(root) {\n    let value\n    root.walk(i => {\n      if (i.nodes && i.nodes.length && i.last.type === 'decl') {\n        value = i.raws.semicolon\n        if (typeof value !== 'undefined') return false\n      }\n    })\n    return value\n  }\n\n  rawValue(node, prop) {\n    let value = node[prop]\n    let raw = node.raws[prop]\n    if (raw && raw.value === value) {\n      return raw.raw\n    }\n\n    return value\n  }\n\n  root(node) {\n    this.body(node)\n    if (node.raws.after) this.builder(node.raws.after)\n  }\n\n  rule(node) {\n    this.block(node, this.rawValue(node, 'selector'))\n    if (node.raws.ownSemicolon) {\n      this.builder(node.raws.ownSemicolon, node, 'end')\n    }\n  }\n\n  stringify(node, semicolon) {\n    /* c8 ignore start */\n    if (!this[node.type]) {\n      throw new Error(\n        'Unknown AST node type ' +\n          node.type +\n          '. ' +\n          'Maybe you need to change PostCSS stringifier.'\n      )\n    }\n    /* c8 ignore stop */\n    this[node.type](node, semicolon)\n  }\n}\n\nmodule.exports = Stringifier\nStringifier.default = Stringifier\n"],"names":["DEFAULT_RAW","capitalize","str","Stringifier","builder","node","semicolon","name","params","end","detect","value","buf","depth","indent","step","start","between","after","last","i","child","before","left","right","string","own","parent","root","method","p","parts","prop","raw","stringifier"],"mappings":"AAEA,MAAMA,IAAc;AAAA,EAClB,OAAO;AAAA;AAAA,EACP,aAAa;AAAA;AAAA,EACb,eAAe;AAAA;AAAA,EACf,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,OAAO;AAAA,EACP,aAAa;AAAA,EACb,cAAc;AAAA,EACd,WAAW;AAAA,EACX,QAAQ;AAAA,EACR,WAAW;AACb;AAEA,SAASC,EAAWC,GAAK;AACvB,SAAOA,EAAI,CAAC,EAAE,YAAgB,IAAAA,EAAI,MAAM,CAAC;AAC3C;AAEA,MAAMC,EAAY;AAAA,EAChB,YAAYC,GAAS;AACnB,SAAK,UAAUA;AAAA,EACjB;AAAA,EAEA,OAAOC,GAAMC,GAAW;AAClB,QAAAC,IAAO,MAAMF,EAAK,MAClBG,IAASH,EAAK,SAAS,KAAK,SAASA,GAAM,QAAQ,IAAI;AAQ3D,QANI,OAAOA,EAAK,KAAK,YAAc,MACjCE,KAAQF,EAAK,KAAK,YACTG,MACDD,KAAA,MAGNF,EAAK;AACF,WAAA,MAAMA,GAAME,IAAOC,CAAM;AAAA,SACzB;AACL,UAAIC,KAAOJ,EAAK,KAAK,WAAW,OAAOC,IAAY,MAAM;AACzD,WAAK,QAAQC,IAAOC,IAASC,GAAKJ,CAAI;AAAA,IACxC;AAAA,EACF;AAAA,EAEA,YAAYA,GAAMK,GAAQ;AACpB,QAAAC;AACA,IAAAN,EAAK,SAAS,SAChBM,IAAQ,KAAK,IAAIN,GAAM,MAAM,YAAY,IAChCA,EAAK,SAAS,YACvBM,IAAQ,KAAK,IAAIN,GAAM,MAAM,eAAe,IACnCK,MAAW,WACpBC,IAAQ,KAAK,IAAIN,GAAM,MAAM,YAAY,IAEzCM,IAAQ,KAAK,IAAIN,GAAM,MAAM,aAAa;AAG5C,QAAIO,IAAMP,EAAK,QACXQ,IAAQ;AACL,WAAAD,KAAOA,EAAI,SAAS;AAChB,MAAAC,KAAA,GACTD,IAAMA,EAAI;AAGR,QAAAD,EAAM,SAAS;AAAA,CAAI,GAAG;AACxB,UAAIG,IAAS,KAAK,IAAIT,GAAM,MAAM,QAAQ;AAC1C,UAAIS,EAAO;AACA,iBAAAC,IAAO,GAAGA,IAAOF,GAAOE;AAAiB,UAAAJ,KAAAG;AAAA,IAEtD;AAEO,WAAAH;AAAA,EACT;AAAA,EAEA,MAAMN,GAAMW,GAAO;AACjB,QAAIC,IAAU,KAAK,IAAIZ,GAAM,WAAW,YAAY;AACpD,SAAK,QAAQW,IAAQC,IAAU,KAAKZ,GAAM,OAAO;AAE7C,QAAAa;AACJ,IAAIb,EAAK,SAASA,EAAK,MAAM,UAC3B,KAAK,KAAKA,CAAI,GACNa,IAAA,KAAK,IAAIb,GAAM,OAAO,KAE9Ba,IAAQ,KAAK,IAAIb,GAAM,SAAS,WAAW,GAGzCa,KAAO,KAAK,QAAQA,CAAK,GACxB,KAAA,QAAQ,KAAKb,GAAM,KAAK;AAAA,EAC/B;AAAA,EAEA,KAAKA,GAAM;AACL,QAAAc,IAAOd,EAAK,MAAM,SAAS;AAC/B,WAAOc,IAAO,KACRd,EAAK,MAAMc,CAAI,EAAE,SAAS;AACtB,MAAAA,KAAA;AAGV,QAAIb,IAAY,KAAK,IAAID,GAAM,WAAW;AAC1C,aAASe,IAAI,GAAGA,IAAIf,EAAK,MAAM,QAAQe,KAAK;AACtC,UAAAC,IAAQhB,EAAK,MAAMe,CAAC,GACpBE,IAAS,KAAK,IAAID,GAAO,QAAQ;AACjC,MAAAC,KAAQ,KAAK,QAAQA,CAAM,GAC/B,KAAK,UAAUD,GAAOF,MAASC,KAAKd,CAAS;AAAA,IAC/C;AAAA,EACF;AAAA,EAEA,QAAQD,GAAM;AACZ,QAAIkB,IAAO,KAAK,IAAIlB,GAAM,QAAQ,aAAa,GAC3CmB,IAAQ,KAAK,IAAInB,GAAM,SAAS,cAAc;AAClD,SAAK,QAAQ,OAAOkB,IAAOlB,EAAK,OAAOmB,IAAQ,MAAMnB,CAAI;AAAA,EAC3D;AAAA,EAEA,KAAKA,GAAMC,GAAW;AACpB,QAAIW,IAAU,KAAK,IAAIZ,GAAM,WAAW,OAAO,GAC3CoB,IAASpB,EAAK,OAAOY,IAAU,KAAK,SAASZ,GAAM,OAAO;AAE9D,IAAIA,EAAK,cACGoB,KAAApB,EAAK,KAAK,aAAa,gBAG/BC,MAAqBmB,KAAA,MACpB,KAAA,QAAQA,GAAQpB,CAAI;AAAA,EAC3B;AAAA,EAEA,SAASA,GAAM;AACb,SAAK,KAAKA,CAAI;AAAA,EAChB;AAAA,EAEA,IAAIA,GAAMqB,GAAKhB,GAAQ;AACjB,QAAAC;AAIJ,QAHKD,MAAiBA,IAAAgB,IAGlBA,MACMf,IAAAN,EAAK,KAAKqB,CAAG,GACjB,OAAOf,IAAU;AAAoB,aAAAA;AAG3C,QAAIgB,IAAStB,EAAK;AAElB,QAAIK,MAAW,aAET,CAACiB,KAAWA,EAAO,SAAS,UAAUA,EAAO,UAAUtB,KAKvDsB,KAAUA,EAAO,SAAS;AACrB,aAAA;AAKX,QAAI,CAACA;AAAQ,aAAO3B,EAAYU,CAAM;AAGlC,QAAAkB,IAAOvB,EAAK;AAEhB,QADKuB,EAAK,aAAUA,EAAK,WAAW,KAChC,OAAOA,EAAK,SAASlB,CAAM,IAAM;AAC5B,aAAAkB,EAAK,SAASlB,CAAM;AAGzB,QAAAA,MAAW,YAAYA,MAAW;AAC7B,aAAA,KAAK,YAAYL,GAAMK,CAAM;AAC/B;AACD,UAAAmB,IAAS,QAAQ5B,EAAWS,CAAM;AAClC,MAAA,KAAKmB,CAAM,IACblB,IAAQ,KAAKkB,CAAM,EAAED,GAAMvB,CAAI,IAE/BuB,EAAK,KAAK,CAAKR,MAAA;AAEb,YADQT,IAAAS,EAAE,KAAKM,CAAG,GACd,OAAOf,IAAU;AAAoB,iBAAA;AAAA,MAAA,CAC1C;AAAA,IAEL;AAEA,WAAI,OAAOA,IAAU,QAAaA,IAAQX,EAAYU,CAAM,IAEvDkB,EAAA,SAASlB,CAAM,IAAIC,GACjBA;AAAA,EACT;AAAA,EAEA,eAAeiB,GAAM;AACf,QAAAjB;AACJ,WAAAiB,EAAK,KAAK,CAAKR,MAAA;AACb,UAAIA,EAAE,SAASA,EAAE,MAAM,SAAS,KAC1B,OAAOA,EAAE,KAAK,QAAU;AAC1B,eAAAT,IAAQS,EAAE,KAAK,OACXT,EAAM,SAAS;AAAA,CAAI,MACbA,IAAAA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,IAEX,CACD,GACGA,MAAeA,IAAAA,EAAM,QAAQ,OAAO,EAAE,IACnCA;AAAA,EACT;AAAA,EAEA,iBAAiBiB,GAAMvB,GAAM;AACvB,QAAAM;AACJ,WAAAiB,EAAK,aAAa,CAAKR,MAAA;AACrB,UAAI,OAAOA,EAAE,KAAK,SAAW;AAC3B,eAAAT,IAAQS,EAAE,KAAK,QACXT,EAAM,SAAS;AAAA,CAAI,MACbA,IAAAA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,IACT,CACD,GACG,OAAOA,IAAU,MACnBA,IAAQ,KAAK,IAAIN,GAAM,MAAM,YAAY,IAChCM,MACDA,IAAAA,EAAM,QAAQ,OAAO,EAAE,IAE1BA;AAAA,EACT;AAAA,EAEA,cAAciB,GAAMvB,GAAM;AACpB,QAAAM;AACJ,WAAAiB,EAAK,UAAU,CAAKR,MAAA;AAClB,UAAI,OAAOA,EAAE,KAAK,SAAW;AAC3B,eAAAT,IAAQS,EAAE,KAAK,QACXT,EAAM,SAAS;AAAA,CAAI,MACbA,IAAAA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,IACT,CACD,GACG,OAAOA,IAAU,MACnBA,IAAQ,KAAK,IAAIN,GAAM,MAAM,YAAY,IAChCM,MACDA,IAAAA,EAAM,QAAQ,OAAO,EAAE,IAE1BA;AAAA,EACT;AAAA,EAEA,cAAciB,GAAM;AACd,QAAAjB;AACJ,WAAAiB,EAAK,KAAK,CAAKR,MAAA;AACT,UAAAA,EAAE,SAAS,WACbT,IAAQS,EAAE,KAAK,SACX,OAAOT,IAAU;AAAoB,eAAA;AAAA,IAC3C,CACD,GACMA;AAAA,EACT;AAAA,EAEA,cAAciB,GAAM;AACd,QAAAjB;AACJ,WAAAiB,EAAK,KAAK,CAAKR,MAAA;AACb,UAAIA,EAAE,UAAUA,EAAE,WAAWQ,KAAQA,EAAK,UAAUR,MAC9C,OAAOA,EAAE,KAAK,SAAW;AAC3B,eAAAT,IAAQS,EAAE,KAAK,QACXT,EAAM,SAAS;AAAA,CAAI,MACbA,IAAAA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,IAEX,CACD,GACGA,MAAeA,IAAAA,EAAM,QAAQ,OAAO,EAAE,IACnCA;AAAA,EACT;AAAA,EAEA,SAASiB,GAAM;AACT,QAAAjB;AACJ,WAAAiB,EAAK,UAAU,CAAKR,MAAA;AAClB,UAAI,OAAOA,EAAE,KAAK,UAAY;AAC5B,eAAAT,IAAQS,EAAE,KAAK,QAAQ,QAAQ,WAAW,EAAE,GACrC;AAAA,IACT,CACD,GACMT;AAAA,EACT;AAAA,EAEA,aAAaiB,GAAM;AACb,QAAAjB;AACJ,WAAAiB,EAAK,KAAK,CAAKR,MAAA;AACb,UAAIA,EAAE,SAASA,EAAE,MAAM,WAAW,MAChCT,IAAQS,EAAE,KAAK,OACX,OAAOT,IAAU;AAAoB,eAAA;AAAA,IAC3C,CACD,GACMA;AAAA,EACT;AAAA,EAEA,UAAUiB,GAAM;AACd,QAAIA,EAAK,KAAK;AAAQ,aAAOA,EAAK,KAAK;AACnC,QAAAjB;AACJ,WAAAiB,EAAK,KAAK,CAAKR,MAAA;AACb,UAAIU,IAAIV,EAAE;AACV,UAAIU,KAAKA,MAAMF,KAAQE,EAAE,UAAUA,EAAE,WAAWF,KAC1C,OAAOR,EAAE,KAAK,SAAW,KAAa;AACxC,YAAIW,IAAQX,EAAE,KAAK,OAAO,MAAM;AAAA,CAAI;AAC5B,eAAAT,IAAAoB,EAAMA,EAAM,SAAS,CAAC,GACtBpB,IAAAA,EAAM,QAAQ,OAAO,EAAE,GACxB;AAAA,MACT;AAAA,IACF,CACD,GACMA;AAAA,EACT;AAAA,EAEA,aAAaiB,GAAM;AACb,QAAAjB;AACJ,WAAAiB,EAAK,KAAK,CAAKR,MAAA;AACT,UAAAA,EAAE,SAASA,EAAE,MAAM,UAAUA,EAAE,KAAK,SAAS,WAC/CT,IAAQS,EAAE,KAAK,WACX,OAAOT,IAAU;AAAoB,eAAA;AAAA,IAC3C,CACD,GACMA;AAAA,EACT;AAAA,EAEA,SAASN,GAAM2B,GAAM;AACf,QAAArB,IAAQN,EAAK2B,CAAI,GACjBC,IAAM5B,EAAK,KAAK2B,CAAI;AACpB,WAAAC,KAAOA,EAAI,UAAUtB,IAChBsB,EAAI,MAGNtB;AAAA,EACT;AAAA,EAEA,KAAKN,GAAM;AACT,SAAK,KAAKA,CAAI,GACVA,EAAK,KAAK,SAAY,KAAA,QAAQA,EAAK,KAAK,KAAK;AAAA,EACnD;AAAA,EAEA,KAAKA,GAAM;AACT,SAAK,MAAMA,GAAM,KAAK,SAASA,GAAM,UAAU,CAAC,GAC5CA,EAAK,KAAK,gBACZ,KAAK,QAAQA,EAAK,KAAK,cAAcA,GAAM,KAAK;AAAA,EAEpD;AAAA,EAEA,UAAUA,GAAMC,GAAW;AAEzB,QAAI,CAAC,KAAKD,EAAK,IAAI;AACjB,YAAM,IAAI;AAAA,QACR,2BACEA,EAAK,OACL;AAAA,MAAA;AAKN,SAAKA,EAAK,IAAI,EAAEA,GAAMC,CAAS;AAAA,EACjC;AACF;IAEA4B,IAAiB/B;AACjBA,EAAY,UAAUA;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es395.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.es396.js

@@ -1,91 +1,76 @@
-import s from "./index.es389.js";
-let { SourceMapConsumer: l, SourceMapGenerator: u } = s, { existsSync: c, readFileSync: p } = s, { dirname: o, join: m } = s;
-function d(r) {
-  return Buffer ? Buffer.from(r, "base64").toString() : window.atob(r);
-}
-class a {
-  constructor(t, e) {
-    if (e.map === !1)
-      return;
-    this.loadAnnotation(t), this.inline = this.startWith(this.annotation, "data:");
-    let i = e.map ? e.map.prev : void 0, n = this.loadMap(e.from, i);
-    !this.mapFile && e.from && (this.mapFile = e.from), this.mapFile && (this.root = o(this.mapFile)), n && (this.text = n);
-  }
-  consumer() {
-    return this.consumerCache || (this.consumerCache = new l(this.text)), this.consumerCache;
-  }
-  decodeInline(t) {
-    let e = /^data:application\/json;charset=utf-?8;base64,/, i = /^data:application\/json;base64,/, n = /^data:application\/json;charset=utf-?8,/, f = /^data:application\/json,/;
-    if (n.test(t) || f.test(t))
-      return decodeURIComponent(t.substr(RegExp.lastMatch.length));
-    if (e.test(t) || i.test(t))
-      return d(t.substr(RegExp.lastMatch.length));
-    let h = t.match(/data:application\/json;([^,]+),/)[1];
-    throw new Error("Unsupported source map encoding " + h);
-  }
-  getAnnotationURL(t) {
-    return t.replace(/^\/\*\s*# sourceMappingURL=/, "").trim();
-  }
-  isMap(t) {
-    return typeof t != "object" ? !1 : typeof t.mappings == "string" || typeof t._mappings == "string" || Array.isArray(t.sections);
-  }
-  loadAnnotation(t) {
-    let e = t.match(/\/\*\s*# sourceMappingURL=/gm);
-    if (!e)
-      return;
-    let i = t.lastIndexOf(e.pop()), n = t.indexOf("*/", i);
-    i > -1 && n > -1 && (this.annotation = this.getAnnotationURL(t.substring(i, n)));
-  }
-  loadFile(t) {
-    if (this.root = o(t), c(t))
-      return this.mapFile = t, p(t, "utf-8").toString().trim();
-  }
-  loadMap(t, e) {
-    if (e === !1)
-      return !1;
-    if (e) {
-      if (typeof e == "string")
-        return e;
-      if (typeof e == "function") {
-        let i = e(t);
-        if (i) {
-          let n = this.loadFile(i);
-          if (!n)
-            throw new Error(
-              "Unable to load previous source map: " + i.toString()
-            );
-          return n;
-        }
-      } else {
-        if (e instanceof l)
-          return u.fromSourceMap(e).toString();
-        if (e instanceof u)
-          return e.toString();
-        if (this.isMap(e))
-          return JSON.stringify(e);
-        throw new Error(
-          "Unsupported previous source map format: " + e.toString()
-        );
-      }
-    } else {
-      if (this.inline)
-        return this.decodeInline(this.annotation);
-      if (this.annotation) {
-        let i = this.annotation;
-        return t && (i = m(o(t), i)), this.loadFile(i);
-      }
-    }
-  }
-  startWith(t, e) {
-    return t ? t.substr(0, e.length) === e : !1;
-  }
-  withContent() {
-    return !!(this.consumer().sourcesContent && this.consumer().sourcesContent.length > 0);
+import { __exports as i } from "./index.es403.js";
+import "./index.es303.js";
+import "./index.es395.js";
+import { __exports as s } from "./index.es402.js";
+import { __exports as y } from "./index.es310.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);
 }
-var M = a;
-a.default = a;
+i.getElementsByTagType = d;
 export {
-  M as p
+  i as default
 };
 //# sourceMappingURL=index.es396.js.map

package/dist/index.es396.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es396.js","sources":["../../../node_modules/sanitize-html/node_modules/postcss/lib/previous-map.js"],"sourcesContent":["'use strict'\n\nlet { SourceMapConsumer, SourceMapGenerator } = require('source-map-js')\nlet { existsSync, readFileSync } = require('fs')\nlet { dirname, join } = require('path')\n\nfunction fromBase64(str) {\n  if (Buffer) {\n    return Buffer.from(str, 'base64').toString()\n  } else {\n    /* c8 ignore next 2 */\n    return window.atob(str)\n  }\n}\n\nclass PreviousMap {\n  constructor(css, opts) {\n    if (opts.map === false) return\n    this.loadAnnotation(css)\n    this.inline = this.startWith(this.annotation, 'data:')\n\n    let prev = opts.map ? opts.map.prev : undefined\n    let text = this.loadMap(opts.from, prev)\n    if (!this.mapFile && opts.from) {\n      this.mapFile = opts.from\n    }\n    if (this.mapFile) this.root = dirname(this.mapFile)\n    if (text) this.text = text\n  }\n\n  consumer() {\n    if (!this.consumerCache) {\n      this.consumerCache = new SourceMapConsumer(this.text)\n    }\n    return this.consumerCache\n  }\n\n  decodeInline(text) {\n    let baseCharsetUri = /^data:application\\/json;charset=utf-?8;base64,/\n    let baseUri = /^data:application\\/json;base64,/\n    let charsetUri = /^data:application\\/json;charset=utf-?8,/\n    let uri = /^data:application\\/json,/\n\n    if (charsetUri.test(text) || uri.test(text)) {\n      return decodeURIComponent(text.substr(RegExp.lastMatch.length))\n    }\n\n    if (baseCharsetUri.test(text) || baseUri.test(text)) {\n      return fromBase64(text.substr(RegExp.lastMatch.length))\n    }\n\n    let encoding = text.match(/data:application\\/json;([^,]+),/)[1]\n    throw new Error('Unsupported source map encoding ' + encoding)\n  }\n\n  getAnnotationURL(sourceMapString) {\n    return sourceMapString.replace(/^\\/\\*\\s*# sourceMappingURL=/, '').trim()\n  }\n\n  isMap(map) {\n    if (typeof map !== 'object') return false\n    return (\n      typeof map.mappings === 'string' ||\n      typeof map._mappings === 'string' ||\n      Array.isArray(map.sections)\n    )\n  }\n\n  loadAnnotation(css) {\n    let comments = css.match(/\\/\\*\\s*# sourceMappingURL=/gm)\n    if (!comments) return\n\n    // sourceMappingURLs from comments, strings, etc.\n    let start = css.lastIndexOf(comments.pop())\n    let end = css.indexOf('*/', start)\n\n    if (start > -1 && end > -1) {\n      // Locate the last sourceMappingURL to avoid pickin\n      this.annotation = this.getAnnotationURL(css.substring(start, end))\n    }\n  }\n\n  loadFile(path) {\n    this.root = dirname(path)\n    if (existsSync(path)) {\n      this.mapFile = path\n      return readFileSync(path, 'utf-8').toString().trim()\n    }\n  }\n\n  loadMap(file, prev) {\n    if (prev === false) return false\n\n    if (prev) {\n      if (typeof prev === 'string') {\n        return prev\n      } else if (typeof prev === 'function') {\n        let prevPath = prev(file)\n        if (prevPath) {\n          let map = this.loadFile(prevPath)\n          if (!map) {\n            throw new Error(\n              'Unable to load previous source map: ' + prevPath.toString()\n            )\n          }\n          return map\n        }\n      } else if (prev instanceof SourceMapConsumer) {\n        return SourceMapGenerator.fromSourceMap(prev).toString()\n      } else if (prev instanceof SourceMapGenerator) {\n        return prev.toString()\n      } else if (this.isMap(prev)) {\n        return JSON.stringify(prev)\n      } else {\n        throw new Error(\n          'Unsupported previous source map format: ' + prev.toString()\n        )\n      }\n    } else if (this.inline) {\n      return this.decodeInline(this.annotation)\n    } else if (this.annotation) {\n      let map = this.annotation\n      if (file) map = join(dirname(file), map)\n      return this.loadFile(map)\n    }\n  }\n\n  startWith(string, start) {\n    if (!string) return false\n    return string.substr(0, start.length) === start\n  }\n\n  withContent() {\n    return !!(\n      this.consumer().sourcesContent &&\n      this.consumer().sourcesContent.length > 0\n    )\n  }\n}\n\nmodule.exports = PreviousMap\nPreviousMap.default = PreviousMap\n"],"names":["SourceMapConsumer","SourceMapGenerator","require$$0","existsSync","readFileSync","require$$1","dirname","join","require$$2","fromBase64","str","PreviousMap","css","opts","prev","text","baseCharsetUri","baseUri","charsetUri","uri","encoding","sourceMapString","map","comments","start","end","path","file","prevPath","string","previousMap"],"mappings":";AAEA,IAAI,EAAE,mBAAAA,GAAmB,oBAAAC,EAAmB,IAAIC,GAC5C,EAAE,YAAAC,GAAY,cAAAC,EAAa,IAAIC,GAC/B,EAAE,SAAAC,GAAS,MAAAC,EAAK,IAAIC;AAExB,SAASC,EAAWC,GAAK;AACvB,SAAI,SACK,OAAO,KAAKA,GAAK,QAAQ,EAAE,SAAS,IAGpC,OAAO,KAAKA,CAAG;AAE1B;AAEA,MAAMC,EAAY;AAAA,EAChB,YAAYC,GAAKC,GAAM;AACrB,QAAIA,EAAK,QAAQ;AAAO;AACxB,SAAK,eAAeD,CAAG,GACvB,KAAK,SAAS,KAAK,UAAU,KAAK,YAAY,OAAO;AAErD,QAAIE,IAAOD,EAAK,MAAMA,EAAK,IAAI,OAAO,QAClCE,IAAO,KAAK,QAAQF,EAAK,MAAMC,CAAI;AACvC,IAAI,CAAC,KAAK,WAAWD,EAAK,SACxB,KAAK,UAAUA,EAAK,OAElB,KAAK,YAAc,KAAA,OAAOP,EAAQ,KAAK,OAAO,IAC9CS,MAAM,KAAK,OAAOA;AAAA,EACxB;AAAA,EAEA,WAAW;AACL,WAAC,KAAK,kBACR,KAAK,gBAAgB,IAAIf,EAAkB,KAAK,IAAI,IAE/C,KAAK;AAAA,EACd;AAAA,EAEA,aAAae,GAAM;AACjB,QAAIC,IAAiB,kDACjBC,IAAU,mCACVC,IAAa,2CACbC,IAAM;AAEV,QAAID,EAAW,KAAKH,CAAI,KAAKI,EAAI,KAAKJ,CAAI;AACxC,aAAO,mBAAmBA,EAAK,OAAO,OAAO,UAAU,MAAM,CAAC;AAGhE,QAAIC,EAAe,KAAKD,CAAI,KAAKE,EAAQ,KAAKF,CAAI;AAChD,aAAON,EAAWM,EAAK,OAAO,OAAO,UAAU,MAAM,CAAC;AAGxD,QAAIK,IAAWL,EAAK,MAAM,iCAAiC,EAAE,CAAC;AACxD,UAAA,IAAI,MAAM,qCAAqCK,CAAQ;AAAA,EAC/D;AAAA,EAEA,iBAAiBC,GAAiB;AAChC,WAAOA,EAAgB,QAAQ,+BAA+B,EAAE,EAAE,KAAK;AAAA,EACzE;AAAA,EAEA,MAAMC,GAAK;AACT,WAAI,OAAOA,KAAQ,WAAiB,KAElC,OAAOA,EAAI,YAAa,YACxB,OAAOA,EAAI,aAAc,YACzB,MAAM,QAAQA,EAAI,QAAQ;AAAA,EAE9B;AAAA,EAEA,eAAeV,GAAK;AACd,QAAAW,IAAWX,EAAI,MAAM,8BAA8B;AACvD,QAAI,CAACW;AAAU;AAGf,QAAIC,IAAQZ,EAAI,YAAYW,EAAS,IAAK,CAAA,GACtCE,IAAMb,EAAI,QAAQ,MAAMY,CAAK;AAE7B,IAAAA,IAAQ,MAAMC,IAAM,OAEtB,KAAK,aAAa,KAAK,iBAAiBb,EAAI,UAAUY,GAAOC,CAAG,CAAC;AAAA,EAErE;AAAA,EAEA,SAASC,GAAM;AAET,QADC,KAAA,OAAOpB,EAAQoB,CAAI,GACpBvB,EAAWuB,CAAI;AACjB,kBAAK,UAAUA,GACRtB,EAAasB,GAAM,OAAO,EAAE,SAAA,EAAW;EAElD;AAAA,EAEA,QAAQC,GAAMb,GAAM;AAClB,QAAIA,MAAS;AAAc,aAAA;AAE3B,QAAIA,GAAM;AACJ,UAAA,OAAOA,KAAS;AACX,eAAAA;AACT,UAAW,OAAOA,KAAS,YAAY;AACjC,YAAAc,IAAWd,EAAKa,CAAI;AACxB,YAAIC,GAAU;AACR,cAAAN,IAAM,KAAK,SAASM,CAAQ;AAChC,cAAI,CAACN;AACH,kBAAM,IAAI;AAAA,cACR,yCAAyCM,EAAS,SAAS;AAAA,YAAA;AAGxD,iBAAAN;AAAA,QACT;AAAA,MAAA,OACF;AAAA,YAAWR,aAAgBd;AACzB,iBAAOC,EAAmB,cAAca,CAAI,EAAE,SAAS;AACzD,YAAWA,aAAgBb;AACzB,iBAAOa,EAAK;AACH,YAAA,KAAK,MAAMA,CAAI;AACjB,iBAAA,KAAK,UAAUA,CAAI;AAE1B,cAAM,IAAI;AAAA,UACR,6CAA6CA,EAAK,SAAS;AAAA,QAAA;AAAA;AAAA,IAE/D,OACF;AAAA,UAAW,KAAK;AACP,eAAA,KAAK,aAAa,KAAK,UAAU;AAC1C,UAAW,KAAK,YAAY;AAC1B,YAAIQ,IAAM,KAAK;AACX,eAAAK,MAAML,IAAMf,EAAKD,EAAQqB,CAAI,GAAGL,CAAG,IAChC,KAAK,SAASA,CAAG;AAAA,MAC1B;AAAA;AAAA,EACF;AAAA,EAEA,UAAUO,GAAQL,GAAO;AACvB,WAAKK,IACEA,EAAO,OAAO,GAAGL,EAAM,MAAM,MAAMA,IADtB;AAAA,EAEtB;AAAA,EAEA,cAAc;AACL,WAAA,CAAC,EACN,KAAK,SAAS,EAAE,kBAChB,KAAK,WAAW,eAAe,SAAS;AAAA,EAE5C;AACF;IAEAM,IAAiBnB;AACjBA,EAAY,UAAUA;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es396.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.es397.js

@@ -1,16 +1,53 @@
-let a = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict", i = (e, t = 21) => (l = t) => {
-  let r = "", n = l;
-  for (; n--; )
-    r += e[Math.random() * e.length | 0];
-  return r;
-}, h = (e = 21) => {
-  let t = "", l = e;
-  for (; l--; )
-    t += a[Math.random() * 64 | 0];
-  return t;
-};
-var o = { nanoid: h, customAlphabet: i };
-export {
-  o as n
-};
+import { __exports as c } from "./index.es404.js";
+import "./index.es303.js";
+import { __exports as m } from "./index.es310.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.es397.js.map

package/dist/index.es397.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es397.js","sources":["../../../node_modules/nanoid/non-secure/index.cjs"],"sourcesContent":["let urlAlphabet =\n  'useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict'\nlet customAlphabet = (alphabet, defaultSize = 21) => {\n  return (size = defaultSize) => {\n    let id = ''\n    let i = size\n    while (i--) {\n      id += alphabet[(Math.random() * alphabet.length) | 0]\n    }\n    return id\n  }\n}\nlet nanoid = (size = 21) => {\n  let id = ''\n  let i = size\n  while (i--) {\n    id += urlAlphabet[(Math.random() * 64) | 0]\n  }\n  return id\n}\nmodule.exports = { nanoid, customAlphabet }\n"],"names":["urlAlphabet","customAlphabet","alphabet","defaultSize","size","id","i","nanoid","nonSecure"],"mappings":"AAAA,IAAIA,IACF,oEACEC,IAAiB,CAACC,GAAUC,IAAc,OACrC,CAACC,IAAOD,MAAgB;AAC7B,MAAIE,IAAK,IACLC,IAAIF;AACR,SAAOE;AACL,IAAAD,KAAMH,EAAU,KAAK,OAAM,IAAKA,EAAS,SAAU,CAAC;AAEtD,SAAOG;AACR,GAECE,IAAS,CAACH,IAAO,OAAO;AAC1B,MAAIC,IAAK,IACLC,IAAIF;AACR,SAAOE;AACL,IAAAD,KAAML,EAAa,KAAK,OAAQ,IAAG,KAAM,CAAC;AAE5C,SAAOK;AACT;AACA,IAAAG,IAAiB,EAAE,QAAAD,GAAQ,gBAAAN,EAAc;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es397.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]}