@relative-ci/core 5.2.2-beta.0 → 5.3.0-alpha.0

package/lib/esm/__/@fastify/busboy/deps/dicer/lib/HeaderParser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HeaderParser.js","sources":["../../../../../../../../../../node_modules/@fastify/busboy/deps/dicer/lib/HeaderParser.js"],"sourcesContent":["'use strict'\n\nconst EventEmitter = require('node:events').EventEmitter\nconst inherits = require('node:util').inherits\nconst getLimit = require('../../../lib/utils/getLimit')\n\nconst StreamSearch = require('../../streamsearch/sbmh')\n\nconst B_DCRLF = Buffer.from('\\r\\n\\r\\n')\nconst RE_CRLF = /\\r\\n/g\nconst RE_HDR = /^([^:]+):[ \\t]?([\\x00-\\xFF]+)?$/ // eslint-disable-line no-control-regex\n\nfunction HeaderParser (cfg) {\n  EventEmitter.call(this)\n\n  cfg = cfg || {}\n  const self = this\n  this.nread = 0\n  this.maxed = false\n  this.npairs = 0\n  this.maxHeaderPairs = getLimit(cfg, 'maxHeaderPairs', 2000)\n  this.maxHeaderSize = getLimit(cfg, 'maxHeaderSize', 80 * 1024)\n  this.buffer = ''\n  this.header = {}\n  this.finished = false\n  this.ss = new StreamSearch(B_DCRLF)\n  this.ss.on('info', function (isMatch, data, start, end) {\n    if (data && !self.maxed) {\n      if (self.nread + end - start >= self.maxHeaderSize) {\n        end = self.maxHeaderSize - self.nread + start\n        self.nread = self.maxHeaderSize\n        self.maxed = true\n      } else { self.nread += (end - start) }\n\n      self.buffer += data.toString('binary', start, end)\n    }\n    if (isMatch) { self._finish() }\n  })\n}\ninherits(HeaderParser, EventEmitter)\n\nHeaderParser.prototype.push = function (data) {\n  const r = this.ss.push(data)\n  if (this.finished) { return r }\n}\n\nHeaderParser.prototype.reset = function () {\n  this.finished = false\n  this.buffer = ''\n  this.header = {}\n  this.ss.reset()\n}\n\nHeaderParser.prototype._finish = function () {\n  if (this.buffer) { this._parseHeader() }\n  this.ss.matches = this.ss.maxMatches\n  const header = this.header\n  this.header = {}\n  this.buffer = ''\n  this.finished = true\n  this.nread = this.npairs = 0\n  this.maxed = false\n  this.emit('header', header)\n}\n\nHeaderParser.prototype._parseHeader = function () {\n  if (this.npairs === this.maxHeaderPairs) { return }\n\n  const lines = this.buffer.split(RE_CRLF)\n  const len = lines.length\n  let m, h\n\n  for (var i = 0; i < len; ++i) { // eslint-disable-line no-var\n    if (lines[i].length === 0) { continue }\n    if (lines[i][0] === '\\t' || lines[i][0] === ' ') {\n      // folded header content\n      // RFC2822 says to just remove the CRLF and not the whitespace following\n      // it, so we follow the RFC and include the leading whitespace ...\n      if (h) {\n        this.header[h][this.header[h].length - 1] += lines[i]\n        continue\n      }\n    }\n\n    const posColon = lines[i].indexOf(':')\n    if (\n      posColon === -1 ||\n      posColon === 0\n    ) {\n      return\n    }\n    m = RE_HDR.exec(lines[i])\n    h = m[1].toLowerCase()\n    this.header[h] = this.header[h] || []\n    this.header[h].push((m[2] || ''))\n    if (++this.npairs === this.maxHeaderPairs) { break }\n  }\n}\n\nmodule.exports = HeaderParser\n"],"names":["require$$2","require$$3"],"mappings":";;;;;;;;;;;;CAEA,MAAM,YAAY,GAAG,UAAsB,CAAC;CAC5C,MAAM,QAAQ,GAAG,UAAoB,CAAC;AACtC,CAAA,MAAM,QAAQ,GAAGA,eAAA;;AAEjB,CAAA,MAAM,YAAY,GAAGC,WAAA;;AAErB,CAAA,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU;AACtC,CAAA,MAAM,OAAO,GAAG;CAChB,MAAM,MAAM,GAAG,kCAAiC;;CAEhD,SAAS,YAAY,EAAE,GAAG,EAAE;AAC5B,GAAE,YAAY,CAAC,IAAI,CAAC,IAAI;;GAEtB,GAAG,GAAG,GAAG,IAAI;GACb,MAAM,IAAI,GAAG;GACb,IAAI,CAAC,KAAK,GAAG;GACb,IAAI,CAAC,KAAK,GAAG;GACb,IAAI,CAAC,MAAM,GAAG;GACd,IAAI,CAAC,cAAc,GAAG,QAAQ,CAAC,GAAG,EAAE,gBAAgB,EAAE,IAAI;AAC5D,GAAE,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,GAAG,EAAE,eAAe,EAAE,EAAE,GAAG,IAAI;GAC7D,IAAI,CAAC,MAAM,GAAG;GACd,IAAI,CAAC,MAAM,GAAG;GACd,IAAI,CAAC,QAAQ,GAAG;AAClB,GAAE,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,OAAO;AACpC,GAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE;AAC1D,KAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;AAC7B,OAAM,IAAI,IAAI,CAAC,KAAK,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE;SAClD,GAAG,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,KAAK,GAAG;AAChD,SAAQ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SAClB,IAAI,CAAC,KAAK,GAAG;OACrB,CAAO,MAAM,EAAE,IAAI,CAAC,KAAK,KAAK,GAAG,GAAG,KAAK,EAAC,CAAA;;AAE1C,OAAM,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG;AACvD,KAAA;AACA,KAAI,IAAI,OAAO,EAAE,EAAE,IAAI,CAAC,OAAO,GAAE,CAAA;GACjC,CAAG;AACH,CAAA;CACA,QAAQ,CAAC,YAAY,EAAE,YAAY;;AAEnC,CAAA,YAAY,CAAC,SAAS,CAAC,IAAI,GAAG,UAAU,IAAI,EAAE;GAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI;AAC7B,GAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,CAAA;AAC/B,CAAA;;AAEA,CAAA,YAAY,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;GACzC,IAAI,CAAC,QAAQ,GAAG;GAChB,IAAI,CAAC,MAAM,GAAG;GACd,IAAI,CAAC,MAAM,GAAG;AAChB,GAAE,IAAI,CAAC,EAAE,CAAC,KAAK;AACf,CAAA;;AAEA,CAAA,YAAY,CAAC,SAAS,CAAC,OAAO,GAAG,YAAY;GAC3C,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,YAAY,GAAE,CAAA;GACtC,IAAI,CAAC,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;AAC5B,GAAE,MAAM,MAAM,GAAG,IAAI,CAAC;GACpB,IAAI,CAAC,MAAM,GAAG;GACd,IAAI,CAAC,MAAM,GAAG;GACd,IAAI,CAAC,QAAQ,GAAG;AAClB,GAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG;GAC3B,IAAI,CAAC,KAAK,GAAG;AACf,GAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM;AAC5B,CAAA;;AAEA,CAAA,YAAY,CAAC,SAAS,CAAC,YAAY,GAAG,YAAY;GAChD,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,cAAc,EAAE,EAAE,MAAM,CAAA;;GAEjD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO;AACzC,GAAE,MAAM,GAAG,GAAG,KAAK,CAAC;GAClB,IAAI,CAAC,EAAE;;AAET,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;KAC5B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAA;KACrC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;AACrD;AACA;AACA;OACM,IAAI,CAAC,EAAE;SACL,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;SACpD;AACR,OAAA;AACA,KAAA;;KAEI,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG;KACrC;OACE,QAAQ,KAAK,EAAE;AACrB,OAAM,QAAQ,KAAK;OACb;OACA;AACN,KAAA;KACI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC5B,KAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW;AACxB,KAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI;AACvC,KAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;KAC/B,IAAI,EAAE,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,cAAc,EAAE,EAAE,KAAK,CAAA;AACtD,GAAA;AACA,CAAA;;AAEA,CAAA,cAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

package/lib/esm/__/@fastify/busboy/deps/dicer/lib/PartStream.js

@@ -0,0 +1,26 @@
+import require$$1 from 'node:util';
+import require$$0 from 'node:stream';
+
+var PartStream_1;
+var hasRequiredPartStream;
+
+function requirePartStream () {
+	if (hasRequiredPartStream) return PartStream_1;
+	hasRequiredPartStream = 1;
+
+	const inherits = require$$1.inherits;
+	const ReadableStream = require$$0.Readable;
+
+	function PartStream (opts) {
+	  ReadableStream.call(this, opts);
+	}
+	inherits(PartStream, ReadableStream);
+
+	PartStream.prototype._read = function (n) {};
+
+	PartStream_1 = PartStream;
+	return PartStream_1;
+}
+
+export { requirePartStream as __require };
+//# sourceMappingURL=PartStream.js.map

package/lib/esm/__/@fastify/busboy/deps/dicer/lib/PartStream.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PartStream.js","sources":["../../../../../../../../../../node_modules/@fastify/busboy/deps/dicer/lib/PartStream.js"],"sourcesContent":["'use strict'\n\nconst inherits = require('node:util').inherits\nconst ReadableStream = require('node:stream').Readable\n\nfunction PartStream (opts) {\n  ReadableStream.call(this, opts)\n}\ninherits(PartStream, ReadableStream)\n\nPartStream.prototype._read = function (n) {}\n\nmodule.exports = PartStream\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;;CAEA,MAAM,QAAQ,GAAGA,UAAoB,CAAC;CACtC,MAAM,cAAc,GAAGC,UAAsB,CAAC;;CAE9C,SAAS,UAAU,EAAE,IAAI,EAAE;AAC3B,GAAE,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI;AAChC,CAAA;CACA,QAAQ,CAAC,UAAU,EAAE,cAAc;;AAEnC,CAAA,UAAU,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,CAAC,EAAE,CAAA;;AAE1C,CAAA,YAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

package/lib/esm/__/@fastify/busboy/deps/streamsearch/sbmh.js

@@ -0,0 +1,241 @@
+import require$$0 from 'node:events';
+import require$$1 from 'node:util';
+
+var sbmh;
+var hasRequiredSbmh;
+
+function requireSbmh () {
+	if (hasRequiredSbmh) return sbmh;
+	hasRequiredSbmh = 1;
+
+	/**
+	 * Copyright Brian White. All rights reserved.
+	 *
+	 * @see https://github.com/mscdex/streamsearch
+	 *
+	 * Permission is hereby granted, free of charge, to any person obtaining a copy
+	 * of this software and associated documentation files (the "Software"), to
+	 * deal in the Software without restriction, including without limitation the
+	 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+	 * sell copies of the Software, and to permit persons to whom the Software is
+	 * furnished to do so, subject to the following conditions:
+	 *
+	 * The above copyright notice and this permission notice shall be included in
+	 * all copies or substantial portions of the Software.
+	 *
+	 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+	 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+	 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+	 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+	 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+	 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+	 * IN THE SOFTWARE.
+	 *
+	 * Based heavily on the Streaming Boyer-Moore-Horspool C++ implementation
+	 * by Hongli Lai at: https://github.com/FooBarWidget/boyer-moore-horspool
+	 */
+	const EventEmitter = require$$0.EventEmitter;
+	const inherits = require$$1.inherits;
+
+	function SBMH (needle) {
+	  if (typeof needle === 'string') {
+	    needle = Buffer.from(needle);
+	  }
+
+	  if (!Buffer.isBuffer(needle)) {
+	    throw new TypeError('The needle has to be a String or a Buffer.')
+	  }
+
+	  const needleLength = needle.length;
+
+	  if (needleLength === 0) {
+	    throw new Error('The needle cannot be an empty String/Buffer.')
+	  }
+
+	  if (needleLength > 256) {
+	    throw new Error('The needle cannot have a length bigger than 256.')
+	  }
+
+	  this.maxMatches = Infinity;
+	  this.matches = 0;
+
+	  this._occ = new Array(256)
+	    .fill(needleLength); // Initialize occurrence table.
+	  this._lookbehind_size = 0;
+	  this._needle = needle;
+	  this._bufpos = 0;
+
+	  this._lookbehind = Buffer.alloc(needleLength);
+
+	  // Populate occurrence table with analysis of the needle,
+	  // ignoring last letter.
+	  for (var i = 0; i < needleLength - 1; ++i) { // eslint-disable-line no-var
+	    this._occ[needle[i]] = needleLength - 1 - i;
+	  }
+	}
+	inherits(SBMH, EventEmitter);
+
+	SBMH.prototype.reset = function () {
+	  this._lookbehind_size = 0;
+	  this.matches = 0;
+	  this._bufpos = 0;
+	};
+
+	SBMH.prototype.push = function (chunk, pos) {
+	  if (!Buffer.isBuffer(chunk)) {
+	    chunk = Buffer.from(chunk, 'binary');
+	  }
+	  const chlen = chunk.length;
+	  this._bufpos = pos || 0;
+	  let r;
+	  while (r !== chlen && this.matches < this.maxMatches) { r = this._sbmh_feed(chunk); }
+	  return r
+	};
+
+	SBMH.prototype._sbmh_feed = function (data) {
+	  const len = data.length;
+	  const needle = this._needle;
+	  const needleLength = needle.length;
+	  const lastNeedleChar = needle[needleLength - 1];
+
+	  // Positive: points to a position in `data`
+	  //           pos == 3 points to data[3]
+	  // Negative: points to a position in the lookbehind buffer
+	  //           pos == -2 points to lookbehind[lookbehind_size - 2]
+	  let pos = -this._lookbehind_size;
+	  let ch;
+
+	  if (pos < 0) {
+	    // Lookbehind buffer is not empty. Perform Boyer-Moore-Horspool
+	    // search with character lookup code that considers both the
+	    // lookbehind buffer and the current round's haystack data.
+	    //
+	    // Loop until
+	    //   there is a match.
+	    // or until
+	    //   we've moved past the position that requires the
+	    //   lookbehind buffer. In this case we switch to the
+	    //   optimized loop.
+	    // or until
+	    //   the character to look at lies outside the haystack.
+	    while (pos < 0 && pos <= len - needleLength) {
+	      ch = this._sbmh_lookup_char(data, pos + needleLength - 1);
+
+	      if (
+	        ch === lastNeedleChar &&
+	        this._sbmh_memcmp(data, pos, needleLength - 1)
+	      ) {
+	        this._lookbehind_size = 0;
+	        ++this.matches;
+	        this.emit('info', true);
+
+	        return (this._bufpos = pos + needleLength)
+	      }
+	      pos += this._occ[ch];
+	    }
+
+	    // No match.
+
+	    if (pos < 0) {
+	      // There's too few data for Boyer-Moore-Horspool to run,
+	      // so let's use a different algorithm to skip as much as
+	      // we can.
+	      // Forward pos until
+	      //   the trailing part of lookbehind + data
+	      //   looks like the beginning of the needle
+	      // or until
+	      //   pos == 0
+	      while (pos < 0 && !this._sbmh_memcmp(data, pos, len - pos)) { ++pos; }
+	    }
+
+	    if (pos >= 0) {
+	      // Discard lookbehind buffer.
+	      this.emit('info', false, this._lookbehind, 0, this._lookbehind_size);
+	      this._lookbehind_size = 0;
+	    } else {
+	      // Cut off part of the lookbehind buffer that has
+	      // been processed and append the entire haystack
+	      // into it.
+	      const bytesToCutOff = this._lookbehind_size + pos;
+	      if (bytesToCutOff > 0) {
+	        // The cut off data is guaranteed not to contain the needle.
+	        this.emit('info', false, this._lookbehind, 0, bytesToCutOff);
+	      }
+
+	      this._lookbehind.copy(this._lookbehind, 0, bytesToCutOff,
+	        this._lookbehind_size - bytesToCutOff);
+	      this._lookbehind_size -= bytesToCutOff;
+
+	      data.copy(this._lookbehind, this._lookbehind_size);
+	      this._lookbehind_size += len;
+
+	      this._bufpos = len;
+	      return len
+	    }
+	  }
+
+	  pos += (pos >= 0) * this._bufpos;
+
+	  // Lookbehind buffer is now empty. We only need to check if the
+	  // needle is in the haystack.
+	  if (data.indexOf(needle, pos) !== -1) {
+	    pos = data.indexOf(needle, pos);
+	    ++this.matches;
+	    if (pos > 0) { this.emit('info', true, data, this._bufpos, pos); } else { this.emit('info', true); }
+
+	    return (this._bufpos = pos + needleLength)
+	  } else {
+	    pos = len - needleLength;
+	  }
+
+	  // There was no match. If there's trailing haystack data that we cannot
+	  // match yet using the Boyer-Moore-Horspool algorithm (because the trailing
+	  // data is less than the needle size) then match using a modified
+	  // algorithm that starts matching from the beginning instead of the end.
+	  // Whatever trailing data is left after running this algorithm is added to
+	  // the lookbehind buffer.
+	  while (
+	    pos < len &&
+	    (
+	      data[pos] !== needle[0] ||
+	      (
+	        (Buffer.compare(
+	          data.subarray(pos, pos + len - pos),
+	          needle.subarray(0, len - pos)
+	        ) !== 0)
+	      )
+	    )
+	  ) {
+	    ++pos;
+	  }
+	  if (pos < len) {
+	    data.copy(this._lookbehind, 0, pos, pos + (len - pos));
+	    this._lookbehind_size = len - pos;
+	  }
+
+	  // Everything until pos is guaranteed not to contain needle data.
+	  if (pos > 0) { this.emit('info', false, data, this._bufpos, pos < len ? pos : len); }
+
+	  this._bufpos = len;
+	  return len
+	};
+
+	SBMH.prototype._sbmh_lookup_char = function (data, pos) {
+	  return (pos < 0)
+	    ? this._lookbehind[this._lookbehind_size + pos]
+	    : data[pos]
+	};
+
+	SBMH.prototype._sbmh_memcmp = function (data, pos, len) {
+	  for (var i = 0; i < len; ++i) { // eslint-disable-line no-var
+	    if (this._sbmh_lookup_char(data, pos + i) !== this._needle[i]) { return false }
+	  }
+	  return true
+	};
+
+	sbmh = SBMH;
+	return sbmh;
+}
+
+export { requireSbmh as __require };
+//# sourceMappingURL=sbmh.js.map

package/lib/esm/__/@fastify/busboy/deps/streamsearch/sbmh.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sbmh.js","sources":["../../../../../../../../../node_modules/@fastify/busboy/deps/streamsearch/sbmh.js"],"sourcesContent":["'use strict'\n\n/**\n * Copyright Brian White. All rights reserved.\n *\n * @see https://github.com/mscdex/streamsearch\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\n * Based heavily on the Streaming Boyer-Moore-Horspool C++ implementation\n * by Hongli Lai at: https://github.com/FooBarWidget/boyer-moore-horspool\n */\nconst EventEmitter = require('node:events').EventEmitter\nconst inherits = require('node:util').inherits\n\nfunction SBMH (needle) {\n  if (typeof needle === 'string') {\n    needle = Buffer.from(needle)\n  }\n\n  if (!Buffer.isBuffer(needle)) {\n    throw new TypeError('The needle has to be a String or a Buffer.')\n  }\n\n  const needleLength = needle.length\n\n  if (needleLength === 0) {\n    throw new Error('The needle cannot be an empty String/Buffer.')\n  }\n\n  if (needleLength > 256) {\n    throw new Error('The needle cannot have a length bigger than 256.')\n  }\n\n  this.maxMatches = Infinity\n  this.matches = 0\n\n  this._occ = new Array(256)\n    .fill(needleLength) // Initialize occurrence table.\n  this._lookbehind_size = 0\n  this._needle = needle\n  this._bufpos = 0\n\n  this._lookbehind = Buffer.alloc(needleLength)\n\n  // Populate occurrence table with analysis of the needle,\n  // ignoring last letter.\n  for (var i = 0; i < needleLength - 1; ++i) { // eslint-disable-line no-var\n    this._occ[needle[i]] = needleLength - 1 - i\n  }\n}\ninherits(SBMH, EventEmitter)\n\nSBMH.prototype.reset = function () {\n  this._lookbehind_size = 0\n  this.matches = 0\n  this._bufpos = 0\n}\n\nSBMH.prototype.push = function (chunk, pos) {\n  if (!Buffer.isBuffer(chunk)) {\n    chunk = Buffer.from(chunk, 'binary')\n  }\n  const chlen = chunk.length\n  this._bufpos = pos || 0\n  let r\n  while (r !== chlen && this.matches < this.maxMatches) { r = this._sbmh_feed(chunk) }\n  return r\n}\n\nSBMH.prototype._sbmh_feed = function (data) {\n  const len = data.length\n  const needle = this._needle\n  const needleLength = needle.length\n  const lastNeedleChar = needle[needleLength - 1]\n\n  // Positive: points to a position in `data`\n  //           pos == 3 points to data[3]\n  // Negative: points to a position in the lookbehind buffer\n  //           pos == -2 points to lookbehind[lookbehind_size - 2]\n  let pos = -this._lookbehind_size\n  let ch\n\n  if (pos < 0) {\n    // Lookbehind buffer is not empty. Perform Boyer-Moore-Horspool\n    // search with character lookup code that considers both the\n    // lookbehind buffer and the current round's haystack data.\n    //\n    // Loop until\n    //   there is a match.\n    // or until\n    //   we've moved past the position that requires the\n    //   lookbehind buffer. In this case we switch to the\n    //   optimized loop.\n    // or until\n    //   the character to look at lies outside the haystack.\n    while (pos < 0 && pos <= len - needleLength) {\n      ch = this._sbmh_lookup_char(data, pos + needleLength - 1)\n\n      if (\n        ch === lastNeedleChar &&\n        this._sbmh_memcmp(data, pos, needleLength - 1)\n      ) {\n        this._lookbehind_size = 0\n        ++this.matches\n        this.emit('info', true)\n\n        return (this._bufpos = pos + needleLength)\n      }\n      pos += this._occ[ch]\n    }\n\n    // No match.\n\n    if (pos < 0) {\n      // There's too few data for Boyer-Moore-Horspool to run,\n      // so let's use a different algorithm to skip as much as\n      // we can.\n      // Forward pos until\n      //   the trailing part of lookbehind + data\n      //   looks like the beginning of the needle\n      // or until\n      //   pos == 0\n      while (pos < 0 && !this._sbmh_memcmp(data, pos, len - pos)) { ++pos }\n    }\n\n    if (pos >= 0) {\n      // Discard lookbehind buffer.\n      this.emit('info', false, this._lookbehind, 0, this._lookbehind_size)\n      this._lookbehind_size = 0\n    } else {\n      // Cut off part of the lookbehind buffer that has\n      // been processed and append the entire haystack\n      // into it.\n      const bytesToCutOff = this._lookbehind_size + pos\n      if (bytesToCutOff > 0) {\n        // The cut off data is guaranteed not to contain the needle.\n        this.emit('info', false, this._lookbehind, 0, bytesToCutOff)\n      }\n\n      this._lookbehind.copy(this._lookbehind, 0, bytesToCutOff,\n        this._lookbehind_size - bytesToCutOff)\n      this._lookbehind_size -= bytesToCutOff\n\n      data.copy(this._lookbehind, this._lookbehind_size)\n      this._lookbehind_size += len\n\n      this._bufpos = len\n      return len\n    }\n  }\n\n  pos += (pos >= 0) * this._bufpos\n\n  // Lookbehind buffer is now empty. We only need to check if the\n  // needle is in the haystack.\n  if (data.indexOf(needle, pos) !== -1) {\n    pos = data.indexOf(needle, pos)\n    ++this.matches\n    if (pos > 0) { this.emit('info', true, data, this._bufpos, pos) } else { this.emit('info', true) }\n\n    return (this._bufpos = pos + needleLength)\n  } else {\n    pos = len - needleLength\n  }\n\n  // There was no match. If there's trailing haystack data that we cannot\n  // match yet using the Boyer-Moore-Horspool algorithm (because the trailing\n  // data is less than the needle size) then match using a modified\n  // algorithm that starts matching from the beginning instead of the end.\n  // Whatever trailing data is left after running this algorithm is added to\n  // the lookbehind buffer.\n  while (\n    pos < len &&\n    (\n      data[pos] !== needle[0] ||\n      (\n        (Buffer.compare(\n          data.subarray(pos, pos + len - pos),\n          needle.subarray(0, len - pos)\n        ) !== 0)\n      )\n    )\n  ) {\n    ++pos\n  }\n  if (pos < len) {\n    data.copy(this._lookbehind, 0, pos, pos + (len - pos))\n    this._lookbehind_size = len - pos\n  }\n\n  // Everything until pos is guaranteed not to contain needle data.\n  if (pos > 0) { this.emit('info', false, data, this._bufpos, pos < len ? pos : len) }\n\n  this._bufpos = len\n  return len\n}\n\nSBMH.prototype._sbmh_lookup_char = function (data, pos) {\n  return (pos < 0)\n    ? this._lookbehind[this._lookbehind_size + pos]\n    : data[pos]\n}\n\nSBMH.prototype._sbmh_memcmp = function (data, pos, len) {\n  for (var i = 0; i < len; ++i) { // eslint-disable-line no-var\n    if (this._sbmh_lookup_char(data, pos + i) !== this._needle[i]) { return false }\n  }\n  return true\n}\n\nmodule.exports = SBMH\n"],"names":[],"mappings":";;;;;;;;;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,MAAM,YAAY,GAAG,UAAsB,CAAC;CAC5C,MAAM,QAAQ,GAAG,UAAoB,CAAC;;CAEtC,SAAS,IAAI,EAAE,MAAM,EAAE;AACvB,GAAE,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;AAClC,KAAI,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM;AAC/B,GAAA;;GAEE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;AAChC,KAAI,MAAM,IAAI,SAAS,CAAC,4CAA4C;AACpE,GAAA;;AAEA,GAAE,MAAM,YAAY,GAAG,MAAM,CAAC;;AAE9B,GAAE,IAAI,YAAY,KAAK,CAAC,EAAE;AAC1B,KAAI,MAAM,IAAI,KAAK,CAAC,8CAA8C;AAClE,GAAA;;AAEA,GAAE,IAAI,YAAY,GAAG,GAAG,EAAE;AAC1B,KAAI,MAAM,IAAI,KAAK,CAAC,kDAAkD;AACtE,GAAA;;GAEE,IAAI,CAAC,UAAU,GAAG;GAClB,IAAI,CAAC,OAAO,GAAG;;AAEjB,GAAE,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG;MACtB,IAAI,CAAC,YAAY,EAAC;GACrB,IAAI,CAAC,gBAAgB,GAAG;GACxB,IAAI,CAAC,OAAO,GAAG;GACf,IAAI,CAAC,OAAO,GAAG;;GAEf,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,YAAY;;AAE9C;AACA;AACA,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;AAC7C,KAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,GAAG,CAAC,GAAG;AAC9C,GAAA;AACA,CAAA;CACA,QAAQ,CAAC,IAAI,EAAE,YAAY;;AAE3B,CAAA,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,YAAY;GACjC,IAAI,CAAC,gBAAgB,GAAG;GACxB,IAAI,CAAC,OAAO,GAAG;GACf,IAAI,CAAC,OAAO,GAAG;AACjB,CAAA;;CAEA,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,UAAU,KAAK,EAAE,GAAG,EAAE;GAC1C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;KAC3B,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ;AACvC,GAAA;AACA,GAAE,MAAM,KAAK,GAAG,KAAK,CAAC;AACtB,GAAE,IAAI,CAAC,OAAO,GAAG,GAAG,IAAI;AACxB,GAAE,IAAI;GACJ,OAAO,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC,CAAA;AACpF,GAAE,OAAO;AACT,CAAA;;AAEA,CAAA,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,UAAU,IAAI,EAAE;AAC5C,GAAE,MAAM,GAAG,GAAG,IAAI,CAAC;AACnB,GAAE,MAAM,MAAM,GAAG,IAAI,CAAC;AACtB,GAAE,MAAM,YAAY,GAAG,MAAM,CAAC;AAC9B,GAAE,MAAM,cAAc,GAAG,MAAM,CAAC,YAAY,GAAG,CAAC;;AAEhD;AACA;AACA;AACA;AACA,GAAE,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;AAClB,GAAE,IAAI;;AAEN,GAAE,IAAI,GAAG,GAAG,CAAC,EAAE;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;KACI,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,YAAY,EAAE;AACjD,OAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,GAAG,GAAG,YAAY,GAAG,CAAC;;OAExD;SACE,EAAE,KAAK,cAAc;SACrB,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,GAAG,CAAC;SAC7C;SACA,IAAI,CAAC,gBAAgB,GAAG;SACxB,EAAE,IAAI,CAAC;AACf,SAAQ,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI;;AAE9B,SAAQ,QAAQ,IAAI,CAAC,OAAO,GAAG,GAAG,GAAG,YAAY;AACjD,OAAA;AACA,OAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AACzB,KAAA;;AAEA;;AAEA,KAAI,IAAI,GAAG,GAAG,CAAC,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;OACM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,IAAG,CAAA;AACzE,KAAA;;AAEA,KAAI,IAAI,GAAG,IAAI,CAAC,EAAE;AAClB;AACA,OAAM,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,IAAI,CAAC,gBAAgB;OACnE,IAAI,CAAC,gBAAgB,GAAG;AAC9B,KAAA,CAAK,MAAM;AACX;AACA;AACA;AACA,OAAM,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,GAAG;AACpD,OAAM,IAAI,aAAa,GAAG,CAAC,EAAE;AAC7B;AACA,SAAQ,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,aAAa;AACnE,OAAA;;AAEA,OAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,aAAa;AAC9D,SAAQ,IAAI,CAAC,gBAAgB,GAAG,aAAa;OACvC,IAAI,CAAC,gBAAgB,IAAI;;OAEzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,gBAAgB;OACjD,IAAI,CAAC,gBAAgB,IAAI;;OAEzB,IAAI,CAAC,OAAO,GAAG;AACrB,OAAM,OAAO;AACb,KAAA;AACA,GAAA;;GAEE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC;;AAE3B;AACA;AACA,GAAE,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,EAAE;KACpC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG;KAC9B,EAAE,IAAI,CAAC;AACX,KAAI,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAC,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAC,CAAA;;AAEpG,KAAI,QAAQ,IAAI,CAAC,OAAO,GAAG,GAAG,GAAG,YAAY;AAC7C,GAAA,CAAG,MAAM;KACL,GAAG,GAAG,GAAG,GAAG;AAChB,GAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;GACE;KACE,GAAG,GAAG,GAAG;AACb;OACM,IAAI,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;AAC7B;UACS,MAAM,CAAC,OAAO;WACb,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;WACnC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG;AACtC,UAAS,KAAK,CAAC;AACf;AACA;KACI;AACJ,KAAI,EAAE;AACN,GAAA;AACA,GAAE,IAAI,GAAG,GAAG,GAAG,EAAE;AACjB,KAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC;AACzD,KAAI,IAAI,CAAC,gBAAgB,GAAG,GAAG,GAAG;AAClC,GAAA;;AAEA;GACE,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC,CAAA;;GAElF,IAAI,CAAC,OAAO,GAAG;AACjB,GAAE,OAAO;AACT,CAAA;;CAEA,IAAI,CAAC,SAAS,CAAC,iBAAiB,GAAG,UAAU,IAAI,EAAE,GAAG,EAAE;AACxD,GAAE,OAAO,CAAC,GAAG,GAAG,CAAC;OACX,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,GAAG,GAAG;OAC5C,IAAI,CAAC,GAAG;AACd,CAAA;;CAEA,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,UAAU,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;AACxD,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;KAC5B,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,KAAK,CAAA;AACjF,GAAA;AACA,GAAE,OAAO;AACT,CAAA;;AAEA,CAAA,IAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

package/lib/esm/__/@fastify/busboy/lib/main.js

@@ -0,0 +1,102 @@
+import { __module as main } from '../../../../_virtual/main.js';
+import require$$0 from 'node:stream';
+import require$$1 from 'node:util';
+import { __require as requireDicer } from '../deps/dicer/lib/Dicer.js';
+import { __require as requireMultipart } from './types/multipart.js';
+import { __require as requireUrlencoded } from './types/urlencoded.js';
+import { __require as requireParseParams } from './utils/parseParams.js';
+
+var hasRequiredMain;
+
+function requireMain () {
+	if (hasRequiredMain) return main.exports;
+	hasRequiredMain = 1;
+
+	const WritableStream = require$$0.Writable;
+	const { inherits } = require$$1;
+	const Dicer = requireDicer();
+
+	const MultipartParser = requireMultipart();
+	const UrlencodedParser = requireUrlencoded();
+	const parseParams = requireParseParams();
+
+	function Busboy (opts) {
+	  if (!(this instanceof Busboy)) { return new Busboy(opts) }
+
+	  if (typeof opts !== 'object') {
+	    throw new TypeError('Busboy expected an options-Object.')
+	  }
+	  if (typeof opts.headers !== 'object') {
+	    throw new TypeError('Busboy expected an options-Object with headers-attribute.')
+	  }
+	  if (typeof opts.headers['content-type'] !== 'string') {
+	    throw new TypeError('Missing Content-Type-header.')
+	  }
+
+	  const {
+	    headers,
+	    ...streamOptions
+	  } = opts;
+
+	  this.opts = {
+	    autoDestroy: false,
+	    ...streamOptions
+	  };
+	  WritableStream.call(this, this.opts);
+
+	  this._done = false;
+	  this._parser = this.getParserByHeaders(headers);
+	  this._finished = false;
+	}
+	inherits(Busboy, WritableStream);
+
+	Busboy.prototype.emit = function (ev) {
+	  if (ev === 'finish') {
+	    if (!this._done) {
+	      this._parser?.end();
+	      return
+	    } else if (this._finished) {
+	      return
+	    }
+	    this._finished = true;
+	  }
+	  WritableStream.prototype.emit.apply(this, arguments);
+	};
+
+	Busboy.prototype.getParserByHeaders = function (headers) {
+	  const parsed = parseParams(headers['content-type']);
+
+	  const cfg = {
+	    defCharset: this.opts.defCharset,
+	    fileHwm: this.opts.fileHwm,
+	    headers,
+	    highWaterMark: this.opts.highWaterMark,
+	    isPartAFile: this.opts.isPartAFile,
+	    limits: this.opts.limits,
+	    parsedConType: parsed,
+	    preservePath: this.opts.preservePath
+	  };
+
+	  if (MultipartParser.detect.test(parsed[0])) {
+	    return new MultipartParser(this, cfg)
+	  }
+	  if (UrlencodedParser.detect.test(parsed[0])) {
+	    return new UrlencodedParser(this, cfg)
+	  }
+	  throw new Error('Unsupported Content-Type.')
+	};
+
+	Busboy.prototype._write = function (chunk, encoding, cb) {
+	  this._parser.write(chunk, cb);
+	};
+
+	main.exports = Busboy;
+	main.exports.default = Busboy;
+	main.exports.Busboy = Busboy;
+
+	main.exports.Dicer = Dicer;
+	return main.exports;
+}
+
+export { requireMain as __require };
+//# sourceMappingURL=main.js.map

package/lib/esm/__/@fastify/busboy/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../node_modules/@fastify/busboy/lib/main.js"],"sourcesContent":["'use strict'\n\nconst WritableStream = require('node:stream').Writable\nconst { inherits } = require('node:util')\nconst Dicer = require('../deps/dicer/lib/Dicer')\n\nconst MultipartParser = require('./types/multipart')\nconst UrlencodedParser = require('./types/urlencoded')\nconst parseParams = require('./utils/parseParams')\n\nfunction Busboy (opts) {\n  if (!(this instanceof Busboy)) { return new Busboy(opts) }\n\n  if (typeof opts !== 'object') {\n    throw new TypeError('Busboy expected an options-Object.')\n  }\n  if (typeof opts.headers !== 'object') {\n    throw new TypeError('Busboy expected an options-Object with headers-attribute.')\n  }\n  if (typeof opts.headers['content-type'] !== 'string') {\n    throw new TypeError('Missing Content-Type-header.')\n  }\n\n  const {\n    headers,\n    ...streamOptions\n  } = opts\n\n  this.opts = {\n    autoDestroy: false,\n    ...streamOptions\n  }\n  WritableStream.call(this, this.opts)\n\n  this._done = false\n  this._parser = this.getParserByHeaders(headers)\n  this._finished = false\n}\ninherits(Busboy, WritableStream)\n\nBusboy.prototype.emit = function (ev) {\n  if (ev === 'finish') {\n    if (!this._done) {\n      this._parser?.end()\n      return\n    } else if (this._finished) {\n      return\n    }\n    this._finished = true\n  }\n  WritableStream.prototype.emit.apply(this, arguments)\n}\n\nBusboy.prototype.getParserByHeaders = function (headers) {\n  const parsed = parseParams(headers['content-type'])\n\n  const cfg = {\n    defCharset: this.opts.defCharset,\n    fileHwm: this.opts.fileHwm,\n    headers,\n    highWaterMark: this.opts.highWaterMark,\n    isPartAFile: this.opts.isPartAFile,\n    limits: this.opts.limits,\n    parsedConType: parsed,\n    preservePath: this.opts.preservePath\n  }\n\n  if (MultipartParser.detect.test(parsed[0])) {\n    return new MultipartParser(this, cfg)\n  }\n  if (UrlencodedParser.detect.test(parsed[0])) {\n    return new UrlencodedParser(this, cfg)\n  }\n  throw new Error('Unsupported Content-Type.')\n}\n\nBusboy.prototype._write = function (chunk, encoding, cb) {\n  this._parser.write(chunk, cb)\n}\n\nmodule.exports = Busboy\nmodule.exports.default = Busboy\nmodule.exports.Busboy = Busboy\n\nmodule.exports.Dicer = Dicer\n"],"names":["require$$2","require$$3","require$$4","require$$5","mainModule"],"mappings":";;;;;;;;;;;;;;CAEA,MAAM,cAAc,GAAG,UAAsB,CAAC;CAC9C,MAAM,EAAE,QAAQ,EAAE,GAAG;AACrB,CAAA,MAAM,KAAK,GAAGA,YAAA;;AAEd,CAAA,MAAM,eAAe,GAAGC,gBAAA;AACxB,CAAA,MAAM,gBAAgB,GAAGC,iBAAA;AACzB,CAAA,MAAM,WAAW,GAAGC,kBAAA;;CAEpB,SAAS,MAAM,EAAE,IAAI,EAAE;AACvB,GAAE,IAAI,EAAE,IAAI,YAAY,MAAM,CAAC,EAAE,EAAE,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAA;;AAE1D,GAAE,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;AAChC,KAAI,MAAM,IAAI,SAAS,CAAC,oCAAoC;AAC5D,GAAA;AACA,GAAE,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,EAAE;AACxC,KAAI,MAAM,IAAI,SAAS,CAAC,2DAA2D;AACnF,GAAA;GACE,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,QAAQ,EAAE;AACxD,KAAI,MAAM,IAAI,SAAS,CAAC,8BAA8B;AACtD,GAAA;;AAEA,GAAE,MAAM;AACR,KAAI,OAAO;AACX,KAAI,GAAG;AACP,IAAG,GAAG;;GAEJ,IAAI,CAAC,IAAI,GAAG;KACV,WAAW,EAAE,KAAK;AACtB,KAAI,GAAG;AACP;GACE,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI;;GAEnC,IAAI,CAAC,KAAK,GAAG;GACb,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO;GAC9C,IAAI,CAAC,SAAS,GAAG;AACnB,CAAA;CACA,QAAQ,CAAC,MAAM,EAAE,cAAc;;AAE/B,CAAA,MAAM,CAAC,SAAS,CAAC,IAAI,GAAG,UAAU,EAAE,EAAE;AACtC,GAAE,IAAI,EAAE,KAAK,QAAQ,EAAE;AACvB,KAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;AACrB,OAAM,IAAI,CAAC,OAAO,EAAE,GAAG;OACjB;AACN,KAAA,CAAK,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE;OACzB;AACN,KAAA;KACI,IAAI,CAAC,SAAS,GAAG;AACrB,GAAA;GACE,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS;AACrD,CAAA;;AAEA,CAAA,MAAM,CAAC,SAAS,CAAC,kBAAkB,GAAG,UAAU,OAAO,EAAE;GACvD,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,cAAc,CAAC;;GAElD,MAAM,GAAG,GAAG;AACd,KAAI,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU;AACpC,KAAI,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO;AAC9B,KAAI,OAAO;AACX,KAAI,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa;AAC1C,KAAI,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW;AACtC,KAAI,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;KACxB,aAAa,EAAE,MAAM;AACzB,KAAI,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC;AAC5B;;AAEA,GAAE,IAAI,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;AAC9C,KAAI,OAAO,IAAI,eAAe,CAAC,IAAI,EAAE,GAAG;AACxC,GAAA;AACA,GAAE,IAAI,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;AAC/C,KAAI,OAAO,IAAI,gBAAgB,CAAC,IAAI,EAAE,GAAG;AACzC,GAAA;AACA,GAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B;AAC7C,CAAA;;CAEA,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE;GACvD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE;AAC9B,CAAA;;AAEA,CAAAC,IAAA,CAAA,OAAc,GAAG;AACjB,CAAAA,IAAA,CAAA,OAAA,CAAA,OAAsB,GAAG;AACzB,CAAAA,IAAA,CAAA,OAAA,CAAA,MAAqB,GAAG;;AAExB,CAAAA,IAAA,CAAA,OAAA,CAAA,KAAoB,GAAG;;;;;;","x_google_ignoreList":[0]}