@e1011/es-kit 1.1.72 → 1.1.75

package/dist/utils/esm/node_modules/source-map-js/lib/source-map-consumer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source-map-consumer.js","sources":["../../../../../../node_modules/source-map-js/lib/source-map-consumer.js"],"sourcesContent":["/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  return sourceMap.sections != null\n    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n//     {\n//       generatedLine: The line number in the generated code,\n//       generatedColumn: The column number in the generated code,\n//       source: The path to the original source file that generated this\n//               chunk of code,\n//       originalLine: The line number in the original source that\n//                     corresponds to this chunk of generated code,\n//       originalColumn: The column number in the original source that\n//                       corresponds to this chunk of generated code,\n//       name: The name of the original symbol which generated this chunk of\n//             code.\n//     }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__generatedMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__generatedMappings;\n  }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__originalMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__originalMappings;\n  }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n    var c = aStr.charAt(index);\n    return c === \";\" || c === \",\";\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n  };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n *        The function that is called with each mapping.\n * @param Object aContext\n *        Optional. If specified, this object will be the value of `this` every\n *        time that `aCallback` is called.\n * @param aOrder\n *        Either `SourceMapConsumer.GENERATED_ORDER` or\n *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n *        iterate over the mappings sorted by the generated file's line/column\n *        order or the original's source/line/column order, respectively. Defaults to\n *        `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n    var context = aContext || null;\n    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n    var mappings;\n    switch (order) {\n    case SourceMapConsumer.GENERATED_ORDER:\n      mappings = this._generatedMappings;\n      break;\n    case SourceMapConsumer.ORIGINAL_ORDER:\n      mappings = this._originalMappings;\n      break;\n    default:\n      throw new Error(\"Unknown order of iteration.\");\n    }\n\n    var sourceRoot = this.sourceRoot;\n    var boundCallback = aCallback.bind(context);\n    var names = this._names;\n    var sources = this._sources;\n    var sourceMapURL = this._sourceMapURL;\n\n    for (var i = 0, n = mappings.length; i < n; i++) {\n      var mapping = mappings[i];\n      var source = mapping.source === null ? null : sources.at(mapping.source);\n      if(source !== null) {\n        source = util.computeSourceURL(sourceRoot, source, sourceMapURL);\n      }\n      boundCallback({\n        source: source,\n        generatedLine: mapping.generatedLine,\n        generatedColumn: mapping.generatedColumn,\n        originalLine: mapping.originalLine,\n        originalColumn: mapping.originalColumn,\n        name: mapping.name === null ? null : names.at(mapping.name)\n      });\n    }\n  };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number is 1-based.\n *   - column: Optional. the column number in the original source.\n *    The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *    line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *    The column number is 0-based.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n    var line = util.getArg(aArgs, 'line');\n\n    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n    // returns the index of the closest mapping less than the needle. By\n    // setting needle.originalColumn to 0, we thus find the last mapping for\n    // the given line, provided such a mapping exists.\n    var needle = {\n      source: util.getArg(aArgs, 'source'),\n      originalLine: line,\n      originalColumn: util.getArg(aArgs, 'column', 0)\n    };\n\n    needle.source = this._findSourceIndex(needle.source);\n    if (needle.source < 0) {\n      return [];\n    }\n\n    var mappings = [];\n\n    var index = this._findMapping(needle,\n                                  this._originalMappings,\n                                  \"originalLine\",\n                                  \"originalColumn\",\n                                  util.compareByOriginalPositions,\n                                  binarySearch.LEAST_UPPER_BOUND);\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (aArgs.column === undefined) {\n        var originalLine = mapping.originalLine;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we found. Since\n        // mappings are sorted, this is guaranteed to find all mappings for\n        // the line we found.\n        while (mapping && mapping.originalLine === originalLine) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      } else {\n        var originalColumn = mapping.originalColumn;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we were searching for.\n        // Since mappings are sorted, this is guaranteed to find all mappings for\n        // the line we are searching for.\n        while (mapping &&\n               mapping.originalLine === line &&\n               mapping.originalColumn == originalColumn) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      }\n    }\n\n    return mappings;\n  };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - sources: An array of URLs to the original source files.\n *   - names: An array of identifiers which can be referrenced by individual mappings.\n *   - sourceRoot: Optional. The URL root from which all sources are relative.\n *   - sourcesContent: Optional. An array of contents of the original source files.\n *   - mappings: A string of base64 VLQs which contain the actual mappings.\n *   - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n *     {\n *       version : 3,\n *       file: \"out.js\",\n *       sourceRoot : \"\",\n *       sources: [\"foo.js\", \"bar.js\"],\n *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n *       mappings: \"AA,AB;;ABCDE;\"\n *     }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sources = util.getArg(sourceMap, 'sources');\n  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n  // requires the array) to play nice here.\n  var names = util.getArg(sourceMap, 'names', []);\n  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n  var mappings = util.getArg(sourceMap, 'mappings');\n  var file = util.getArg(sourceMap, 'file', null);\n\n  // Once again, Sass deviates from the spec and supplies the version as a\n  // string rather than a number, so we use loose equality checking here.\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  if (sourceRoot) {\n    sourceRoot = util.normalize(sourceRoot);\n  }\n\n  sources = sources\n    .map(String)\n    // Some source maps produce relative source paths like \"./foo.js\" instead of\n    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n    // See bugzil.la/1090768.\n    .map(util.normalize)\n    // Always ensure that absolute sources are internally stored relative to\n    // the source root, if the source root is absolute. Not doing this would\n    // be particularly problematic when the source root is a prefix of the\n    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n    .map(function (source) {\n      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n        ? util.relative(sourceRoot, source)\n        : source;\n    });\n\n  // Pass `true` below to allow duplicate names and sources. While source maps\n  // are intended to be compressed and deduplicated, the TypeScript compiler\n  // sometimes generates source maps with duplicates in them. See Github issue\n  // #72 and bugzil.la/889492.\n  this._names = ArraySet.fromArray(names.map(String), true);\n  this._sources = ArraySet.fromArray(sources, true);\n\n  this._absoluteSources = this._sources.toArray().map(function (s) {\n    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n  });\n\n  this.sourceRoot = sourceRoot;\n  this.sourcesContent = sourcesContent;\n  this._mappings = mappings;\n  this._sourceMapURL = aSourceMapURL;\n  this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n  var relativeSource = aSource;\n  if (this.sourceRoot != null) {\n    relativeSource = util.relative(this.sourceRoot, relativeSource);\n  }\n\n  if (this._sources.has(relativeSource)) {\n    return this._sources.indexOf(relativeSource);\n  }\n\n  // Maybe aSource is an absolute URL as returned by |sources|.  In\n  // this case we can't simply undo the transform.\n  var i;\n  for (i = 0; i < this._absoluteSources.length; ++i) {\n    if (this._absoluteSources[i] == aSource) {\n      return i;\n    }\n  }\n\n  return -1;\n};\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n *        The source map that will be consumed.\n * @param String aSourceMapURL\n *        The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n                                                            smc.sourceRoot);\n    smc.file = aSourceMap._file;\n    smc._sourceMapURL = aSourceMapURL;\n    smc._absoluteSources = smc._sources.toArray().map(function (s) {\n      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n    });\n\n    // Because we are modifying the entries (by converting string sources and\n    // names to indices into the sources and names ArraySets), we have to make\n    // a copy of the entry or else bad things happen. Shared mutable state\n    // strikes again! See github issue #191.\n\n    var generatedMappings = aSourceMap._mappings.toArray().slice();\n    var destGeneratedMappings = smc.__generatedMappings = [];\n    var destOriginalMappings = smc.__originalMappings = [];\n\n    for (var i = 0, length = generatedMappings.length; i < length; i++) {\n      var srcMapping = generatedMappings[i];\n      var destMapping = new Mapping;\n      destMapping.generatedLine = srcMapping.generatedLine;\n      destMapping.generatedColumn = srcMapping.generatedColumn;\n\n      if (srcMapping.source) {\n        destMapping.source = sources.indexOf(srcMapping.source);\n        destMapping.originalLine = srcMapping.originalLine;\n        destMapping.originalColumn = srcMapping.originalColumn;\n\n        if (srcMapping.name) {\n          destMapping.name = names.indexOf(srcMapping.name);\n        }\n\n        destOriginalMappings.push(destMapping);\n      }\n\n      destGeneratedMappings.push(destMapping);\n    }\n\n    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n    return smc;\n  };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    return this._absoluteSources.slice();\n  }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n  this.generatedLine = 0;\n  this.generatedColumn = 0;\n  this.source = null;\n  this.originalLine = null;\n  this.originalColumn = null;\n  this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\n\nconst compareGenerated = util.compareByGeneratedPositionsDeflatedNoLine;\nfunction sortGenerated(array, start) {\n  let l = array.length;\n  let n = array.length - start;\n  if (n <= 1) {\n    return;\n  } else if (n == 2) {\n    let a = array[start];\n    let b = array[start + 1];\n    if (compareGenerated(a, b) > 0) {\n      array[start] = b;\n      array[start + 1] = a;\n    }\n  } else if (n < 20) {\n    for (let i = start; i < l; i++) {\n      for (let j = i; j > start; j--) {\n        let a = array[j - 1];\n        let b = array[j];\n        if (compareGenerated(a, b) <= 0) {\n          break;\n        }\n        array[j - 1] = b;\n        array[j] = a;\n      }\n    }\n  } else {\n    quickSort(array, compareGenerated, start);\n  }\n}\nBasicSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    var generatedLine = 1;\n    var previousGeneratedColumn = 0;\n    var previousOriginalLine = 0;\n    var previousOriginalColumn = 0;\n    var previousSource = 0;\n    var previousName = 0;\n    var length = aStr.length;\n    var index = 0;\n    var cachedSegments = {};\n    var temp = {};\n    var originalMappings = [];\n    var generatedMappings = [];\n    var mapping, str, segment, end, value;\n\n    let subarrayStart = 0;\n    while (index < length) {\n      if (aStr.charAt(index) === ';') {\n        generatedLine++;\n        index++;\n        previousGeneratedColumn = 0;\n\n        sortGenerated(generatedMappings, subarrayStart);\n        subarrayStart = generatedMappings.length;\n      }\n      else if (aStr.charAt(index) === ',') {\n        index++;\n      }\n      else {\n        mapping = new Mapping();\n        mapping.generatedLine = generatedLine;\n\n        for (end = index; end < length; end++) {\n          if (this._charIsMappingSeparator(aStr, end)) {\n            break;\n          }\n        }\n        str = aStr.slice(index, end);\n\n        segment = [];\n        while (index < end) {\n          base64VLQ.decode(aStr, index, temp);\n          value = temp.value;\n          index = temp.rest;\n          segment.push(value);\n        }\n\n        if (segment.length === 2) {\n          throw new Error('Found a source, but no line and column');\n        }\n\n        if (segment.length === 3) {\n          throw new Error('Found a source and line, but no column');\n        }\n\n        // Generated column.\n        mapping.generatedColumn = previousGeneratedColumn + segment[0];\n        previousGeneratedColumn = mapping.generatedColumn;\n\n        if (segment.length > 1) {\n          // Original source.\n          mapping.source = previousSource + segment[1];\n          previousSource += segment[1];\n\n          // Original line.\n          mapping.originalLine = previousOriginalLine + segment[2];\n          previousOriginalLine = mapping.originalLine;\n          // Lines are stored 0-based\n          mapping.originalLine += 1;\n\n          // Original column.\n          mapping.originalColumn = previousOriginalColumn + segment[3];\n          previousOriginalColumn = mapping.originalColumn;\n\n          if (segment.length > 4) {\n            // Original name.\n            mapping.name = previousName + segment[4];\n            previousName += segment[4];\n          }\n        }\n\n        generatedMappings.push(mapping);\n        if (typeof mapping.originalLine === 'number') {\n          let currentSource = mapping.source;\n          while (originalMappings.length <= currentSource) {\n            originalMappings.push(null);\n          }\n          if (originalMappings[currentSource] === null) {\n            originalMappings[currentSource] = [];\n          }\n          originalMappings[currentSource].push(mapping);\n        }\n      }\n    }\n\n    sortGenerated(generatedMappings, subarrayStart);\n    this.__generatedMappings = generatedMappings;\n\n    for (var i = 0; i < originalMappings.length; i++) {\n      if (originalMappings[i] != null) {\n        quickSort(originalMappings[i], util.compareByOriginalPositionsNoSource);\n      }\n    }\n    this.__originalMappings = [].concat(...originalMappings);\n  };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n                                         aColumnName, aComparator, aBias) {\n    // To return the position we are searching for, we must first find the\n    // mapping for the given position and then return the opposite position it\n    // points to. Because the mappings are sorted, we can use binary search to\n    // find the best mapping.\n\n    if (aNeedle[aLineName] <= 0) {\n      throw new TypeError('Line must be greater than or equal to 1, got '\n                          + aNeedle[aLineName]);\n    }\n    if (aNeedle[aColumnName] < 0) {\n      throw new TypeError('Column must be greater than or equal to 0, got '\n                          + aNeedle[aColumnName]);\n    }\n\n    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n  };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n  function SourceMapConsumer_computeColumnSpans() {\n    for (var index = 0; index < this._generatedMappings.length; ++index) {\n      var mapping = this._generatedMappings[index];\n\n      // Mappings do not contain a field for the last generated columnt. We\n      // can come up with an optimistic estimate, however, by assuming that\n      // mappings are contiguous (i.e. given two consecutive mappings, the\n      // first mapping ends where the second one starts).\n      if (index + 1 < this._generatedMappings.length) {\n        var nextMapping = this._generatedMappings[index + 1];\n\n        if (mapping.generatedLine === nextMapping.generatedLine) {\n          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n          continue;\n        }\n      }\n\n      // The last mapping for each line spans the entire line.\n      mapping.lastGeneratedColumn = Infinity;\n    }\n  };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n  function SourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._generatedMappings,\n      \"generatedLine\",\n      \"generatedColumn\",\n      util.compareByGeneratedPositionsDeflated,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._generatedMappings[index];\n\n      if (mapping.generatedLine === needle.generatedLine) {\n        var source = util.getArg(mapping, 'source', null);\n        if (source !== null) {\n          source = this._sources.at(source);\n          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n        }\n        var name = util.getArg(mapping, 'name', null);\n        if (name !== null) {\n          name = this._names.at(name);\n        }\n        return {\n          source: source,\n          line: util.getArg(mapping, 'originalLine', null),\n          column: util.getArg(mapping, 'originalColumn', null),\n          name: name\n        };\n      }\n    }\n\n    return {\n      source: null,\n      line: null,\n      column: null,\n      name: null\n    };\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) {\n      return false;\n    }\n    return this.sourcesContent.length >= this._sources.size() &&\n      !this.sourcesContent.some(function (sc) { return sc == null; });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    if (!this.sourcesContent) {\n      return null;\n    }\n\n    var index = this._findSourceIndex(aSource);\n    if (index >= 0) {\n      return this.sourcesContent[index];\n    }\n\n    var relativeSource = aSource;\n    if (this.sourceRoot != null) {\n      relativeSource = util.relative(this.sourceRoot, relativeSource);\n    }\n\n    var url;\n    if (this.sourceRoot != null\n        && (url = util.urlParse(this.sourceRoot))) {\n      // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n      // many users. We can help them out when they expect file:// URIs to\n      // behave like it would if they were running a local HTTP server. See\n      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n      var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n      if (url.scheme == \"file\"\n          && this._sources.has(fileUriAbsPath)) {\n        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n      }\n\n      if ((!url.path || url.path == \"/\")\n          && this._sources.has(\"/\" + relativeSource)) {\n        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n      }\n    }\n\n    // This function is used recursively from\n    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n    // don't want to throw if we can't find the source - we just want to\n    // return null, so we provide a flag to exit gracefully.\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n  function SourceMapConsumer_generatedPositionFor(aArgs) {\n    var source = util.getArg(aArgs, 'source');\n    source = this._findSourceIndex(source);\n    if (source < 0) {\n      return {\n        line: null,\n        column: null,\n        lastColumn: null\n      };\n    }\n\n    var needle = {\n      source: source,\n      originalLine: util.getArg(aArgs, 'line'),\n      originalColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._originalMappings,\n      \"originalLine\",\n      \"originalColumn\",\n      util.compareByOriginalPositions,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (mapping.source === needle.source) {\n        return {\n          line: util.getArg(mapping, 'generatedLine', null),\n          column: util.getArg(mapping, 'generatedColumn', null),\n          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n        };\n      }\n    }\n\n    return {\n      line: null,\n      column: null,\n      lastColumn: null\n    };\n  };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - file: Optional. The generated file this source map is associated with.\n *   - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n *   - offset: The offset into the original specified at which this section\n *       begins to apply, defined as an object with a \"line\" and \"column\"\n *       field.\n *   - map: A source map definition. This source map could also be indexed,\n *       but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n *  {\n *    version : 3,\n *    file: \"app.js\",\n *    sections: [{\n *      offset: {line:100, column:10},\n *      map: {\n *        version : 3,\n *        file: \"section.js\",\n *        sources: [\"foo.js\", \"bar.js\"],\n *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n *        mappings: \"AAAA,E;;ABCDE;\"\n *      }\n *    }],\n *  }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sections = util.getArg(sourceMap, 'sections');\n\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n\n  var lastOffset = {\n    line: -1,\n    column: 0\n  };\n  this._sections = sections.map(function (s) {\n    if (s.url) {\n      // The url field will require support for asynchronicity.\n      // See https://github.com/mozilla/source-map/issues/16\n      throw new Error('Support for url field in sections not implemented.');\n    }\n    var offset = util.getArg(s, 'offset');\n    var offsetLine = util.getArg(offset, 'line');\n    var offsetColumn = util.getArg(offset, 'column');\n\n    if (offsetLine < lastOffset.line ||\n        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n      throw new Error('Section offsets must be ordered and non-overlapping.');\n    }\n    lastOffset = offset;\n\n    return {\n      generatedOffset: {\n        // The offset fields are 0-based, but we use 1-based indices when\n        // encoding/decoding from VLQ.\n        generatedLine: offsetLine + 1,\n        generatedColumn: offsetColumn + 1\n      },\n      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n    }\n  });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    var sources = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n        sources.push(this._sections[i].consumer.sources[j]);\n      }\n    }\n    return sources;\n  }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    // Find the section containing the generated position we're trying to map\n    // to an original position.\n    var sectionIndex = binarySearch.search(needle, this._sections,\n      function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) {\n          return cmp;\n        }\n\n        return (needle.generatedColumn -\n                section.generatedOffset.generatedColumn);\n      });\n    var section = this._sections[sectionIndex];\n\n    if (!section) {\n      return {\n        source: null,\n        line: null,\n        column: null,\n        name: null\n      };\n    }\n\n    return section.consumer.originalPositionFor({\n      line: needle.generatedLine -\n        (section.generatedOffset.generatedLine - 1),\n      column: needle.generatedColumn -\n        (section.generatedOffset.generatedLine === needle.generatedLine\n         ? section.generatedOffset.generatedColumn - 1\n         : 0),\n      bias: aArgs.bias\n    });\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n    return this._sections.every(function (s) {\n      return s.consumer.hasContentsOfAllSources();\n    });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      var content = section.consumer.sourceContentFor(aSource, true);\n      if (content || content === '') {\n        return content;\n      }\n    }\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based. \n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      // Only consider this section if the requested source is in the list of\n      // sources of the consumer.\n      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n        continue;\n      }\n      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n      if (generatedPosition) {\n        var ret = {\n          line: generatedPosition.line +\n            (section.generatedOffset.generatedLine - 1),\n          column: generatedPosition.column +\n            (section.generatedOffset.generatedLine === generatedPosition.line\n             ? section.generatedOffset.generatedColumn - 1\n             : 0)\n        };\n        return ret;\n      }\n    }\n\n    return {\n      line: null,\n      column: null\n    };\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    this.__generatedMappings = [];\n    this.__originalMappings = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n      var sectionMappings = section.consumer._generatedMappings;\n      for (var j = 0; j < sectionMappings.length; j++) {\n        var mapping = sectionMappings[j];\n\n        var source = section.consumer._sources.at(mapping.source);\n        if(source !== null) {\n          source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n        }\n        this._sources.add(source);\n        source = this._sources.indexOf(source);\n\n        var name = null;\n        if (mapping.name) {\n          name = section.consumer._names.at(mapping.name);\n          this._names.add(name);\n          name = this._names.indexOf(name);\n        }\n\n        // The mappings coming from the consumer for the section have\n        // generated positions relative to the start of the section, so we\n        // need to offset them to be relative to the start of the concatenated\n        // generated file.\n        var adjustedMapping = {\n          source: source,\n          generatedLine: mapping.generatedLine +\n            (section.generatedOffset.generatedLine - 1),\n          generatedColumn: mapping.generatedColumn +\n            (section.generatedOffset.generatedLine === mapping.generatedLine\n            ? section.generatedOffset.generatedColumn - 1\n            : 0),\n          originalLine: mapping.originalLine,\n          originalColumn: mapping.originalColumn,\n          name: name\n        };\n\n        this.__generatedMappings.push(adjustedMapping);\n        if (typeof adjustedMapping.originalLine === 'number') {\n          this.__originalMappings.push(adjustedMapping);\n        }\n      }\n    }\n\n    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n  };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n"],"names":["util","require$$0","binarySearch","require$$1","ArraySet","require$$2","base64VLQ","require$$3","quickSort","require$$4","SourceMapConsumer","aSourceMap","aSourceMapURL","sourceMap","parseSourceMapInput","sections","IndexedSourceMapConsumer","BasicSourceMapConsumer","version","getArg","sources","names","sourceRoot","sourcesContent","mappings","file","this","_version","Error","normalize","map","String","source","isAbsolute","relative","_names","fromArray","_sources","_absoluteSources","toArray","s","computeSourceURL","_mappings","_sourceMapURL","Mapping","generatedLine","generatedColumn","originalLine","originalColumn","name","fromSourceMap","prototype","__generatedMappings","Object","defineProperty","configurable","enumerable","get","_parseMappings","__originalMappings","_charIsMappingSeparator","aStr","index","c","charAt","aSourceRoot","GENERATED_ORDER","ORIGINAL_ORDER","GREATEST_LOWER_BOUND","LEAST_UPPER_BOUND","eachMapping","aCallback","aContext","aOrder","context","_generatedMappings","_originalMappings","boundCallback","bind","sourceMapURL","i","n","length","mapping","at","allGeneratedPositionsFor","aArgs","line","needle","_findSourceIndex","_findMapping","compareByOriginalPositions","undefined","column","push","lastColumn","sourceMapConsumer","create","consumer","aSource","relativeSource","has","indexOf","smc","_sourceRoot","_generateSourcesContent","_file","generatedMappings","slice","destGeneratedMappings","destOriginalMappings","srcMapping","destMapping","compareGenerated","compareByGeneratedPositionsDeflatedNoLine","sortGenerated","array","start","l","a","b","j","lastOffset","_sections","url","offset","offsetLine","offsetColumn","generatedOffset","segment","end","value","previousGeneratedColumn","previousOriginalLine","previousOriginalColumn","previousSource","previousName","temp","originalMappings","subarrayStart","decode","rest","currentSource","compareByOriginalPositionsNoSource","concat","aNeedle","aMappings","aLineName","aColumnName","aComparator","aBias","TypeError","search","computeColumnSpans","nextMapping","lastGeneratedColumn","Infinity","originalPositionFor","compareByGeneratedPositionsDeflated","hasContentsOfAllSources","size","some","sc","sourceContentFor","nullOnMissing","urlParse","fileUriAbsPath","replace","scheme","path","generatedPositionFor","constructor","sectionIndex","section","cmp","bias","every","content","generatedPosition","sectionMappings","add","adjustedMapping"],"mappings":"ieAOA,IAAIA,EAAOC,EACPC,EAAeC,EACfC,EAAWC,EAAuBD,SAClCE,EAAYC,EACZC,EAAYC,EAAwBD,UAExC,SAASE,EAAkBC,EAAYC,GACrC,IAAIC,EAAYF,EAKhB,MAJ0B,iBAAfA,IACTE,EAAYb,EAAKc,oBAAoBH,IAGV,MAAtBE,EAAUE,SACb,IAAIC,EAAyBH,EAAWD,GACxC,IAAIK,EAAuBJ,EAAWD,EAC5C,CAiRA,SAASK,EAAuBN,EAAYC,GAC1C,IAAIC,EAAYF,EACU,iBAAfA,IACTE,EAAYb,EAAKc,oBAAoBH,IAGvC,IAAIO,EAAUlB,EAAKmB,OAAON,EAAW,WACjCO,EAAUpB,EAAKmB,OAAON,EAAW,WAGjCQ,EAAQrB,EAAKmB,OAAON,EAAW,QAAS,IACxCS,EAAatB,EAAKmB,OAAON,EAAW,aAAc,MAClDU,EAAiBvB,EAAKmB,OAAON,EAAW,iBAAkB,MAC1DW,EAAWxB,EAAKmB,OAAON,EAAW,YAClCY,EAAOzB,EAAKmB,OAAON,EAAW,OAAQ,MAI1C,GAAIK,GAAWQ,KAAKC,SAClB,MAAM,IAAIC,MAAM,wBAA0BV,GAGxCI,IACFA,EAAatB,EAAK6B,UAAUP,IAG9BF,EAAUA,EACPU,IAAIC,QAIJD,IAAI9B,EAAK6B,WAKTC,KAAI,SAAUE,GACb,OAAOV,GAActB,EAAKiC,WAAWX,IAAetB,EAAKiC,WAAWD,GAChEhC,EAAKkC,SAASZ,EAAYU,GAC1BA,CACV,IAMEN,KAAKS,OAAS/B,EAASgC,UAAUf,EAAMS,IAAIC,SAAS,GACpDL,KAAKW,SAAWjC,EAASgC,UAAUhB,GAAS,GAE5CM,KAAKY,iBAAmBZ,KAAKW,SAASE,UAAUT,KAAI,SAAUU,GAC5D,OAAOxC,EAAKyC,iBAAiBnB,EAAYkB,EAAG5B,EAChD,IAEEc,KAAKJ,WAAaA,EAClBI,KAAKH,eAAiBA,EACtBG,KAAKgB,UAAYlB,EACjBE,KAAKiB,cAAgB/B,EACrBc,KAAKD,KAAOA,CACd,CA2GA,SAASmB,IACPlB,KAAKmB,cAAgB,EACrBnB,KAAKoB,gBAAkB,EACvBpB,KAAKM,OAAS,KACdN,KAAKqB,aAAe,KACpBrB,KAAKsB,eAAiB,KACtBtB,KAAKuB,KAAO,IACd,CA3bAvC,EAAkBwC,cAAgB,SAASvC,EAAYC,GACrD,OAAOK,EAAuBiC,cAAcvC,EAAYC,EAC1D,EAKAF,EAAkByC,UAAUxB,SAAW,EAgCvCjB,EAAkByC,UAAUC,oBAAsB,KAClDC,OAAOC,eAAe5C,EAAkByC,UAAW,qBAAsB,CACvEI,cAAc,EACdC,YAAY,EACZC,IAAK,WAKH,OAJK/B,KAAK0B,qBACR1B,KAAKgC,eAAehC,KAAKgB,UAAWhB,KAAKJ,YAGpCI,KAAK0B,mBAChB,IAGA1C,EAAkByC,UAAUQ,mBAAqB,KACjDN,OAAOC,eAAe5C,EAAkByC,UAAW,oBAAqB,CACtEI,cAAc,EACdC,YAAY,EACZC,IAAK,WAKH,OAJK/B,KAAKiC,oBACRjC,KAAKgC,eAAehC,KAAKgB,UAAWhB,KAAKJ,YAGpCI,KAAKiC,kBAChB,IAGAjD,EAAkByC,UAAUS,wBAC1B,SAAkDC,EAAMC,GACtD,IAAIC,EAAIF,EAAKG,OAAOF,GACpB,MAAa,MAANC,GAAmB,MAANA,CACrB,EAOHrD,EAAkByC,UAAUO,eAC1B,SAAyCG,EAAMI,GAC7C,MAAM,IAAIrC,MAAM,2CACjB,EAEHlB,EAAkBwD,gBAAkB,EACpCxD,EAAkByD,eAAiB,EAEnCzD,EAAkB0D,qBAAuB,EACzC1D,EAAkB2D,kBAAoB,EAkBtC3D,EAAkByC,UAAUmB,YAC1B,SAAuCC,EAAWC,EAAUC,GAC1D,IAGIjD,EAHAkD,EAAUF,GAAY,KAI1B,OAHYC,GAAU/D,EAAkBwD,iBAIxC,KAAKxD,EAAkBwD,gBACrB1C,EAAWE,KAAKiD,mBAChB,MACF,KAAKjE,EAAkByD,eACrB3C,EAAWE,KAAKkD,kBAChB,MACF,QACE,MAAM,IAAIhD,MAAM,+BASlB,IANA,IAAIN,EAAaI,KAAKJ,WAClBuD,EAAgBN,EAAUO,KAAKJ,GAC/BrD,EAAQK,KAAKS,OACbf,EAAUM,KAAKW,SACf0C,EAAerD,KAAKiB,cAEfqC,EAAI,EAAGC,EAAIzD,EAAS0D,OAAQF,EAAIC,EAAGD,IAAK,CAC/C,IAAIG,EAAU3D,EAASwD,GACnBhD,EAA4B,OAAnBmD,EAAQnD,OAAkB,KAAOZ,EAAQgE,GAAGD,EAAQnD,QACnD,OAAXA,IACDA,EAAShC,EAAKyC,iBAAiBnB,EAAYU,EAAQ+C,IAErDF,EAAc,CACZ7C,OAAQA,EACRa,cAAesC,EAAQtC,cACvBC,gBAAiBqC,EAAQrC,gBACzBC,aAAcoC,EAAQpC,aACtBC,eAAgBmC,EAAQnC,eACxBC,KAAuB,OAAjBkC,EAAQlC,KAAgB,KAAO5B,EAAM+D,GAAGD,EAAQlC,OAE9D,CACG,EAwBHvC,EAAkByC,UAAUkC,yBAC1B,SAAoDC,GAClD,IAAIC,EAAOvF,EAAKmB,OAAOmE,EAAO,QAM1BE,EAAS,CACXxD,OAAQhC,EAAKmB,OAAOmE,EAAO,UAC3BvC,aAAcwC,EACdvC,eAAgBhD,EAAKmB,OAAOmE,EAAO,SAAU,IAI/C,GADAE,EAAOxD,OAASN,KAAK+D,iBAAiBD,EAAOxD,QACzCwD,EAAOxD,OAAS,EAClB,MAAO,GAGT,IAAIR,EAAW,GAEXsC,EAAQpC,KAAKgE,aAAaF,EACA9D,KAAKkD,kBACL,eACA,iBACA5E,EAAK2F,2BACLzF,EAAamE,mBAC3C,GAAIP,GAAS,EAAG,CACd,IAAIqB,EAAUzD,KAAKkD,kBAAkBd,GAErC,QAAqB8B,IAAjBN,EAAMO,OAOR,IANA,IAAI9C,EAAeoC,EAAQpC,aAMpBoC,GAAWA,EAAQpC,eAAiBA,GACzCvB,EAASsE,KAAK,CACZP,KAAMvF,EAAKmB,OAAOgE,EAAS,gBAAiB,MAC5CU,OAAQ7F,EAAKmB,OAAOgE,EAAS,kBAAmB,MAChDY,WAAY/F,EAAKmB,OAAOgE,EAAS,sBAAuB,QAG1DA,EAAUzD,KAAKkD,oBAAoBd,QASrC,IANA,IAAId,EAAiBmC,EAAQnC,eAMtBmC,GACAA,EAAQpC,eAAiBwC,GACzBJ,EAAQnC,gBAAkBA,GAC/BxB,EAASsE,KAAK,CACZP,KAAMvF,EAAKmB,OAAOgE,EAAS,gBAAiB,MAC5CU,OAAQ7F,EAAKmB,OAAOgE,EAAS,kBAAmB,MAChDY,WAAY/F,EAAKmB,OAAOgE,EAAS,sBAAuB,QAG1DA,EAAUzD,KAAKkD,oBAAoBd,EAG7C,CAEI,OAAOtC,CACR,EAEsBwE,EAAAtF,kBAAGA,EAgG5BO,EAAuBkC,UAAYE,OAAO4C,OAAOvF,EAAkByC,WACnElC,EAAuBkC,UAAU+C,SAAWxF,EAM5CO,EAAuBkC,UAAUsC,iBAAmB,SAASU,GAC3D,IAWInB,EAXAoB,EAAiBD,EAKrB,GAJuB,MAAnBzE,KAAKJ,aACP8E,EAAiBpG,EAAKkC,SAASR,KAAKJ,WAAY8E,IAG9C1E,KAAKW,SAASgE,IAAID,GACpB,OAAO1E,KAAKW,SAASiE,QAAQF,GAM/B,IAAKpB,EAAI,EAAGA,EAAItD,KAAKY,iBAAiB4C,SAAUF,EAC9C,GAAItD,KAAKY,iBAAiB0C,IAAMmB,EAC9B,OAAOnB,EAIX,OAAQ,CACV,EAWA/D,EAAuBiC,cACrB,SAAyCvC,EAAYC,GACnD,IAAI2F,EAAMlD,OAAO4C,OAAOhF,EAAuBkC,WAE3C9B,EAAQkF,EAAIpE,OAAS/B,EAASgC,UAAUzB,EAAWwB,OAAOI,WAAW,GACrEnB,EAAUmF,EAAIlE,SAAWjC,EAASgC,UAAUzB,EAAW0B,SAASE,WAAW,GAC/EgE,EAAIjF,WAAaX,EAAW6F,YAC5BD,EAAIhF,eAAiBZ,EAAW8F,wBAAwBF,EAAIlE,SAASE,UACbgE,EAAIjF,YAC5DiF,EAAI9E,KAAOd,EAAW+F,MACtBH,EAAI5D,cAAgB/B,EACpB2F,EAAIjE,iBAAmBiE,EAAIlE,SAASE,UAAUT,KAAI,SAAUU,GAC1D,OAAOxC,EAAKyC,iBAAiB8D,EAAIjF,WAAYkB,EAAG5B,EACtD,IAWI,IAJA,IAAI+F,EAAoBhG,EAAW+B,UAAUH,UAAUqE,QACnDC,EAAwBN,EAAInD,oBAAsB,GAClD0D,EAAuBP,EAAI5C,mBAAqB,GAE3CqB,EAAI,EAAGE,EAASyB,EAAkBzB,OAAQF,EAAIE,EAAQF,IAAK,CAClE,IAAI+B,EAAaJ,EAAkB3B,GAC/BgC,EAAc,IAAIpE,EACtBoE,EAAYnE,cAAgBkE,EAAWlE,cACvCmE,EAAYlE,gBAAkBiE,EAAWjE,gBAErCiE,EAAW/E,SACbgF,EAAYhF,OAASZ,EAAQkF,QAAQS,EAAW/E,QAChDgF,EAAYjE,aAAegE,EAAWhE,aACtCiE,EAAYhE,eAAiB+D,EAAW/D,eAEpC+D,EAAW9D,OACb+D,EAAY/D,KAAO5B,EAAMiF,QAAQS,EAAW9D,OAG9C6D,EAAqBhB,KAAKkB,IAG5BH,EAAsBf,KAAKkB,EACjC,CAII,OAFAxG,EAAU+F,EAAI5C,mBAAoB3D,EAAK2F,4BAEhCY,CACR,EAKHtF,EAAuBkC,UAAUxB,SAAW,EAK5C0B,OAAOC,eAAerC,EAAuBkC,UAAW,UAAW,CACjEM,IAAK,WACH,OAAO/B,KAAKY,iBAAiBsE,OACjC,IAqBA,MAAMK,EAAmBjH,EAAKkH,0CAC9B,SAASC,EAAcC,EAAOC,GAC5B,IAAIC,EAAIF,EAAMlC,OACVD,EAAImC,EAAMlC,OAASmC,EACvB,KAAIpC,GAAK,GAEF,GAAS,GAALA,EAAQ,CACjB,IAAIsC,EAAIH,EAAMC,GACVG,EAAIJ,EAAMC,EAAQ,GAClBJ,EAAiBM,EAAGC,GAAK,IAC3BJ,EAAMC,GAASG,EACfJ,EAAMC,EAAQ,GAAKE,EAEzB,MAAS,GAAItC,EAAI,GACb,IAAK,IAAID,EAAIqC,EAAOrC,EAAIsC,EAAGtC,IACzB,IAAK,IAAIyC,EAAIzC,EAAGyC,EAAIJ,EAAOI,IAAK,CAC9B,IAAIF,EAAIH,EAAMK,EAAI,GACdD,EAAIJ,EAAMK,GACd,GAAIR,EAAiBM,EAAGC,IAAM,EAC5B,MAEFJ,EAAMK,EAAI,GAAKD,EACfJ,EAAMK,GAAKF,CACnB,MAGI/G,EAAU4G,EAAOH,EAAkBI,EAEvC,CA8ZA,SAASrG,EAAyBL,EAAYC,GAC5C,IAAIC,EAAYF,EACU,iBAAfA,IACTE,EAAYb,EAAKc,oBAAoBH,IAGvC,IAAIO,EAAUlB,EAAKmB,OAAON,EAAW,WACjCE,EAAWf,EAAKmB,OAAON,EAAW,YAEtC,GAAIK,GAAWQ,KAAKC,SAClB,MAAM,IAAIC,MAAM,wBAA0BV,GAG5CQ,KAAKW,SAAW,IAAIjC,EACpBsB,KAAKS,OAAS,IAAI/B,EAElB,IAAIsH,EAAa,CACfnC,MAAO,EACPM,OAAQ,GAEVnE,KAAKiG,UAAY5G,EAASe,KAAI,SAAUU,GACtC,GAAIA,EAAEoF,IAGJ,MAAM,IAAIhG,MAAM,sDAElB,IAAIiG,EAAS7H,EAAKmB,OAAOqB,EAAG,UACxBsF,EAAa9H,EAAKmB,OAAO0G,EAAQ,QACjCE,EAAe/H,EAAKmB,OAAO0G,EAAQ,UAEvC,GAAIC,EAAaJ,EAAWnC,MACvBuC,IAAeJ,EAAWnC,MAAQwC,EAAeL,EAAW7B,OAC/D,MAAM,IAAIjE,MAAM,wDAIlB,OAFA8F,EAAaG,EAEN,CACLG,gBAAiB,CAGfnF,cAAeiF,EAAa,EAC5BhF,gBAAiBiF,EAAe,GAElC7B,SAAU,IAAIxF,EAAkBV,EAAKmB,OAAOqB,EAAG,OAAQ5B,GAE7D,GACA,CA3cAK,EAAuBkC,UAAUO,eAC/B,SAAyCG,EAAMI,GAC7C,IAYIkB,EAAc8C,EAASC,EAAKC,EAZ5BtF,EAAgB,EAChBuF,EAA0B,EAC1BC,EAAuB,EACvBC,EAAyB,EACzBC,EAAiB,EACjBC,EAAe,EACftD,EAASrB,EAAKqB,OACdpB,EAAQ,EAER2E,EAAO,CAAE,EACTC,EAAmB,GACnB/B,EAAoB,GAGxB,IAAIgC,EAAgB,EACpB,KAAO7E,EAAQoB,GACb,GAA2B,MAAvBrB,EAAKG,OAAOF,GACdjB,IACAiB,IACAsE,EAA0B,EAE1BjB,EAAcR,EAAmBgC,GACjCA,EAAgBhC,EAAkBzB,YAE/B,GAA2B,MAAvBrB,EAAKG,OAAOF,GACnBA,QAEG,CAIH,KAHAqB,EAAU,IAAIvC,GACNC,cAAgBA,EAEnBqF,EAAMpE,EAAOoE,EAAMhD,IAClBxD,KAAKkC,wBAAwBC,EAAMqE,GADTA,KAQhC,IAHMrE,EAAK+C,MAAM9C,EAAOoE,GAExBD,EAAU,GACHnE,EAAQoE,GACb5H,EAAUsI,OAAO/E,EAAMC,EAAO2E,GAC9BN,EAAQM,EAAKN,MACbrE,EAAQ2E,EAAKI,KACbZ,EAAQnC,KAAKqC,GAGf,GAAuB,IAAnBF,EAAQ/C,OACV,MAAM,IAAItD,MAAM,0CAGlB,GAAuB,IAAnBqG,EAAQ/C,OACV,MAAM,IAAItD,MAAM,0CA8BlB,GA1BAuD,EAAQrC,gBAAkBsF,EAA0BH,EAAQ,GAC5DG,EAA0BjD,EAAQrC,gBAE9BmF,EAAQ/C,OAAS,IAEnBC,EAAQnD,OAASuG,EAAiBN,EAAQ,GAC1CM,GAAkBN,EAAQ,GAG1B9C,EAAQpC,aAAesF,EAAuBJ,EAAQ,GACtDI,EAAuBlD,EAAQpC,aAE/BoC,EAAQpC,cAAgB,EAGxBoC,EAAQnC,eAAiBsF,EAAyBL,EAAQ,GAC1DK,EAAyBnD,EAAQnC,eAE7BiF,EAAQ/C,OAAS,IAEnBC,EAAQlC,KAAOuF,EAAeP,EAAQ,GACtCO,GAAgBP,EAAQ,KAI5BtB,EAAkBb,KAAKX,GACa,iBAAzBA,EAAQpC,aAA2B,CAC5C,IAAI+F,EAAgB3D,EAAQnD,OAC5B,KAAO0G,EAAiBxD,QAAU4D,GAChCJ,EAAiB5C,KAAK,MAEgB,OAApC4C,EAAiBI,KACnBJ,EAAiBI,GAAiB,IAEpCJ,EAAiBI,GAAehD,KAAKX,EAC/C,CACA,CAGIgC,EAAcR,EAAmBgC,GACjCjH,KAAK0B,oBAAsBuD,EAE3B,IAAK,IAAI3B,EAAI,EAAGA,EAAI0D,EAAiBxD,OAAQF,IAChB,MAAvB0D,EAAiB1D,IACnBxE,EAAUkI,EAAiB1D,GAAIhF,EAAK+I,oCAGxCrH,KAAKiC,mBAAqB,GAAGqF,UAAUN,EACxC,EAMHzH,EAAuBkC,UAAUuC,aAC/B,SAAuCuD,EAASC,EAAWC,EACpBC,EAAaC,EAAaC,GAM/D,GAAIL,EAAQE,IAAc,EACxB,MAAM,IAAII,UAAU,gDACEN,EAAQE,IAEhC,GAAIF,EAAQG,GAAe,EACzB,MAAM,IAAIG,UAAU,kDACEN,EAAQG,IAGhC,OAAOlJ,EAAasJ,OAAOP,EAASC,EAAWG,EAAaC,EAC7D,EAMHrI,EAAuBkC,UAAUsG,mBAC/B,WACE,IAAK,IAAI3F,EAAQ,EAAGA,EAAQpC,KAAKiD,mBAAmBO,SAAUpB,EAAO,CACnE,IAAIqB,EAAUzD,KAAKiD,mBAAmBb,GAMtC,GAAIA,EAAQ,EAAIpC,KAAKiD,mBAAmBO,OAAQ,CAC9C,IAAIwE,EAAchI,KAAKiD,mBAAmBb,EAAQ,GAElD,GAAIqB,EAAQtC,gBAAkB6G,EAAY7G,cAAe,CACvDsC,EAAQwE,oBAAsBD,EAAY5G,gBAAkB,EAC5D,QACV,CACA,CAGMqC,EAAQwE,oBAAsBC,GACpC,CACG,EA0BH3I,EAAuBkC,UAAU0G,oBAC/B,SAA+CvE,GAC7C,IAAIE,EAAS,CACX3C,cAAe7C,EAAKmB,OAAOmE,EAAO,QAClCxC,gBAAiB9C,EAAKmB,OAAOmE,EAAO,WAGlCxB,EAAQpC,KAAKgE,aACfF,EACA9D,KAAKiD,mBACL,gBACA,kBACA3E,EAAK8J,oCACL9J,EAAKmB,OAAOmE,EAAO,OAAQ5E,EAAkB0D,uBAG/C,GAAIN,GAAS,EAAG,CACd,IAAIqB,EAAUzD,KAAKiD,mBAAmBb,GAEtC,GAAIqB,EAAQtC,gBAAkB2C,EAAO3C,cAAe,CAClD,IAAIb,EAAShC,EAAKmB,OAAOgE,EAAS,SAAU,MAC7B,OAAXnD,IACFA,EAASN,KAAKW,SAAS+C,GAAGpD,GAC1BA,EAAShC,EAAKyC,iBAAiBf,KAAKJ,WAAYU,EAAQN,KAAKiB,gBAE/D,IAAIM,EAAOjD,EAAKmB,OAAOgE,EAAS,OAAQ,MAIxC,OAHa,OAATlC,IACFA,EAAOvB,KAAKS,OAAOiD,GAAGnC,IAEjB,CACLjB,OAAQA,EACRuD,KAAMvF,EAAKmB,OAAOgE,EAAS,eAAgB,MAC3CU,OAAQ7F,EAAKmB,OAAOgE,EAAS,iBAAkB,MAC/ClC,KAAMA,EAEhB,CACA,CAEI,MAAO,CACLjB,OAAQ,KACRuD,KAAM,KACNM,OAAQ,KACR5C,KAAM,KAET,EAMHhC,EAAuBkC,UAAU4G,wBAC/B,WACE,QAAKrI,KAAKH,iBAGHG,KAAKH,eAAe2D,QAAUxD,KAAKW,SAAS2H,SAChDtI,KAAKH,eAAe0I,MAAK,SAAUC,GAAM,OAAa,MAANA,KACpD,EAOHjJ,EAAuBkC,UAAUgH,iBAC/B,SAA4ChE,EAASiE,GACnD,IAAK1I,KAAKH,eACR,OAAO,KAGT,IAAIuC,EAAQpC,KAAK+D,iBAAiBU,GAClC,GAAIrC,GAAS,EACX,OAAOpC,KAAKH,eAAeuC,GAG7B,IAKI8D,EALAxB,EAAiBD,EAMrB,GALuB,MAAnBzE,KAAKJ,aACP8E,EAAiBpG,EAAKkC,SAASR,KAAKJ,WAAY8E,IAI3B,MAAnB1E,KAAKJ,aACDsG,EAAM5H,EAAKqK,SAAS3I,KAAKJ,aAAc,CAK7C,IAAIgJ,EAAiBlE,EAAemE,QAAQ,aAAc,IAC1D,GAAkB,QAAd3C,EAAI4C,QACD9I,KAAKW,SAASgE,IAAIiE,GACvB,OAAO5I,KAAKH,eAAeG,KAAKW,SAASiE,QAAQgE,IAGnD,KAAM1C,EAAI6C,MAAoB,KAAZ7C,EAAI6C,OACf/I,KAAKW,SAASgE,IAAI,IAAMD,GAC7B,OAAO1E,KAAKH,eAAeG,KAAKW,SAASiE,QAAQ,IAAMF,GAE/D,CAMI,GAAIgE,EACF,OAAO,KAGP,MAAM,IAAIxI,MAAM,IAAMwE,EAAiB,6BAE1C,EAyBHnF,EAAuBkC,UAAUuH,qBAC/B,SAAgDpF,GAC9C,IAAItD,EAAShC,EAAKmB,OAAOmE,EAAO,UAEhC,IADAtD,EAASN,KAAK+D,iBAAiBzD,IAClB,EACX,MAAO,CACLuD,KAAM,KACNM,OAAQ,KACRE,WAAY,MAIhB,IAAIP,EAAS,CACXxD,OAAQA,EACRe,aAAc/C,EAAKmB,OAAOmE,EAAO,QACjCtC,eAAgBhD,EAAKmB,OAAOmE,EAAO,WAGjCxB,EAAQpC,KAAKgE,aACfF,EACA9D,KAAKkD,kBACL,eACA,iBACA5E,EAAK2F,2BACL3F,EAAKmB,OAAOmE,EAAO,OAAQ5E,EAAkB0D,uBAG/C,GAAIN,GAAS,EAAG,CACd,IAAIqB,EAAUzD,KAAKkD,kBAAkBd,GAErC,GAAIqB,EAAQnD,SAAWwD,EAAOxD,OAC5B,MAAO,CACLuD,KAAMvF,EAAKmB,OAAOgE,EAAS,gBAAiB,MAC5CU,OAAQ7F,EAAKmB,OAAOgE,EAAS,kBAAmB,MAChDY,WAAY/F,EAAKmB,OAAOgE,EAAS,sBAAuB,MAGlE,CAEI,MAAO,CACLI,KAAM,KACNM,OAAQ,KACRE,WAAY,KAEf,EAE2BC,EAAA/E,uBAAGA,EAmGjCD,EAAyBmC,UAAYE,OAAO4C,OAAOvF,EAAkByC,WACrEnC,EAAyBmC,UAAUwH,YAAcjK,EAKjDM,EAAyBmC,UAAUxB,SAAW,EAK9C0B,OAAOC,eAAetC,EAAyBmC,UAAW,UAAW,CACnEM,IAAK,WAEH,IADA,IAAIrC,EAAU,GACL4D,EAAI,EAAGA,EAAItD,KAAKiG,UAAUzC,OAAQF,IACzC,IAAK,IAAIyC,EAAI,EAAGA,EAAI/F,KAAKiG,UAAU3C,GAAGkB,SAAS9E,QAAQ8D,OAAQuC,IAC7DrG,EAAQ0E,KAAKpE,KAAKiG,UAAU3C,GAAGkB,SAAS9E,QAAQqG,IAGpD,OAAOrG,CACX,IAsBAJ,EAAyBmC,UAAU0G,oBACjC,SAAsDvE,GACpD,IAAIE,EAAS,CACX3C,cAAe7C,EAAKmB,OAAOmE,EAAO,QAClCxC,gBAAiB9C,EAAKmB,OAAOmE,EAAO,WAKlCsF,EAAe1K,EAAasJ,OAAOhE,EAAQ9D,KAAKiG,WAClD,SAASnC,EAAQqF,GACf,IAAIC,EAAMtF,EAAO3C,cAAgBgI,EAAQ7C,gBAAgBnF,cACzD,OAAIiI,GAIItF,EAAO1C,gBACP+H,EAAQ7C,gBAAgBlF,eACxC,IACQ+H,EAAUnJ,KAAKiG,UAAUiD,GAE7B,OAAKC,EASEA,EAAQ3E,SAAS2D,oBAAoB,CAC1CtE,KAAMC,EAAO3C,eACVgI,EAAQ7C,gBAAgBnF,cAAgB,GAC3CgD,OAAQL,EAAO1C,iBACZ+H,EAAQ7C,gBAAgBnF,gBAAkB2C,EAAO3C,cAC/CgI,EAAQ7C,gBAAgBlF,gBAAkB,EAC1C,GACLiI,KAAMzF,EAAMyF,OAfL,CACL/I,OAAQ,KACRuD,KAAM,KACNM,OAAQ,KACR5C,KAAM,KAaX,EAMHjC,EAAyBmC,UAAU4G,wBACjC,WACE,OAAOrI,KAAKiG,UAAUqD,OAAM,SAAUxI,GACpC,OAAOA,EAAE0D,SAAS6D,yBACxB,GACG,EAOH/I,EAAyBmC,UAAUgH,iBACjC,SAAmDhE,EAASiE,GAC1D,IAAK,IAAIpF,EAAI,EAAGA,EAAItD,KAAKiG,UAAUzC,OAAQF,IAAK,CAC9C,IAEIiG,EAFUvJ,KAAKiG,UAAU3C,GAEPkB,SAASiE,iBAAiBhE,GAAS,GACzD,GAAI8E,GAAuB,KAAZA,EACb,OAAOA,CAEf,CACI,GAAIb,EACF,OAAO,KAGP,MAAM,IAAIxI,MAAM,IAAMuE,EAAU,6BAEnC,EAoBHnF,EAAyBmC,UAAUuH,qBACjC,SAAuDpF,GACrD,IAAK,IAAIN,EAAI,EAAGA,EAAItD,KAAKiG,UAAUzC,OAAQF,IAAK,CAC9C,IAAI6F,EAAUnJ,KAAKiG,UAAU3C,GAI7B,IAAyE,IAArE6F,EAAQ3E,SAAST,iBAAiBzF,EAAKmB,OAAOmE,EAAO,WAAzD,CAGA,IAAI4F,EAAoBL,EAAQ3E,SAASwE,qBAAqBpF,GAC9D,GAAI4F,EASF,MARU,CACR3F,KAAM2F,EAAkB3F,MACrBsF,EAAQ7C,gBAAgBnF,cAAgB,GAC3CgD,OAAQqF,EAAkBrF,QACvBgF,EAAQ7C,gBAAgBnF,gBAAkBqI,EAAkB3F,KAC1DsF,EAAQ7C,gBAAgBlF,gBAAkB,EAC1C,GATf,CAaA,CAEI,MAAO,CACLyC,KAAM,KACNM,OAAQ,KAEX,EAOH7E,EAAyBmC,UAAUO,eACjC,SAAgDG,EAAMI,GACpDvC,KAAK0B,oBAAsB,GAC3B1B,KAAKiC,mBAAqB,GAC1B,IAAK,IAAIqB,EAAI,EAAGA,EAAItD,KAAKiG,UAAUzC,OAAQF,IAGzC,IAFA,IAAI6F,EAAUnJ,KAAKiG,UAAU3C,GACzBmG,EAAkBN,EAAQ3E,SAASvB,mBAC9B8C,EAAI,EAAGA,EAAI0D,EAAgBjG,OAAQuC,IAAK,CAC/C,IAAItC,EAAUgG,EAAgB1D,GAE1BzF,EAAS6I,EAAQ3E,SAAS7D,SAAS+C,GAAGD,EAAQnD,QACpC,OAAXA,IACDA,EAAShC,EAAKyC,iBAAiBoI,EAAQ3E,SAAS5E,WAAYU,EAAQN,KAAKiB,gBAE3EjB,KAAKW,SAAS+I,IAAIpJ,GAClBA,EAASN,KAAKW,SAASiE,QAAQtE,GAE/B,IAAIiB,EAAO,KACPkC,EAAQlC,OACVA,EAAO4H,EAAQ3E,SAAS/D,OAAOiD,GAAGD,EAAQlC,MAC1CvB,KAAKS,OAAOiJ,IAAInI,GAChBA,EAAOvB,KAAKS,OAAOmE,QAAQrD,IAO7B,IAAIoI,EAAkB,CACpBrJ,OAAQA,EACRa,cAAesC,EAAQtC,eACpBgI,EAAQ7C,gBAAgBnF,cAAgB,GAC3CC,gBAAiBqC,EAAQrC,iBACtB+H,EAAQ7C,gBAAgBnF,gBAAkBsC,EAAQtC,cACjDgI,EAAQ7C,gBAAgBlF,gBAAkB,EAC1C,GACJC,aAAcoC,EAAQpC,aACtBC,eAAgBmC,EAAQnC,eACxBC,KAAMA,GAGRvB,KAAK0B,oBAAoB0C,KAAKuF,GACc,iBAAjCA,EAAgBtI,cACzBrB,KAAKiC,mBAAmBmC,KAAKuF,EAEvC,CAGI7K,EAAUkB,KAAK0B,oBAAqBpD,EAAK8J,qCACzCtJ,EAAUkB,KAAKiC,mBAAoB3D,EAAK2F,2BACzC,EAEHK,EAAAhF,yBAAmCA","x_google_ignoreList":[0]}

package/dist/utils/esm/node_modules/source-map-js/lib/source-map-generator.js

@@ -0,0 +1,2 @@
+import{__exports as e}from"../../../_virtual/source-map-generator.js";import"./base64-vlq.js";import"./util.js";import"./array-set.js";import"./mapping-list.js";import{__exports as n}from"../../../_virtual/base64-vlq.js";import{__exports as o}from"../../../_virtual/util.js";import{__exports as t}from"../../../_virtual/array-set.js";import{__exports as r}from"../../../_virtual/mapping-list.js";var i=n,s=o,l=t.ArraySet,a=r.MappingList;function u(e){e||(e={}),this._file=s.getArg(e,"file",null),this._sourceRoot=s.getArg(e,"sourceRoot",null),this._skipValidation=s.getArg(e,"skipValidation",!1),this._ignoreInvalidMapping=s.getArg(e,"ignoreInvalidMapping",!1),this._sources=new l,this._names=new l,this._mappings=new a,this._sourcesContents=null}u.prototype._version=3,u.fromSourceMap=function(e,n){var o=e.sourceRoot,t=new u(Object.assign(n||{},{file:e.file,sourceRoot:o}));return e.eachMapping((function(e){var n={generated:{line:e.generatedLine,column:e.generatedColumn}};null!=e.source&&(n.source=e.source,null!=o&&(n.source=s.relative(o,n.source)),n.original={line:e.originalLine,column:e.originalColumn},null!=e.name&&(n.name=e.name)),t.addMapping(n)})),e.sources.forEach((function(n){var r=n;null!==o&&(r=s.relative(o,n)),t._sources.has(r)||t._sources.add(r);var i=e.sourceContentFor(n);null!=i&&t.setSourceContent(n,i)})),t},u.prototype.addMapping=function(e){var n=s.getArg(e,"generated"),o=s.getArg(e,"original",null),t=s.getArg(e,"source",null),r=s.getArg(e,"name",null);(this._skipValidation||!1!==this._validateMapping(n,o,t,r))&&(null!=t&&(t=String(t),this._sources.has(t)||this._sources.add(t)),null!=r&&(r=String(r),this._names.has(r)||this._names.add(r)),this._mappings.add({generatedLine:n.line,generatedColumn:n.column,originalLine:null!=o&&o.line,originalColumn:null!=o&&o.column,source:t,name:r}))},u.prototype.setSourceContent=function(e,n){var o=e;null!=this._sourceRoot&&(o=s.relative(this._sourceRoot,o)),null!=n?(this._sourcesContents||(this._sourcesContents=Object.create(null)),this._sourcesContents[s.toSetString(o)]=n):this._sourcesContents&&(delete this._sourcesContents[s.toSetString(o)],0===Object.keys(this._sourcesContents).length&&(this._sourcesContents=null))},u.prototype.applySourceMap=function(e,n,o){var t=n;if(null==n){if(null==e.file)throw new Error('SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, or the source map\'s "file" property. Both were omitted.');t=e.file}var r=this._sourceRoot;null!=r&&(t=s.relative(r,t));var i=new l,a=new l;this._mappings.unsortedForEach((function(n){if(n.source===t&&null!=n.originalLine){var l=e.originalPositionFor({line:n.originalLine,column:n.originalColumn});null!=l.source&&(n.source=l.source,null!=o&&(n.source=s.join(o,n.source)),null!=r&&(n.source=s.relative(r,n.source)),n.originalLine=l.line,n.originalColumn=l.column,null!=l.name&&(n.name=l.name))}var u=n.source;null==u||i.has(u)||i.add(u);var c=n.name;null==c||a.has(c)||a.add(c)}),this),this._sources=i,this._names=a,e.sources.forEach((function(n){var t=e.sourceContentFor(n);null!=t&&(null!=o&&(n=s.join(o,n)),null!=r&&(n=s.relative(r,n)),this.setSourceContent(n,t))}),this)},u.prototype._validateMapping=function(e,n,o,t){if(n&&"number"!=typeof n.line&&"number"!=typeof n.column){var r="original.line and original.column are not numbers -- you probably meant to omit the original mapping entirely and only map the generated position. If so, pass null for the original mapping instead of an object with empty or null values.";if(this._ignoreInvalidMapping)return"undefined"!=typeof console&&console.warn&&console.warn(r),!1;throw new Error(r)}if((!(e&&"line"in e&&"column"in e&&e.line>0&&e.column>=0)||n||o||t)&&!(e&&"line"in e&&"column"in e&&n&&"line"in n&&"column"in n&&e.line>0&&e.column>=0&&n.line>0&&n.column>=0&&o)){r="Invalid mapping: "+JSON.stringify({generated:e,source:o,original:n,name:t});if(this._ignoreInvalidMapping)return"undefined"!=typeof console&&console.warn&&console.warn(r),!1;throw new Error(r)}},u.prototype._serializeMappings=function(){for(var e,n,o,t,r=0,l=1,a=0,u=0,c=0,p=0,g="",m=this._mappings.toArray(),h=0,_=m.length;h<_;h++){if(e="",(n=m[h]).generatedLine!==l)for(r=0;n.generatedLine!==l;)e+=";",l++;else if(h>0){if(!s.compareByGeneratedPositionsInflated(n,m[h-1]))continue;e+=","}e+=i.encode(n.generatedColumn-r),r=n.generatedColumn,null!=n.source&&(t=this._sources.indexOf(n.source),e+=i.encode(t-p),p=t,e+=i.encode(n.originalLine-1-u),u=n.originalLine-1,e+=i.encode(n.originalColumn-a),a=n.originalColumn,null!=n.name&&(o=this._names.indexOf(n.name),e+=i.encode(o-c),c=o)),g+=e}return g},u.prototype._generateSourcesContent=function(e,n){return e.map((function(e){if(!this._sourcesContents)return null;null!=n&&(e=s.relative(n,e));var o=s.toSetString(e);return Object.prototype.hasOwnProperty.call(this._sourcesContents,o)?this._sourcesContents[o]:null}),this)},u.prototype.toJSON=function(){var e={version:this._version,sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};return null!=this._file&&(e.file=this._file),null!=this._sourceRoot&&(e.sourceRoot=this._sourceRoot),this._sourcesContents&&(e.sourcesContent=this._generateSourcesContent(e.sources,e.sourceRoot)),e},u.prototype.toString=function(){return JSON.stringify(this.toJSON())},e.SourceMapGenerator=u;export{e as default};
+//# sourceMappingURL=source-map-generator.js.map

package/dist/utils/esm/node_modules/source-map-js/lib/source-map-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source-map-generator.js","sources":["../../../../../../node_modules/source-map-js/lib/source-map-generator.js"],"sourcesContent":["/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n *   - file: The filename of the generated source.\n *   - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n  if (!aArgs) {\n    aArgs = {};\n  }\n  this._file = util.getArg(aArgs, 'file', null);\n  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n  this._ignoreInvalidMapping = util.getArg(aArgs, 'ignoreInvalidMapping', false);\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n  this._mappings = new MappingList();\n  this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer, generatorOps) {\n    var sourceRoot = aSourceMapConsumer.sourceRoot;\n    var generator = new SourceMapGenerator(Object.assign(generatorOps || {}, {\n      file: aSourceMapConsumer.file,\n      sourceRoot: sourceRoot\n    }));\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      var newMapping = {\n        generated: {\n          line: mapping.generatedLine,\n          column: mapping.generatedColumn\n        }\n      };\n\n      if (mapping.source != null) {\n        newMapping.source = mapping.source;\n        if (sourceRoot != null) {\n          newMapping.source = util.relative(sourceRoot, newMapping.source);\n        }\n\n        newMapping.original = {\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        };\n\n        if (mapping.name != null) {\n          newMapping.name = mapping.name;\n        }\n      }\n\n      generator.addMapping(newMapping);\n    });\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var sourceRelative = sourceFile;\n      if (sourceRoot !== null) {\n        sourceRelative = util.relative(sourceRoot, sourceFile);\n      }\n\n      if (!generator._sources.has(sourceRelative)) {\n        generator._sources.add(sourceRelative);\n      }\n\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        generator.setSourceContent(sourceFile, content);\n      }\n    });\n    return generator;\n  };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n *   - generated: An object with the generated line and column positions.\n *   - original: An object with the original line and column positions.\n *   - source: The original source file (relative to the sourceRoot).\n *   - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\n    var generated = util.getArg(aArgs, 'generated');\n    var original = util.getArg(aArgs, 'original', null);\n    var source = util.getArg(aArgs, 'source', null);\n    var name = util.getArg(aArgs, 'name', null);\n\n    if (!this._skipValidation) {\n      if (this._validateMapping(generated, original, source, name) === false) {\n        return;\n      }\n    }\n\n    if (source != null) {\n      source = String(source);\n      if (!this._sources.has(source)) {\n        this._sources.add(source);\n      }\n    }\n\n    if (name != null) {\n      name = String(name);\n      if (!this._names.has(name)) {\n        this._names.add(name);\n      }\n    }\n\n    this._mappings.add({\n      generatedLine: generated.line,\n      generatedColumn: generated.column,\n      originalLine: original != null && original.line,\n      originalColumn: original != null && original.column,\n      source: source,\n      name: name\n    });\n  };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n    var source = aSourceFile;\n    if (this._sourceRoot != null) {\n      source = util.relative(this._sourceRoot, source);\n    }\n\n    if (aSourceContent != null) {\n      // Add the source content to the _sourcesContents map.\n      // Create a new _sourcesContents map if the property is null.\n      if (!this._sourcesContents) {\n        this._sourcesContents = Object.create(null);\n      }\n      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n    } else if (this._sourcesContents) {\n      // Remove the source file from the _sourcesContents map.\n      // If the _sourcesContents map is empty, set the property to null.\n      delete this._sourcesContents[util.toSetString(source)];\n      if (Object.keys(this._sourcesContents).length === 0) {\n        this._sourcesContents = null;\n      }\n    }\n  };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n *        If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n *        to be applied. If relative, it is relative to the SourceMapConsumer.\n *        This parameter is needed when the two source maps aren't in the same\n *        directory, and the source map to be applied contains relative source\n *        paths. If so, those relative source paths need to be rewritten\n *        relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n    var sourceFile = aSourceFile;\n    // If aSourceFile is omitted, we will use the file property of the SourceMap\n    if (aSourceFile == null) {\n      if (aSourceMapConsumer.file == null) {\n        throw new Error(\n          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n          'or the source map\\'s \"file\" property. Both were omitted.'\n        );\n      }\n      sourceFile = aSourceMapConsumer.file;\n    }\n    var sourceRoot = this._sourceRoot;\n    // Make \"sourceFile\" relative if an absolute Url is passed.\n    if (sourceRoot != null) {\n      sourceFile = util.relative(sourceRoot, sourceFile);\n    }\n    // Applying the SourceMap can add and remove items from the sources and\n    // the names array.\n    var newSources = new ArraySet();\n    var newNames = new ArraySet();\n\n    // Find mappings for the \"sourceFile\"\n    this._mappings.unsortedForEach(function (mapping) {\n      if (mapping.source === sourceFile && mapping.originalLine != null) {\n        // Check if it can be mapped by the source map, then update the mapping.\n        var original = aSourceMapConsumer.originalPositionFor({\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        });\n        if (original.source != null) {\n          // Copy mapping\n          mapping.source = original.source;\n          if (aSourceMapPath != null) {\n            mapping.source = util.join(aSourceMapPath, mapping.source)\n          }\n          if (sourceRoot != null) {\n            mapping.source = util.relative(sourceRoot, mapping.source);\n          }\n          mapping.originalLine = original.line;\n          mapping.originalColumn = original.column;\n          if (original.name != null) {\n            mapping.name = original.name;\n          }\n        }\n      }\n\n      var source = mapping.source;\n      if (source != null && !newSources.has(source)) {\n        newSources.add(source);\n      }\n\n      var name = mapping.name;\n      if (name != null && !newNames.has(name)) {\n        newNames.add(name);\n      }\n\n    }, this);\n    this._sources = newSources;\n    this._names = newNames;\n\n    // Copy sourcesContents of applied map.\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aSourceMapPath != null) {\n          sourceFile = util.join(aSourceMapPath, sourceFile);\n        }\n        if (sourceRoot != null) {\n          sourceFile = util.relative(sourceRoot, sourceFile);\n        }\n        this.setSourceContent(sourceFile, content);\n      }\n    }, this);\n  };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n *   1. Just the generated position.\n *   2. The Generated position, original position, and original source.\n *   3. Generated and original position, original source, as well as a name\n *      token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\n    // When aOriginal is truthy but has empty values for .line and .column,\n    // it is most likely a programmer error. In this case we throw a very\n    // specific error message to try to guide them the right way.\n    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n      var message = 'original.line and original.column are not numbers -- you probably meant to omit ' +\n      'the original mapping entirely and only map the generated position. If so, pass ' +\n      'null for the original mapping instead of an object with empty or null values.'\n\n      if (this._ignoreInvalidMapping) {\n        if (typeof console !== 'undefined' && console.warn) {\n          console.warn(message);\n        }\n        return false;\n      } else {\n        throw new Error(message);\n      }\n    }\n\n    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      var message = 'Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\n      });\n\n      if (this._ignoreInvalidMapping) {\n        if (typeof console !== 'undefined' && console.warn) {\n          console.warn(message);\n        }\n        return false;\n      } else {\n        throw new Error(message)\n      }\n    }\n  };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n  function SourceMapGenerator_serializeMappings() {\n    var previousGeneratedColumn = 0;\n    var previousGeneratedLine = 1;\n    var previousOriginalColumn = 0;\n    var previousOriginalLine = 0;\n    var previousName = 0;\n    var previousSource = 0;\n    var result = '';\n    var next;\n    var mapping;\n    var nameIdx;\n    var sourceIdx;\n\n    var mappings = this._mappings.toArray();\n    for (var i = 0, len = mappings.length; i < len; i++) {\n      mapping = mappings[i];\n      next = ''\n\n      if (mapping.generatedLine !== previousGeneratedLine) {\n        previousGeneratedColumn = 0;\n        while (mapping.generatedLine !== previousGeneratedLine) {\n          next += ';';\n          previousGeneratedLine++;\n        }\n      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\n      previousGeneratedColumn = mapping.generatedColumn;\n\n      if (mapping.source != null) {\n        sourceIdx = this._sources.indexOf(mapping.source);\n        next += base64VLQ.encode(sourceIdx - previousSource);\n        previousSource = sourceIdx;\n\n        // lines are stored 0-based in SourceMap spec version 3\n        next += base64VLQ.encode(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\n        previousOriginalColumn = mapping.originalColumn;\n\n        if (mapping.name != null) {\n          nameIdx = this._names.indexOf(mapping.name);\n          next += base64VLQ.encode(nameIdx - previousName);\n          previousName = nameIdx;\n        }\n      }\n\n      result += next;\n    }\n\n    return result;\n  };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n    return aSources.map(function (source) {\n      if (!this._sourcesContents) {\n        return null;\n      }\n      if (aSourceRoot != null) {\n        source = util.relative(aSourceRoot, source);\n      }\n      var key = util.toSetString(source);\n      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  function SourceMapGenerator_toJSON() {\n    var map = {\n      version: this._version,\n      sources: this._sources.toArray(),\n      names: this._names.toArray(),\n      mappings: this._serializeMappings()\n    };\n    if (this._file != null) {\n      map.file = this._file;\n    }\n    if (this._sourceRoot != null) {\n      map.sourceRoot = this._sourceRoot;\n    }\n    if (this._sourcesContents) {\n      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n"],"names":["base64VLQ","require$$0","util","require$$1","ArraySet","require$$2","MappingList","require$$3","SourceMapGenerator","aArgs","this","_file","getArg","_sourceRoot","_skipValidation","_ignoreInvalidMapping","_sources","_names","_mappings","_sourcesContents","prototype","_version","fromSourceMap","aSourceMapConsumer","generatorOps","sourceRoot","generator","Object","assign","file","eachMapping","mapping","newMapping","generated","line","generatedLine","column","generatedColumn","source","relative","original","originalLine","originalColumn","name","addMapping","sources","forEach","sourceFile","sourceRelative","has","add","content","sourceContentFor","setSourceContent","_validateMapping","String","aSourceFile","aSourceContent","create","toSetString","keys","length","applySourceMap","aSourceMapPath","Error","newSources","newNames","unsortedForEach","originalPositionFor","join","aGenerated","aOriginal","aSource","aName","message","console","warn","JSON","stringify","_serializeMappings","next","nameIdx","sourceIdx","previousGeneratedColumn","previousGeneratedLine","previousOriginalColumn","previousOriginalLine","previousName","previousSource","result","mappings","toArray","i","len","compareByGeneratedPositionsInflated","encode","indexOf","_generateSourcesContent","aSources","aSourceRoot","map","key","hasOwnProperty","call","toJSON","version","names","sourcesContent","toString","sourceMapGenerator"],"mappings":"4YAOA,IAAIA,EAAYC,EACZC,EAAOC,EACPC,EAAWC,EAAuBD,SAClCE,EAAcC,EAA0BD,YAU5C,SAASE,EAAmBC,GACrBA,IACHA,EAAQ,CAAE,GAEZC,KAAKC,MAAQT,EAAKU,OAAOH,EAAO,OAAQ,MACxCC,KAAKG,YAAcX,EAAKU,OAAOH,EAAO,aAAc,MACpDC,KAAKI,gBAAkBZ,EAAKU,OAAOH,EAAO,kBAAkB,GAC5DC,KAAKK,sBAAwBb,EAAKU,OAAOH,EAAO,wBAAwB,GACxEC,KAAKM,SAAW,IAAIZ,EACpBM,KAAKO,OAAS,IAAIb,EAClBM,KAAKQ,UAAY,IAAIZ,EACrBI,KAAKS,iBAAmB,IAC1B,CAEAX,EAAmBY,UAAUC,SAAW,EAOxCb,EAAmBc,cACjB,SAA0CC,EAAoBC,GAC5D,IAAIC,EAAaF,EAAmBE,WAChCC,EAAY,IAAIlB,EAAmBmB,OAAOC,OAAOJ,GAAgB,GAAI,CACvEK,KAAMN,EAAmBM,KACzBJ,WAAYA,KA2Cd,OAzCAF,EAAmBO,aAAY,SAAUC,GACvC,IAAIC,EAAa,CACfC,UAAW,CACTC,KAAMH,EAAQI,cACdC,OAAQL,EAAQM,kBAIE,MAAlBN,EAAQO,SACVN,EAAWM,OAASP,EAAQO,OACV,MAAdb,IACFO,EAAWM,OAASpC,EAAKqC,SAASd,EAAYO,EAAWM,SAG3DN,EAAWQ,SAAW,CACpBN,KAAMH,EAAQU,aACdL,OAAQL,EAAQW,gBAGE,MAAhBX,EAAQY,OACVX,EAAWW,KAAOZ,EAAQY,OAI9BjB,EAAUkB,WAAWZ,EAC3B,IACIT,EAAmBsB,QAAQC,SAAQ,SAAUC,GAC3C,IAAIC,EAAiBD,EACF,OAAftB,IACFuB,EAAiB9C,EAAKqC,SAASd,EAAYsB,IAGxCrB,EAAUV,SAASiC,IAAID,IAC1BtB,EAAUV,SAASkC,IAAIF,GAGzB,IAAIG,EAAU5B,EAAmB6B,iBAAiBL,GACnC,MAAXI,GACFzB,EAAU2B,iBAAiBN,EAAYI,EAE/C,IACWzB,CACR,EAYHlB,EAAmBY,UAAUwB,WAC3B,SAAuCnC,GACrC,IAAIwB,EAAY/B,EAAKU,OAAOH,EAAO,aAC/B+B,EAAWtC,EAAKU,OAAOH,EAAO,WAAY,MAC1C6B,EAASpC,EAAKU,OAAOH,EAAO,SAAU,MACtCkC,EAAOzC,EAAKU,OAAOH,EAAO,OAAQ,OAEjCC,KAAKI,kBACyD,IAA7DJ,KAAK4C,iBAAiBrB,EAAWO,EAAUF,EAAQK,MAK3C,MAAVL,IACFA,EAASiB,OAAOjB,GACX5B,KAAKM,SAASiC,IAAIX,IACrB5B,KAAKM,SAASkC,IAAIZ,IAIV,MAARK,IACFA,EAAOY,OAAOZ,GACTjC,KAAKO,OAAOgC,IAAIN,IACnBjC,KAAKO,OAAOiC,IAAIP,IAIpBjC,KAAKQ,UAAUgC,IAAI,CACjBf,cAAeF,EAAUC,KACzBG,gBAAiBJ,EAAUG,OAC3BK,aAA0B,MAAZD,GAAoBA,EAASN,KAC3CQ,eAA4B,MAAZF,GAAoBA,EAASJ,OAC7CE,OAAQA,EACRK,KAAMA,IAET,EAKHnC,EAAmBY,UAAUiC,iBAC3B,SAA6CG,EAAaC,GACxD,IAAInB,EAASkB,EACW,MAApB9C,KAAKG,cACPyB,EAASpC,EAAKqC,SAAS7B,KAAKG,YAAayB,IAGrB,MAAlBmB,GAGG/C,KAAKS,mBACRT,KAAKS,iBAAmBQ,OAAO+B,OAAO,OAExChD,KAAKS,iBAAiBjB,EAAKyD,YAAYrB,IAAWmB,GACzC/C,KAAKS,0BAGPT,KAAKS,iBAAiBjB,EAAKyD,YAAYrB,IACI,IAA9CX,OAAOiC,KAAKlD,KAAKS,kBAAkB0C,SACrCnD,KAAKS,iBAAmB,MAG7B,EAkBHX,EAAmBY,UAAU0C,eAC3B,SAA2CvC,EAAoBiC,EAAaO,GAC1E,IAAIhB,EAAaS,EAEjB,GAAmB,MAAfA,EAAqB,CACvB,GAA+B,MAA3BjC,EAAmBM,KACrB,MAAM,IAAImC,MACR,iJAIJjB,EAAaxB,EAAmBM,IACtC,CACI,IAAIJ,EAAaf,KAAKG,YAEJ,MAAdY,IACFsB,EAAa7C,EAAKqC,SAASd,EAAYsB,IAIzC,IAAIkB,EAAa,IAAI7D,EACjB8D,EAAW,IAAI9D,EAGnBM,KAAKQ,UAAUiD,iBAAgB,SAAUpC,GACvC,GAAIA,EAAQO,SAAWS,GAAsC,MAAxBhB,EAAQU,aAAsB,CAEjE,IAAID,EAAWjB,EAAmB6C,oBAAoB,CACpDlC,KAAMH,EAAQU,aACdL,OAAQL,EAAQW,iBAEK,MAAnBF,EAASF,SAEXP,EAAQO,OAASE,EAASF,OACJ,MAAlByB,IACFhC,EAAQO,OAASpC,EAAKmE,KAAKN,EAAgBhC,EAAQO,SAEnC,MAAdb,IACFM,EAAQO,OAASpC,EAAKqC,SAASd,EAAYM,EAAQO,SAErDP,EAAQU,aAAeD,EAASN,KAChCH,EAAQW,eAAiBF,EAASJ,OACb,MAAjBI,EAASG,OACXZ,EAAQY,KAAOH,EAASG,MAGpC,CAEM,IAAIL,EAASP,EAAQO,OACP,MAAVA,GAAmB2B,EAAWhB,IAAIX,IACpC2B,EAAWf,IAAIZ,GAGjB,IAAIK,EAAOZ,EAAQY,KACP,MAARA,GAAiBuB,EAASjB,IAAIN,IAChCuB,EAAShB,IAAIP,EAGhB,GAAEjC,MACHA,KAAKM,SAAWiD,EAChBvD,KAAKO,OAASiD,EAGd3C,EAAmBsB,QAAQC,SAAQ,SAAUC,GAC3C,IAAII,EAAU5B,EAAmB6B,iBAAiBL,GACnC,MAAXI,IACoB,MAAlBY,IACFhB,EAAa7C,EAAKmE,KAAKN,EAAgBhB,IAEvB,MAAdtB,IACFsB,EAAa7C,EAAKqC,SAASd,EAAYsB,IAEzCrC,KAAK2C,iBAAiBN,EAAYI,GAErC,GAAEzC,KACJ,EAaHF,EAAmBY,UAAUkC,iBAC3B,SAA4CgB,EAAYC,EAAWC,EACvBC,GAK1C,GAAIF,GAAuC,iBAAnBA,EAAUrC,MAAiD,iBAArBqC,EAAUnC,OAAqB,CAC3F,IAAIsC,EAAU,+OAId,GAAIhE,KAAKK,sBAIP,MAHuB,oBAAZ4D,SAA2BA,QAAQC,MAC5CD,QAAQC,KAAKF,IAER,EAEP,MAAM,IAAIV,MAAMU,EAExB,CAEI,MAAIJ,GAAc,SAAUA,GAAc,WAAYA,GAC/CA,EAAWpC,KAAO,GAAKoC,EAAWlC,QAAU,IAC3CmC,GAAcC,GAAYC,MAIzBH,GAAc,SAAUA,GAAc,WAAYA,GAC/CC,GAAa,SAAUA,GAAa,WAAYA,GAChDD,EAAWpC,KAAO,GAAKoC,EAAWlC,QAAU,GAC5CmC,EAAUrC,KAAO,GAAKqC,EAAUnC,QAAU,GAC1CoC,GAJP,CASCE,EAAU,oBAAsBG,KAAKC,UAAU,CACjD7C,UAAWqC,EACXhC,OAAQkC,EACRhC,SAAU+B,EACV5B,KAAM8B,IAGR,GAAI/D,KAAKK,sBAIP,MAHuB,oBAAZ4D,SAA2BA,QAAQC,MAC5CD,QAAQC,KAAKF,IAER,EAEP,MAAM,IAAIV,MAAMU,EAExB,CACG,EAMHlE,EAAmBY,UAAU2D,mBAC3B,WAcE,IAbA,IAOIC,EACAjD,EACAkD,EACAC,EAVAC,EAA0B,EAC1BC,EAAwB,EACxBC,EAAyB,EACzBC,EAAuB,EACvBC,EAAe,EACfC,EAAiB,EACjBC,EAAS,GAMTC,EAAWhF,KAAKQ,UAAUyE,UACrBC,EAAI,EAAGC,EAAMH,EAAS7B,OAAQ+B,EAAIC,EAAKD,IAAK,CAInD,GAFAZ,EAAO,IADPjD,EAAU2D,EAASE,IAGPzD,gBAAkBiD,EAE5B,IADAD,EAA0B,EACnBpD,EAAQI,gBAAkBiD,GAC/BJ,GAAQ,IACRI,SAIF,GAAIQ,EAAI,EAAG,CACT,IAAK1F,EAAK4F,oCAAoC/D,EAAS2D,EAASE,EAAI,IAClE,SAEFZ,GAAQ,GAClB,CAGMA,GAAQhF,EAAU+F,OAAOhE,EAAQM,gBACJ8C,GAC7BA,EAA0BpD,EAAQM,gBAEZ,MAAlBN,EAAQO,SACV4C,EAAYxE,KAAKM,SAASgF,QAAQjE,EAAQO,QAC1C0C,GAAQhF,EAAU+F,OAAOb,EAAYM,GACrCA,EAAiBN,EAGjBF,GAAQhF,EAAU+F,OAAOhE,EAAQU,aAAe,EACnB6C,GAC7BA,EAAuBvD,EAAQU,aAAe,EAE9CuC,GAAQhF,EAAU+F,OAAOhE,EAAQW,eACJ2C,GAC7BA,EAAyBtD,EAAQW,eAEb,MAAhBX,EAAQY,OACVsC,EAAUvE,KAAKO,OAAO+E,QAAQjE,EAAQY,MACtCqC,GAAQhF,EAAU+F,OAAOd,EAAUM,GACnCA,EAAeN,IAInBQ,GAAUT,CAChB,CAEI,OAAOS,CACR,EAEHjF,EAAmBY,UAAU6E,wBAC3B,SAAmDC,EAAUC,GAC3D,OAAOD,EAASE,KAAI,SAAU9D,GAC5B,IAAK5B,KAAKS,iBACR,OAAO,KAEU,MAAfgF,IACF7D,EAASpC,EAAKqC,SAAS4D,EAAa7D,IAEtC,IAAI+D,EAAMnG,EAAKyD,YAAYrB,GAC3B,OAAOX,OAAOP,UAAUkF,eAAeC,KAAK7F,KAAKS,iBAAkBkF,GAC/D3F,KAAKS,iBAAiBkF,GACtB,IACL,GAAE3F,KACJ,EAKHF,EAAmBY,UAAUoF,OAC3B,WACE,IAAIJ,EAAM,CACRK,QAAS/F,KAAKW,SACdwB,QAASnC,KAAKM,SAAS2E,UACvBe,MAAOhG,KAAKO,OAAO0E,UACnBD,SAAUhF,KAAKqE,sBAYjB,OAVkB,MAAdrE,KAAKC,QACPyF,EAAIvE,KAAOnB,KAAKC,OAEM,MAApBD,KAAKG,cACPuF,EAAI3E,WAAaf,KAAKG,aAEpBH,KAAKS,mBACPiF,EAAIO,eAAiBjG,KAAKuF,wBAAwBG,EAAIvD,QAASuD,EAAI3E,aAG9D2E,CACR,EAKH5F,EAAmBY,UAAUwF,SAC3B,WACE,OAAO/B,KAAKC,UAAUpE,KAAK8F,SAC5B,EAEHK,EAAArG,mBAA6BA","x_google_ignoreList":[0]}

package/dist/utils/esm/node_modules/source-map-js/lib/source-node.js

@@ -0,0 +1,2 @@
+import{__exports as n}from"../../../_virtual/source-node.js";import"./source-map-generator.js";import"./util.js";import{__exports as e}from"../../../_virtual/source-map-generator.js";import{__exports as r}from"../../../_virtual/util.js";var t=e.SourceMapGenerator,o=r,i=/(\r?\n)/,l="$$$isSourceNode$$$";function u(n,e,r,t,o){this.children=[],this.sourceContents={},this.line=null==n?null:n,this.column=null==e?null:e,this.source=null==r?null:r,this.name=null==o?null:o,this[l]=!0,null!=t&&this.add(t)}u.fromStringWithSourceMap=function(n,e,r){var t=new u,l=n.split(i),s=0,c=function(){return n()+(n()||"");function n(){return s<l.length?l[s++]:void 0}},a=1,h=0,d=null;return e.eachMapping((function(n){if(null!==d){if(!(a<n.generatedLine)){var e=(r=l[s]||"").substr(0,n.generatedColumn-h);return l[s]=r.substr(n.generatedColumn-h),h=n.generatedColumn,p(d,e),void(d=n)}p(d,c()),a++,h=0}for(;a<n.generatedLine;)t.add(c()),a++;if(h<n.generatedColumn){var r=l[s]||"";t.add(r.substr(0,n.generatedColumn)),l[s]=r.substr(n.generatedColumn),h=n.generatedColumn}d=n}),this),s<l.length&&(d&&p(d,c()),t.add(l.splice(s).join(""))),e.sources.forEach((function(n){var i=e.sourceContentFor(n);null!=i&&(null!=r&&(n=o.join(r,n)),t.setSourceContent(n,i))})),t;function p(n,e){if(null===n||void 0===n.source)t.add(e);else{var i=r?o.join(r,n.source):n.source;t.add(new u(n.originalLine,n.originalColumn,i,e,n.name))}}},u.prototype.add=function(n){if(Array.isArray(n))n.forEach((function(n){this.add(n)}),this);else{if(!n[l]&&"string"!=typeof n)throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+n);n&&this.children.push(n)}return this},u.prototype.prepend=function(n){if(Array.isArray(n))for(var e=n.length-1;e>=0;e--)this.prepend(n[e]);else{if(!n[l]&&"string"!=typeof n)throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+n);this.children.unshift(n)}return this},u.prototype.walk=function(n){for(var e,r=0,t=this.children.length;r<t;r++)(e=this.children[r])[l]?e.walk(n):""!==e&&n(e,{source:this.source,line:this.line,column:this.column,name:this.name})},u.prototype.join=function(n){var e,r,t=this.children.length;if(t>0){for(e=[],r=0;r<t-1;r++)e.push(this.children[r]),e.push(n);e.push(this.children[r]),this.children=e}return this},u.prototype.replaceRight=function(n,e){var r=this.children[this.children.length-1];return r[l]?r.replaceRight(n,e):"string"==typeof r?this.children[this.children.length-1]=r.replace(n,e):this.children.push("".replace(n,e)),this},u.prototype.setSourceContent=function(n,e){this.sourceContents[o.toSetString(n)]=e},u.prototype.walkSourceContents=function(n){for(var e=0,r=this.children.length;e<r;e++)this.children[e][l]&&this.children[e].walkSourceContents(n);var t=Object.keys(this.sourceContents);for(e=0,r=t.length;e<r;e++)n(o.fromSetString(t[e]),this.sourceContents[t[e]])},u.prototype.toString=function(){var n="";return this.walk((function(e){n+=e})),n},u.prototype.toStringWithSourceMap=function(n){var e={code:"",line:1,column:0},r=new t(n),o=!1,i=null,l=null,u=null,s=null;return this.walk((function(n,t){e.code+=n,null!==t.source&&null!==t.line&&null!==t.column?(i===t.source&&l===t.line&&u===t.column&&s===t.name||r.addMapping({source:t.source,original:{line:t.line,column:t.column},generated:{line:e.line,column:e.column},name:t.name}),i=t.source,l=t.line,u=t.column,s=t.name,o=!0):o&&(r.addMapping({generated:{line:e.line,column:e.column}}),i=null,o=!1);for(var c=0,a=n.length;c<a;c++)10===n.charCodeAt(c)?(e.line++,e.column=0,c+1===a?(i=null,o=!1):o&&r.addMapping({source:t.source,original:{line:t.line,column:t.column},generated:{line:e.line,column:e.column},name:t.name})):e.column++})),this.walkSourceContents((function(n,e){r.setSourceContent(n,e)})),{code:e.code,map:r}},n.SourceNode=u;export{n as default};
+//# sourceMappingURL=source-node.js.map

package/dist/utils/esm/node_modules/source-map-js/lib/source-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source-node.js","sources":["../../../../../../node_modules/source-map-js/lib/source-node.js"],"sourcesContent":["/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar util = require('./util');\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n *        generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n  this.children = [];\n  this.sourceContents = {};\n  this.line = aLine == null ? null : aLine;\n  this.column = aColumn == null ? null : aColumn;\n  this.source = aSource == null ? null : aSource;\n  this.name = aName == null ? null : aName;\n  this[isSourceNode] = true;\n  if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n *        SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n    // The SourceNode we want to fill with the generated code\n    // and the SourceMap\n    var node = new SourceNode();\n\n    // All even indices of this array are one line of the generated code,\n    // while all odd indices are the newlines between two adjacent lines\n    // (since `REGEX_NEWLINE` captures its match).\n    // Processed fragments are accessed by calling `shiftNextLine`.\n    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n    var remainingLinesIndex = 0;\n    var shiftNextLine = function() {\n      var lineContents = getNextLine();\n      // The last line of a file might not have a newline.\n      var newLine = getNextLine() || \"\";\n      return lineContents + newLine;\n\n      function getNextLine() {\n        return remainingLinesIndex < remainingLines.length ?\n            remainingLines[remainingLinesIndex++] : undefined;\n      }\n    };\n\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n    // The generate SourceNodes we need a code range.\n    // To extract it current and last mapping is used.\n    // Here we store the last mapping.\n    var lastMapping = null;\n\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      if (lastMapping !== null) {\n        // We add the code from \"lastMapping\" to \"mapping\":\n        // First check if there is a new line in between.\n        if (lastGeneratedLine < mapping.generatedLine) {\n          // Associate first line with \"lastMapping\"\n          addMappingWithCode(lastMapping, shiftNextLine());\n          lastGeneratedLine++;\n          lastGeneratedColumn = 0;\n          // The remaining code is added without mapping\n        } else {\n          // There is no new line in between.\n          // Associate the code between \"lastGeneratedColumn\" and\n          // \"mapping.generatedColumn\" with \"lastMapping\"\n          var nextLine = remainingLines[remainingLinesIndex] || '';\n          var code = nextLine.substr(0, mapping.generatedColumn -\n                                        lastGeneratedColumn);\n          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n                                              lastGeneratedColumn);\n          lastGeneratedColumn = mapping.generatedColumn;\n          addMappingWithCode(lastMapping, code);\n          // No more remaining code, continue\n          lastMapping = mapping;\n          return;\n        }\n      }\n      // We add the generated code until the first mapping\n      // to the SourceNode without any mapping.\n      // Each line is added as separate string.\n      while (lastGeneratedLine < mapping.generatedLine) {\n        node.add(shiftNextLine());\n        lastGeneratedLine++;\n      }\n      if (lastGeneratedColumn < mapping.generatedColumn) {\n        var nextLine = remainingLines[remainingLinesIndex] || '';\n        node.add(nextLine.substr(0, mapping.generatedColumn));\n        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n        lastGeneratedColumn = mapping.generatedColumn;\n      }\n      lastMapping = mapping;\n    }, this);\n    // We have processed all mappings.\n    if (remainingLinesIndex < remainingLines.length) {\n      if (lastMapping) {\n        // Associate the remaining code in the current line with \"lastMapping\"\n        addMappingWithCode(lastMapping, shiftNextLine());\n      }\n      // and add the remaining lines without any mapping\n      node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n    }\n\n    // Copy sourcesContent into SourceNode\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aRelativePath != null) {\n          sourceFile = util.join(aRelativePath, sourceFile);\n        }\n        node.setSourceContent(sourceFile, content);\n      }\n    });\n\n    return node;\n\n    function addMappingWithCode(mapping, code) {\n      if (mapping === null || mapping.source === undefined) {\n        node.add(code);\n      } else {\n        var source = aRelativePath\n          ? util.join(aRelativePath, mapping.source)\n          : mapping.source;\n        node.add(new SourceNode(mapping.originalLine,\n                                mapping.originalColumn,\n                                source,\n                                code,\n                                mapping.name));\n      }\n    }\n  };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n  if (Array.isArray(aChunk)) {\n    aChunk.forEach(function (chunk) {\n      this.add(chunk);\n    }, this);\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    if (aChunk) {\n      this.children.push(aChunk);\n    }\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n  if (Array.isArray(aChunk)) {\n    for (var i = aChunk.length-1; i >= 0; i--) {\n      this.prepend(aChunk[i]);\n    }\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    this.children.unshift(aChunk);\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n  var chunk;\n  for (var i = 0, len = this.children.length; i < len; i++) {\n    chunk = this.children[i];\n    if (chunk[isSourceNode]) {\n      chunk.walk(aFn);\n    }\n    else {\n      if (chunk !== '') {\n        aFn(chunk, { source: this.source,\n                     line: this.line,\n                     column: this.column,\n                     name: this.name });\n      }\n    }\n  }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n  var newChildren;\n  var i;\n  var len = this.children.length;\n  if (len > 0) {\n    newChildren = [];\n    for (i = 0; i < len-1; i++) {\n      newChildren.push(this.children[i]);\n      newChildren.push(aSep);\n    }\n    newChildren.push(this.children[i]);\n    this.children = newChildren;\n  }\n  return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n  var lastChild = this.children[this.children.length - 1];\n  if (lastChild[isSourceNode]) {\n    lastChild.replaceRight(aPattern, aReplacement);\n  }\n  else if (typeof lastChild === 'string') {\n    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n  }\n  else {\n    this.children.push(''.replace(aPattern, aReplacement));\n  }\n  return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n  };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n  function SourceNode_walkSourceContents(aFn) {\n    for (var i = 0, len = this.children.length; i < len; i++) {\n      if (this.children[i][isSourceNode]) {\n        this.children[i].walkSourceContents(aFn);\n      }\n    }\n\n    var sources = Object.keys(this.sourceContents);\n    for (var i = 0, len = sources.length; i < len; i++) {\n      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n    }\n  };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n  var str = \"\";\n  this.walk(function (chunk) {\n    str += chunk;\n  });\n  return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n  var generated = {\n    code: \"\",\n    line: 1,\n    column: 0\n  };\n  var map = new SourceMapGenerator(aArgs);\n  var sourceMappingActive = false;\n  var lastOriginalSource = null;\n  var lastOriginalLine = null;\n  var lastOriginalColumn = null;\n  var lastOriginalName = null;\n  this.walk(function (chunk, original) {\n    generated.code += chunk;\n    if (original.source !== null\n        && original.line !== null\n        && original.column !== null) {\n      if(lastOriginalSource !== original.source\n         || lastOriginalLine !== original.line\n         || lastOriginalColumn !== original.column\n         || lastOriginalName !== original.name) {\n        map.addMapping({\n          source: original.source,\n          original: {\n            line: original.line,\n            column: original.column\n          },\n          generated: {\n            line: generated.line,\n            column: generated.column\n          },\n          name: original.name\n        });\n      }\n      lastOriginalSource = original.source;\n      lastOriginalLine = original.line;\n      lastOriginalColumn = original.column;\n      lastOriginalName = original.name;\n      sourceMappingActive = true;\n    } else if (sourceMappingActive) {\n      map.addMapping({\n        generated: {\n          line: generated.line,\n          column: generated.column\n        }\n      });\n      lastOriginalSource = null;\n      sourceMappingActive = false;\n    }\n    for (var idx = 0, length = chunk.length; idx < length; idx++) {\n      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n        generated.line++;\n        generated.column = 0;\n        // Mappings end at eol\n        if (idx + 1 === length) {\n          lastOriginalSource = null;\n          sourceMappingActive = false;\n        } else if (sourceMappingActive) {\n          map.addMapping({\n            source: original.source,\n            original: {\n              line: original.line,\n              column: original.column\n            },\n            generated: {\n              line: generated.line,\n              column: generated.column\n            },\n            name: original.name\n          });\n        }\n      } else {\n        generated.column++;\n      }\n    }\n  });\n  this.walkSourceContents(function (sourceFile, sourceContent) {\n    map.setSourceContent(sourceFile, sourceContent);\n  });\n\n  return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n"],"names":["SourceMapGenerator","require$$0","util","require$$1","REGEX_NEWLINE","isSourceNode","SourceNode","aLine","aColumn","aSource","aChunks","aName","this","children","sourceContents","line","column","source","name","add","fromStringWithSourceMap","aGeneratedCode","aSourceMapConsumer","aRelativePath","node","remainingLines","split","remainingLinesIndex","shiftNextLine","getNextLine","length","undefined","lastGeneratedLine","lastGeneratedColumn","lastMapping","eachMapping","mapping","generatedLine","code","nextLine","substr","generatedColumn","addMappingWithCode","splice","join","sources","forEach","sourceFile","content","sourceContentFor","setSourceContent","originalLine","originalColumn","prototype","aChunk","Array","isArray","chunk","TypeError","push","prepend","i","unshift","walk","aFn","len","aSep","newChildren","replaceRight","aPattern","aReplacement","lastChild","replace","aSourceFile","aSourceContent","toSetString","walkSourceContents","Object","keys","fromSetString","toString","str","toStringWithSourceMap","aArgs","generated","map","sourceMappingActive","lastOriginalSource","lastOriginalLine","lastOriginalColumn","lastOriginalName","original","addMapping","idx","charCodeAt","sourceContent","sourceNode"],"mappings":"6OAOA,IAAIA,EAAqBC,EAAkCD,mBACvDE,EAAOC,EAIPC,EAAgB,UAQhBC,EAAe,qBAcnB,SAASC,EAAWC,EAAOC,EAASC,EAASC,EAASC,GACpDC,KAAKC,SAAW,GAChBD,KAAKE,eAAiB,CAAE,EACxBF,KAAKG,KAAgB,MAATR,EAAgB,KAAOA,EACnCK,KAAKI,OAAoB,MAAXR,EAAkB,KAAOA,EACvCI,KAAKK,OAAoB,MAAXR,EAAkB,KAAOA,EACvCG,KAAKM,KAAgB,MAATP,EAAgB,KAAOA,EACnCC,KAAKP,IAAgB,EACN,MAAXK,GAAiBE,KAAKO,IAAIT,EAChC,CAUAJ,EAAWc,wBACT,SAA4CC,EAAgBC,EAAoBC,GAG9E,IAAIC,EAAO,IAAIlB,EAMXmB,EAAiBJ,EAAeK,MAAMtB,GACtCuB,EAAsB,EACtBC,EAAgB,WAIlB,OAHmBC,KAELA,KAAiB,IAG/B,SAASA,IACP,OAAOF,EAAsBF,EAAeK,OACxCL,EAAeE,UAAyBI,CACpD,CACK,EAGGC,EAAoB,EAAGC,EAAsB,EAK7CC,EAAc,KAgElB,OA9DAZ,EAAmBa,aAAY,SAAUC,GACvC,GAAoB,OAAhBF,EAAsB,CAGxB,KAAIF,EAAoBI,EAAQC,eAMzB,CAIL,IACIC,GADAC,EAAWd,EAAeE,IAAwB,IAClCa,OAAO,EAAGJ,EAAQK,gBACRR,GAO9B,OANAR,EAAeE,GAAuBY,EAASC,OAAOJ,EAAQK,gBAC1BR,GACpCA,EAAsBG,EAAQK,gBAC9BC,EAAmBR,EAAaI,QAEhCJ,EAAcE,EAExB,CAlBUM,EAAmBR,EAAaN,KAChCI,IACAC,EAAsB,CAiBhC,CAIM,KAAOD,EAAoBI,EAAQC,eACjCb,EAAKL,IAAIS,KACTI,IAEF,GAAIC,EAAsBG,EAAQK,gBAAiB,CACjD,IAAIF,EAAWd,EAAeE,IAAwB,GACtDH,EAAKL,IAAIoB,EAASC,OAAO,EAAGJ,EAAQK,kBACpChB,EAAeE,GAAuBY,EAASC,OAAOJ,EAAQK,iBAC9DR,EAAsBG,EAAQK,eACtC,CACMP,EAAcE,CACf,GAAExB,MAECe,EAAsBF,EAAeK,SACnCI,GAEFQ,EAAmBR,EAAaN,KAGlCJ,EAAKL,IAAIM,EAAekB,OAAOhB,GAAqBiB,KAAK,MAI3DtB,EAAmBuB,QAAQC,SAAQ,SAAUC,GAC3C,IAAIC,EAAU1B,EAAmB2B,iBAAiBF,GACnC,MAAXC,IACmB,MAAjBzB,IACFwB,EAAa7C,EAAK0C,KAAKrB,EAAewB,IAExCvB,EAAK0B,iBAAiBH,EAAYC,GAE1C,IAEWxB,EAEP,SAASkB,EAAmBN,EAASE,GACnC,GAAgB,OAAZF,QAAuCL,IAAnBK,EAAQnB,OAC9BO,EAAKL,IAAImB,OACJ,CACL,IAAIrB,EAASM,EACTrB,EAAK0C,KAAKrB,EAAea,EAAQnB,QACjCmB,EAAQnB,OACZO,EAAKL,IAAI,IAAIb,EAAW8B,EAAQe,aACRf,EAAQgB,eACRnC,EACAqB,EACAF,EAAQlB,MACxC,CACA,CACG,EAQHZ,EAAW+C,UAAUlC,IAAM,SAAwBmC,GACjD,GAAIC,MAAMC,QAAQF,GAChBA,EAAOR,SAAQ,SAAUW,GACvB7C,KAAKO,IAAIsC,EACV,GAAE7C,UAEA,KAAI0C,EAAOjD,IAAmC,iBAAXiD,EAMtC,MAAM,IAAII,UACR,8EAAgFJ,GAN9EA,GACF1C,KAAKC,SAAS8C,KAAKL,EAOzB,CACE,OAAO1C,IACT,EAQAN,EAAW+C,UAAUO,QAAU,SAA4BN,GACzD,GAAIC,MAAMC,QAAQF,GAChB,IAAK,IAAIO,EAAIP,EAAOxB,OAAO,EAAG+B,GAAK,EAAGA,IACpCjD,KAAKgD,QAAQN,EAAOO,QAGnB,KAAIP,EAAOjD,IAAmC,iBAAXiD,EAItC,MAAM,IAAII,UACR,8EAAgFJ,GAJlF1C,KAAKC,SAASiD,QAAQR,EAM1B,CACE,OAAO1C,IACT,EASAN,EAAW+C,UAAUU,KAAO,SAAyBC,GAEnD,IADA,IAAIP,EACKI,EAAI,EAAGI,EAAMrD,KAAKC,SAASiB,OAAQ+B,EAAII,EAAKJ,KACnDJ,EAAQ7C,KAAKC,SAASgD,IACZxD,GACRoD,EAAMM,KAAKC,GAGG,KAAVP,GACFO,EAAIP,EAAO,CAAExC,OAAQL,KAAKK,OACbF,KAAMH,KAAKG,KACXC,OAAQJ,KAAKI,OACbE,KAAMN,KAAKM,MAIhC,EAQAZ,EAAW+C,UAAUT,KAAO,SAAyBsB,GACnD,IAAIC,EACAN,EACAI,EAAMrD,KAAKC,SAASiB,OACxB,GAAImC,EAAM,EAAG,CAEX,IADAE,EAAc,GACTN,EAAI,EAAGA,EAAII,EAAI,EAAGJ,IACrBM,EAAYR,KAAK/C,KAAKC,SAASgD,IAC/BM,EAAYR,KAAKO,GAEnBC,EAAYR,KAAK/C,KAAKC,SAASgD,IAC/BjD,KAAKC,SAAWsD,CACpB,CACE,OAAOvD,IACT,EASAN,EAAW+C,UAAUe,aAAe,SAAiCC,EAAUC,GAC7E,IAAIC,EAAY3D,KAAKC,SAASD,KAAKC,SAASiB,OAAS,GAUrD,OATIyC,EAAUlE,GACZkE,EAAUH,aAAaC,EAAUC,GAEL,iBAAdC,EACd3D,KAAKC,SAASD,KAAKC,SAASiB,OAAS,GAAKyC,EAAUC,QAAQH,EAAUC,GAGtE1D,KAAKC,SAAS8C,KAAK,GAAGa,QAAQH,EAAUC,IAEnC1D,IACT,EASAN,EAAW+C,UAAUH,iBACnB,SAAqCuB,EAAaC,GAChD9D,KAAKE,eAAeZ,EAAKyE,YAAYF,IAAgBC,CACtD,EAQHpE,EAAW+C,UAAUuB,mBACnB,SAAuCZ,GACrC,IAAK,IAAIH,EAAI,EAAGI,EAAMrD,KAAKC,SAASiB,OAAQ+B,EAAII,EAAKJ,IAC/CjD,KAAKC,SAASgD,GAAGxD,IACnBO,KAAKC,SAASgD,GAAGe,mBAAmBZ,GAIxC,IAAInB,EAAUgC,OAAOC,KAAKlE,KAAKE,gBAC/B,IAAS+C,EAAI,EAAGI,EAAMpB,EAAQf,OAAQ+B,EAAII,EAAKJ,IAC7CG,EAAI9D,EAAK6E,cAAclC,EAAQgB,IAAKjD,KAAKE,eAAe+B,EAAQgB,IAEnE,EAMHvD,EAAW+C,UAAU2B,SAAW,WAC9B,IAAIC,EAAM,GAIV,OAHArE,KAAKmD,MAAK,SAAUN,GAClBwB,GAAOxB,CACX,IACSwB,CACT,EAMA3E,EAAW+C,UAAU6B,sBAAwB,SAA0CC,GACrF,IAAIC,EAAY,CACd9C,KAAM,GACNvB,KAAM,EACNC,OAAQ,GAENqE,EAAM,IAAIrF,EAAmBmF,GAC7BG,GAAsB,EACtBC,EAAqB,KACrBC,EAAmB,KACnBC,EAAqB,KACrBC,EAAmB,KAqEvB,OApEA9E,KAAKmD,MAAK,SAAUN,EAAOkC,GACzBP,EAAU9C,MAAQmB,EACM,OAApBkC,EAAS1E,QACY,OAAlB0E,EAAS5E,MACW,OAApB4E,EAAS3E,QACXuE,IAAuBI,EAAS1E,QAC7BuE,IAAqBG,EAAS5E,MAC9B0E,IAAuBE,EAAS3E,QAChC0E,IAAqBC,EAASzE,MAClCmE,EAAIO,WAAW,CACb3E,OAAQ0E,EAAS1E,OACjB0E,SAAU,CACR5E,KAAM4E,EAAS5E,KACfC,OAAQ2E,EAAS3E,QAEnBoE,UAAW,CACTrE,KAAMqE,EAAUrE,KAChBC,OAAQoE,EAAUpE,QAEpBE,KAAMyE,EAASzE,OAGnBqE,EAAqBI,EAAS1E,OAC9BuE,EAAmBG,EAAS5E,KAC5B0E,EAAqBE,EAAS3E,OAC9B0E,EAAmBC,EAASzE,KAC5BoE,GAAsB,GACbA,IACTD,EAAIO,WAAW,CACbR,UAAW,CACTrE,KAAMqE,EAAUrE,KAChBC,OAAQoE,EAAUpE,UAGtBuE,EAAqB,KACrBD,GAAsB,GAExB,IAAK,IAAIO,EAAM,EAAG/D,EAAS2B,EAAM3B,OAAQ+D,EAAM/D,EAAQ+D,IA3WxC,KA4WTpC,EAAMqC,WAAWD,IACnBT,EAAUrE,OACVqE,EAAUpE,OAAS,EAEf6E,EAAM,IAAM/D,GACdyD,EAAqB,KACrBD,GAAsB,GACbA,GACTD,EAAIO,WAAW,CACb3E,OAAQ0E,EAAS1E,OACjB0E,SAAU,CACR5E,KAAM4E,EAAS5E,KACfC,OAAQ2E,EAAS3E,QAEnBoE,UAAW,CACTrE,KAAMqE,EAAUrE,KAChBC,OAAQoE,EAAUpE,QAEpBE,KAAMyE,EAASzE,QAInBkE,EAAUpE,QAGlB,IACEJ,KAAKgE,oBAAmB,SAAU7B,EAAYgD,GAC5CV,EAAInC,iBAAiBH,EAAYgD,EACrC,IAES,CAAEzD,KAAM8C,EAAU9C,KAAM+C,IAAKA,EACtC,EAEAW,EAAA1F,WAAqBA","x_google_ignoreList":[0]}

package/dist/utils/esm/node_modules/source-map-js/lib/util.js

@@ -0,0 +1,2 @@
+import{__exports as e}from"../../../_virtual/util.js";!function(e){e.getArg=function(e,r,n){if(r in e)return e[r];if(3===arguments.length)return n;throw new Error('"'+r+'" is a required argument.')};var r=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/,n=/^data:.+\,.+$/;function t(e){var n=e.match(r);return n?{scheme:n[1],auth:n[2],host:n[3],port:n[4],path:n[5]}:null}function i(e){var r="";return e.scheme&&(r+=e.scheme+":"),r+="//",e.auth&&(r+=e.auth+"@"),e.host&&(r+=e.host),e.port&&(r+=":"+e.port),e.path&&(r+=e.path),r}e.urlParse=t,e.urlGenerate=i;var a,o,u=(a=function(r){var n=r,a=t(r);if(a){if(!a.path)return r;n=a.path}for(var o=e.isAbsolute(n),u=[],l=0,c=0;;){if(l=c,-1===(c=n.indexOf("/",l))){u.push(n.slice(l));break}for(u.push(n.slice(l,c));c<n.length&&"/"===n[c];)c++}var s,f=0;for(c=u.length-1;c>=0;c--)"."===(s=u[c])?u.splice(c,1):".."===s?f++:f>0&&(""===s?(u.splice(c+1,f),f=0):(u.splice(c,2),f--));return""===(n=u.join("/"))&&(n=o?"/":"."),a?(a.path=n,i(a)):n},o=[],function(e){for(var r=0;r<o.length;r++)if(o[r].input===e){var n=o[0];return o[0]=o[r],o[r]=n,o[0].result}var t=a(e);return o.unshift({input:e,result:t}),o.length>32&&o.pop(),t});function l(e,r){""===e&&(e="."),""===r&&(r=".");var a=t(r),o=t(e);if(o&&(e=o.path||"/"),a&&!a.scheme)return o&&(a.scheme=o.scheme),i(a);if(a||r.match(n))return r;if(o&&!o.host&&!o.path)return o.host=r,i(o);var l="/"===r.charAt(0)?r:u(e.replace(/\/+$/,"")+"/"+r);return o?(o.path=l,i(o)):l}e.normalize=u,e.join=l,e.isAbsolute=function(e){return"/"===e.charAt(0)||r.test(e)},e.relative=function(e,r){""===e&&(e="."),e=e.replace(/\/$/,"");for(var n=0;0!==r.indexOf(e+"/");){var t=e.lastIndexOf("/");if(t<0)return r;if((e=e.slice(0,t)).match(/^([^\/]+:\/)?\/*$/))return r;++n}return Array(n+1).join("../")+r.substr(e.length+1)};var c=!("__proto__"in Object.create(null));function s(e){return e}function f(e){if(!e)return!1;var r=e.length;if(r<9)return!1;if(95!==e.charCodeAt(r-1)||95!==e.charCodeAt(r-2)||111!==e.charCodeAt(r-3)||116!==e.charCodeAt(r-4)||111!==e.charCodeAt(r-5)||114!==e.charCodeAt(r-6)||112!==e.charCodeAt(r-7)||95!==e.charCodeAt(r-8)||95!==e.charCodeAt(r-9))return!1;for(var n=r-10;n>=0;n--)if(36!==e.charCodeAt(n))return!1;return!0}function h(e,r){return e===r?0:null===e?1:null===r?-1:e>r?1:-1}e.toSetString=c?s:function(e){return f(e)?"$"+e:e},e.fromSetString=c?s:function(e){return f(e)?e.slice(1):e},e.compareByOriginalPositions=function(e,r,n){var t=h(e.source,r.source);return 0!==t||0!==(t=e.originalLine-r.originalLine)||0!==(t=e.originalColumn-r.originalColumn)||n||0!==(t=e.generatedColumn-r.generatedColumn)||0!==(t=e.generatedLine-r.generatedLine)?t:h(e.name,r.name)},e.compareByOriginalPositionsNoSource=function(e,r,n){var t;return 0!==(t=e.originalLine-r.originalLine)||0!==(t=e.originalColumn-r.originalColumn)||n||0!==(t=e.generatedColumn-r.generatedColumn)||0!==(t=e.generatedLine-r.generatedLine)?t:h(e.name,r.name)},e.compareByGeneratedPositionsDeflated=function(e,r,n){var t=e.generatedLine-r.generatedLine;return 0!==t||0!==(t=e.generatedColumn-r.generatedColumn)||n||0!==(t=h(e.source,r.source))||0!==(t=e.originalLine-r.originalLine)||0!==(t=e.originalColumn-r.originalColumn)?t:h(e.name,r.name)},e.compareByGeneratedPositionsDeflatedNoLine=function(e,r,n){var t=e.generatedColumn-r.generatedColumn;return 0!==t||n||0!==(t=h(e.source,r.source))||0!==(t=e.originalLine-r.originalLine)||0!==(t=e.originalColumn-r.originalColumn)?t:h(e.name,r.name)},e.compareByGeneratedPositionsInflated=function(e,r){var n=e.generatedLine-r.generatedLine;return 0!==n||0!==(n=e.generatedColumn-r.generatedColumn)||0!==(n=h(e.source,r.source))||0!==(n=e.originalLine-r.originalLine)||0!==(n=e.originalColumn-r.originalColumn)?n:h(e.name,r.name)},e.parseSourceMapInput=function(e){return JSON.parse(e.replace(/^\)]}'[^\n]*\n/,""))},e.computeSourceURL=function(e,r,n){if(r=r||"",e&&("/"!==e[e.length-1]&&"/"!==r[0]&&(e+="/"),r=e+r),n){var a=t(n);if(!a)throw new Error("sourceMapURL could not be parsed");if(a.path){var o=a.path.lastIndexOf("/");o>=0&&(a.path=a.path.substring(0,o+1))}r=l(i(a),r)}return u(r)}}(e);
+//# sourceMappingURL=util.js.map

package/dist/utils/esm/node_modules/source-map-js/lib/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sources":["../../../../../../node_modules/source-map-js/lib/util.js"],"sourcesContent":["/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n  if (aName in aArgs) {\n    return aArgs[aName];\n  } else if (arguments.length === 3) {\n    return aDefaultValue;\n  } else {\n    throw new Error('\"' + aName + '\" is a required argument.');\n  }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n  var match = aUrl.match(urlRegexp);\n  if (!match) {\n    return null;\n  }\n  return {\n    scheme: match[1],\n    auth: match[2],\n    host: match[3],\n    port: match[4],\n    path: match[5]\n  };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n  var url = '';\n  if (aParsedUrl.scheme) {\n    url += aParsedUrl.scheme + ':';\n  }\n  url += '//';\n  if (aParsedUrl.auth) {\n    url += aParsedUrl.auth + '@';\n  }\n  if (aParsedUrl.host) {\n    url += aParsedUrl.host;\n  }\n  if (aParsedUrl.port) {\n    url += \":\" + aParsedUrl.port\n  }\n  if (aParsedUrl.path) {\n    url += aParsedUrl.path;\n  }\n  return url;\n}\nexports.urlGenerate = urlGenerate;\n\nvar MAX_CACHED_INPUTS = 32;\n\n/**\n * Takes some function `f(input) -> result` and returns a memoized version of\n * `f`.\n *\n * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The\n * memoization is a dumb-simple, linear least-recently-used cache.\n */\nfunction lruMemoize(f) {\n  var cache = [];\n\n  return function(input) {\n    for (var i = 0; i < cache.length; i++) {\n      if (cache[i].input === input) {\n        var temp = cache[0];\n        cache[0] = cache[i];\n        cache[i] = temp;\n        return cache[0].result;\n      }\n    }\n\n    var result = f(input);\n\n    cache.unshift({\n      input,\n      result,\n    });\n\n    if (cache.length > MAX_CACHED_INPUTS) {\n      cache.pop();\n    }\n\n    return result;\n  };\n}\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nvar normalize = lruMemoize(function normalize(aPath) {\n  var path = aPath;\n  var url = urlParse(aPath);\n  if (url) {\n    if (!url.path) {\n      return aPath;\n    }\n    path = url.path;\n  }\n  var isAbsolute = exports.isAbsolute(path);\n  // Split the path into parts between `/` characters. This is much faster than\n  // using `.split(/\\/+/g)`.\n  var parts = [];\n  var start = 0;\n  var i = 0;\n  while (true) {\n    start = i;\n    i = path.indexOf(\"/\", start);\n    if (i === -1) {\n      parts.push(path.slice(start));\n      break;\n    } else {\n      parts.push(path.slice(start, i));\n      while (i < path.length && path[i] === \"/\") {\n        i++;\n      }\n    }\n  }\n\n  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n    part = parts[i];\n    if (part === '.') {\n      parts.splice(i, 1);\n    } else if (part === '..') {\n      up++;\n    } else if (up > 0) {\n      if (part === '') {\n        // The first part is blank if the path is absolute. Trying to go\n        // above the root is a no-op. Therefore we can remove all '..' parts\n        // directly after the root.\n        parts.splice(i + 1, up);\n        up = 0;\n      } else {\n        parts.splice(i, 2);\n        up--;\n      }\n    }\n  }\n  path = parts.join('/');\n\n  if (path === '') {\n    path = isAbsolute ? '/' : '.';\n  }\n\n  if (url) {\n    url.path = path;\n    return urlGenerate(url);\n  }\n  return path;\n});\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n *   first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n *   is updated with the result and aRoot is returned. Otherwise the result\n *   is returned.\n *   - If aPath is absolute, the result is aPath.\n *   - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n  if (aPath === \"\") {\n    aPath = \".\";\n  }\n  var aPathUrl = urlParse(aPath);\n  var aRootUrl = urlParse(aRoot);\n  if (aRootUrl) {\n    aRoot = aRootUrl.path || '/';\n  }\n\n  // `join(foo, '//www.example.org')`\n  if (aPathUrl && !aPathUrl.scheme) {\n    if (aRootUrl) {\n      aPathUrl.scheme = aRootUrl.scheme;\n    }\n    return urlGenerate(aPathUrl);\n  }\n\n  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n    return aPath;\n  }\n\n  // `join('http://', 'www.example.com')`\n  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n    aRootUrl.host = aPath;\n    return urlGenerate(aRootUrl);\n  }\n\n  var joined = aPath.charAt(0) === '/'\n    ? aPath\n    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n  if (aRootUrl) {\n    aRootUrl.path = joined;\n    return urlGenerate(aRootUrl);\n  }\n  return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n\n  aRoot = aRoot.replace(/\\/$/, '');\n\n  // It is possible for the path to be above the root. In this case, simply\n  // checking whether the root is a prefix of the path won't work. Instead, we\n  // need to remove components from the root one by one, until either we find\n  // a prefix that fits, or we run out of components to remove.\n  var level = 0;\n  while (aPath.indexOf(aRoot + '/') !== 0) {\n    var index = aRoot.lastIndexOf(\"/\");\n    if (index < 0) {\n      return aPath;\n    }\n\n    // If the only part of the root that is left is the scheme (i.e. http://,\n    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n    // have exhausted all components, so the path is not relative to the root.\n    aRoot = aRoot.slice(0, index);\n    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n      return aPath;\n    }\n\n    ++level;\n  }\n\n  // Make sure we add a \"../\" for each component we removed from the root.\n  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n  return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n  if (!s) {\n    return false;\n  }\n\n  var length = s.length;\n\n  if (length < 9 /* \"__proto__\".length */) {\n    return false;\n  }\n\n  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n    return false;\n  }\n\n  for (var i = length - 10; i >= 0; i--) {\n    if (s.charCodeAt(i) !== 36 /* '$' */) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\nfunction compareByOriginalPositionsNoSource(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositionsNoSource = compareByOriginalPositionsNoSource;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction compareByGeneratedPositionsDeflatedNoLine(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflatedNoLine = compareByGeneratedPositionsDeflatedNoLine;\n\nfunction strcmp(aStr1, aStr2) {\n  if (aStr1 === aStr2) {\n    return 0;\n  }\n\n  if (aStr1 === null) {\n    return 1; // aStr2 !== null\n  }\n\n  if (aStr2 === null) {\n    return -1; // aStr1 !== null\n  }\n\n  if (aStr1 > aStr2) {\n    return 1;\n  }\n\n  return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n      sourceRoot += '/';\n    }\n    // The spec says:\n    //   Line 4: An optional source root, useful for relocating source\n    //   files on a server or removing repeated values in the\n    //   “sources” entry.  This value is prepended to the individual\n    //   entries in the “source” field.\n    sourceURL = sourceRoot + sourceURL;\n  }\n\n  // Historically, SourceMapConsumer did not take the sourceMapURL as\n  // a parameter.  This mode is still somewhat supported, which is why\n  // this code block is conditional.  However, it's preferable to pass\n  // the source map URL to SourceMapConsumer, so that this function\n  // can implement the source URL resolution algorithm as outlined in\n  // the spec.  This block is basically the equivalent of:\n  //    new URL(sourceURL, sourceMapURL).toString()\n  // ... except it avoids using URL, which wasn't available in the\n  // older releases of node still supported by this library.\n  //\n  // The spec says:\n  //   If the sources are not absolute URLs after prepending of the\n  //   “sourceRoot”, the sources are resolved relative to the\n  //   SourceMap (like resolving script src in a html document).\n  if (sourceMapURL) {\n    var parsed = urlParse(sourceMapURL);\n    if (!parsed) {\n      throw new Error(\"sourceMapURL could not be parsed\");\n    }\n    if (parsed.path) {\n      // Strip the last path component, but keep the \"/\".\n      var index = parsed.path.lastIndexOf('/');\n      if (index >= 0) {\n        parsed.path = parsed.path.substring(0, index + 1);\n      }\n    }\n    sourceURL = join(urlGenerate(parsed), sourceURL);\n  }\n\n  return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n"],"names":["exports","getArg","aArgs","aName","aDefaultValue","arguments","length","Error","urlRegexp","dataUrlRegexp","urlParse","aUrl","match","scheme","auth","host","port","path","urlGenerate","aParsedUrl","url","f","cache","normalize","aPath","isAbsolute","parts","start","i","indexOf","push","slice","part","up","splice","join","input","temp","result","unshift","pop","aRoot","aPathUrl","aRootUrl","joined","charAt","replace","test","relative","level","index","lastIndexOf","Array","substr","supportsNullProto","Object","create","identity","s","isProtoString","charCodeAt","strcmp","aStr1","aStr2","toSetString","aStr","fromSetString","compareByOriginalPositions","mappingA","mappingB","onlyCompareOriginal","cmp","source","originalLine","originalColumn","generatedColumn","generatedLine","name","compareByOriginalPositionsNoSource","compareByGeneratedPositionsDeflated","onlyCompareGenerated","compareByGeneratedPositionsDeflatedNoLine","compareByGeneratedPositionsInflated","parseSourceMapInput","str","JSON","parse","computeSourceURL","sourceRoot","sourceURL","sourceMapURL","parsed","substring"],"mappings":"mEA0BAA,EAAAC,OATA,SAAgBC,EAAOC,EAAOC,GAC5B,GAAID,KAASD,EACX,OAAOA,EAAMC,GACR,GAAyB,IAArBE,UAAUC,OACnB,OAAOF,EAEP,MAAM,IAAIG,MAAM,IAAMJ,EAAQ,8BAKlC,IAAIK,EAAY,iEACZC,EAAgB,gBAEpB,SAASC,EAASC,GAChB,IAAIC,EAAQD,EAAKC,MAAMJ,GACvB,OAAKI,EAGE,CACLC,OAAQD,EAAM,GACdE,KAAMF,EAAM,GACZG,KAAMH,EAAM,GACZI,KAAMJ,EAAM,GACZK,KAAML,EAAM,IAPL,KAYX,SAASM,EAAYC,GACnB,IAAIC,EAAM,GAiBV,OAhBID,EAAWN,SACbO,GAAOD,EAAWN,OAAS,KAE7BO,GAAO,KACHD,EAAWL,OACbM,GAAOD,EAAWL,KAAO,KAEvBK,EAAWJ,OACbK,GAAOD,EAAWJ,MAEhBI,EAAWH,OACbI,GAAO,IAAMD,EAAWH,MAEtBG,EAAWF,OACbG,GAAOD,EAAWF,MAEbG,EApBTpB,EAAAU,SAAmBA,EAsBnBV,EAAAkB,YAAsBA,EAkDtB,IAvCoBG,EACdC,EAsCFC,GAvCgBF,EAuCO,SAAmBG,GAC5C,IAAIP,EAAOO,EACPJ,EAAMV,EAASc,GACnB,GAAIJ,EAAK,CACP,IAAKA,EAAIH,KACP,OAAOO,EAETP,EAAOG,EAAIH,KAQb,IANA,IAAIQ,EAAazB,EAAQyB,WAAWR,GAGhCS,EAAQ,GACRC,EAAQ,EACRC,EAAI,IACK,CAGX,GAFAD,EAAQC,GAEG,KADXA,EAAIX,EAAKY,QAAQ,IAAKF,IACR,CACZD,EAAMI,KAAKb,EAAKc,MAAMJ,IACtB,KACN,CAEM,IADAD,EAAMI,KAAKb,EAAKc,MAAMJ,EAAOC,IACtBA,EAAIX,EAAKX,QAAsB,MAAZW,EAAKW,IAC7BA,IAKD,IAAII,EAAMC,EAAK,EAApB,IAAuBL,EAAIF,EAAMpB,OAAS,EAAGsB,GAAK,EAAGA,IAEtC,OADbI,EAAON,EAAME,IAEXF,EAAMQ,OAAON,EAAG,GACE,OAATI,EACTC,IACSA,EAAK,IACD,KAATD,GAIFN,EAAMQ,OAAON,EAAI,EAAGK,GACpBA,EAAK,IAELP,EAAMQ,OAAON,EAAG,GAChBK,MAUN,MAJa,MAFbhB,EAAOS,EAAMS,KAAK,QAGhBlB,EAAOQ,EAAa,IAAM,KAGxBL,GACFA,EAAIH,KAAOA,EACJC,EAAYE,IAEdH,CACT,EAjGMK,EAAQ,GAEL,SAASc,GACd,IAAK,IAAIR,EAAI,EAAGA,EAAIN,EAAMhB,OAAQsB,IAChC,GAAIN,EAAMM,GAAGQ,QAAUA,EAAO,CAC5B,IAAIC,EAAOf,EAAM,GAGjB,OAFAA,EAAM,GAAKA,EAAMM,GACjBN,EAAMM,GAAKS,EACJf,EAAM,GAAGgB,OAIpB,IAAIA,EAASjB,EAAEe,GAWf,OATAd,EAAMiB,QAAQ,CACZH,QACAE,WAGEhB,EAAMhB,OA7BU,IA8BlBgB,EAAMkB,MAGDF,CACR,GA4FH,SAASH,EAAKM,EAAOjB,GACL,KAAViB,IACFA,EAAQ,KAEI,KAAVjB,IACFA,EAAQ,KAEV,IAAIkB,EAAWhC,EAASc,GACpBmB,EAAWjC,EAAS+B,GAMxB,GALIE,IACFF,EAAQE,EAAS1B,MAAQ,KAIvByB,IAAaA,EAAS7B,OAIxB,OAHI8B,IACFD,EAAS7B,OAAS8B,EAAS9B,QAEtBK,EAAYwB,GAGrB,GAAIA,GAAYlB,EAAMZ,MAAMH,GAC1B,OAAOe,EAIT,GAAImB,IAAaA,EAAS5B,OAAS4B,EAAS1B,KAE1C,OADA0B,EAAS5B,KAAOS,EACTN,EAAYyB,GAGrB,IAAIC,EAA6B,MAApBpB,EAAMqB,OAAO,GACtBrB,EACAD,EAAUkB,EAAMK,QAAQ,OAAQ,IAAM,IAAMtB,GAEhD,OAAImB,GACFA,EAAS1B,KAAO2B,EACT1B,EAAYyB,IAEdC,EAzDT5C,EAAAuB,UAAoBA,EA2DpBvB,EAAAmC,KAAeA,EAEfnC,EAAqByB,WAAA,SAAUD,GAC7B,MAA2B,MAApBA,EAAMqB,OAAO,IAAcrC,EAAUuC,KAAKvB,EAClD,EAwCDxB,EAAAgD,SAhCA,SAAkBP,EAAOjB,GACT,KAAViB,IACFA,EAAQ,KAGVA,EAAQA,EAAMK,QAAQ,MAAO,IAO7B,IADA,IAAIG,EAAQ,EAC0B,IAA/BzB,EAAMK,QAAQY,EAAQ,MAAY,CACvC,IAAIS,EAAQT,EAAMU,YAAY,KAC9B,GAAID,EAAQ,EACV,OAAO1B,EAOT,IADAiB,EAAQA,EAAMV,MAAM,EAAGmB,IACbtC,MAAM,qBACd,OAAOY,IAGPyB,EAIJ,OAAOG,MAAMH,EAAQ,GAAGd,KAAK,OAASX,EAAM6B,OAAOZ,EAAMnC,OAAS,IAIpE,IAAIgD,IAEO,cADCC,OAAOC,OAAO,OAI1B,SAASC,EAAUC,GACjB,OAAOA,EA8BT,SAASC,EAAcD,GACrB,IAAKA,EACH,OAAO,EAGT,IAAIpD,EAASoD,EAAEpD,OAEf,GAAIA,EAAS,EACX,OAAO,EAGT,GAAiC,KAA7BoD,EAAEE,WAAWtD,EAAS,IACO,KAA7BoD,EAAEE,WAAWtD,EAAS,IACO,MAA7BoD,EAAEE,WAAWtD,EAAS,IACO,MAA7BoD,EAAEE,WAAWtD,EAAS,IACO,MAA7BoD,EAAEE,WAAWtD,EAAS,IACO,MAA7BoD,EAAEE,WAAWtD,EAAS,IACO,MAA7BoD,EAAEE,WAAWtD,EAAS,IACO,KAA7BoD,EAAEE,WAAWtD,EAAS,IACO,KAA7BoD,EAAEE,WAAWtD,EAAS,GACxB,OAAO,EAGT,IAAK,IAAIsB,EAAItB,EAAS,GAAIsB,GAAK,EAAGA,IAChC,GAAwB,KAApB8B,EAAEE,WAAWhC,GACf,OAAO,EAIX,OAAO,EAoIT,SAASiC,EAAOC,EAAOC,GACrB,OAAID,IAAUC,EACL,EAGK,OAAVD,EACK,EAGK,OAAVC,GACM,EAGND,EAAQC,EACH,GAGD,EA7LV/D,EAAAgE,YAAsBV,EAAoBG,EAP1C,SAAqBQ,GACnB,OAAIN,EAAcM,GACT,IAAMA,EAGRA,GAWTjE,EAAAkE,cAAwBZ,EAAoBG,EAP5C,SAAuBQ,GACrB,OAAIN,EAAcM,GACTA,EAAKlC,MAAM,GAGbkC,GAwETjE,EAAAmE,2BA5BA,SAAoCC,EAAUC,EAAUC,GACtD,IAAIC,EAAMV,EAAOO,EAASI,OAAQH,EAASG,QAC3C,OAAY,IAARD,GAKQ,KADZA,EAAMH,EAASK,aAAeJ,EAASI,eAM3B,KADZF,EAAMH,EAASM,eAAiBL,EAASK,iBACxBJ,GAKL,KADZC,EAAMH,EAASO,gBAAkBN,EAASM,kBAM9B,KADZJ,EAAMH,EAASQ,cAAgBP,EAASO,eAlB/BL,EAuBFV,EAAOO,EAASS,KAAMR,EAASQ,OA6BxC7E,EAAA8E,mCAzBA,SAA4CV,EAAUC,EAAUC,GAC9D,IAAIC,EAGJ,OAAY,KADZA,EAAMH,EAASK,aAAeJ,EAASI,eAM3B,KADZF,EAAMH,EAASM,eAAiBL,EAASK,iBACxBJ,GAKL,KADZC,EAAMH,EAASO,gBAAkBN,EAASM,kBAM9B,KADZJ,EAAMH,EAASQ,cAAgBP,EAASO,eAb/BL,EAkBFV,EAAOO,EAASS,KAAMR,EAASQ,OAyCxC7E,EAAA+E,oCA5BA,SAA6CX,EAAUC,EAAUW,GAC/D,IAAIT,EAAMH,EAASQ,cAAgBP,EAASO,cAC5C,OAAY,IAARL,GAKQ,KADZA,EAAMH,EAASO,gBAAkBN,EAASM,kBACzBK,GAKL,KADZT,EAAMV,EAAOO,EAASI,OAAQH,EAASG,UAM3B,KADZD,EAAMH,EAASK,aAAeJ,EAASI,eAM3B,KADZF,EAAMH,EAASM,eAAiBL,EAASK,gBAlBhCH,EAuBFV,EAAOO,EAASS,KAAMR,EAASQ,OA2BxC7E,EAAAiF,0CAvBA,SAAmDb,EAAUC,EAAUW,GACrE,IAAIT,EAAMH,EAASO,gBAAkBN,EAASM,gBAC9C,OAAY,IAARJ,GAAaS,GAKL,KADZT,EAAMV,EAAOO,EAASI,OAAQH,EAASG,UAM3B,KADZD,EAAMH,EAASK,aAAeJ,EAASI,eAM3B,KADZF,EAAMH,EAASM,eAAiBL,EAASK,gBAbhCH,EAkBFV,EAAOO,EAASS,KAAMR,EAASQ,OAwDxC7E,EAAAkF,oCA5BA,SAA6Cd,EAAUC,GACrD,IAAIE,EAAMH,EAASQ,cAAgBP,EAASO,cAC5C,OAAY,IAARL,GAKQ,KADZA,EAAMH,EAASO,gBAAkBN,EAASM,kBAM9B,KADZJ,EAAMV,EAAOO,EAASI,OAAQH,EAASG,UAM3B,KADZD,EAAMH,EAASK,aAAeJ,EAASI,eAM3B,KADZF,EAAMH,EAASM,eAAiBL,EAASK,gBAlBhCH,EAuBFV,EAAOO,EAASS,KAAMR,EAASQ,OAYxC7E,EAAAmF,oBAHA,SAA6BC,GAC3B,OAAOC,KAAKC,MAAMF,EAAItC,QAAQ,iBAAkB,MAuDlD9C,EAAAuF,iBA/CA,SAA0BC,EAAYC,EAAWC,GA8B/C,GA7BAD,EAAYA,GAAa,GAErBD,IAEwC,MAAtCA,EAAWA,EAAWlF,OAAS,IAA+B,MAAjBmF,EAAU,KACzDD,GAAc,KAOhBC,EAAYD,EAAaC,GAiBvBC,EAAc,CAChB,IAAIC,EAASjF,EAASgF,GACtB,IAAKC,EACH,MAAM,IAAIpF,MAAM,oCAElB,GAAIoF,EAAO1E,KAAM,CAEf,IAAIiC,EAAQyC,EAAO1E,KAAKkC,YAAY,KAChCD,GAAS,IACXyC,EAAO1E,KAAO0E,EAAO1E,KAAK2E,UAAU,EAAG1C,EAAQ,IAGnDuC,EAAYtD,EAAKjB,EAAYyE,GAASF,GAGxC,OAAOlE,EAAUkE","x_google_ignoreList":[0]}

package/dist/utils/esm/node_modules/source-map-js/source-map.js

@@ -0,0 +1,2 @@
+import{__exports as r}from"../../_virtual/source-map.js";import"./lib/source-map-generator.js";import"./lib/source-map-consumer.js";import"./lib/source-node.js";import{__exports as o}from"../../_virtual/source-map-generator.js";import{__exports as e}from"../../_virtual/source-map-consumer.js";import{__exports as s}from"../../_virtual/source-node.js";r.SourceMapGenerator=o.SourceMapGenerator,r.SourceMapConsumer=e.SourceMapConsumer,r.SourceNode=s.SourceNode;export{r as default};
+//# sourceMappingURL=source-map.js.map

package/dist/utils/esm/node_modules/source-map-js/source-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source-map.js","sources":["../../../../../node_modules/source-map-js/source-map.js"],"sourcesContent":["/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n"],"names":["sourceMap","SourceMapGenerator","require$$0","SourceMapConsumer","require$$1","SourceNode","require$$2"],"mappings":"gWAKAA,EAAAC,mBAA6BC,EAAsCD,mBACnED,EAAAG,kBAA4BC,EAAqCD,kBAC/CH,EAAAK,WAAGC,EAA6BD","x_google_ignoreList":[0]}

package/dist/utils/esm/node_modules/uuid/dist/esm-browser/v4.js.map

@@ -1 +1 @@
-{"version":3,"file":"v4.js","sources":["../../../../../../../node_modules/uuid/dist/esm-browser/v4.js"],"sourcesContent":["import native from './native.js';\nimport rng from './rng.js';\nimport { unsafeStringify } from './stringify.js';\n\nfunction v4(options, buf, offset) {\n  if (native.randomUUID && !buf && !options) {\n    return native.randomUUID();\n  }\n\n  options = options || {};\n  const rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n  rnds[6] = rnds[6] & 0x0f | 0x40;\n  rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n  if (buf) {\n    offset = offset || 0;\n\n    for (let i = 0; i < 16; ++i) {\n      buf[offset + i] = rnds[i];\n    }\n\n    return buf;\n  }\n\n  return unsafeStringify(rnds);\n}\n\nexport default v4;"],"names":["v4","options","buf","offset","native","randomUUID","rnds","random","rng","unsafeStringify"],"mappings":"oGAIA,SAASA,EAAGC,EAASC,EAAKC,GACxB,GAAIC,EAAOC,aAAeH,IAAQD,EAChC,OAAOG,EAAOC,aAIhB,MAAMC,GADNL,EAAUA,GAAW,IACAM,SAAWN,EAAQO,KAAOA,KAe/C,OAbAF,EAAK,GAAe,GAAVA,EAAK,GAAY,GAC3BA,EAAK,GAAe,GAAVA,EAAK,GAAY,IAYpBG,EAAgBH,EACzB","x_google_ignoreList":[0]}
+{"version":3,"file":"v4.js","sources":["../../../../../../../node_modules/uuid/dist/esm-browser/v4.js"],"sourcesContent":["import native from './native.js';\nimport rng from './rng.js';\nimport { unsafeStringify } from './stringify.js';\n\nfunction v4(options, buf, offset) {\n  if (native.randomUUID && !buf && !options) {\n    return native.randomUUID();\n  }\n\n  options = options || {};\n  const rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n  rnds[6] = rnds[6] & 0x0f | 0x40;\n  rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n  if (buf) {\n    offset = offset || 0;\n\n    for (let i = 0; i < 16; ++i) {\n      buf[offset + i] = rnds[i];\n    }\n\n    return buf;\n  }\n\n  return unsafeStringify(rnds);\n}\n\nexport default v4;"],"names":["v4","options","buf","offset","native","randomUUID","rnds","random","rng","unsafeStringify"],"mappings":"oGAIA,SAASA,EAAGC,EAASC,EAAKC,GACxB,GAAIC,EAAOC,aAAeH,IAAQD,EAChC,OAAOG,EAAOC,aAIhB,MAAMC,GADNL,EAAUA,GAAW,CAAE,GACFM,SAAWN,EAAQO,KAAOA,KAe/C,OAbAF,EAAK,GAAe,GAAVA,EAAK,GAAY,GAC3BA,EAAK,GAAe,GAAVA,EAAK,GAAY,IAYpBG,EAAgBH,EACzB","x_google_ignoreList":[0]}

package/dist/utils/esm/src/core/utils/appState/peregrineMQ/peregrineMQ.js

@@ -1,2 +1,2 @@
-import{NON_EXISTENT_CHANNEL as e}from"./peregrineMQ.types.js";import t from"../../../../../node_modules/uuid/dist/esm-browser/v4.js";class s extends Error{constructor(){super("Clearing PeregrineMQ is not allowed. Please read the documentation for more information."),this.name="PeregrineMQClearError"}}class n{constructor(n,r){this.id=void 0,this.config={allowAutoPrune:!1,pruneInterval:1e4,allowClear:!1},this.channels=new Map,this.listeners=new Map,this.addListener=(e,t)=>{const s=this.listeners.get(e),n=this.channels.get(t);n&&(s?s.push(n):this.listeners.set(e,[n]))},this.removeListener=e=>{const t=this.listeners.get(e);let s=!0;for(const n of t||[])if(s=!n.has(e),!s)break;s&&this.listeners.delete(e)},this.publishToChannel=(t,s,n)=>{const r=this.channels.get(t);if(!r)return e;const i=r[Symbol.iterator]();let l=i.next().value;const h=[];for(;l;)h.push(l(t,n)),l=i.next().value;return 1===h?.length?h[0]:h},this.configure=e=>{this.config=e;const{allowAutoPrune:t,pruneInterval:s}=e;let n;t&&(n=setInterval((()=>{this.prune()}),s));const r=this;return{...t?{clearPruneInterval:()=>{clearInterval(n)},restartPruneInterval:()=>{clearInterval(n),n=setInterval((()=>{r.prune()}),s)}}:{}}},this.getChannels=()=>[...this.channels.keys()],this.prune=()=>{const e=this.channels[Symbol.iterator]();let t=e.next().value;const s=[];for(;t;)0===t[1]?.size&&(s.push(t[0]),this.channels.delete(t[0])),t=e.next().value;return s},this.removeChannel=e=>{const t=this.channels.get(e);if(t&&t.size>0){const e=[...t||[]];t.clear();let s=e.length;for(;s--;)this.removeListener(e[s])}return this.channels.delete(e)},this.publish=(e,t)=>{if(e.includes(".")){const s=e.split(".");let{length:n}=s,r=0;const i=[];for(;n--;){const e=this.publishToChannel(s.slice(0,r+1).join("."),n!==s.length-1,t);r+=1,i.push(e)}return i}return this.publishToChannel(e,!1,t)},this.subscribe=(e,t)=>{const s=this.channels.get(e);return s?s.add(t):this.channels.set(e,new Set([t])),this.addListener(t,e),()=>this.unsubscribe(t,{channel:e,prune:!0})},this.unsubscribe=(e,t)=>{const{channel:s,prune:n}=t||{};let r=!1;if(s){const t=this.channels.get(s);return r=!!t&&t.delete(e),n&&0===t?.size&&this.channels.delete(s),this.removeListener(e),r}const i=this.listeners.get(e)||[];for(const t of i)r=t.delete(e),n&&0===t.size&&this.prune();return this.listeners.delete(e),r},this.isSubscribed=(e,t)=>{if(t){const s=this.channels.get(t);return!!s&&s.has(e)}return this.listeners.has(e)},this.clear=()=>{if(!this.config.allowClear)throw new s;this.channels.clear(),this.listeners.clear()},this.getId=()=>this.id,this.id=n||t(),this.configure(r||{})}get length(){return[...this.channels.values()].reduce(((e,t)=>e+t.size),0)}}export{n as PeregrineMQ,s as PeregrineMQClearError};
+import{objectSpread2 as e}from"../../../../../_virtual/_rollupPluginBabelHelpers.js";import"../../../../../node_modules/core-js/modules/web.dom-collections.iterator.js";import{NON_EXISTENT_CHANNEL as t}from"./peregrineMQ.types.js";import s from"../../../../../node_modules/uuid/dist/esm-browser/v4.js";class n extends Error{constructor(){super("Clearing PeregrineMQ is not allowed. Please read the documentation for more information."),this.name="PeregrineMQClearError"}}class r{constructor(r,i){this.id=void 0,this.config={allowAutoPrune:!1,pruneInterval:1e4,allowClear:!1},this.channels=new Map,this.listeners=new Map,this.addListener=(e,t)=>{const s=this.listeners.get(e),n=this.channels.get(t);n&&(s?s.push(n):this.listeners.set(e,[n]))},this.removeListener=e=>{const t=this.listeners.get(e);let s=!0;for(const n of t||[])if(s=!n.has(e),!s)break;s&&this.listeners.delete(e)},this.publishToChannel=(e,s,n)=>{const r=this.channels.get(e);if(!r)return t;const i=r[Symbol.iterator]();let l=i.next().value;const h=[];for(;l;)h.push(l(e,n)),l=i.next().value;return 1===(null==h?void 0:h.length)?h[0]:h},this.configure=t=>{this.config=t;const{allowAutoPrune:s,pruneInterval:n}=t;let r;s&&(r=setInterval((()=>{this.prune()}),n));const i=this;return e({},s?{clearPruneInterval:()=>{clearInterval(r)},restartPruneInterval:()=>{clearInterval(r),r=setInterval((()=>{i.prune()}),n)}}:{})},this.getChannels=()=>[...this.channels.keys()],this.prune=()=>{const e=this.channels[Symbol.iterator]();let t=e.next().value;const s=[];for(;t;){var n;0===(null===(n=t[1])||void 0===n?void 0:n.size)&&(s.push(t[0]),this.channels.delete(t[0])),t=e.next().value}return s},this.removeChannel=e=>{const t=this.channels.get(e);if(t&&t.size>0){const e=[...t||[]];t.clear();let s=e.length;for(;s--;)this.removeListener(e[s])}return this.channels.delete(e)},this.publish=(e,t)=>{if(e.includes(".")){const s=e.split(".");let{length:n}=s,r=0;const i=[];for(;n--;){const e=this.publishToChannel(s.slice(0,r+1).join("."),n!==s.length-1,t);r+=1,i.push(e)}return i}return this.publishToChannel(e,!1,t)},this.subscribe=(e,t)=>{const s=this.channels.get(e);return s?s.add(t):this.channels.set(e,new Set([t])),this.addListener(t,e),()=>this.unsubscribe(t,{channel:e,prune:!0})},this.unsubscribe=(e,t)=>{const{channel:s,prune:n}=t||{};let r=!1;if(s){const t=this.channels.get(s);return r=!!t&&t.delete(e),n&&0===(null==t?void 0:t.size)&&this.channels.delete(s),this.removeListener(e),r}const i=this.listeners.get(e)||[];for(const t of i)r=t.delete(e),n&&0===t.size&&this.prune();return this.listeners.delete(e),r},this.isSubscribed=(e,t)=>{if(t){const s=this.channels.get(t);return!!s&&s.has(e)}return this.listeners.has(e)},this.clear=()=>{if(!this.config.allowClear)throw new n;this.channels.clear(),this.listeners.clear()},this.getId=()=>this.id,this.id=r||s(),this.configure(i||{})}get length(){return[...this.channels.values()].reduce(((e,t)=>e+t.size),0)}}export{r as PeregrineMQ,n as PeregrineMQClearError};
 //# sourceMappingURL=peregrineMQ.js.map

package/dist/utils/esm/src/core/utils/appState/peregrineMQ/peregrineMQ.js.map

@@ -1 +1 @@
-{"version":3,"file":"peregrineMQ.js","sources":["../../../../../../../../src/core/utils/appState/peregrineMQ/peregrineMQ.ts"],"sourcesContent":["import { v4 as uuidv4 } from 'uuid'\n\nimport {\n  Callback, Config, PeregrineMQApi, PublishToChannelReturnType,\n  PublishReturnType, SubscribersSet,\n  UnsubscribeOptions, NON_EXISTENT_CHANNEL_TYPE,\n  NON_EXISTENT_CHANNEL,\n  CallbackPayload,\n} from './peregrineMQ.types'\n\n\nexport class PeregrineMQClearError extends Error {\n  constructor() {\n    super('Clearing PeregrineMQ is not allowed. Please read the documentation for more information.')\n    this.name = 'PeregrineMQClearError'\n  }\n}\n\n/**\n * Represents a message queue with publish/subscribe functionality.\n */\nexport class PeregrineMQ implements PeregrineMQApi {\n  private id: string\n\n  private config: Config = {\n    allowAutoPrune: false,\n    pruneInterval: 10000,\n    allowClear: false,\n  }\n\n  /**\n   * The map of channels and their subscribers sets.\n   */\n  private channels: Map<string, SubscribersSet> = new Map()\n\n  /**\n   * The map of listeners and their subscribed channels.\n   */\n  private listeners: Map<Callback, SubscribersSet[]> = new Map()\n\n  /**\n   * Adds a callback as a listener to a channel.\n   * @param callback The callback function to add as a listener.\n   * @param channel The channel to add the listener to.\n   */\n  private addListener = (callback: Callback, channel: string): void => {\n    const listener = this.listeners.get(callback)\n    const subscribersSet = this.channels.get(channel)\n\n    if (subscribersSet) {\n      if (listener) {\n        listener.push(subscribersSet)\n      } else {\n        this.listeners.set(callback, [subscribersSet])\n      }\n    }\n  }\n\n  /**\n   * Removes the callback from the listeners collection if it is not subscribed to any channels.\n   * @description Removes the callback only when it is not present in any other subscriberSet\n   * (Ref to Map<string, SubscribersSet>).\n   * @param callback The callback to remove from listeners.\n   */\n  private removeListener = (callback: Callback): void => {\n    const channelSubscriberSets = this.listeners.get(callback)\n    let isEmpty = true\n\n    // eslint-disable-next-line no-restricted-syntax\n    for (const channelSubscriberSet of channelSubscriberSets || []) {\n      isEmpty = !channelSubscriberSet.has(callback)\n      if (!isEmpty) {\n        break\n      }\n    }\n\n    if (isEmpty) {\n      this.listeners.delete(callback)\n    }\n  }\n\n  /**\n   * Publishes data to a channel.\n   * @param channel The channel to publish the data to.\n   * @param isParent Indicates if the channel is a parent channel.\n   * @param data The data to publish.\n   * @returns A boolean indicating if the publication was successful.\n   */\n  private publishToChannel = (\n    channel: string, isParent: boolean, data?: unknown,\n  ): PublishToChannelReturnType => {\n    const subscribersSet = this.channels.get(channel)\n\n    if (!subscribersSet) {\n      return NON_EXISTENT_CHANNEL as NON_EXISTENT_CHANNEL_TYPE\n    }\n\n    const iterator = subscribersSet[Symbol.iterator]()\n    let subscriberFunc = iterator.next().value\n\n    const results = []\n\n    // eslint-disable-next-line no-plusplus\n    while (subscriberFunc) {\n      // eslint-disable-next-line no-await-in-loop\n      results.push(subscriberFunc(channel, data as CallbackPayload))\n      subscriberFunc = iterator.next().value\n    }\n    return results?.length === 1 ? results[0] : results\n  }\n\n  /**\n   * Creates a new instance of PeregrineMQ.\n   * @param id Specific instance of PeregrineMQ identifier\n   * @param config The configuration options for PeregrineMQ.\n   */\n  constructor(id?: string, config?: Config) {\n    this.id = id || uuidv4()\n    this.configure(config || {})\n  }\n\n  /**\n   * Gets the total number of subscribers across all channels.\n   */\n  get length(): number {\n    return [...this.channels.values()].reduce((acc, subscribersList) => acc + subscribersList.size, 0)\n  }\n\n  /**\n   * Configures PeregrineMQ with the specified options.\n   * @param config The configuration options for PeregrineMQ.\n   * @returns An object containing the prune interval handler (if auto prune is enabled).\n   */\n  configure = (config: Config): {\n    clearPruneInterval?: () => void\n    restartPruneInterval?: () => void\n  } => {\n    this.config = config\n    const { allowAutoPrune, pruneInterval } = config\n\n    let pruneIntervalHandler: ReturnType<typeof setInterval>\n\n    if (allowAutoPrune) {\n      pruneIntervalHandler = setInterval(() => {\n        this.prune()\n      }, pruneInterval)\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    const instance: PeregrineMQ = this\n\n    return {\n      ...(allowAutoPrune\n        ? {\n          clearPruneInterval: (): void => {\n            clearInterval(pruneIntervalHandler)\n          },\n          restartPruneInterval: (): void => {\n            clearInterval(pruneIntervalHandler)\n            pruneIntervalHandler = setInterval(() => {\n              instance.prune()\n            }, pruneInterval)\n          },\n        }\n        : {}),\n    }\n  }\n\n  /**\n   * Gets an array of all channels.\n   * @returns An array of channel names.\n   */\n  getChannels = (): string[] => [...this.channels.keys()]\n\n  /**\n   * Prunes the channels with no subscribers.\n   * @returns An array of pruned channel names.\n   */\n  prune = (): string[] => {\n    const iterator = this.channels[Symbol.iterator]()\n    let subscribersSet = iterator.next().value\n    const prunedChannels: string[] = []\n\n    // eslint-disable-next-line no-plusplus\n    while (subscribersSet) {\n      if (subscribersSet[1]?.size === 0) {\n        prunedChannels.push(subscribersSet[0])\n        this.channels.delete(subscribersSet[0])\n      }\n      subscribersSet = iterator.next().value\n    }\n\n    return prunedChannels\n  }\n\n  /**\n   * Removes a channel and its subscribers.\n   * @param channel The channel to remove.\n   * @returns A boolean indicating if the channel was successfully removed.\n   */\n  removeChannel = (channel: string): boolean => {\n    const subscribersSet = this.channels.get(channel)\n\n    if (subscribersSet && subscribersSet.size > 0) {\n      const channelListeners = [...subscribersSet || []]\n\n      subscribersSet.clear()\n\n      let index = channelListeners.length\n\n      // eslint-disable-next-line no-plusplus\n      while (index--) {\n        this.removeListener(channelListeners[index])\n      }\n    }\n\n    return this.channels.delete(channel)\n  }\n\n  /**\n   * Publishes data to a channel.\n   * @param channel The channel to publish the data to.\n   * @param data The data to publish.\n   * @returns A boolean indicating if the publication was successful.\n   */\n  publish = <T>(channel: string, data?: T): PublishReturnType => {\n    if (channel.includes('.')) {\n      const nestedChannels = channel.split('.')\n\n      let { length } = nestedChannels\n      let it = 0\n      const results = []\n\n      // eslint-disable-next-line no-plusplus\n      while (length--) {\n        // eslint-disable-next-line no-await-in-loop\n        const result = this.publishToChannel(\n          nestedChannels.slice(0, it + 1).join('.'),\n          length !== nestedChannels.length - 1,\n          data,\n        )\n\n        it += 1\n        results.push(result)\n      }\n      return results\n    }\n\n    return this.publishToChannel(channel, false, data)\n  }\n\n  /**\n   * Subscribes a callback to a channel.\n   * @param channel The channel to subscribe to.\n   * @param callback The callback function to subscribe.\n   * @returns A function to unsubscribe the callback.\n   */\n  subscribe = (channel: string, callback: Callback): () => boolean => {\n    const subscribersList = this.channels.get(channel)\n\n    if (subscribersList) {\n      subscribersList.add(callback)\n    } else {\n      this.channels.set(channel, new Set([callback]))\n    }\n\n    this.addListener(callback, channel)\n\n    return () => this.unsubscribe(callback, { channel, prune: true })\n  }\n\n  /**\n   * Unsubscribes a callback from a channel or all channels.\n   * @param callback The callback function to unsubscribe.\n   * @param options Optional unsubscribe options.\n   * @returns A boolean indicating if the callback was successfully unsubscribed.\n   */\n  unsubscribe = (callback: Callback, options?: UnsubscribeOptions): boolean => {\n    const { channel, prune } = options || {}\n\n    let unsubscribed = false\n\n    if (channel) {\n      const subscriberSet = this.channels.get(channel)\n\n      unsubscribed = subscriberSet ? subscriberSet.delete(callback) : false\n      if (prune && subscriberSet?.size === 0) {\n        this.channels.delete(channel)\n      }\n\n      this.removeListener(callback)\n\n      return unsubscribed\n    }\n\n    const subscriberSetArray = this.listeners.get(callback) || []\n\n    // remove callback form listeners and all channels\n    // TODO remove only if has\n    // eslint-disable-next-line no-restricted-syntax\n    for (const subscriberSet of subscriberSetArray) {\n      unsubscribed = subscriberSet.delete(callback) as boolean\n\n      if (prune && subscriberSet.size === 0) {\n        this.prune()\n      }\n    }\n\n    this.listeners.delete(callback)\n\n    return unsubscribed\n  }\n\n  /**\n   * Checks if a callback is subscribed to a specific channel or any channel.\n   * @param callback The callback function to check.\n   * @param channel Optional channel name to check subscription for.\n   * @returns A boolean indicating if the callback is subscribed.\n   */\n  isSubscribed = (callback: Callback, channel?: string): boolean => {\n    if (channel) {\n      const subscribersList = this.channels.get(channel)\n\n      return subscribersList ? subscribersList.has(callback) : false\n    }\n\n    return this.listeners.has(callback)\n  }\n\n  /**\n   * Clears all channels and listeners.\n   * @throws {Error} If clearing PeregrineMQ is not allowed.\n   */\n  clear = (): void => {\n    if (this.config.allowClear) {\n      this.channels.clear()\n      this.listeners.clear()\n    } else {\n      throw new PeregrineMQClearError()\n    }\n  }\n\n  /**\n   * Returns the specific instance of PeregrineMQ.\n   * @returns A string identifier of the specific instance of PeregrineMQ.\n   */\n  getId = (): string => this.id\n}\n"],"names":["PeregrineMQClearError","Error","constructor","super","this","name","PeregrineMQ","id","config","allowAutoPrune","pruneInterval","allowClear","channels","Map","listeners","addListener","callback","channel","listener","get","subscribersSet","push","set","removeListener","channelSubscriberSets","isEmpty","channelSubscriberSet","has","delete","publishToChannel","isParent","data","NON_EXISTENT_CHANNEL","iterator","Symbol","subscriberFunc","next","value","results","length","configure","pruneIntervalHandler","setInterval","prune","instance","clearPruneInterval","clearInterval","restartPruneInterval","getChannels","keys","prunedChannels","size","removeChannel","channelListeners","clear","index","publish","includes","nestedChannels","split","it","result","slice","join","subscribe","subscribersList","add","Set","unsubscribe","options","unsubscribed","subscriberSet","subscriberSetArray","isSubscribed","getId","uuidv4","values","reduce","acc"],"mappings":"qIAWO,MAAMA,UAA8BC,MACzCC,WAAAA,GACEC,MAAM,4FACNC,KAAKC,KAAO,uBACd,EAMK,MAAMC,EA+FXJ,WAAAA,CAAYK,EAAaC,GAAiBJ,KA9FlCG,QAAE,EAAAH,KAEFI,OAAiB,CACvBC,gBAAgB,EAChBC,cAAe,IACfC,YAAY,GAGdP,KAGQQ,SAAwC,IAAIC,IAEpDT,KAGQU,UAA6C,IAAID,IAEzDT,KAKQW,YAAc,CAACC,EAAoBC,KACzC,MAAMC,EAAWd,KAAKU,UAAUK,IAAIH,GAC9BI,EAAiBhB,KAAKQ,SAASO,IAAIF,GAErCG,IACEF,EACFA,EAASG,KAAKD,GAEdhB,KAAKU,UAAUQ,IAAIN,EAAU,CAACI,IAElC,EAGFhB,KAMQmB,eAAkBP,IACxB,MAAMQ,EAAwBpB,KAAKU,UAAUK,IAAIH,GACjD,IAAIS,GAAU,EAGd,IAAK,MAAMC,KAAwBF,GAAyB,GAE1D,GADAC,GAAWC,EAAqBC,IAAIX,IAC/BS,EACH,MAIAA,GACFrB,KAAKU,UAAUc,OAAOZ,EACxB,EAGFZ,KAOQyB,iBAAmB,CACzBZ,EAAiBa,EAAmBC,KAEpC,MAAMX,EAAiBhB,KAAKQ,SAASO,IAAIF,GAEzC,IAAKG,EACH,OAAOY,EAGT,MAAMC,EAAWb,EAAec,OAAOD,YACvC,IAAIE,EAAiBF,EAASG,OAAOC,MAErC,MAAMC,EAAU,GAGhB,KAAOH,GAELG,EAAQjB,KAAKc,EAAelB,EAASc,IACrCI,EAAiBF,EAASG,OAAOC,MAEnC,OAA2B,IAApBC,GAASC,OAAeD,EAAQ,GAAKA,CAAO,EAoBrDlC,KAKAoC,UAAahC,IAIXJ,KAAKI,OAASA,EACd,MAAMC,eAAEA,EAAcC,cAAEA,GAAkBF,EAE1C,IAAIiC,EAEAhC,IACFgC,EAAuBC,aAAY,KACjCtC,KAAKuC,OAAO,GACXjC,IAIL,MAAMkC,EAAwBxC,KAE9B,MAAO,IACDK,EACA,CACAoC,mBAAoBA,KAClBC,cAAcL,EAAqB,EAErCM,qBAAsBA,KACpBD,cAAcL,GACdA,EAAuBC,aAAY,KACjCE,EAASD,OAAO,GACfjC,EAAc,GAGnB,GACL,EAGHN,KAIA4C,YAAc,IAAgB,IAAI5C,KAAKQ,SAASqC,QAEhD7C,KAIAuC,MAAQ,KACN,MAAMV,EAAW7B,KAAKQ,SAASsB,OAAOD,YACtC,IAAIb,EAAiBa,EAASG,OAAOC,MACrC,MAAMa,EAA2B,GAGjC,KAAO9B,GAC2B,IAA5BA,EAAe,IAAI+B,OACrBD,EAAe7B,KAAKD,EAAe,IACnChB,KAAKQ,SAASgB,OAAOR,EAAe,KAEtCA,EAAiBa,EAASG,OAAOC,MAGnC,OAAOa,CAAc,EAGvB9C,KAKAgD,cAAiBnC,IACf,MAAMG,EAAiBhB,KAAKQ,SAASO,IAAIF,GAEzC,GAAIG,GAAkBA,EAAe+B,KAAO,EAAG,CAC7C,MAAME,EAAmB,IAAIjC,GAAkB,IAE/CA,EAAekC,QAEf,IAAIC,EAAQF,EAAiBd,OAG7B,KAAOgB,KACLnD,KAAKmB,eAAe8B,EAAiBE,GAEzC,CAEA,OAAOnD,KAAKQ,SAASgB,OAAOX,EAAQ,EAGtCb,KAMAoD,QAAU,CAAIvC,EAAiBc,KAC7B,GAAId,EAAQwC,SAAS,KAAM,CACzB,MAAMC,EAAiBzC,EAAQ0C,MAAM,KAErC,IAAIpB,OAAEA,GAAWmB,EACbE,EAAK,EACT,MAAMtB,EAAU,GAGhB,KAAOC,KAAU,CAEf,MAAMsB,EAASzD,KAAKyB,iBAClB6B,EAAeI,MAAM,EAAGF,EAAK,GAAGG,KAAK,KACrCxB,IAAWmB,EAAenB,OAAS,EACnCR,GAGF6B,GAAM,EACNtB,EAAQjB,KAAKwC,EACf,CACA,OAAOvB,CACT,CAEA,OAAOlC,KAAKyB,iBAAiBZ,GAAS,EAAOc,EAAK,EAGpD3B,KAMA4D,UAAY,CAAC/C,EAAiBD,KAC5B,MAAMiD,EAAkB7D,KAAKQ,SAASO,IAAIF,GAU1C,OARIgD,EACFA,EAAgBC,IAAIlD,GAEpBZ,KAAKQ,SAASU,IAAIL,EAAS,IAAIkD,IAAI,CAACnD,KAGtCZ,KAAKW,YAAYC,EAAUC,GAEpB,IAAMb,KAAKgE,YAAYpD,EAAU,CAAEC,UAAS0B,OAAO,GAAO,EAGnEvC,KAMAgE,YAAc,CAACpD,EAAoBqD,KACjC,MAAMpD,QAAEA,EAAO0B,MAAEA,GAAU0B,GAAW,CAAA,EAEtC,IAAIC,GAAe,EAEnB,GAAIrD,EAAS,CACX,MAAMsD,EAAgBnE,KAAKQ,SAASO,IAAIF,GASxC,OAPAqD,IAAeC,GAAgBA,EAAc3C,OAAOZ,GAChD2B,GAAiC,IAAxB4B,GAAepB,MAC1B/C,KAAKQ,SAASgB,OAAOX,GAGvBb,KAAKmB,eAAeP,GAEbsD,CACT,CAEA,MAAME,EAAqBpE,KAAKU,UAAUK,IAAIH,IAAa,GAK3D,IAAK,MAAMuD,KAAiBC,EAC1BF,EAAeC,EAAc3C,OAAOZ,GAEhC2B,GAAgC,IAAvB4B,EAAcpB,MACzB/C,KAAKuC,QAMT,OAFAvC,KAAKU,UAAUc,OAAOZ,GAEfsD,CAAY,EAGrBlE,KAMAqE,aAAe,CAACzD,EAAoBC,KAClC,GAAIA,EAAS,CACX,MAAMgD,EAAkB7D,KAAKQ,SAASO,IAAIF,GAE1C,QAAOgD,GAAkBA,EAAgBtC,IAAIX,EAC/C,CAEA,OAAOZ,KAAKU,UAAUa,IAAIX,EAAS,EAGrCZ,KAIAkD,MAAQ,KACN,IAAIlD,KAAKI,OAAOG,WAId,MAAM,IAAIX,EAHVI,KAAKQ,SAAS0C,QACdlD,KAAKU,UAAUwC,OAGjB,EAGFlD,KAIAsE,MAAQ,IAActE,KAAKG,GArOzBH,KAAKG,GAAKA,GAAMoE,IAChBvE,KAAKoC,UAAUhC,GAAU,CAAA,EAC3B,CAKA,UAAI+B,GACF,MAAO,IAAInC,KAAKQ,SAASgE,UAAUC,QAAO,CAACC,EAAKb,IAAoBa,EAAMb,EAAgBd,MAAM,EAClG"}
+{"version":3,"file":"peregrineMQ.js","sources":["../../../../../../../../src/core/utils/appState/peregrineMQ/peregrineMQ.ts"],"sourcesContent":["import { v4 as uuidv4 } from 'uuid'\n\nimport {\n  Callback, Config, PeregrineMQApi, PublishToChannelReturnType,\n  PublishReturnType, SubscribersSet,\n  UnsubscribeOptions, NON_EXISTENT_CHANNEL_TYPE,\n  NON_EXISTENT_CHANNEL,\n  CallbackPayload,\n} from './peregrineMQ.types'\n\n\nexport class PeregrineMQClearError extends Error {\n  constructor() {\n    super('Clearing PeregrineMQ is not allowed. Please read the documentation for more information.')\n    this.name = 'PeregrineMQClearError'\n  }\n}\n\n/**\n * Represents a message queue with publish/subscribe functionality.\n */\nexport class PeregrineMQ implements PeregrineMQApi {\n  private id: string\n\n  private config: Config = {\n    allowAutoPrune: false,\n    pruneInterval: 10000,\n    allowClear: false,\n  }\n\n  /**\n   * The map of channels and their subscribers sets.\n   */\n  private channels: Map<string, SubscribersSet> = new Map()\n\n  /**\n   * The map of listeners and their subscribed channels.\n   */\n  private listeners: Map<Callback, SubscribersSet[]> = new Map()\n\n  /**\n   * Adds a callback as a listener to a channel.\n   * @param callback The callback function to add as a listener.\n   * @param channel The channel to add the listener to.\n   */\n  private addListener = (callback: Callback, channel: string): void => {\n    const listener = this.listeners.get(callback)\n    const subscribersSet = this.channels.get(channel)\n\n    if (subscribersSet) {\n      if (listener) {\n        listener.push(subscribersSet)\n      } else {\n        this.listeners.set(callback, [subscribersSet])\n      }\n    }\n  }\n\n  /**\n   * Removes the callback from the listeners collection if it is not subscribed to any channels.\n   * @description Removes the callback only when it is not present in any other subscriberSet\n   * (Ref to Map<string, SubscribersSet>).\n   * @param callback The callback to remove from listeners.\n   */\n  private removeListener = (callback: Callback): void => {\n    const channelSubscriberSets = this.listeners.get(callback)\n    let isEmpty = true\n\n    // eslint-disable-next-line no-restricted-syntax\n    for (const channelSubscriberSet of channelSubscriberSets || []) {\n      isEmpty = !channelSubscriberSet.has(callback)\n      if (!isEmpty) {\n        break\n      }\n    }\n\n    if (isEmpty) {\n      this.listeners.delete(callback)\n    }\n  }\n\n  /**\n   * Publishes data to a channel.\n   * @param channel The channel to publish the data to.\n   * @param isParent Indicates if the channel is a parent channel.\n   * @param data The data to publish.\n   * @returns A boolean indicating if the publication was successful.\n   */\n  private publishToChannel = (\n    channel: string, isParent: boolean, data?: unknown,\n  ): PublishToChannelReturnType => {\n    const subscribersSet = this.channels.get(channel)\n\n    if (!subscribersSet) {\n      return NON_EXISTENT_CHANNEL as NON_EXISTENT_CHANNEL_TYPE\n    }\n\n    const iterator = subscribersSet[Symbol.iterator]()\n    let subscriberFunc = iterator.next().value\n\n    const results = []\n\n    // eslint-disable-next-line no-plusplus\n    while (subscriberFunc) {\n      // eslint-disable-next-line no-await-in-loop\n      results.push(subscriberFunc(channel, data as CallbackPayload))\n      subscriberFunc = iterator.next().value\n    }\n    return results?.length === 1 ? results[0] : results\n  }\n\n  /**\n   * Creates a new instance of PeregrineMQ.\n   * @param id Specific instance of PeregrineMQ identifier\n   * @param config The configuration options for PeregrineMQ.\n   */\n  constructor(id?: string, config?: Config) {\n    this.id = id || uuidv4()\n    this.configure(config || {})\n  }\n\n  /**\n   * Gets the total number of subscribers across all channels.\n   */\n  get length(): number {\n    return [...this.channels.values()].reduce((acc, subscribersList) => acc + subscribersList.size, 0)\n  }\n\n  /**\n   * Configures PeregrineMQ with the specified options.\n   * @param config The configuration options for PeregrineMQ.\n   * @returns An object containing the prune interval handler (if auto prune is enabled).\n   */\n  configure = (config: Config): {\n    clearPruneInterval?: () => void\n    restartPruneInterval?: () => void\n  } => {\n    this.config = config\n    const { allowAutoPrune, pruneInterval } = config\n\n    let pruneIntervalHandler: ReturnType<typeof setInterval>\n\n    if (allowAutoPrune) {\n      pruneIntervalHandler = setInterval(() => {\n        this.prune()\n      }, pruneInterval)\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    const instance: PeregrineMQ = this\n\n    return {\n      ...(allowAutoPrune\n        ? {\n          clearPruneInterval: (): void => {\n            clearInterval(pruneIntervalHandler)\n          },\n          restartPruneInterval: (): void => {\n            clearInterval(pruneIntervalHandler)\n            pruneIntervalHandler = setInterval(() => {\n              instance.prune()\n            }, pruneInterval)\n          },\n        }\n        : {}),\n    }\n  }\n\n  /**\n   * Gets an array of all channels.\n   * @returns An array of channel names.\n   */\n  getChannels = (): string[] => [...this.channels.keys()]\n\n  /**\n   * Prunes the channels with no subscribers.\n   * @returns An array of pruned channel names.\n   */\n  prune = (): string[] => {\n    const iterator = this.channels[Symbol.iterator]()\n    let subscribersSet = iterator.next().value\n    const prunedChannels: string[] = []\n\n    // eslint-disable-next-line no-plusplus\n    while (subscribersSet) {\n      if (subscribersSet[1]?.size === 0) {\n        prunedChannels.push(subscribersSet[0])\n        this.channels.delete(subscribersSet[0])\n      }\n      subscribersSet = iterator.next().value\n    }\n\n    return prunedChannels\n  }\n\n  /**\n   * Removes a channel and its subscribers.\n   * @param channel The channel to remove.\n   * @returns A boolean indicating if the channel was successfully removed.\n   */\n  removeChannel = (channel: string): boolean => {\n    const subscribersSet = this.channels.get(channel)\n\n    if (subscribersSet && subscribersSet.size > 0) {\n      const channelListeners = [...subscribersSet || []]\n\n      subscribersSet.clear()\n\n      let index = channelListeners.length\n\n      // eslint-disable-next-line no-plusplus\n      while (index--) {\n        this.removeListener(channelListeners[index])\n      }\n    }\n\n    return this.channels.delete(channel)\n  }\n\n  /**\n   * Publishes data to a channel.\n   * @param channel The channel to publish the data to.\n   * @param data The data to publish.\n   * @returns A boolean indicating if the publication was successful.\n   */\n  publish = <T>(channel: string, data?: T): PublishReturnType => {\n    if (channel.includes('.')) {\n      const nestedChannels = channel.split('.')\n\n      let { length } = nestedChannels\n      let it = 0\n      const results = []\n\n      // eslint-disable-next-line no-plusplus\n      while (length--) {\n        // eslint-disable-next-line no-await-in-loop\n        const result = this.publishToChannel(\n          nestedChannels.slice(0, it + 1).join('.'),\n          length !== nestedChannels.length - 1,\n          data,\n        )\n\n        it += 1\n        results.push(result)\n      }\n      return results\n    }\n\n    return this.publishToChannel(channel, false, data)\n  }\n\n  /**\n   * Subscribes a callback to a channel.\n   * @param channel The channel to subscribe to.\n   * @param callback The callback function to subscribe.\n   * @returns A function to unsubscribe the callback.\n   */\n  subscribe = (channel: string, callback: Callback): () => boolean => {\n    const subscribersList = this.channels.get(channel)\n\n    if (subscribersList) {\n      subscribersList.add(callback)\n    } else {\n      this.channels.set(channel, new Set([callback]))\n    }\n\n    this.addListener(callback, channel)\n\n    return () => this.unsubscribe(callback, { channel, prune: true })\n  }\n\n  /**\n   * Unsubscribes a callback from a channel or all channels.\n   * @param callback The callback function to unsubscribe.\n   * @param options Optional unsubscribe options.\n   * @returns A boolean indicating if the callback was successfully unsubscribed.\n   */\n  unsubscribe = (callback: Callback, options?: UnsubscribeOptions): boolean => {\n    const { channel, prune } = options || {}\n\n    let unsubscribed = false\n\n    if (channel) {\n      const subscriberSet = this.channels.get(channel)\n\n      unsubscribed = subscriberSet ? subscriberSet.delete(callback) : false\n      if (prune && subscriberSet?.size === 0) {\n        this.channels.delete(channel)\n      }\n\n      this.removeListener(callback)\n\n      return unsubscribed\n    }\n\n    const subscriberSetArray = this.listeners.get(callback) || []\n\n    // remove callback form listeners and all channels\n    // TODO remove only if has\n    // eslint-disable-next-line no-restricted-syntax\n    for (const subscriberSet of subscriberSetArray) {\n      unsubscribed = subscriberSet.delete(callback) as boolean\n\n      if (prune && subscriberSet.size === 0) {\n        this.prune()\n      }\n    }\n\n    this.listeners.delete(callback)\n\n    return unsubscribed\n  }\n\n  /**\n   * Checks if a callback is subscribed to a specific channel or any channel.\n   * @param callback The callback function to check.\n   * @param channel Optional channel name to check subscription for.\n   * @returns A boolean indicating if the callback is subscribed.\n   */\n  isSubscribed = (callback: Callback, channel?: string): boolean => {\n    if (channel) {\n      const subscribersList = this.channels.get(channel)\n\n      return subscribersList ? subscribersList.has(callback) : false\n    }\n\n    return this.listeners.has(callback)\n  }\n\n  /**\n   * Clears all channels and listeners.\n   * @throws {Error} If clearing PeregrineMQ is not allowed.\n   */\n  clear = (): void => {\n    if (this.config.allowClear) {\n      this.channels.clear()\n      this.listeners.clear()\n    } else {\n      throw new PeregrineMQClearError()\n    }\n  }\n\n  /**\n   * Returns the specific instance of PeregrineMQ.\n   * @returns A string identifier of the specific instance of PeregrineMQ.\n   */\n  getId = (): string => this.id\n}\n"],"names":["PeregrineMQClearError","Error","constructor","super","this","name","PeregrineMQ","id","config","allowAutoPrune","pruneInterval","allowClear","channels","Map","listeners","addListener","callback","channel","listener","get","subscribersSet","push","set","removeListener","channelSubscriberSets","isEmpty","channelSubscriberSet","has","delete","publishToChannel","isParent","data","NON_EXISTENT_CHANNEL","iterator","Symbol","subscriberFunc","next","value","results","length","configure","pruneIntervalHandler","setInterval","prune","instance","_objectSpread","clearPruneInterval","clearInterval","restartPruneInterval","getChannels","keys","prunedChannels","_subscribersSet$","size","removeChannel","channelListeners","clear","index","publish","includes","nestedChannels","split","it","result","slice","join","subscribe","subscribersList","add","Set","unsubscribe","options","unsubscribed","subscriberSet","subscriberSetArray","isSubscribed","getId","uuidv4","values","reduce","acc"],"mappings":"8SAWO,MAAMA,UAA8BC,MACzCC,WAAAA,GACEC,MAAM,4FACNC,KAAKC,KAAO,uBACd,EAMK,MAAMC,EA+FXJ,WAAAA,CAAYK,EAAaC,GAAiBJ,KA9FlCG,QAAE,EAAAH,KAEFI,OAAiB,CACvBC,gBAAgB,EAChBC,cAAe,IACfC,YAAY,GAGdP,KAGQQ,SAAwC,IAAIC,IAEpDT,KAGQU,UAA6C,IAAID,IAEzDT,KAKQW,YAAc,CAACC,EAAoBC,KACzC,MAAMC,EAAWd,KAAKU,UAAUK,IAAIH,GAC9BI,EAAiBhB,KAAKQ,SAASO,IAAIF,GAErCG,IACEF,EACFA,EAASG,KAAKD,GAEdhB,KAAKU,UAAUQ,IAAIN,EAAU,CAACI,IAElC,EAGFhB,KAMQmB,eAAkBP,IACxB,MAAMQ,EAAwBpB,KAAKU,UAAUK,IAAIH,GACjD,IAAIS,GAAU,EAGd,IAAK,MAAMC,KAAwBF,GAAyB,GAE1D,GADAC,GAAWC,EAAqBC,IAAIX,IAC/BS,EACH,MAIAA,GACFrB,KAAKU,UAAUc,OAAOZ,EACxB,EAGFZ,KAOQyB,iBAAmB,CACzBZ,EAAiBa,EAAmBC,KAEpC,MAAMX,EAAiBhB,KAAKQ,SAASO,IAAIF,GAEzC,IAAKG,EACH,OAAOY,EAGT,MAAMC,EAAWb,EAAec,OAAOD,YACvC,IAAIE,EAAiBF,EAASG,OAAOC,MAErC,MAAMC,EAAU,GAGhB,KAAOH,GAELG,EAAQjB,KAAKc,EAAelB,EAASc,IACrCI,EAAiBF,EAASG,OAAOC,MAEnC,OAA2B,KAApBC,aAAO,EAAPA,EAASC,QAAeD,EAAQ,GAAKA,CAAO,EAoBrDlC,KAKAoC,UAAahC,IAIXJ,KAAKI,OAASA,EACd,MAAMC,eAAEA,EAAcC,cAAEA,GAAkBF,EAE1C,IAAIiC,EAEAhC,IACFgC,EAAuBC,aAAY,KACjCtC,KAAKuC,OAAO,GACXjC,IAIL,MAAMkC,EAAwBxC,KAE9B,OAAAyC,EACMpC,CAAAA,EAAAA,EACA,CACAqC,mBAAoBA,KAClBC,cAAcN,EAAqB,EAErCO,qBAAsBA,KACpBD,cAAcN,GACdA,EAAuBC,aAAY,KACjCE,EAASD,OAAO,GACfjC,EAAc,GAGnB,GAAE,EAIVN,KAIA6C,YAAc,IAAgB,IAAI7C,KAAKQ,SAASsC,QAEhD9C,KAIAuC,MAAQ,KACN,MAAMV,EAAW7B,KAAKQ,SAASsB,OAAOD,YACtC,IAAIb,EAAiBa,EAASG,OAAOC,MACrC,MAAMc,EAA2B,GAGjC,KAAO/B,GAAgB,CAAA,IAAAgC,EACW,KAAXA,QAAjBA,EAAAhC,EAAe,cAAEgC,SAAjBA,EAAmBC,QACrBF,EAAe9B,KAAKD,EAAe,IACnChB,KAAKQ,SAASgB,OAAOR,EAAe,KAEtCA,EAAiBa,EAASG,OAAOC,KACnC,CAEA,OAAOc,CAAc,EAGvB/C,KAKAkD,cAAiBrC,IACf,MAAMG,EAAiBhB,KAAKQ,SAASO,IAAIF,GAEzC,GAAIG,GAAkBA,EAAeiC,KAAO,EAAG,CAC7C,MAAME,EAAmB,IAAInC,GAAkB,IAE/CA,EAAeoC,QAEf,IAAIC,EAAQF,EAAiBhB,OAG7B,KAAOkB,KACLrD,KAAKmB,eAAegC,EAAiBE,GAEzC,CAEA,OAAOrD,KAAKQ,SAASgB,OAAOX,EAAQ,EAGtCb,KAMAsD,QAAU,CAAIzC,EAAiBc,KAC7B,GAAId,EAAQ0C,SAAS,KAAM,CACzB,MAAMC,EAAiB3C,EAAQ4C,MAAM,KAErC,IAAItB,OAAEA,GAAWqB,EACbE,EAAK,EACT,MAAMxB,EAAU,GAGhB,KAAOC,KAAU,CAEf,MAAMwB,EAAS3D,KAAKyB,iBAClB+B,EAAeI,MAAM,EAAGF,EAAK,GAAGG,KAAK,KACrC1B,IAAWqB,EAAerB,OAAS,EACnCR,GAGF+B,GAAM,EACNxB,EAAQjB,KAAK0C,EACf,CACA,OAAOzB,CACT,CAEA,OAAOlC,KAAKyB,iBAAiBZ,GAAS,EAAOc,EAAK,EAGpD3B,KAMA8D,UAAY,CAACjD,EAAiBD,KAC5B,MAAMmD,EAAkB/D,KAAKQ,SAASO,IAAIF,GAU1C,OARIkD,EACFA,EAAgBC,IAAIpD,GAEpBZ,KAAKQ,SAASU,IAAIL,EAAS,IAAIoD,IAAI,CAACrD,KAGtCZ,KAAKW,YAAYC,EAAUC,GAEpB,IAAMb,KAAKkE,YAAYtD,EAAU,CAAEC,UAAS0B,OAAO,GAAO,EAGnEvC,KAMAkE,YAAc,CAACtD,EAAoBuD,KACjC,MAAMtD,QAAEA,EAAO0B,MAAEA,GAAU4B,GAAW,CAAE,EAExC,IAAIC,GAAe,EAEnB,GAAIvD,EAAS,CACX,MAAMwD,EAAgBrE,KAAKQ,SAASO,IAAIF,GASxC,OAPAuD,IAAeC,GAAgBA,EAAc7C,OAAOZ,GAChD2B,GAAiC,KAAxB8B,aAAAA,EAAAA,EAAepB,OAC1BjD,KAAKQ,SAASgB,OAAOX,GAGvBb,KAAKmB,eAAeP,GAEbwD,CACT,CAEA,MAAME,EAAqBtE,KAAKU,UAAUK,IAAIH,IAAa,GAK3D,IAAK,MAAMyD,KAAiBC,EAC1BF,EAAeC,EAAc7C,OAAOZ,GAEhC2B,GAAgC,IAAvB8B,EAAcpB,MACzBjD,KAAKuC,QAMT,OAFAvC,KAAKU,UAAUc,OAAOZ,GAEfwD,CAAY,EAGrBpE,KAMAuE,aAAe,CAAC3D,EAAoBC,KAClC,GAAIA,EAAS,CACX,MAAMkD,EAAkB/D,KAAKQ,SAASO,IAAIF,GAE1C,QAAOkD,GAAkBA,EAAgBxC,IAAIX,EAC/C,CAEA,OAAOZ,KAAKU,UAAUa,IAAIX,EAAS,EAGrCZ,KAIAoD,MAAQ,KACN,IAAIpD,KAAKI,OAAOG,WAId,MAAM,IAAIX,EAHVI,KAAKQ,SAAS4C,QACdpD,KAAKU,UAAU0C,OAGjB,EAGFpD,KAIAwE,MAAQ,IAAcxE,KAAKG,GArOzBH,KAAKG,GAAKA,GAAMsE,IAChBzE,KAAKoC,UAAUhC,GAAU,GAC3B,CAKA,UAAI+B,GACF,MAAO,IAAInC,KAAKQ,SAASkE,UAAUC,QAAO,CAACC,EAAKb,IAAoBa,EAAMb,EAAgBd,MAAM,EAClG"}

package/dist/utils/esm/src/core/utils/appState/peregrineMQ/usePeregrineMQ.react.js

@@ -1,2 +1,2 @@
-import{useCallback as r,useRef as t,useEffect as c}from"react";const e=(e,n,u)=>{const o=r(u,[u]),s=t();return c((()=>(s.current=e.subscribe(n,o),()=>{s?.current?.()})),[o,n,e]),[s.current,e.publish]};export{e as usePeregrineMQ};
+import{r as e}from"../../../../../node_modules/react/index.js";const r=(r,u,s)=>{const c=e.useCallback(s,[s]),l=e.useRef();return e.useEffect((()=>(l.current=r.subscribe(u,c),()=>{var e;null==l||null===(e=l.current)||void 0===e||e.call(l)})),[c,u,r]),[l.current,r.publish]};export{r as usePeregrineMQ};
 //# sourceMappingURL=usePeregrineMQ.react.js.map

package/dist/utils/esm/src/core/utils/appState/peregrineMQ/usePeregrineMQ.react.js.map

@@ -1 +1 @@
-{"version":3,"file":"usePeregrineMQ.react.js","sources":["../../../../../../../../src/core/utils/appState/peregrineMQ/usePeregrineMQ.react.ts"],"sourcesContent":["import { useCallback, useEffect, useRef } from 'react'\n\nimport { PeregrineMQ } from './peregrineMQ'\nimport { Callback, PublishReturnType } from './peregrineMQ.types'\n\nexport type usePeregrineMQReturnType = [\n  (() => boolean) | undefined,\n  <T>(channel: string, data?: T) => PublishReturnType\n]\n\nexport const usePeregrineMQ = (\n  peregrineInstance: PeregrineMQ, channel: string, callback: Callback,\n): usePeregrineMQReturnType => {\n  const memCallback = useCallback(callback, [callback])\n\n  const unsubscribeRef = useRef<ReturnType<typeof peregrineInstance.subscribe>>()\n\n  useEffect(() => {\n    unsubscribeRef.current = peregrineInstance.subscribe(channel, memCallback)\n\n    return (): void => {\n      unsubscribeRef?.current?.()\n    }\n  }, [memCallback, channel, peregrineInstance])\n\n  return [unsubscribeRef.current, peregrineInstance.publish]\n}\n"],"names":["usePeregrineMQ","peregrineInstance","channel","callback","memCallback","useCallback","unsubscribeRef","useRef","useEffect","current","subscribe","publish"],"mappings":"+DAUO,MAAMA,EAAiBA,CAC5BC,EAAgCC,EAAiBC,KAEjD,MAAMC,EAAcC,EAAYF,EAAU,CAACA,IAErCG,EAAiBC,IAUvB,OARAC,GAAU,KACRF,EAAeG,QAAUR,EAAkBS,UAAUR,EAASE,GAEvD,KACLE,GAAgBG,WAAW,IAE5B,CAACL,EAAaF,EAASD,IAEnB,CAACK,EAAeG,QAASR,EAAkBU,QAAQ"}
+{"version":3,"file":"usePeregrineMQ.react.js","sources":["../../../../../../../../src/core/utils/appState/peregrineMQ/usePeregrineMQ.react.ts"],"sourcesContent":["import { useCallback, useEffect, useRef } from 'react'\n\nimport { PeregrineMQ } from './peregrineMQ'\nimport { Callback, PublishReturnType } from './peregrineMQ.types'\n\nexport type usePeregrineMQReturnType = [\n  (() => boolean) | undefined,\n  <T>(channel: string, data?: T) => PublishReturnType\n]\n\nexport const usePeregrineMQ = (\n  peregrineInstance: PeregrineMQ, channel: string, callback: Callback,\n): usePeregrineMQReturnType => {\n  const memCallback = useCallback(callback, [callback])\n\n  const unsubscribeRef = useRef<ReturnType<typeof peregrineInstance.subscribe>>()\n\n  useEffect(() => {\n    unsubscribeRef.current = peregrineInstance.subscribe(channel, memCallback)\n\n    return (): void => {\n      unsubscribeRef?.current?.()\n    }\n  }, [memCallback, channel, peregrineInstance])\n\n  return [unsubscribeRef.current, peregrineInstance.publish]\n}\n"],"names":["usePeregrineMQ","peregrineInstance","channel","callback","memCallback","useCallback","unsubscribeRef","useRef","useEffect","current","subscribe","_unsubscribeRef$curre","call","publish"],"mappings":"+DAUO,MAAMA,EAAiBA,CAC5BC,EAAgCC,EAAiBC,KAEjD,MAAMC,EAAcC,EAAWA,YAACF,EAAU,CAACA,IAErCG,EAAiBC,EAAAA,SAUvB,OARAC,EAAAA,WAAU,KACRF,EAAeG,QAAUR,EAAkBS,UAAUR,EAASE,GAEvD,KAAY,IAAAO,EACjBL,SAAuBK,QAATA,EAAdL,EAAgBG,mBAAOE,GAAvBA,EAAAC,KAAAN,EAA2B,IAE5B,CAACF,EAAaF,EAASD,IAEnB,CAACK,EAAeG,QAASR,EAAkBY,QAAQ"}

package/dist/utils/esm/src/core/utils/appState/stateMachine/tiny-state-machine.base.js

@@ -1,2 +1,2 @@
-import{classPrivateFieldLooseBase as t,classPrivateFieldLooseKey as e}from"../../../../../_virtual/_rollupPluginBabelHelpers.js";let i=function(t){return t.CHANGE="change",t.TRANSITIONED_TO="transitionedTo",t.TRANSITIONED_FROM="transitionedFrom",t.ADDED_TO_QUEUE="addedToQueue",t.REMOVED_FROM_QUEUE="removedFromQueue",t}({});class s extends Event{constructor(t,e){super(t,e)}}var r=e("name"),n=e("listeners");class a{constructor(e){Object.defineProperty(this,r,{writable:!0,value:void 0}),Object.defineProperty(this,n,{writable:!0,value:void 0}),this.subscribe=e=>(t(this,n)[n].add(e),()=>t(this,n)[n].delete(e)),this.unsubscribe=e=>t(this,n)[n].delete(e),this.publish=e=>{if(t(this,n)[n]?.size)for(const i of t(this,n)[n])i(e)},this.toString=()=>`TinyStateMachineSate: ${t(this,r)[r]}`,t(this,r)[r]=e,t(this,n)[n]=new Set}get name(){return t(this,r)[r]}get[Symbol.toStringTag](){return`TinyStateMachineSate: ${t(this,r)[r]}`}}const o=t=>new Set(t.map((t=>new a(t))));var h=e("states"),l=e("listeners"),u=e("currentState"),d=e("getStateByName"),c=e("getStateByState");class _{constructor(e){Object.defineProperty(this,h,{writable:!0,value:void 0}),Object.defineProperty(this,l,{writable:!0,value:void 0}),Object.defineProperty(this,u,{writable:!0,value:void 0}),this.addState=e=>{t(this,h)[h].add(e)},this.removeState=e=>{t(this,h)[h].delete(e)},this.subscribe=e=>(t(this,l)[l].add(e),()=>t(this,l)[l].delete(e)),this.unsubscribe=e=>{t(this,l)[l].delete(e)},this.publish=(e,i)=>{if(t(this,l)[l]?.size)for(const s of t(this,l)[l])s(e,i)},Object.defineProperty(this,d,{writable:!0,value:e=>Array.from(t(this,h)[h]).find((t=>t.name===e))}),Object.defineProperty(this,c,{writable:!0,value:e=>t(this,h)[h].has(e)?e:void 0}),this.gotoState=e=>{const r="string"==typeof e?t(this,d)[d](e):t(this,c)[c](e);if(!r)throw Error(`TinyStateMachin::gotoState state not found: ${e}`);const n=t(this,u)[u];return t(this,u)[u]=r,this.publish(new s(i.TRANSITIONED_FROM),n),this.publish(new s(i.TRANSITIONED_TO),r),n?.publish(new s(i.TRANSITIONED_FROM)),t(this,u)[u].publish(new s(i.TRANSITIONED_TO)),!0},this.next=()=>{let e;const i=Array.from(t(this,h)[h]);if(!t(this,u)[u])return[e]=i,this.gotoState(e)?e:null;const s=i.findIndex((e=>e===t(this,u)[u]));return s<t(this,h)[h].size-2?(e=i[s+1],this.gotoState(e)?e:null):null},t(this,h)[h]=e,t(this,l)[l]=new Set}get states(){return t(this,h)[h]}get currentState(){return t(this,u)[u]}}const S=function*(){let t,e=S.IS_RUNNING;for(;;)if(t=yield e,t===S.DO_END){e=S.IS_FINITE,yield e;break}return yield*[1,2,3],yield 123,10};S.DO_END="__DO__END__",S.IS_FINITE="__IS__FINITE__",S.IS_RUNNING="__IS__RUNNING__";export{_ as TinyStateMachine,s as TinyStateMachineEvent,i as TinyStateMachineEventType,a as TinyStateMachineState,o as createStates,S as stateIterator};
+import{classPrivateFieldLooseBase as t,classPrivateFieldLooseKey as e}from"../../../../../_virtual/_rollupPluginBabelHelpers.js";import"../../../../../node_modules/core-js/modules/web.dom-collections.iterator.js";let i=function(t){return t.CHANGE="change",t.TRANSITIONED_TO="transitionedTo",t.TRANSITIONED_FROM="transitionedFrom",t.ADDED_TO_QUEUE="addedToQueue",t.REMOVED_FROM_QUEUE="removedFromQueue",t}({});class s extends Event{constructor(t,e){super(t,e)}}var r=e("name"),n=e("listeners");class o{constructor(e){Object.defineProperty(this,r,{writable:!0,value:void 0}),Object.defineProperty(this,n,{writable:!0,value:void 0}),this.subscribe=e=>(t(this,n)[n].add(e),()=>t(this,n)[n].delete(e)),this.unsubscribe=e=>t(this,n)[n].delete(e),this.publish=e=>{var i;if(null!==(i=t(this,n)[n])&&void 0!==i&&i.size)for(const i of t(this,n)[n])i(e)},this.toString=()=>"TinyStateMachineSate: ".concat(t(this,r)[r]),t(this,r)[r]=e,t(this,n)[n]=new Set}get name(){return t(this,r)[r]}get[Symbol.toStringTag](){return"TinyStateMachineSate: ".concat(t(this,r)[r])}}const a=t=>new Set(t.map((t=>new o(t))));var h=e("states"),l=e("listeners"),u=e("currentState"),d=e("getStateByName"),c=e("getStateByState");class _{constructor(e){Object.defineProperty(this,h,{writable:!0,value:void 0}),Object.defineProperty(this,l,{writable:!0,value:void 0}),Object.defineProperty(this,u,{writable:!0,value:void 0}),this.addState=e=>{t(this,h)[h].add(e)},this.removeState=e=>{t(this,h)[h].delete(e)},this.subscribe=e=>(t(this,l)[l].add(e),()=>t(this,l)[l].delete(e)),this.unsubscribe=e=>{t(this,l)[l].delete(e)},this.publish=(e,i)=>{var s;if(null!==(s=t(this,l)[l])&&void 0!==s&&s.size)for(const s of t(this,l)[l])s(e,i)},Object.defineProperty(this,d,{writable:!0,value:e=>Array.from(t(this,h)[h]).find((t=>t.name===e))}),Object.defineProperty(this,c,{writable:!0,value:e=>t(this,h)[h].has(e)?e:void 0}),this.gotoState=e=>{const r="string"==typeof e?t(this,d)[d](e):t(this,c)[c](e);if(!r)throw Error("TinyStateMachin::gotoState state not found: ".concat(e));const n=t(this,u)[u];return t(this,u)[u]=r,this.publish(new s(i.TRANSITIONED_FROM),n),this.publish(new s(i.TRANSITIONED_TO),r),null==n||n.publish(new s(i.TRANSITIONED_FROM)),t(this,u)[u].publish(new s(i.TRANSITIONED_TO)),!0},this.next=()=>{let e;const i=Array.from(t(this,h)[h]);if(!t(this,u)[u])return[e]=i,this.gotoState(e)?e:null;const s=i.findIndex((e=>e===t(this,u)[u]));return s<t(this,h)[h].size-2?(e=i[s+1],this.gotoState(e)?e:null):null},t(this,h)[h]=e,t(this,l)[l]=new Set}get states(){return t(this,h)[h]}get currentState(){return t(this,u)[u]}}const S=function*(){let t,e=S.IS_RUNNING;for(;;)if(t=yield e,t===S.DO_END){e=S.IS_FINITE,yield e;break}return yield*[1,2,3],yield 123,10};S.DO_END="__DO__END__",S.IS_FINITE="__IS__FINITE__",S.IS_RUNNING="__IS__RUNNING__";export{_ as TinyStateMachine,s as TinyStateMachineEvent,i as TinyStateMachineEventType,o as TinyStateMachineState,a as createStates,S as stateIterator};
 //# sourceMappingURL=tiny-state-machine.base.js.map