@anoki/fse-ui 2.3.0-12-SNAPSHOT1 → 2.3.0-12-SNAPSHOT3

package/dist/index.es735.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es735.js","sources":["../node_modules/postcss/lib/map-generator.js"],"sourcesContent":["'use strict'\n\nlet { dirname, relative, resolve, sep } = require('path')\nlet { SourceMapConsumer, SourceMapGenerator } = require('source-map-js')\nlet { pathToFileURL } = require('url')\n\nlet Input = require('./input')\n\nlet sourceMapAvailable = Boolean(SourceMapConsumer && SourceMapGenerator)\nlet pathAvailable = Boolean(dirname && resolve && relative && sep)\n\nclass MapGenerator {\n  constructor(stringify, root, opts, cssString) {\n    this.stringify = stringify\n    this.mapOpts = opts.map || {}\n    this.root = root\n    this.opts = opts\n    this.css = cssString\n    this.originalCSS = cssString\n    this.usesFileUrls = !this.mapOpts.from && this.mapOpts.absolute\n\n    this.memoizedFileURLs = new Map()\n    this.memoizedPaths = new Map()\n    this.memoizedURLs = new Map()\n  }\n\n  addAnnotation() {\n    let content\n\n    if (this.isInline()) {\n      content =\n        'data:application/json;base64,' + this.toBase64(this.map.toString())\n    } else if (typeof this.mapOpts.annotation === 'string') {\n      content = this.mapOpts.annotation\n    } else if (typeof this.mapOpts.annotation === 'function') {\n      content = this.mapOpts.annotation(this.opts.to, this.root)\n    } else {\n      content = this.outputFile() + '.map'\n    }\n    let eol = '\\n'\n    if (this.css.includes('\\r\\n')) eol = '\\r\\n'\n\n    this.css += eol + '/*# sourceMappingURL=' + content + ' */'\n  }\n\n  applyPrevMaps() {\n    for (let prev of this.previous()) {\n      let from = this.toUrl(this.path(prev.file))\n      let root = prev.root || dirname(prev.file)\n      let map\n\n      if (this.mapOpts.sourcesContent === false) {\n        map = new SourceMapConsumer(prev.text)\n        if (map.sourcesContent) {\n          map.sourcesContent = null\n        }\n      } else {\n        map = prev.consumer()\n      }\n\n      this.map.applySourceMap(map, from, this.toUrl(this.path(root)))\n    }\n  }\n\n  clearAnnotation() {\n    if (this.mapOpts.annotation === false) return\n\n    if (this.root) {\n      let node\n      for (let i = this.root.nodes.length - 1; i >= 0; i--) {\n        node = this.root.nodes[i]\n        if (node.type !== 'comment') continue\n        if (node.text.startsWith('# sourceMappingURL=')) {\n          this.root.removeChild(i)\n        }\n      }\n    } else if (this.css) {\n      this.css = this.css.replace(/\\n*\\/\\*#[\\S\\s]*?\\*\\/$/gm, '')\n    }\n  }\n\n  generate() {\n    this.clearAnnotation()\n    if (pathAvailable && sourceMapAvailable && this.isMap()) {\n      return this.generateMap()\n    } else {\n      let result = ''\n      this.stringify(this.root, i => {\n        result += i\n      })\n      return [result]\n    }\n  }\n\n  generateMap() {\n    if (this.root) {\n      this.generateString()\n    } else if (this.previous().length === 1) {\n      let prev = this.previous()[0].consumer()\n      prev.file = this.outputFile()\n      this.map = SourceMapGenerator.fromSourceMap(prev, {\n        ignoreInvalidMapping: true\n      })\n    } else {\n      this.map = new SourceMapGenerator({\n        file: this.outputFile(),\n        ignoreInvalidMapping: true\n      })\n      this.map.addMapping({\n        generated: { column: 0, line: 1 },\n        original: { column: 0, line: 1 },\n        source: this.opts.from\n          ? this.toUrl(this.path(this.opts.from))\n          : '<no source>'\n      })\n    }\n\n    if (this.isSourcesContent()) this.setSourcesContent()\n    if (this.root && this.previous().length > 0) this.applyPrevMaps()\n    if (this.isAnnotation()) this.addAnnotation()\n\n    if (this.isInline()) {\n      return [this.css]\n    } else {\n      return [this.css, this.map]\n    }\n  }\n\n  generateString() {\n    this.css = ''\n    this.map = new SourceMapGenerator({\n      file: this.outputFile(),\n      ignoreInvalidMapping: true\n    })\n\n    let line = 1\n    let column = 1\n\n    let noSource = '<no source>'\n    let mapping = {\n      generated: { column: 0, line: 0 },\n      original: { column: 0, line: 0 },\n      source: ''\n    }\n\n    let last, lines\n    this.stringify(this.root, (str, node, type) => {\n      this.css += str\n\n      if (node && type !== 'end') {\n        mapping.generated.line = line\n        mapping.generated.column = column - 1\n        if (node.source && node.source.start) {\n          mapping.source = this.sourcePath(node)\n          mapping.original.line = node.source.start.line\n          mapping.original.column = node.source.start.column - 1\n          this.map.addMapping(mapping)\n        } else {\n          mapping.source = noSource\n          mapping.original.line = 1\n          mapping.original.column = 0\n          this.map.addMapping(mapping)\n        }\n      }\n\n      lines = str.match(/\\n/g)\n      if (lines) {\n        line += lines.length\n        last = str.lastIndexOf('\\n')\n        column = str.length - last\n      } else {\n        column += str.length\n      }\n\n      if (node && type !== 'start') {\n        let p = node.parent || { raws: {} }\n        let childless =\n          node.type === 'decl' || (node.type === 'atrule' && !node.nodes)\n        if (!childless || node !== p.last || p.raws.semicolon) {\n          if (node.source && node.source.end) {\n            mapping.source = this.sourcePath(node)\n            mapping.original.line = node.source.end.line\n            mapping.original.column = node.source.end.column - 1\n            mapping.generated.line = line\n            mapping.generated.column = column - 2\n            this.map.addMapping(mapping)\n          } else {\n            mapping.source = noSource\n            mapping.original.line = 1\n            mapping.original.column = 0\n            mapping.generated.line = line\n            mapping.generated.column = column - 1\n            this.map.addMapping(mapping)\n          }\n        }\n      }\n    })\n  }\n\n  isAnnotation() {\n    if (this.isInline()) {\n      return true\n    }\n    if (typeof this.mapOpts.annotation !== 'undefined') {\n      return this.mapOpts.annotation\n    }\n    if (this.previous().length) {\n      return this.previous().some(i => i.annotation)\n    }\n    return true\n  }\n\n  isInline() {\n    if (typeof this.mapOpts.inline !== 'undefined') {\n      return this.mapOpts.inline\n    }\n\n    let annotation = this.mapOpts.annotation\n    if (typeof annotation !== 'undefined' && annotation !== true) {\n      return false\n    }\n\n    if (this.previous().length) {\n      return this.previous().some(i => i.inline)\n    }\n    return true\n  }\n\n  isMap() {\n    if (typeof this.opts.map !== 'undefined') {\n      return !!this.opts.map\n    }\n    return this.previous().length > 0\n  }\n\n  isSourcesContent() {\n    if (typeof this.mapOpts.sourcesContent !== 'undefined') {\n      return this.mapOpts.sourcesContent\n    }\n    if (this.previous().length) {\n      return this.previous().some(i => i.withContent())\n    }\n    return true\n  }\n\n  outputFile() {\n    if (this.opts.to) {\n      return this.path(this.opts.to)\n    } else if (this.opts.from) {\n      return this.path(this.opts.from)\n    } else {\n      return 'to.css'\n    }\n  }\n\n  path(file) {\n    if (this.mapOpts.absolute) return file\n    if (file.charCodeAt(0) === 60 /* `<` */) return file\n    if (/^\\w+:\\/\\//.test(file)) return file\n    let cached = this.memoizedPaths.get(file)\n    if (cached) return cached\n\n    let from = this.opts.to ? dirname(this.opts.to) : '.'\n\n    if (typeof this.mapOpts.annotation === 'string') {\n      from = dirname(resolve(from, this.mapOpts.annotation))\n    }\n\n    let path = relative(from, file)\n    this.memoizedPaths.set(file, path)\n\n    return path\n  }\n\n  previous() {\n    if (!this.previousMaps) {\n      this.previousMaps = []\n      if (this.root) {\n        this.root.walk(node => {\n          if (node.source && node.source.input.map) {\n            let map = node.source.input.map\n            if (!this.previousMaps.includes(map)) {\n              this.previousMaps.push(map)\n            }\n          }\n        })\n      } else {\n        let input = new Input(this.originalCSS, this.opts)\n        if (input.map) this.previousMaps.push(input.map)\n      }\n    }\n\n    return this.previousMaps\n  }\n\n  setSourcesContent() {\n    let already = {}\n    if (this.root) {\n      this.root.walk(node => {\n        if (node.source) {\n          let from = node.source.input.from\n          if (from && !already[from]) {\n            already[from] = true\n            let fromUrl = this.usesFileUrls\n              ? this.toFileUrl(from)\n              : this.toUrl(this.path(from))\n            this.map.setSourceContent(fromUrl, node.source.input.css)\n          }\n        }\n      })\n    } else if (this.css) {\n      let from = this.opts.from\n        ? this.toUrl(this.path(this.opts.from))\n        : '<no source>'\n      this.map.setSourceContent(from, this.css)\n    }\n  }\n\n  sourcePath(node) {\n    if (this.mapOpts.from) {\n      return this.toUrl(this.mapOpts.from)\n    } else if (this.usesFileUrls) {\n      return this.toFileUrl(node.source.input.from)\n    } else {\n      return this.toUrl(this.path(node.source.input.from))\n    }\n  }\n\n  toBase64(str) {\n    if (Buffer) {\n      return Buffer.from(str).toString('base64')\n    } else {\n      return window.btoa(unescape(encodeURIComponent(str)))\n    }\n  }\n\n  toFileUrl(path) {\n    let cached = this.memoizedFileURLs.get(path)\n    if (cached) return cached\n\n    if (pathToFileURL) {\n      let fileURL = pathToFileURL(path).toString()\n      this.memoizedFileURLs.set(path, fileURL)\n\n      return fileURL\n    } else {\n      throw new Error(\n        '`map.absolute` option is not available in this PostCSS build'\n      )\n    }\n  }\n\n  toUrl(path) {\n    let cached = this.memoizedURLs.get(path)\n    if (cached) return cached\n\n    if (sep === '\\\\') {\n      path = path.replace(/\\\\/g, '/')\n    }\n\n    let url = encodeURI(path).replace(/[#?]/g, encodeURIComponent)\n    this.memoizedURLs.set(path, url)\n\n    return url\n  }\n}\n\nmodule.exports = MapGenerator\n"],"names":["dirname","relative","resolve","sep","require$$0","SourceMapConsumer","SourceMapGenerator","require$$1","pathToFileURL","require$$2","Input","require$$3","sourceMapAvailable","pathAvailable","MapGenerator","stringify","root","opts","cssString","content","eol","prev","from","map","node","i","result","line","column","noSource","mapping","last","lines","str","type","p","annotation","file","cached","path","input","already","fromUrl","fileURL","url","mapGenerator"],"mappings":";;;;;;AAEA,MAAI,EAAE,SAAAA,GAAS,UAAAC,GAAU,SAAAC,GAAS,KAAAC,EAAG,IAAKC,GACtC,EAAE,mBAAAC,GAAmB,oBAAAC,MAAuBC,GAC5C,EAAE,eAAAC,EAAa,IAAKC,GAEpBC,IAAQC,EAAA,GAERC,IAAqB,GAAQP,KAAqBC,IAClDO,IAAgB,GAAQb,KAAWE,KAAWD,KAAYE;AAAA,EAE9D,MAAMW,EAAa;AAAA,IACjB,YAAYC,GAAWC,GAAMC,GAAMC,GAAW;AAC5C,WAAK,YAAYH,GACjB,KAAK,UAAUE,EAAK,OAAO,CAAA,GAC3B,KAAK,OAAOD,GACZ,KAAK,OAAOC,GACZ,KAAK,MAAMC,GACX,KAAK,cAAcA,GACnB,KAAK,eAAe,CAAC,KAAK,QAAQ,QAAQ,KAAK,QAAQ,UAEvD,KAAK,mBAAmB,oBAAI,IAAG,GAC/B,KAAK,gBAAgB,oBAAI,IAAG,GAC5B,KAAK,eAAe,oBAAI,IAAG;AAAA,IAC/B;AAAA,IAEE,gBAAgB;AACd,UAAIC;AAEJ,MAAI,KAAK,aACPA,IACE,kCAAkC,KAAK,SAAS,KAAK,IAAI,SAAQ,CAAE,IAC5D,OAAO,KAAK,QAAQ,cAAe,WAC5CA,IAAU,KAAK,QAAQ,aACd,OAAO,KAAK,QAAQ,cAAe,aAC5CA,IAAU,KAAK,QAAQ,WAAW,KAAK,KAAK,IAAI,KAAK,IAAI,IAEzDA,IAAU,KAAK,eAAe;AAEhC,UAAIC,IAAM;AAAA;AACV,MAAI,KAAK,IAAI,SAAS;AAAA,CAAM,MAAGA,IAAM;AAAA,IAErC,KAAK,OAAOA,IAAM,0BAA0BD,IAAU;AAAA,IAC1D;AAAA,IAEE,gBAAgB;AACd,eAASE,KAAQ,KAAK,YAAY;AAChC,YAAIC,IAAO,KAAK,MAAM,KAAK,KAAKD,EAAK,IAAI,CAAC,GACtCL,IAAOK,EAAK,QAAQrB,EAAQqB,EAAK,IAAI,GACrCE;AAEJ,QAAI,KAAK,QAAQ,mBAAmB,MAClCA,IAAM,IAAIlB,EAAkBgB,EAAK,IAAI,GACjCE,EAAI,mBACNA,EAAI,iBAAiB,SAGvBA,IAAMF,EAAK,SAAQ,GAGrB,KAAK,IAAI,eAAeE,GAAKD,GAAM,KAAK,MAAM,KAAK,KAAKN,CAAI,CAAC,CAAC;AAAA,MACpE;AAAA,IACA;AAAA,IAEE,kBAAkB;AAChB,UAAI,KAAK,QAAQ,eAAe;AAEhC,YAAI,KAAK,MAAM;AACb,cAAIQ;AACJ,mBAASC,IAAI,KAAK,KAAK,MAAM,SAAS,GAAGA,KAAK,GAAGA;AAE/C,YADAD,IAAO,KAAK,KAAK,MAAMC,CAAC,GACpBD,EAAK,SAAS,aACdA,EAAK,KAAK,WAAW,qBAAqB,KAC5C,KAAK,KAAK,YAAYC,CAAC;AAAA,QAGjC,MAAW,CAAI,KAAK,QACd,KAAK,MAAM,KAAK,IAAI,QAAQ,2BAA2B,EAAE;AAAA,IAE/D;AAAA,IAEE,WAAW;AAET,UADA,KAAK,gBAAe,GAChBZ,KAAiBD,KAAsB,KAAK,MAAK;AACnD,eAAO,KAAK,YAAW;AAClB;AACL,YAAIc,IAAS;AACb,oBAAK,UAAU,KAAK,MAAM,CAAAD,MAAK;AAC7B,UAAAC,KAAUD;AAAA,QAClB,CAAO,GACM,CAACC,CAAM;AAAA,MACpB;AAAA,IACA;AAAA,IAEE,cAAc;AACZ,UAAI,KAAK;AACP,aAAK,eAAc;AAAA,eACV,KAAK,SAAQ,EAAG,WAAW,GAAG;AACvC,YAAIL,IAAO,KAAK,SAAQ,EAAG,CAAC,EAAE,SAAQ;AACtC,QAAAA,EAAK,OAAO,KAAK,WAAU,GAC3B,KAAK,MAAMf,EAAmB,cAAce,GAAM;AAAA,UAChD,sBAAsB;AAAA,SACvB;AAAA,MACP;AACM,aAAK,MAAM,IAAIf,EAAmB;AAAA,UAChC,MAAM,KAAK,WAAU;AAAA,UACrB,sBAAsB;AAAA,SACvB,GACD,KAAK,IAAI,WAAW;AAAA,UAClB,WAAW,EAAE,QAAQ,GAAG,MAAM,EAAC;AAAA,UAC/B,UAAU,EAAE,QAAQ,GAAG,MAAM,EAAC;AAAA,UAC9B,QAAQ,KAAK,KAAK,OACd,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,IACpC;AAAA,SACL;AAOH,aAJI,KAAK,sBAAoB,KAAK,kBAAiB,GAC/C,KAAK,QAAQ,KAAK,SAAQ,EAAG,SAAS,KAAG,KAAK,cAAa,GAC3D,KAAK,kBAAgB,KAAK,cAAa,GAEvC,KAAK,aACA,CAAC,KAAK,GAAG,IAET,CAAC,KAAK,KAAK,KAAK,GAAG;AAAA,IAEhC;AAAA,IAEE,iBAAiB;AACf,WAAK,MAAM,IACX,KAAK,MAAM,IAAIA,EAAmB;AAAA,QAChC,MAAM,KAAK,WAAU;AAAA,QACrB,sBAAsB;AAAA,OACvB;AAED,UAAIqB,IAAO,GACPC,IAAS,GAETC,IAAW,eACXC,IAAU;AAAA,QACZ,WAAW,EAAE,QAAQ,GAAG,MAAM,EAAC;AAAA,QAC/B,UAAU,EAAE,QAAQ,GAAG,MAAM,EAAC;AAAA,QAC9B,QAAQ;AAAA,MACd,GAEQC,GAAMC;AACV,WAAK,UAAU,KAAK,MAAM,CAACC,GAAKT,GAAMU,MAAS;AA4B7C,YA3BA,KAAK,OAAOD,GAERT,KAAQU,MAAS,UACnBJ,EAAQ,UAAU,OAAOH,GACzBG,EAAQ,UAAU,SAASF,IAAS,GAChCJ,EAAK,UAAUA,EAAK,OAAO,SAC7BM,EAAQ,SAAS,KAAK,WAAWN,CAAI,GACrCM,EAAQ,SAAS,OAAON,EAAK,OAAO,MAAM,MAC1CM,EAAQ,SAAS,SAASN,EAAK,OAAO,MAAM,SAAS,GACrD,KAAK,IAAI,WAAWM,CAAO,MAE3BA,EAAQ,SAASD,GACjBC,EAAQ,SAAS,OAAO,GACxBA,EAAQ,SAAS,SAAS,GAC1B,KAAK,IAAI,WAAWA,CAAO,KAI/BE,IAAQC,EAAI,MAAM,KAAK,GACnBD,KACFL,KAAQK,EAAM,QACdD,IAAOE,EAAI,YAAY;AAAA,CAAI,GAC3BL,IAASK,EAAI,SAASF,KAEtBH,KAAUK,EAAI,QAGZT,KAAQU,MAAS,SAAS;AAC5B,cAAIC,IAAIX,EAAK,UAAU,EAAE,MAAM,CAAA,EAAE;AAGjC,WAAI,EADFA,EAAK,SAAS,UAAWA,EAAK,SAAS,YAAY,CAACA,EAAK,UACzCA,MAASW,EAAE,QAAQA,EAAE,KAAK,eACtCX,EAAK,UAAUA,EAAK,OAAO,OAC7BM,EAAQ,SAAS,KAAK,WAAWN,CAAI,GACrCM,EAAQ,SAAS,OAAON,EAAK,OAAO,IAAI,MACxCM,EAAQ,SAAS,SAASN,EAAK,OAAO,IAAI,SAAS,GACnDM,EAAQ,UAAU,OAAOH,GACzBG,EAAQ,UAAU,SAASF,IAAS,GACpC,KAAK,IAAI,WAAWE,CAAO,MAE3BA,EAAQ,SAASD,GACjBC,EAAQ,SAAS,OAAO,GACxBA,EAAQ,SAAS,SAAS,GAC1BA,EAAQ,UAAU,OAAOH,GACzBG,EAAQ,UAAU,SAASF,IAAS,GACpC,KAAK,IAAI,WAAWE,CAAO;AAAA,QAGvC;AAAA,MACA,CAAK;AAAA,IACL;AAAA,IAEE,eAAe;AACb,aAAI,KAAK,aACA,KAEL,OAAO,KAAK,QAAQ,aAAe,MAC9B,KAAK,QAAQ,aAElB,KAAK,SAAQ,EAAG,SACX,KAAK,SAAQ,EAAG,KAAK,CAAAL,MAAKA,EAAE,UAAU,IAExC;AAAA,IACX;AAAA,IAEE,WAAW;AACT,UAAI,OAAO,KAAK,QAAQ,SAAW;AACjC,eAAO,KAAK,QAAQ;AAGtB,UAAIW,IAAa,KAAK,QAAQ;AAC9B,aAAI,OAAOA,IAAe,OAAeA,MAAe,KAC/C,KAGL,KAAK,SAAQ,EAAG,SACX,KAAK,SAAQ,EAAG,KAAK,CAAAX,MAAKA,EAAE,MAAM,IAEpC;AAAA,IACX;AAAA,IAEE,QAAQ;AACN,aAAI,OAAO,KAAK,KAAK,MAAQ,MACpB,CAAC,CAAC,KAAK,KAAK,MAEd,KAAK,SAAQ,EAAG,SAAS;AAAA,IACpC;AAAA,IAEE,mBAAmB;AACjB,aAAI,OAAO,KAAK,QAAQ,iBAAmB,MAClC,KAAK,QAAQ,iBAElB,KAAK,SAAQ,EAAG,SACX,KAAK,SAAQ,EAAG,KAAK,CAAAA,MAAKA,EAAE,YAAW,CAAE,IAE3C;AAAA,IACX;AAAA,IAEE,aAAa;AACX,aAAI,KAAK,KAAK,KACL,KAAK,KAAK,KAAK,KAAK,EAAE,IACpB,KAAK,KAAK,OACZ,KAAK,KAAK,KAAK,KAAK,IAAI,IAExB;AAAA,IAEb;AAAA,IAEE,KAAKY,GAAM;AAGT,UAFI,KAAK,QAAQ,YACbA,EAAK,WAAW,CAAC,MAAM,MACvB,YAAY,KAAKA,CAAI,EAAG,QAAOA;AACnC,UAAIC,IAAS,KAAK,cAAc,IAAID,CAAI;AACxC,UAAIC,EAAQ,QAAOA;AAEnB,UAAIhB,IAAO,KAAK,KAAK,KAAKtB,EAAQ,KAAK,KAAK,EAAE,IAAI;AAElD,MAAI,OAAO,KAAK,QAAQ,cAAe,aACrCsB,IAAOtB,EAAQE,EAAQoB,GAAM,KAAK,QAAQ,UAAU,CAAC;AAGvD,UAAIiB,IAAOtC,EAASqB,GAAMe,CAAI;AAC9B,kBAAK,cAAc,IAAIA,GAAME,CAAI,GAE1BA;AAAA,IACX;AAAA,IAEE,WAAW;AACT,UAAI,CAAC,KAAK;AAER,YADA,KAAK,eAAe,CAAA,GAChB,KAAK;AACP,eAAK,KAAK,KAAK,CAAAf,MAAQ;AACrB,gBAAIA,EAAK,UAAUA,EAAK,OAAO,MAAM,KAAK;AACxC,kBAAID,IAAMC,EAAK,OAAO,MAAM;AAC5B,cAAK,KAAK,aAAa,SAASD,CAAG,KACjC,KAAK,aAAa,KAAKA,CAAG;AAAA,YAExC;AAAA,UACA,CAAS;AAAA,aACI;AACL,cAAIiB,IAAQ,IAAI9B,EAAM,KAAK,aAAa,KAAK,IAAI;AACjD,UAAI8B,EAAM,OAAK,KAAK,aAAa,KAAKA,EAAM,GAAG;AAAA,QACvD;AAGI,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,oBAAoB;AAClB,UAAIC,IAAU,CAAA;AACd,UAAI,KAAK;AACP,aAAK,KAAK,KAAK,CAAAjB,MAAQ;AACrB,cAAIA,EAAK,QAAQ;AACf,gBAAIF,IAAOE,EAAK,OAAO,MAAM;AAC7B,gBAAIF,KAAQ,CAACmB,EAAQnB,CAAI,GAAG;AAC1B,cAAAmB,EAAQnB,CAAI,IAAI;AAChB,kBAAIoB,IAAU,KAAK,eACf,KAAK,UAAUpB,CAAI,IACnB,KAAK,MAAM,KAAK,KAAKA,CAAI,CAAC;AAC9B,mBAAK,IAAI,iBAAiBoB,GAASlB,EAAK,OAAO,MAAM,GAAG;AAAA,YACpE;AAAA,UACA;AAAA,QACA,CAAO;AAAA,eACQ,KAAK,KAAK;AACnB,YAAIF,IAAO,KAAK,KAAK,OACjB,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,IACpC;AACJ,aAAK,IAAI,iBAAiBA,GAAM,KAAK,GAAG;AAAA,MAC9C;AAAA,IACA;AAAA,IAEE,WAAWE,GAAM;AACf,aAAI,KAAK,QAAQ,OACR,KAAK,MAAM,KAAK,QAAQ,IAAI,IAC1B,KAAK,eACP,KAAK,UAAUA,EAAK,OAAO,MAAM,IAAI,IAErC,KAAK,MAAM,KAAK,KAAKA,EAAK,OAAO,MAAM,IAAI,CAAC;AAAA,IAEzD;AAAA,IAEE,SAASS,GAAK;AACZ,aAAI,SACK,OAAO,KAAKA,CAAG,EAAE,SAAS,QAAQ,IAElC,OAAO,KAAK,SAAS,mBAAmBA,CAAG,CAAC,CAAC;AAAA,IAE1D;AAAA,IAEE,UAAUM,GAAM;AACd,UAAID,IAAS,KAAK,iBAAiB,IAAIC,CAAI;AAC3C,UAAID,EAAQ,QAAOA;AAEnB,UAAI9B,GAAe;AACjB,YAAImC,IAAUnC,EAAc+B,CAAI,EAAE,SAAQ;AAC1C,oBAAK,iBAAiB,IAAIA,GAAMI,CAAO,GAEhCA;AAAA,MACb;AACM,cAAM,IAAI;AAAA,UACR;AAAA,QACR;AAAA,IAEA;AAAA,IAEE,MAAMJ,GAAM;AACV,UAAID,IAAS,KAAK,aAAa,IAAIC,CAAI;AACvC,UAAID,EAAQ,QAAOA;AAEnB,MAAInC,MAAQ,SACVoC,IAAOA,EAAK,QAAQ,OAAO,GAAG;AAGhC,UAAIK,IAAM,UAAUL,CAAI,EAAE,QAAQ,SAAS,kBAAkB;AAC7D,kBAAK,aAAa,IAAIA,GAAMK,CAAG,GAExBA;AAAA,IACX;AAAA,EACA;AAEA,SAAAC,IAAiB/B;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es735.js","sources":["../node_modules/domutils/lib/querying.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.filter = filter;\nexports.find = find;\nexports.findOneChild = findOneChild;\nexports.findOne = findOne;\nexports.existsOne = existsOne;\nexports.findAll = findAll;\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}\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 = [Array.isArray(nodes) ? nodes : [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}\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}\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 searchedNodes = Array.isArray(nodes) ? nodes : [nodes];\n    for (var i = 0; i < searchedNodes.length; i++) {\n        var node = searchedNodes[i];\n        if ((0, domhandler_1.isTag)(node) && test(node)) {\n            return node;\n        }\n        if (recurse && (0, domhandler_1.hasChildren)(node) && node.children.length > 0) {\n            var found = findOne(test, node.children, true);\n            if (found)\n                return found;\n        }\n    }\n    return null;\n}\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 (Array.isArray(nodes) ? nodes : [nodes]).some(function (node) {\n        return ((0, domhandler_1.isTag)(node) && test(node)) ||\n            ((0, domhandler_1.hasChildren)(node) && existsOne(test, node.children));\n    });\n}\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 = [Array.isArray(nodes) ? nodes : [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) && test(elem))\n            result.push(elem);\n        if ((0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\n//# sourceMappingURL=querying.js.map"],"names":["querying","filter","find","findOneChild","findOne","existsOne","findAll","domhandler_1","require$$0","test","node","recurse","limit","nodes","result","nodeStack","indexStack","elem","searchedNodes","i","found"],"mappings":";;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,SAAiBC,GACjBD,EAAA,OAAeE,GACfF,EAAA,eAAuBG,GACvBH,EAAA,UAAkBI,GAClBJ,EAAA,YAAoBK,GACpBL,EAAA,UAAkBM;AAClB,MAAIC,IAAeC,gBAAAA,EAAA;AAWnB,WAASP,EAAOQ,GAAMC,GAAMC,GAASC,GAAO;AACxC,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,QACzBV,EAAKO,GAAM,MAAM,QAAQC,CAAI,IAAIA,IAAO,CAACA,CAAI,GAAGC,GAASC,CAAK;AAAA,EACzE;AAWA,WAASV,EAAKO,GAAMI,GAAOF,GAASC,GAAO;AAMvC,aALIE,IAAS,CAAA,GAETC,IAAY,CAAC,MAAM,QAAQF,CAAK,IAAIA,IAAQ,CAACA,CAAK,CAAC,GAEnDG,IAAa,CAAC,CAAC,OACV;AAEL,UAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAEtC,YAAIC,EAAW,WAAW;AACtB,iBAAOF;AAGX,QAAAC,EAAU,MAAK,GACfC,EAAW,MAAK;AAEhB;AAAA,MACZ;AACQ,UAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,UAAIP,EAAKQ,CAAI,MACTH,EAAO,KAAKG,CAAI,GACZ,EAAEL,KAAS;AACX,eAAOE;AAEf,MAAIH,SAAeJ,EAAa,aAAaU,CAAI,KAAKA,EAAK,SAAS,SAAS,MAKzED,EAAW,QAAQ,CAAC,GACpBD,EAAU,QAAQE,EAAK,QAAQ;AAAA,IAE3C;AAAA,EACA;AAUA,WAASd,EAAaM,GAAMI,GAAO;AAC/B,WAAOA,EAAM,KAAKJ,CAAI;AAAA,EAC1B;AAUA,WAASL,EAAQK,GAAMI,GAAOF,GAAS;AACnC,IAAIA,MAAY,WAAUA,IAAU;AAEpC,aADIO,IAAgB,MAAM,QAAQL,CAAK,IAAIA,IAAQ,CAACA,CAAK,GAChDM,IAAI,GAAGA,IAAID,EAAc,QAAQC,KAAK;AAC3C,UAAIT,IAAOQ,EAAcC,CAAC;AAC1B,cAAQZ,EAAa,OAAOG,CAAI,KAAKD,EAAKC,CAAI;AAC1C,eAAOA;AAEX,UAAIC,SAAeJ,EAAa,aAAaG,CAAI,KAAKA,EAAK,SAAS,SAAS,GAAG;AAC5E,YAAIU,IAAQhB,EAAQK,GAAMC,EAAK,UAAU,EAAI;AAC7C,YAAIU;AACA,iBAAOA;AAAA,MACvB;AAAA,IACA;AACI,WAAO;AAAA,EACX;AASA,WAASf,EAAUI,GAAMI,GAAO;AAC5B,YAAQ,MAAM,QAAQA,CAAK,IAAIA,IAAQ,CAACA,CAAK,GAAG,KAAK,SAAUH,GAAM;AACjE,iBAAYH,EAAa,OAAOG,CAAI,KAAKD,EAAKC,CAAI,SACzCH,EAAa,aAAaG,CAAI,KAAKL,EAAUI,GAAMC,EAAK,QAAQ;AAAA,IACjF,CAAK;AAAA,EACL;AAWA,WAASJ,EAAQG,GAAMI,GAAO;AAI1B,aAHIC,IAAS,CAAA,GACTC,IAAY,CAAC,MAAM,QAAQF,CAAK,IAAIA,IAAQ,CAACA,CAAK,CAAC,GACnDG,IAAa,CAAC,CAAC,OACV;AACL,UAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AACtC,YAAIA,EAAU,WAAW;AACrB,iBAAOD;AAGX,QAAAC,EAAU,MAAK,GACfC,EAAW,MAAK;AAEhB;AAAA,MACZ;AACQ,UAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,UAAQT,EAAa,OAAOU,CAAI,KAAKR,EAAKQ,CAAI,KAC1CH,EAAO,KAAKG,CAAI,OACZV,EAAa,aAAaU,CAAI,KAAKA,EAAK,SAAS,SAAS,MAC9DD,EAAW,QAAQ,CAAC,GACpBD,EAAU,QAAQE,EAAK,QAAQ;AAAA,IAE3C;AAAA,EACA;;;","x_google_ignoreList":[0]}

package/dist/index.es736.js

@@ -1,13 +1,76 @@
-var r, i;
-function t() {
-  if (i) return r;
-  i = 1;
-  let e = {};
-  return r = function(n) {
-    e[n] || (e[n] = !0, typeof console < "u" && console.warn && console.warn(n));
-  }, r;
+import { __exports as i } from "./index.es762.js";
+import { __require as m } from "./index.es687.js";
+import { __require as E } from "./index.es735.js";
+var g;
+function h() {
+  if (g) return i;
+  g = 1, Object.defineProperty(i, "__esModule", { value: !0 }), i.testElement = p, i.getElements = _, i.getElementById = v, i.getElementsByTagName = d, i.getElementsByClassName = l, i.getElementsByTagType = T;
+  var u = /* @__PURE__ */ m(), f = /* @__PURE__ */ E(), o = {
+    tag_name: function(e) {
+      return typeof e == "function" ? function(t) {
+        return (0, u.isTag)(t) && e(t.name);
+      } : e === "*" ? u.isTag : function(t) {
+        return (0, u.isTag)(t) && t.name === e;
+      };
+    },
+    tag_type: function(e) {
+      return typeof e == "function" ? function(t) {
+        return e(t.type);
+      } : function(t) {
+        return t.type === e;
+      };
+    },
+    tag_contains: function(e) {
+      return typeof e == "function" ? function(t) {
+        return (0, u.isText)(t) && e(t.data);
+      } : function(t) {
+        return (0, u.isText)(t) && t.data === e;
+      };
+    }
+  };
+  function a(e, t) {
+    return typeof t == "function" ? function(n) {
+      return (0, u.isTag)(n) && t(n.attribs[e]);
+    } : function(n) {
+      return (0, u.isTag)(n) && n.attribs[e] === t;
+    };
+  }
+  function y(e, t) {
+    return function(n) {
+      return e(n) || t(n);
+    };
+  }
+  function c(e) {
+    var t = Object.keys(e).map(function(n) {
+      var r = e[n];
+      return Object.prototype.hasOwnProperty.call(o, n) ? o[n](r) : a(n, r);
+    });
+    return t.length === 0 ? null : t.reduce(y);
+  }
+  function p(e, t) {
+    var n = c(e);
+    return n ? n(t) : !0;
+  }
+  function _(e, t, n, r) {
+    r === void 0 && (r = 1 / 0);
+    var s = c(e);
+    return s ? (0, f.filter)(s, t, n, r) : [];
+  }
+  function v(e, t, n) {
+    return n === void 0 && (n = !0), Array.isArray(t) || (t = [t]), (0, f.findOne)(a("id", e), t, n);
+  }
+  function d(e, t, n, r) {
+    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(o.tag_name(e), t, n, r);
+  }
+  function l(e, t, n, r) {
+    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(a("class", e), t, n, r);
+  }
+  function T(e, t, n, r) {
+    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(o.tag_type(e), t, n, r);
+  }
+  return i;
 }
 export {
-  t as __require
+  h as __require
 };
 //# sourceMappingURL=index.es736.js.map

package/dist/index.es736.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es736.js","sources":["../node_modules/postcss/lib/warn-once.js"],"sourcesContent":["/* eslint-disable no-console */\n'use strict'\n\nlet printed = {}\n\nmodule.exports = function warnOnce(message) {\n  if (printed[message]) return\n  printed[message] = true\n\n  if (typeof console !== 'undefined' && console.warn) {\n    console.warn(message)\n  }\n}\n"],"names":["printed","warnOnce","message"],"mappings":";;;;AAGA,MAAIA,IAAU,CAAA;AAEd,SAAAC,IAAiB,SAAkBC,GAAS;AAC1C,IAAIF,EAAQE,CAAO,MACnBF,EAAQE,CAAO,IAAI,IAEf,OAAO,UAAY,OAAe,QAAQ,QAC5C,QAAQ,KAAKA,CAAO;AAAA,EAExB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es736.js","sources":["../node_modules/domutils/lib/legacy.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.testElement = testElement;\nexports.getElements = getElements;\nexports.getElementById = getElementById;\nexports.getElementsByTagName = getElementsByTagName;\nexports.getElementsByClassName = getElementsByClassName;\nexports.getElementsByTagType = getElementsByTagType;\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}\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}\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}\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}\n/**\n * Returns all nodes with the supplied `className`.\n *\n * @category Legacy Query Functions\n * @param className Class 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 `className`.\n */\nfunction getElementsByClassName(className, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(getAttribCheck(\"class\", className), nodes, recurse, limit);\n}\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}\n//# sourceMappingURL=legacy.js.map"],"names":["legacy","testElement","getElements","getElementById","getElementsByTagName","getElementsByClassName","getElementsByTagType","domhandler_1","require$$0","querying_js_1","require$$1","Checks","name","elem","type","data","getAttribCheck","attrib","value","combineFuncs","a","b","compileTest","options","funcs","key","node","test","nodes","recurse","limit","id","tagName","className"],"mappings":";;;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,cAAsBC,GACtBD,EAAA,cAAsBE,GACtBF,EAAA,iBAAyBG,GACzBH,EAAA,uBAA+BI,GAC/BJ,EAAA,yBAAiCK,GACjCL,EAAA,uBAA+BM;AAC/B,MAAIC,IAAeC,gBAAAA,EAAA,GACfC,IAAgBC,gBAAAA,EAAA,GAIhBC,IAAS;AAAA,IACT,UAAU,SAAUC,GAAM;AACtB,aAAI,OAAOA,KAAS,aACT,SAAUC,GAAM;AAAE,mBAAWN,EAAa,OAAOM,CAAI,KAAKD,EAAKC,EAAK,IAAI;AAAA,MAAE,IAE5ED,MAAS,MACPL,EAAa,QAEjB,SAAUM,GAAM;AAAE,mBAAWN,EAAa,OAAOM,CAAI,KAAKA,EAAK,SAASD;AAAA,MAAK;AAAA,IAC5F;AAAA,IACI,UAAU,SAAUE,GAAM;AACtB,aAAI,OAAOA,KAAS,aACT,SAAUD,GAAM;AAAE,eAAOC,EAAKD,EAAK,IAAI;AAAA,MAAE,IAE7C,SAAUA,GAAM;AAAE,eAAOA,EAAK,SAASC;AAAA,MAAK;AAAA,IAC3D;AAAA,IACI,cAAc,SAAUC,GAAM;AAC1B,aAAI,OAAOA,KAAS,aACT,SAAUF,GAAM;AAAE,mBAAWN,EAAa,QAAQM,CAAI,KAAKE,EAAKF,EAAK,IAAI;AAAA,MAAE,IAE/E,SAAUA,GAAM;AAAE,mBAAWN,EAAa,QAAQM,CAAI,KAAKA,EAAK,SAASE;AAAA,MAAK;AAAA,IAC7F;AAAA;AAWA,WAASC,EAAeC,GAAQC,GAAO;AACnC,WAAI,OAAOA,KAAU,aACV,SAAUL,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKK,EAAML,EAAK,QAAQI,CAAM,CAAC;AAAA,IAAE,IAE1F,SAAUJ,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKA,EAAK,QAAQI,CAAM,MAAMC;AAAA,IAAM;AAAA,EACpG;AAUA,WAASC,EAAaC,GAAGC,GAAG;AACxB,WAAO,SAAUR,GAAM;AAAE,aAAOO,EAAEP,CAAI,KAAKQ,EAAER,CAAI;AAAA,IAAE;AAAA,EACvD;AASA,WAASS,EAAYC,GAAS;AAC1B,QAAIC,IAAQ,OAAO,KAAKD,CAAO,EAAE,IAAI,SAAUE,GAAK;AAChD,UAAIP,IAAQK,EAAQE,CAAG;AACvB,aAAO,OAAO,UAAU,eAAe,KAAKd,GAAQc,CAAG,IACjDd,EAAOc,CAAG,EAAEP,CAAK,IACjBF,EAAeS,GAAKP,CAAK;AAAA,IACvC,CAAK;AACD,WAAOM,EAAM,WAAW,IAAI,OAAOA,EAAM,OAAOL,CAAY;AAAA,EAChE;AASA,WAASlB,EAAYsB,GAASG,GAAM;AAChC,QAAIC,IAAOL,EAAYC,CAAO;AAC9B,WAAOI,IAAOA,EAAKD,CAAI,IAAI;AAAA,EAC/B;AAWA,WAASxB,EAAYqB,GAASK,GAAOC,GAASC,GAAO;AACjD,IAAIA,MAAU,WAAUA,IAAQ;AAChC,QAAIH,IAAOL,EAAYC,CAAO;AAC9B,WAAOI,QAAWlB,EAAc,QAAQkB,GAAMC,GAAOC,GAASC,CAAK,IAAI,CAAA;AAAA,EAC3E;AAUA,WAAS3B,EAAe4B,GAAIH,GAAOC,GAAS;AACxC,WAAIA,MAAY,WAAUA,IAAU,KAC/B,MAAM,QAAQD,CAAK,MACpBA,IAAQ,CAACA,CAAK,QACPnB,EAAc,SAASO,EAAe,MAAMe,CAAE,GAAGH,GAAOC,CAAO;AAAA,EAC9E;AAWA,WAASzB,EAAqB4B,GAASJ,GAAOC,GAASC,GAAO;AAC1D,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,YACrBrB,EAAc,QAAQE,EAAO,SAAYqB,CAAO,GAAGJ,GAAOC,GAASC,CAAK;AAAA,EACvF;AAWA,WAASzB,EAAuB4B,GAAWL,GAAOC,GAASC,GAAO;AAC9D,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,YACrBrB,EAAc,QAAQO,EAAe,SAASiB,CAAS,GAAGL,GAAOC,GAASC,CAAK;AAAA,EAC9F;AAWA,WAASxB,EAAqBQ,GAAMc,GAAOC,GAASC,GAAO;AACvD,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,YACrBrB,EAAc,QAAQE,EAAO,SAAYG,CAAI,GAAGc,GAAOC,GAASC,CAAK;AAAA,EACpF;;;","x_google_ignoreList":[0]}

package/dist/index.es737.js

@@ -1,195 +1,53 @@
-var u, o;
+import { __exports as N } from "./index.es763.js";
+import { __require as S } from "./index.es687.js";
+var I;
 function b() {
-  if (o) return u;
-  o = 1;
-  const w = {
-    after: `
-`,
-    beforeClose: `
-`,
-    beforeComment: `
-`,
-    beforeDecl: `
-`,
-    beforeOpen: " ",
-    beforeRule: `
-`,
-    colon: ": ",
-    commentLeft: " ",
-    commentRight: " ",
-    emptyBody: "",
-    indent: "    ",
-    semicolon: !1
-  };
-  function p(s) {
-    return s[0].toUpperCase() + s.slice(1);
-  }
-  class n {
-    constructor(e) {
-      this.builder = e;
-    }
-    atrule(e, t) {
-      let r = "@" + e.name, l = e.params ? this.rawValue(e, "params") : "";
-      if (typeof e.raws.afterName < "u" ? r += e.raws.afterName : l && (r += " "), e.nodes)
-        this.block(e, r + l);
-      else {
-        let a = (e.raws.between || "") + (t ? ";" : "");
-        this.builder(r + l + a, e);
-      }
-    }
-    beforeAfter(e, t) {
-      let r;
-      e.type === "decl" ? r = this.raw(e, null, "beforeDecl") : e.type === "comment" ? r = this.raw(e, null, "beforeComment") : t === "before" ? r = this.raw(e, null, "beforeRule") : r = this.raw(e, null, "beforeClose");
-      let l = e.parent, a = 0;
-      for (; l && l.type !== "root"; )
-        a += 1, l = l.parent;
-      if (r.includes(`
-`)) {
-        let f = this.raw(e, null, "indent");
-        if (f.length)
-          for (let i = 0; i < a; i++) r += f;
-      }
-      return r;
-    }
-    block(e, t) {
-      let r = this.raw(e, "between", "beforeOpen");
-      this.builder(t + r + "{", e, "start");
-      let l;
-      e.nodes && e.nodes.length ? (this.body(e), l = this.raw(e, "after")) : l = this.raw(e, "after", "emptyBody"), l && this.builder(l), this.builder("}", e, "end");
-    }
-    body(e) {
-      let t = e.nodes.length - 1;
-      for (; t > 0 && e.nodes[t].type === "comment"; )
-        t -= 1;
-      let r = this.raw(e, "semicolon");
-      for (let l = 0; l < e.nodes.length; l++) {
-        let a = e.nodes[l], f = this.raw(a, "before");
-        f && this.builder(f), this.stringify(a, t !== l || r);
+  if (I) return N;
+  I = 1, Object.defineProperty(N, "__esModule", { value: !0 }), N.DocumentPosition = void 0, N.removeSubsets = h, N.compareDocumentPosition = O, N.uniqueSort = C;
+  var l = /* @__PURE__ */ S();
+  function h(r) {
+    for (var e = r.length; --e >= 0; ) {
+      var t = r[e];
+      if (e > 0 && r.lastIndexOf(t, e - 1) >= 0) {
+        r.splice(e, 1);
+        continue;
       }
-    }
-    comment(e) {
-      let t = this.raw(e, "left", "commentLeft"), r = this.raw(e, "right", "commentRight");
-      this.builder("/*" + t + e.text + r + "*/", e);
-    }
-    decl(e, t) {
-      let r = this.raw(e, "between", "colon"), l = e.prop + r + this.rawValue(e, "value");
-      e.important && (l += e.raws.important || " !important"), t && (l += ";"), this.builder(l, e);
-    }
-    document(e) {
-      this.body(e);
-    }
-    raw(e, t, r) {
-      let l;
-      if (r || (r = t), t && (l = e.raws[t], typeof l < "u"))
-        return l;
-      let a = e.parent;
-      if (r === "before" && (!a || a.type === "root" && a.first === e || a && a.type === "document"))
-        return "";
-      if (!a) return w[r];
-      let f = e.root();
-      if (f.rawCache || (f.rawCache = {}), typeof f.rawCache[r] < "u")
-        return f.rawCache[r];
-      if (r === "before" || r === "after")
-        return this.beforeAfter(e, r);
-      {
-        let i = "raw" + p(r);
-        this[i] ? l = this[i](f, e) : f.walk((h) => {
-          if (l = h.raws[t], typeof l < "u") return !1;
-        });
-      }
-      return typeof l > "u" && (l = w[r]), f.rawCache[r] = l, l;
-    }
-    rawBeforeClose(e) {
-      let t;
-      return e.walk((r) => {
-        if (r.nodes && r.nodes.length > 0 && typeof r.raws.after < "u")
-          return t = r.raws.after, t.includes(`
-`) && (t = t.replace(/[^\n]+$/, "")), !1;
-      }), t && (t = t.replace(/\S/g, "")), t;
-    }
-    rawBeforeComment(e, t) {
-      let r;
-      return e.walkComments((l) => {
-        if (typeof l.raws.before < "u")
-          return r = l.raws.before, r.includes(`
-`) && (r = r.replace(/[^\n]+$/, "")), !1;
-      }), typeof r > "u" ? r = this.raw(t, null, "beforeDecl") : r && (r = r.replace(/\S/g, "")), r;
-    }
-    rawBeforeDecl(e, t) {
-      let r;
-      return e.walkDecls((l) => {
-        if (typeof l.raws.before < "u")
-          return r = l.raws.before, r.includes(`
-`) && (r = r.replace(/[^\n]+$/, "")), !1;
-      }), typeof r > "u" ? r = this.raw(t, null, "beforeRule") : r && (r = r.replace(/\S/g, "")), r;
-    }
-    rawBeforeOpen(e) {
-      let t;
-      return e.walk((r) => {
-        if (r.type !== "decl" && (t = r.raws.between, typeof t < "u"))
-          return !1;
-      }), t;
-    }
-    rawBeforeRule(e) {
-      let t;
-      return e.walk((r) => {
-        if (r.nodes && (r.parent !== e || e.first !== r) && typeof r.raws.before < "u")
-          return t = r.raws.before, t.includes(`
-`) && (t = t.replace(/[^\n]+$/, "")), !1;
-      }), t && (t = t.replace(/\S/g, "")), t;
-    }
-    rawColon(e) {
-      let t;
-      return e.walkDecls((r) => {
-        if (typeof r.raws.between < "u")
-          return t = r.raws.between.replace(/[^\s:]/g, ""), !1;
-      }), t;
-    }
-    rawEmptyBody(e) {
-      let t;
-      return e.walk((r) => {
-        if (r.nodes && r.nodes.length === 0 && (t = r.raws.after, typeof t < "u"))
-          return !1;
-      }), t;
-    }
-    rawIndent(e) {
-      if (e.raws.indent) return e.raws.indent;
-      let t;
-      return e.walk((r) => {
-        let l = r.parent;
-        if (l && l !== e && l.parent && l.parent === e && typeof r.raws.before < "u") {
-          let a = r.raws.before.split(`
-`);
-          return t = a[a.length - 1], t = t.replace(/\S/g, ""), !1;
+      for (var i = t.parent; i; i = i.parent)
+        if (r.includes(i)) {
+          r.splice(e, 1);
+          break;
         }
-      }), t;
-    }
-    rawSemicolon(e) {
-      let t;
-      return e.walk((r) => {
-        if (r.nodes && r.nodes.length && r.last.type === "decl" && (t = r.raws.semicolon, typeof t < "u"))
-          return !1;
-      }), t;
-    }
-    rawValue(e, t) {
-      let r = e[t], l = e.raws[t];
-      return l && l.value === r ? l.raw : r;
-    }
-    root(e) {
-      this.body(e), e.raws.after && this.builder(e.raws.after);
-    }
-    rule(e) {
-      this.block(e, this.rawValue(e, "selector")), e.raws.ownSemicolon && this.builder(e.raws.ownSemicolon, e, "end");
-    }
-    stringify(e, t) {
-      if (!this[e.type])
-        throw new Error(
-          "Unknown AST node type " + e.type + ". Maybe you need to change PostCSS stringifier."
-        );
-      this[e.type](e, t);
     }
+    return r;
+  }
+  var a;
+  (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";
+  })(a || (N.DocumentPosition = a = {}));
+  function O(r, e) {
+    var t = [], i = [];
+    if (r === e)
+      return 0;
+    for (var u = (0, l.hasChildren)(r) ? r : r.parent; u; )
+      t.unshift(u), u = u.parent;
+    for (u = (0, l.hasChildren)(e) ? e : e.parent; u; )
+      i.unshift(u), u = u.parent;
+    for (var E = Math.min(t.length, i.length), n = 0; n < E && t[n] === i[n]; )
+      n++;
+    if (n === 0)
+      return a.DISCONNECTED;
+    var f = t[n - 1], v = f.children, p = t[n], s = i[n];
+    return v.indexOf(p) > v.indexOf(s) ? f === e ? a.FOLLOWING | a.CONTAINED_BY : a.FOLLOWING : f === r ? a.PRECEDING | a.CONTAINS : a.PRECEDING;
+  }
+  function C(r) {
+    return r = r.filter(function(e, t, i) {
+      return !i.includes(e, t + 1);
+    }), r.sort(function(e, t) {
+      var i = O(e, t);
+      return i & a.PRECEDING ? -1 : i & a.FOLLOWING ? 1 : 0;
+    }), r;
   }
-  return u = n, n.default = n, u;
+  return N;
 }
 export {
   b as __require

package/dist/index.es737.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es737.js","sources":["../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,QAAMA,IAAc;AAAA,IAClB,OAAO;AAAA;AAAA,IACP,aAAa;AAAA;AAAA,IACb,eAAe;AAAA;AAAA,IACf,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,OAAO;AAAA,IACP,aAAa;AAAA,IACb,cAAc;AAAA,IACd,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,WAAW;AAAA,EACb;AAEA,WAASC,EAAWC,GAAK;AACvB,WAAOA,EAAI,CAAC,EAAE,YAAW,IAAKA,EAAI,MAAM,CAAC;AAAA,EAC3C;AAAA,EAEA,MAAMC,EAAY;AAAA,IAChB,YAAYC,GAAS;AACnB,WAAK,UAAUA;AAAA,IACnB;AAAA,IAEE,OAAOC,GAAMC,GAAW;AACtB,UAAIC,IAAO,MAAMF,EAAK,MAClBG,IAASH,EAAK,SAAS,KAAK,SAASA,GAAM,QAAQ,IAAI;AAQ3D,UANI,OAAOA,EAAK,KAAK,YAAc,MACjCE,KAAQF,EAAK,KAAK,YACTG,MACTD,KAAQ,MAGNF,EAAK;AACP,aAAK,MAAMA,GAAME,IAAOC,CAAM;AAAA,WACzB;AACL,YAAIC,KAAOJ,EAAK,KAAK,WAAW,OAAOC,IAAY,MAAM;AACzD,aAAK,QAAQC,IAAOC,IAASC,GAAKJ,CAAI;AAAA,MAC5C;AAAA,IACA;AAAA,IAEE,YAAYA,GAAMK,GAAQ;AACxB,UAAIC;AACJ,MAAIN,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,UAAIO,IAAMP,EAAK,QACXQ,IAAQ;AACZ,aAAOD,KAAOA,EAAI,SAAS;AACzB,QAAAC,KAAS,GACTD,IAAMA,EAAI;AAGZ,UAAID,EAAM,SAAS;AAAA,CAAI,GAAG;AACxB,YAAIG,IAAS,KAAK,IAAIT,GAAM,MAAM,QAAQ;AAC1C,YAAIS,EAAO;AACT,mBAASC,IAAO,GAAGA,IAAOF,GAAOE,IAAQ,CAAAJ,KAASG;AAAA,MAE1D;AAEI,aAAOH;AAAA,IACX;AAAA,IAEE,MAAMN,GAAMW,GAAO;AACjB,UAAIC,IAAU,KAAK,IAAIZ,GAAM,WAAW,YAAY;AACpD,WAAK,QAAQW,IAAQC,IAAU,KAAKZ,GAAM,OAAO;AAEjD,UAAIa;AACJ,MAAIb,EAAK,SAASA,EAAK,MAAM,UAC3B,KAAK,KAAKA,CAAI,GACda,IAAQ,KAAK,IAAIb,GAAM,OAAO,KAE9Ba,IAAQ,KAAK,IAAIb,GAAM,SAAS,WAAW,GAGzCa,KAAO,KAAK,QAAQA,CAAK,GAC7B,KAAK,QAAQ,KAAKb,GAAM,KAAK;AAAA,IACjC;AAAA,IAEE,KAAKA,GAAM;AACT,UAAIc,IAAOd,EAAK,MAAM,SAAS;AAC/B,aAAOc,IAAO,KACRd,EAAK,MAAMc,CAAI,EAAE,SAAS;AAC9B,QAAAA,KAAQ;AAGV,UAAIb,IAAY,KAAK,IAAID,GAAM,WAAW;AAC1C,eAASe,IAAI,GAAGA,IAAIf,EAAK,MAAM,QAAQe,KAAK;AAC1C,YAAIC,IAAQhB,EAAK,MAAMe,CAAC,GACpBE,IAAS,KAAK,IAAID,GAAO,QAAQ;AACrC,QAAIC,KAAQ,KAAK,QAAQA,CAAM,GAC/B,KAAK,UAAUD,GAAOF,MAASC,KAAKd,CAAS;AAAA,MACnD;AAAA,IACA;AAAA,IAEE,QAAQD,GAAM;AACZ,UAAIkB,IAAO,KAAK,IAAIlB,GAAM,QAAQ,aAAa,GAC3CmB,IAAQ,KAAK,IAAInB,GAAM,SAAS,cAAc;AAClD,WAAK,QAAQ,OAAOkB,IAAOlB,EAAK,OAAOmB,IAAQ,MAAMnB,CAAI;AAAA,IAC7D;AAAA,IAEE,KAAKA,GAAMC,GAAW;AACpB,UAAIW,IAAU,KAAK,IAAIZ,GAAM,WAAW,OAAO,GAC3CoB,IAASpB,EAAK,OAAOY,IAAU,KAAK,SAASZ,GAAM,OAAO;AAE9D,MAAIA,EAAK,cACPoB,KAAUpB,EAAK,KAAK,aAAa,gBAG/BC,MAAWmB,KAAU,MACzB,KAAK,QAAQA,GAAQpB,CAAI;AAAA,IAC7B;AAAA,IAEE,SAASA,GAAM;AACb,WAAK,KAAKA,CAAI;AAAA,IAClB;AAAA,IAEE,IAAIA,GAAMqB,GAAKhB,GAAQ;AACrB,UAAIC;AAIJ,UAHKD,MAAQA,IAASgB,IAGlBA,MACFf,IAAQN,EAAK,KAAKqB,CAAG,GACjB,OAAOf,IAAU;AAAa,eAAOA;AAG3C,UAAIgB,IAAStB,EAAK;AAElB,UAAIK,MAAW,aAET,CAACiB,KAAWA,EAAO,SAAS,UAAUA,EAAO,UAAUtB,KAKvDsB,KAAUA,EAAO,SAAS;AAC5B,eAAO;AAKX,UAAI,CAACA,EAAQ,QAAO3B,EAAYU,CAAM;AAGtC,UAAIkB,IAAOvB,EAAK,KAAI;AAEpB,UADKuB,EAAK,aAAUA,EAAK,WAAW,CAAA,IAChC,OAAOA,EAAK,SAASlB,CAAM,IAAM;AACnC,eAAOkB,EAAK,SAASlB,CAAM;AAG7B,UAAIA,MAAW,YAAYA,MAAW;AACpC,eAAO,KAAK,YAAYL,GAAMK,CAAM;AAC/B;AACL,YAAImB,IAAS,QAAQ5B,EAAWS,CAAM;AACtC,QAAI,KAAKmB,CAAM,IACblB,IAAQ,KAAKkB,CAAM,EAAED,GAAMvB,CAAI,IAE/BuB,EAAK,KAAK,CAAAR,MAAK;AAEb,cADAT,IAAQS,EAAE,KAAKM,CAAG,GACd,OAAOf,IAAU,IAAa,QAAO;AAAA,QACnD,CAAS;AAAA,MAET;AAEI,aAAI,OAAOA,IAAU,QAAaA,IAAQX,EAAYU,CAAM,IAE5DkB,EAAK,SAASlB,CAAM,IAAIC,GACjBA;AAAA,IACX;AAAA,IAEE,eAAeiB,GAAM;AACnB,UAAIjB;AACJ,aAAAiB,EAAK,KAAK,CAAAR,MAAK;AACb,YAAIA,EAAE,SAASA,EAAE,MAAM,SAAS,KAC1B,OAAOA,EAAE,KAAK,QAAU;AAC1B,iBAAAT,IAAQS,EAAE,KAAK,OACXT,EAAM,SAAS;AAAA,CAAI,MACrBA,IAAQA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,MAGjB,CAAK,GACGA,MAAOA,IAAQA,EAAM,QAAQ,OAAO,EAAE,IACnCA;AAAA,IACX;AAAA,IAEE,iBAAiBiB,GAAMvB,GAAM;AAC3B,UAAIM;AACJ,aAAAiB,EAAK,aAAa,CAAAR,MAAK;AACrB,YAAI,OAAOA,EAAE,KAAK,SAAW;AAC3B,iBAAAT,IAAQS,EAAE,KAAK,QACXT,EAAM,SAAS;AAAA,CAAI,MACrBA,IAAQA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,MAEf,CAAK,GACG,OAAOA,IAAU,MACnBA,IAAQ,KAAK,IAAIN,GAAM,MAAM,YAAY,IAChCM,MACTA,IAAQA,EAAM,QAAQ,OAAO,EAAE,IAE1BA;AAAA,IACX;AAAA,IAEE,cAAciB,GAAMvB,GAAM;AACxB,UAAIM;AACJ,aAAAiB,EAAK,UAAU,CAAAR,MAAK;AAClB,YAAI,OAAOA,EAAE,KAAK,SAAW;AAC3B,iBAAAT,IAAQS,EAAE,KAAK,QACXT,EAAM,SAAS;AAAA,CAAI,MACrBA,IAAQA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,MAEf,CAAK,GACG,OAAOA,IAAU,MACnBA,IAAQ,KAAK,IAAIN,GAAM,MAAM,YAAY,IAChCM,MACTA,IAAQA,EAAM,QAAQ,OAAO,EAAE,IAE1BA;AAAA,IACX;AAAA,IAEE,cAAciB,GAAM;AAClB,UAAIjB;AACJ,aAAAiB,EAAK,KAAK,CAAAR,MAAK;AACb,YAAIA,EAAE,SAAS,WACbT,IAAQS,EAAE,KAAK,SACX,OAAOT,IAAU;AAAa,iBAAO;AAAA,MAEjD,CAAK,GACMA;AAAA,IACX;AAAA,IAEE,cAAciB,GAAM;AAClB,UAAIjB;AACJ,aAAAiB,EAAK,KAAK,CAAAR,MAAK;AACb,YAAIA,EAAE,UAAUA,EAAE,WAAWQ,KAAQA,EAAK,UAAUR,MAC9C,OAAOA,EAAE,KAAK,SAAW;AAC3B,iBAAAT,IAAQS,EAAE,KAAK,QACXT,EAAM,SAAS;AAAA,CAAI,MACrBA,IAAQA,EAAM,QAAQ,WAAW,EAAE,IAE9B;AAAA,MAGjB,CAAK,GACGA,MAAOA,IAAQA,EAAM,QAAQ,OAAO,EAAE,IACnCA;AAAA,IACX;AAAA,IAEE,SAASiB,GAAM;AACb,UAAIjB;AACJ,aAAAiB,EAAK,UAAU,CAAAR,MAAK;AAClB,YAAI,OAAOA,EAAE,KAAK,UAAY;AAC5B,iBAAAT,IAAQS,EAAE,KAAK,QAAQ,QAAQ,WAAW,EAAE,GACrC;AAAA,MAEf,CAAK,GACMT;AAAA,IACX;AAAA,IAEE,aAAaiB,GAAM;AACjB,UAAIjB;AACJ,aAAAiB,EAAK,KAAK,CAAAR,MAAK;AACb,YAAIA,EAAE,SAASA,EAAE,MAAM,WAAW,MAChCT,IAAQS,EAAE,KAAK,OACX,OAAOT,IAAU;AAAa,iBAAO;AAAA,MAEjD,CAAK,GACMA;AAAA,IACX;AAAA,IAEE,UAAUiB,GAAM;AACd,UAAIA,EAAK,KAAK,OAAQ,QAAOA,EAAK,KAAK;AACvC,UAAIjB;AACJ,aAAAiB,EAAK,KAAK,CAAAR,MAAK;AACb,YAAIU,IAAIV,EAAE;AACV,YAAIU,KAAKA,MAAMF,KAAQE,EAAE,UAAUA,EAAE,WAAWF,KAC1C,OAAOR,EAAE,KAAK,SAAW,KAAa;AACxC,cAAIW,IAAQX,EAAE,KAAK,OAAO,MAAM;AAAA,CAAI;AACpC,iBAAAT,IAAQoB,EAAMA,EAAM,SAAS,CAAC,GAC9BpB,IAAQA,EAAM,QAAQ,OAAO,EAAE,GACxB;AAAA,QACjB;AAAA,MAEA,CAAK,GACMA;AAAA,IACX;AAAA,IAEE,aAAaiB,GAAM;AACjB,UAAIjB;AACJ,aAAAiB,EAAK,KAAK,CAAAR,MAAK;AACb,YAAIA,EAAE,SAASA,EAAE,MAAM,UAAUA,EAAE,KAAK,SAAS,WAC/CT,IAAQS,EAAE,KAAK,WACX,OAAOT,IAAU;AAAa,iBAAO;AAAA,MAEjD,CAAK,GACMA;AAAA,IACX;AAAA,IAEE,SAASN,GAAM2B,GAAM;AACnB,UAAIrB,IAAQN,EAAK2B,CAAI,GACjBC,IAAM5B,EAAK,KAAK2B,CAAI;AACxB,aAAIC,KAAOA,EAAI,UAAUtB,IAChBsB,EAAI,MAGNtB;AAAA,IACX;AAAA,IAEE,KAAKN,GAAM;AACT,WAAK,KAAKA,CAAI,GACVA,EAAK,KAAK,SAAO,KAAK,QAAQA,EAAK,KAAK,KAAK;AAAA,IACrD;AAAA,IAEE,KAAKA,GAAM;AACT,WAAK,MAAMA,GAAM,KAAK,SAASA,GAAM,UAAU,CAAC,GAC5CA,EAAK,KAAK,gBACZ,KAAK,QAAQA,EAAK,KAAK,cAAcA,GAAM,KAAK;AAAA,IAEtD;AAAA,IAEE,UAAUA,GAAMC,GAAW;AAEzB,UAAI,CAAC,KAAKD,EAAK,IAAI;AACjB,cAAM,IAAI;AAAA,UACR,2BACEA,EAAK,OACL;AAAA,QAEV;AAGI,WAAKA,EAAK,IAAI,EAAEA,GAAMC,CAAS;AAAA,IACnC;AAAA,EACA;AAEA,SAAA4B,IAAiB/B,GACjBA,EAAY,UAAUA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es737.js","sources":["../node_modules/domutils/lib/helpers.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DocumentPosition = void 0;\nexports.removeSubsets = removeSubsets;\nexports.compareDocumentPosition = compareDocumentPosition;\nexports.uniqueSort = uniqueSort;\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}\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 = 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}\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}\n//# sourceMappingURL=helpers.js.map"],"names":["helpers","removeSubsets","compareDocumentPosition","uniqueSort","domhandler_1","require$$0","nodes","idx","node","ancestor","DocumentPosition","nodeA","nodeB","aParents","bParents","current","maxIdx","sharedParent","siblings","aSibling","bSibling","i","arr","a","b","relative"],"mappings":";;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,mBAA2B,QAC3BA,EAAA,gBAAwBC,GACxBD,EAAA,0BAAkCE,GAClCF,EAAA,aAAqBG;AACrB,MAAIC,IAAeC,gBAAAA,EAAA;AASnB,WAASJ,EAAcK,GAAO;AAM1B,aALIC,IAAMD,EAAM,QAKT,EAAEC,KAAO,KAAG;AACf,UAAIC,IAAOF,EAAMC,CAAG;AAMpB,UAAIA,IAAM,KAAKD,EAAM,YAAYE,GAAMD,IAAM,CAAC,KAAK,GAAG;AAClD,QAAAD,EAAM,OAAOC,GAAK,CAAC;AACnB;AAAA,MACZ;AACQ,eAASE,IAAWD,EAAK,QAAQC,GAAUA,IAAWA,EAAS;AAC3D,YAAIH,EAAM,SAASG,CAAQ,GAAG;AAC1B,UAAAH,EAAM,OAAOC,GAAK,CAAC;AACnB;AAAA,QAChB;AAAA,IAEA;AACI,WAAOD;AAAA,EACX;AAKA,MAAII;AACJ,GAAC,SAAUA,GAAkB;AACzB,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,EAC9D,GAAGA,MAAqBV,EAAA,mBAA2BU,IAAmB,CAAA,EAAG;AA2BzE,WAASR,EAAwBS,GAAOC,GAAO;AAC3C,QAAIC,IAAW,CAAA,GACXC,IAAW,CAAA;AACf,QAAIH,MAAUC;AACV,aAAO;AAGX,aADIG,QAAcX,EAAa,aAAaO,CAAK,IAAIA,IAAQA,EAAM,QAC5DI;AACH,MAAAF,EAAS,QAAQE,CAAO,GACxBA,IAAUA,EAAQ;AAGtB,SADAA,QAAcX,EAAa,aAAaQ,CAAK,IAAIA,IAAQA,EAAM,QACxDG;AACH,MAAAD,EAAS,QAAQC,CAAO,GACxBA,IAAUA,EAAQ;AAItB,aAFIC,IAAS,KAAK,IAAIH,EAAS,QAAQC,EAAS,MAAM,GAClDP,IAAM,GACHA,IAAMS,KAAUH,EAASN,CAAG,MAAMO,EAASP,CAAG;AACjD,MAAAA;AAEJ,QAAIA,MAAQ;AACR,aAAOG,EAAiB;AAE5B,QAAIO,IAAeJ,EAASN,IAAM,CAAC,GAC/BW,IAAWD,EAAa,UACxBE,IAAWN,EAASN,CAAG,GACvBa,IAAWN,EAASP,CAAG;AAC3B,WAAIW,EAAS,QAAQC,CAAQ,IAAID,EAAS,QAAQE,CAAQ,IAClDH,MAAiBL,IACVF,EAAiB,YAAYA,EAAiB,eAElDA,EAAiB,YAExBO,MAAiBN,IACVD,EAAiB,YAAYA,EAAiB,WAElDA,EAAiB;AAAA,EAC5B;AAUA,WAASP,EAAWG,GAAO;AACvB,WAAAA,IAAQA,EAAM,OAAO,SAAUE,GAAMa,GAAGC,GAAK;AAAE,aAAO,CAACA,EAAI,SAASd,GAAMa,IAAI,CAAC;AAAA,IAAE,CAAE,GACnFf,EAAM,KAAK,SAAUiB,GAAGC,GAAG;AACvB,UAAIC,IAAWvB,EAAwBqB,GAAGC,CAAC;AAC3C,aAAIC,IAAWf,EAAiB,YACrB,KAEFe,IAAWf,EAAiB,YAC1B,IAEJ;AAAA,IACf,CAAK,GACMJ;AAAA,EACX;;;","x_google_ignoreList":[0]}