@slicemachine/manager 0.1.1-dev-plugins.4 → 0.1.1-dev-plugins.5

package/dist/__node_modules/r19/dist/lib/objectToFormData.server.cjs

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const node_buffer = require("node:buffer");
-const browser = require("../../../formdata-node/lib/browser.cjs");
-const flattenObject = require("./flattenObject.cjs");
-require("../../../devalue/src/uneval.cjs");
-const stringify = require("../../../devalue/src/stringify.cjs");
-const objectToFormData = (obj) => {
-  const formData = new browser.FormData();
-  const flattenedObject = flattenObject.flattenObject(obj);
-  for (const key in flattenedObject) {
-    const value = flattenedObject[key];
-    if (node_buffer.Buffer.isBuffer(value)) {
-      formData.set(key, new browser.Blob([value]));
-    } else {
-      formData.set(key, stringify.stringify(value));
-    }
-  }
-  return formData;
-};
-exports.objectToFormData = objectToFormData;
-//# sourceMappingURL=objectToFormData.server.cjs.map

package/dist/__node_modules/r19/dist/lib/objectToFormData.server.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"objectToFormData.server.cjs","sources":["../../../../../../../node_modules/r19/dist/lib/objectToFormData.server.js"],"sourcesContent":["import { Buffer } from \"node:buffer\";\nimport { FormData, Blob } from \"formdata-node\";\nimport { flattenObject } from \"./flattenObject.js\";\nimport { stringify } from \"devalue\";\nconst objectToFormData = (obj) => {\n  const formData = new FormData();\n  const flattenedObject = flattenObject(obj);\n  for (const key in flattenedObject) {\n    const value = flattenedObject[key];\n    if (Buffer.isBuffer(value)) {\n      formData.set(key, new Blob([value]));\n    } else {\n      formData.set(key, stringify(value));\n    }\n  }\n  return formData;\n};\nexport {\n  objectToFormData\n};\n//# sourceMappingURL=objectToFormData.server.js.map\n"],"names":["FormData","flattenObject","Buffer","Blob","stringify"],"mappings":";;;;;;;AAIK,MAAC,mBAAmB,CAAC,QAAQ;AAChC,QAAM,WAAW,IAAIA,QAAAA;AACrB,QAAM,kBAAkBC,4BAAc,GAAG;AACzC,aAAW,OAAO,iBAAiB;AACjC,UAAM,QAAQ,gBAAgB,GAAG;AACjC,QAAIC,YAAM,OAAC,SAAS,KAAK,GAAG;AAC1B,eAAS,IAAI,KAAK,IAAIC,QAAI,KAAC,CAAC,KAAK,CAAC,CAAC;AAAA,IACzC,OAAW;AACL,eAAS,IAAI,KAAKC,UAAAA,UAAU,KAAK,CAAC;AAAA,IACnC;AAAA,EACF;AACD,SAAO;AACT;;"}

package/dist/__node_modules/r19/dist/lib/objectToFormData.server.js

@@ -1,22 +0,0 @@
-import { Buffer } from "node:buffer";
-import { FormData, Blob } from "../../../formdata-node/lib/browser.js";
-import { flattenObject } from "./flattenObject.js";
-import "../../../devalue/src/uneval.js";
-import { stringify } from "../../../devalue/src/stringify.js";
-const objectToFormData = (obj) => {
-  const formData = new FormData();
-  const flattenedObject = flattenObject(obj);
-  for (const key in flattenedObject) {
-    const value = flattenedObject[key];
-    if (Buffer.isBuffer(value)) {
-      formData.set(key, new Blob([value]));
-    } else {
-      formData.set(key, stringify(value));
-    }
-  }
-  return formData;
-};
-export {
-  objectToFormData
-};
-//# sourceMappingURL=objectToFormData.server.js.map

package/dist/__node_modules/r19/dist/lib/objectToFormData.server.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"objectToFormData.server.js","sources":["../../../../../../../node_modules/r19/dist/lib/objectToFormData.server.js"],"sourcesContent":["import { Buffer } from \"node:buffer\";\nimport { FormData, Blob } from \"formdata-node\";\nimport { flattenObject } from \"./flattenObject.js\";\nimport { stringify } from \"devalue\";\nconst objectToFormData = (obj) => {\n  const formData = new FormData();\n  const flattenedObject = flattenObject(obj);\n  for (const key in flattenedObject) {\n    const value = flattenedObject[key];\n    if (Buffer.isBuffer(value)) {\n      formData.set(key, new Blob([value]));\n    } else {\n      formData.set(key, stringify(value));\n    }\n  }\n  return formData;\n};\nexport {\n  objectToFormData\n};\n//# sourceMappingURL=objectToFormData.server.js.map\n"],"names":[],"mappings":";;;;;AAIK,MAAC,mBAAmB,CAAC,QAAQ;AAChC,QAAM,WAAW,IAAI;AACrB,QAAM,kBAAkB,cAAc,GAAG;AACzC,aAAW,OAAO,iBAAiB;AACjC,UAAM,QAAQ,gBAAgB,GAAG;AACjC,QAAI,OAAO,SAAS,KAAK,GAAG;AAC1B,eAAS,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;AAAA,IACzC,OAAW;AACL,eAAS,IAAI,KAAK,UAAU,KAAK,CAAC;AAAA,IACnC;AAAA,EACF;AACD,SAAO;AACT;"}

package/dist/__node_modules/r19/dist/lib/unflattenObject.cjs

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const REGEX = /\.?([^.\[\]]+)|\[(\d+)\]/g;
-const unflattenObject = (object) => {
-  const result = {};
-  const keys = Object.keys(object);
-  for (const key of keys) {
-    let current = result;
-    let prop = "";
-    let m;
-    while (m = REGEX.exec(key)) {
-      current = current[prop] || (current[prop] = m[2] ? [] : {});
-      prop = m[2] || m[1];
-    }
-    current[prop] = object[key];
-  }
-  return result[""] || result;
-};
-exports.unflattenObject = unflattenObject;
-//# sourceMappingURL=unflattenObject.cjs.map

package/dist/__node_modules/r19/dist/lib/unflattenObject.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"unflattenObject.cjs","sources":["../../../../../../../node_modules/r19/dist/lib/unflattenObject.js"],"sourcesContent":["const REGEX = /\\.?([^.\\[\\]]+)|\\[(\\d+)\\]/g;\nconst unflattenObject = (object) => {\n  const result = {};\n  const keys = Object.keys(object);\n  for (const key of keys) {\n    let current = result;\n    let prop = \"\";\n    let m;\n    while (m = REGEX.exec(key)) {\n      current = current[prop] || (current[prop] = m[2] ? [] : {});\n      prop = m[2] || m[1];\n    }\n    current[prop] = object[key];\n  }\n  return result[\"\"] || result;\n};\nexport {\n  unflattenObject\n};\n//# sourceMappingURL=unflattenObject.js.map\n"],"names":[],"mappings":";;AAAA,MAAM,QAAQ;AACT,MAAC,kBAAkB,CAAC,WAAW;AAClC,QAAM,SAAS,CAAA;AACf,QAAM,OAAO,OAAO,KAAK,MAAM;AAC/B,aAAW,OAAO,MAAM;AACtB,QAAI,UAAU;AACd,QAAI,OAAO;AACX,QAAI;AACJ,WAAO,IAAI,MAAM,KAAK,GAAG,GAAG;AAC1B,gBAAU,QAAQ,IAAI,MAAM,QAAQ,IAAI,IAAI,EAAE,CAAC,IAAI,CAAE,IAAG,CAAE;AAC1D,aAAO,EAAE,CAAC,KAAK,EAAE,CAAC;AAAA,IACnB;AACD,YAAQ,IAAI,IAAI,OAAO,GAAG;AAAA,EAC3B;AACD,SAAO,OAAO,EAAE,KAAK;AACvB;;"}

package/dist/__node_modules/r19/dist/lib/unflattenObject.js

@@ -1,20 +0,0 @@
-const REGEX = /\.?([^.\[\]]+)|\[(\d+)\]/g;
-const unflattenObject = (object) => {
-  const result = {};
-  const keys = Object.keys(object);
-  for (const key of keys) {
-    let current = result;
-    let prop = "";
-    let m;
-    while (m = REGEX.exec(key)) {
-      current = current[prop] || (current[prop] = m[2] ? [] : {});
-      prop = m[2] || m[1];
-    }
-    current[prop] = object[key];
-  }
-  return result[""] || result;
-};
-export {
-  unflattenObject
-};
-//# sourceMappingURL=unflattenObject.js.map

package/dist/__node_modules/r19/dist/lib/unflattenObject.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"unflattenObject.js","sources":["../../../../../../../node_modules/r19/dist/lib/unflattenObject.js"],"sourcesContent":["const REGEX = /\\.?([^.\\[\\]]+)|\\[(\\d+)\\]/g;\nconst unflattenObject = (object) => {\n  const result = {};\n  const keys = Object.keys(object);\n  for (const key of keys) {\n    let current = result;\n    let prop = \"\";\n    let m;\n    while (m = REGEX.exec(key)) {\n      current = current[prop] || (current[prop] = m[2] ? [] : {});\n      prop = m[2] || m[1];\n    }\n    current[prop] = object[key];\n  }\n  return result[\"\"] || result;\n};\nexport {\n  unflattenObject\n};\n//# sourceMappingURL=unflattenObject.js.map\n"],"names":[],"mappings":"AAAA,MAAM,QAAQ;AACT,MAAC,kBAAkB,CAAC,WAAW;AAClC,QAAM,SAAS,CAAA;AACf,QAAM,OAAO,OAAO,KAAK,MAAM;AAC/B,aAAW,OAAO,MAAM;AACtB,QAAI,UAAU;AACd,QAAI,OAAO;AACX,QAAI;AACJ,WAAO,IAAI,MAAM,KAAK,GAAG,GAAG;AAC1B,gBAAU,QAAQ,IAAI,MAAM,QAAQ,IAAI,IAAI,EAAE,CAAC,IAAI,CAAE,IAAG,CAAE;AAC1D,aAAO,EAAE,CAAC,KAAK,EAAE,CAAC;AAAA,IACnB;AACD,YAAQ,IAAI,IAAI,OAAO,GAAG;AAAA,EAC3B;AACD,SAAO,OAAO,EAAE,KAAK;AACvB;"}

package/dist/__node_modules/streamsearch/lib/sbmh.cjs

@@ -1,393 +0,0 @@
-"use strict";
-function memcmp(buf1, pos1, buf2, pos2, num) {
-  for (let i = 0; i < num; ++i) {
-    if (buf1[pos1 + i] !== buf2[pos2 + i])
-      return false;
-  }
-  return true;
-}
-class SBMH {
-  constructor(needle, cb) {
-    if (typeof cb !== "function")
-      throw new Error("Missing match callback");
-    if (typeof needle === "string")
-      needle = Buffer.from(needle);
-    else if (!Buffer.isBuffer(needle))
-      throw new Error(`Expected Buffer for needle, got ${typeof needle}`);
-    const needleLen = needle.length;
-    this.maxMatches = Infinity;
-    this.matches = 0;
-    this._cb = cb;
-    this._lookbehindSize = 0;
-    this._needle = needle;
-    this._bufPos = 0;
-    this._lookbehind = Buffer.allocUnsafe(needleLen);
-    this._occ = [
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen,
-      needleLen
-    ];
-    if (needleLen > 1) {
-      for (let i = 0; i < needleLen - 1; ++i)
-        this._occ[needle[i]] = needleLen - 1 - i;
-    }
-  }
-  reset() {
-    this.matches = 0;
-    this._lookbehindSize = 0;
-    this._bufPos = 0;
-  }
-  push(chunk, pos) {
-    let result;
-    if (!Buffer.isBuffer(chunk))
-      chunk = Buffer.from(chunk, "latin1");
-    const chunkLen = chunk.length;
-    this._bufPos = pos || 0;
-    while (result !== chunkLen && this.matches < this.maxMatches)
-      result = feed(this, chunk);
-    return result;
-  }
-  destroy() {
-    const lbSize = this._lookbehindSize;
-    if (lbSize)
-      this._cb(false, this._lookbehind, 0, lbSize, false);
-    this.reset();
-  }
-}
-function feed(self, data) {
-  const len = data.length;
-  const needle = self._needle;
-  const needleLen = needle.length;
-  let pos = -self._lookbehindSize;
-  const lastNeedleCharPos = needleLen - 1;
-  const lastNeedleChar = needle[lastNeedleCharPos];
-  const end = len - needleLen;
-  const occ = self._occ;
-  const lookbehind = self._lookbehind;
-  if (pos < 0) {
-    while (pos < 0 && pos <= end) {
-      const nextPos = pos + lastNeedleCharPos;
-      const ch = nextPos < 0 ? lookbehind[self._lookbehindSize + nextPos] : data[nextPos];
-      if (ch === lastNeedleChar && matchNeedle(self, data, pos, lastNeedleCharPos)) {
-        self._lookbehindSize = 0;
-        ++self.matches;
-        if (pos > -self._lookbehindSize)
-          self._cb(true, lookbehind, 0, self._lookbehindSize + pos, false);
-        else
-          self._cb(true, void 0, 0, 0, true);
-        return self._bufPos = pos + needleLen;
-      }
-      pos += occ[ch];
-    }
-    while (pos < 0 && !matchNeedle(self, data, pos, len - pos))
-      ++pos;
-    if (pos < 0) {
-      const bytesToCutOff = self._lookbehindSize + pos;
-      if (bytesToCutOff > 0) {
-        self._cb(false, lookbehind, 0, bytesToCutOff, false);
-      }
-      self._lookbehindSize -= bytesToCutOff;
-      lookbehind.copy(lookbehind, 0, bytesToCutOff, self._lookbehindSize);
-      lookbehind.set(data, self._lookbehindSize);
-      self._lookbehindSize += len;
-      self._bufPos = len;
-      return len;
-    }
-    self._cb(false, lookbehind, 0, self._lookbehindSize, false);
-    self._lookbehindSize = 0;
-  }
-  pos += self._bufPos;
-  const firstNeedleChar = needle[0];
-  while (pos <= end) {
-    const ch = data[pos + lastNeedleCharPos];
-    if (ch === lastNeedleChar && data[pos] === firstNeedleChar && memcmp(needle, 0, data, pos, lastNeedleCharPos)) {
-      ++self.matches;
-      if (pos > 0)
-        self._cb(true, data, self._bufPos, pos, true);
-      else
-        self._cb(true, void 0, 0, 0, true);
-      return self._bufPos = pos + needleLen;
-    }
-    pos += occ[ch];
-  }
-  while (pos < len) {
-    if (data[pos] !== firstNeedleChar || !memcmp(data, pos, needle, 0, len - pos)) {
-      ++pos;
-      continue;
-    }
-    data.copy(lookbehind, 0, pos, len);
-    self._lookbehindSize = len - pos;
-    break;
-  }
-  if (pos > 0)
-    self._cb(false, data, self._bufPos, pos < len ? pos : len, true);
-  self._bufPos = len;
-  return len;
-}
-function matchNeedle(self, data, pos, len) {
-  const lb = self._lookbehind;
-  const lbSize = self._lookbehindSize;
-  const needle = self._needle;
-  for (let i = 0; i < len; ++i, ++pos) {
-    const ch = pos < 0 ? lb[lbSize + pos] : data[pos];
-    if (ch !== needle[i])
-      return false;
-  }
-  return true;
-}
-var sbmh = SBMH;
-module.exports = sbmh;
-//# sourceMappingURL=sbmh.cjs.map

package/dist/__node_modules/streamsearch/lib/sbmh.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"sbmh.cjs","sources":["../../../../../../node_modules/streamsearch/lib/sbmh.js"],"sourcesContent":["'use strict';\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*/\nfunction memcmp(buf1, pos1, buf2, pos2, num) {\n  for (let i = 0; i < num; ++i) {\n    if (buf1[pos1 + i] !== buf2[pos2 + i])\n      return false;\n  }\n  return true;\n}\n\nclass SBMH {\n  constructor(needle, cb) {\n    if (typeof cb !== 'function')\n      throw new Error('Missing match callback');\n\n    if (typeof needle === 'string')\n      needle = Buffer.from(needle);\n    else if (!Buffer.isBuffer(needle))\n      throw new Error(`Expected Buffer for needle, got ${typeof needle}`);\n\n    const needleLen = needle.length;\n\n    this.maxMatches = Infinity;\n    this.matches = 0;\n\n    this._cb = cb;\n    this._lookbehindSize = 0;\n    this._needle = needle;\n    this._bufPos = 0;\n\n    this._lookbehind = Buffer.allocUnsafe(needleLen);\n\n    // Initialize occurrence table.\n    this._occ = [\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,\n      needleLen, needleLen, needleLen, needleLen\n    ];\n\n    // Populate occurrence table with analysis of the needle, ignoring the last\n    // letter.\n    if (needleLen > 1) {\n      for (let i = 0; i < needleLen - 1; ++i)\n        this._occ[needle[i]] = needleLen - 1 - i;\n    }\n  }\n\n  reset() {\n    this.matches = 0;\n    this._lookbehindSize = 0;\n    this._bufPos = 0;\n  }\n\n  push(chunk, pos) {\n    let result;\n    if (!Buffer.isBuffer(chunk))\n      chunk = Buffer.from(chunk, 'latin1');\n    const chunkLen = chunk.length;\n    this._bufPos = pos || 0;\n    while (result !== chunkLen && this.matches < this.maxMatches)\n      result = feed(this, chunk);\n    return result;\n  }\n\n  destroy() {\n    const lbSize = this._lookbehindSize;\n    if (lbSize)\n      this._cb(false, this._lookbehind, 0, lbSize, false);\n    this.reset();\n  }\n}\n\nfunction feed(self, data) {\n  const len = data.length;\n  const needle = self._needle;\n  const needleLen = needle.length;\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[lookbehindSize - 2]\n  let pos = -self._lookbehindSize;\n  const lastNeedleCharPos = needleLen - 1;\n  const lastNeedleChar = needle[lastNeedleCharPos];\n  const end = len - needleLen;\n  const occ = self._occ;\n  const lookbehind = self._lookbehind;\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 <= end) {\n      const nextPos = pos + lastNeedleCharPos;\n      const ch = (nextPos < 0\n                  ? lookbehind[self._lookbehindSize + nextPos]\n                  : data[nextPos]);\n\n      if (ch === lastNeedleChar\n          && matchNeedle(self, data, pos, lastNeedleCharPos)) {\n        self._lookbehindSize = 0;\n        ++self.matches;\n        if (pos > -self._lookbehindSize)\n          self._cb(true, lookbehind, 0, self._lookbehindSize + pos, false);\n        else\n          self._cb(true, undefined, 0, 0, true);\n\n        return (self._bufPos = pos + needleLen);\n      }\n\n      pos += occ[ch];\n    }\n\n    // No match.\n\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 && !matchNeedle(self, data, pos, len - pos))\n      ++pos;\n\n    if (pos < 0) {\n      // Cut off part of the lookbehind buffer that has\n      // been processed and append the entire haystack\n      // into it.\n      const bytesToCutOff = self._lookbehindSize + pos;\n\n      if (bytesToCutOff > 0) {\n        // The cut off data is guaranteed not to contain the needle.\n        self._cb(false, lookbehind, 0, bytesToCutOff, false);\n      }\n\n      self._lookbehindSize -= bytesToCutOff;\n      lookbehind.copy(lookbehind, 0, bytesToCutOff, self._lookbehindSize);\n      lookbehind.set(data, self._lookbehindSize);\n      self._lookbehindSize += len;\n\n      self._bufPos = len;\n      return len;\n    }\n\n    // Discard lookbehind buffer.\n    self._cb(false, lookbehind, 0, self._lookbehindSize, false);\n    self._lookbehindSize = 0;\n  }\n\n  pos += self._bufPos;\n\n  const firstNeedleChar = needle[0];\n\n  // Lookbehind buffer is now empty. Perform Boyer-Moore-Horspool\n  // search with optimized character lookup code that only considers\n  // the current round's haystack data.\n  while (pos <= end) {\n    const ch = data[pos + lastNeedleCharPos];\n\n    if (ch === lastNeedleChar\n        && data[pos] === firstNeedleChar\n        && memcmp(needle, 0, data, pos, lastNeedleCharPos)) {\n      ++self.matches;\n      if (pos > 0)\n        self._cb(true, data, self._bufPos, pos, true);\n      else\n        self._cb(true, undefined, 0, 0, true);\n\n      return (self._bufPos = pos + needleLen);\n    }\n\n    pos += occ[ch];\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 (pos < len) {\n    if (data[pos] !== firstNeedleChar\n        || !memcmp(data, pos, needle, 0, len - pos)) {\n      ++pos;\n      continue;\n    }\n    data.copy(lookbehind, 0, pos, len);\n    self._lookbehindSize = len - pos;\n    break;\n  }\n\n  // Everything until `pos` is guaranteed not to contain needle data.\n  if (pos > 0)\n    self._cb(false, data, self._bufPos, pos < len ? pos : len, true);\n\n  self._bufPos = len;\n  return len;\n}\n\nfunction matchNeedle(self, data, pos, len) {\n  const lb = self._lookbehind;\n  const lbSize = self._lookbehindSize;\n  const needle = self._needle;\n\n  for (let i = 0; i < len; ++i, ++pos) {\n    const ch = (pos < 0 ? lb[lbSize + pos] : data[pos]);\n    if (ch !== needle[i])\n      return false;\n  }\n  return true;\n}\n\nmodule.exports = SBMH;\n"],"names":[],"mappings":";AAKA,SAAS,OAAO,MAAM,MAAM,MAAM,MAAM,KAAK;AAC3C,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,QAAI,KAAK,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC;AAClC,aAAO;AAAA,EACV;AACD,SAAO;AACT;AAEA,MAAM,KAAK;AAAA,EACT,YAAY,QAAQ,IAAI;AACtB,QAAI,OAAO,OAAO;AAChB,YAAM,IAAI,MAAM,wBAAwB;AAE1C,QAAI,OAAO,WAAW;AACpB,eAAS,OAAO,KAAK,MAAM;AAAA,aACpB,CAAC,OAAO,SAAS,MAAM;AAC9B,YAAM,IAAI,MAAM,mCAAmC,OAAO,QAAQ;AAEpE,UAAM,YAAY,OAAO;AAEzB,SAAK,aAAa;AAClB,SAAK,UAAU;AAEf,SAAK,MAAM;AACX,SAAK,kBAAkB;AACvB,SAAK,UAAU;AACf,SAAK,UAAU;AAEf,SAAK,cAAc,OAAO,YAAY,SAAS;AAG/C,SAAK,OAAO;AAAA,MACV;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,MACvD;AAAA,MAAW;AAAA,MAAW;AAAA,MAAW;AAAA,IACvC;AAII,QAAI,YAAY,GAAG;AACjB,eAAS,IAAI,GAAG,IAAI,YAAY,GAAG,EAAE;AACnC,aAAK,KAAK,OAAO,CAAC,CAAC,IAAI,YAAY,IAAI;AAAA,IAC1C;AAAA,EACF;AAAA,EAED,QAAQ;AACN,SAAK,UAAU;AACf,SAAK,kBAAkB;AACvB,SAAK,UAAU;AAAA,EAChB;AAAA,EAED,KAAK,OAAO,KAAK;AACf,QAAI;AACJ,QAAI,CAAC,OAAO,SAAS,KAAK;AACxB,cAAQ,OAAO,KAAK,OAAO,QAAQ;AACrC,UAAM,WAAW,MAAM;AACvB,SAAK,UAAU,OAAO;AACtB,WAAO,WAAW,YAAY,KAAK,UAAU,KAAK;AAChD,eAAS,KAAK,MAAM,KAAK;AAC3B,WAAO;AAAA,EACR;AAAA,EAED,UAAU;AACR,UAAM,SAAS,KAAK;AACpB,QAAI;AACF,WAAK,IAAI,OAAO,KAAK,aAAa,GAAG,QAAQ,KAAK;AACpD,SAAK,MAAK;AAAA,EACX;AACH;AAEA,SAAS,KAAK,MAAM,MAAM;AACxB,QAAM,MAAM,KAAK;AACjB,QAAM,SAAS,KAAK;AACpB,QAAM,YAAY,OAAO;AAMzB,MAAI,MAAM,CAAC,KAAK;AAChB,QAAM,oBAAoB,YAAY;AACtC,QAAM,iBAAiB,OAAO,iBAAiB;AAC/C,QAAM,MAAM,MAAM;AAClB,QAAM,MAAM,KAAK;AACjB,QAAM,aAAa,KAAK;AAExB,MAAI,MAAM,GAAG;AAaX,WAAO,MAAM,KAAK,OAAO,KAAK;AAC5B,YAAM,UAAU,MAAM;AACtB,YAAM,KAAM,UAAU,IACR,WAAW,KAAK,kBAAkB,OAAO,IACzC,KAAK,OAAO;AAE1B,UAAI,OAAO,kBACJ,YAAY,MAAM,MAAM,KAAK,iBAAiB,GAAG;AACtD,aAAK,kBAAkB;AACvB,UAAE,KAAK;AACP,YAAI,MAAM,CAAC,KAAK;AACd,eAAK,IAAI,MAAM,YAAY,GAAG,KAAK,kBAAkB,KAAK,KAAK;AAAA;AAE/D,eAAK,IAAI,MAAM,QAAW,GAAG,GAAG,IAAI;AAEtC,eAAQ,KAAK,UAAU,MAAM;AAAA,MAC9B;AAED,aAAO,IAAI,EAAE;AAAA,IACd;AAYD,WAAO,MAAM,KAAK,CAAC,YAAY,MAAM,MAAM,KAAK,MAAM,GAAG;AACvD,QAAE;AAEJ,QAAI,MAAM,GAAG;AAIX,YAAM,gBAAgB,KAAK,kBAAkB;AAE7C,UAAI,gBAAgB,GAAG;AAErB,aAAK,IAAI,OAAO,YAAY,GAAG,eAAe,KAAK;AAAA,MACpD;AAED,WAAK,mBAAmB;AACxB,iBAAW,KAAK,YAAY,GAAG,eAAe,KAAK,eAAe;AAClE,iBAAW,IAAI,MAAM,KAAK,eAAe;AACzC,WAAK,mBAAmB;AAExB,WAAK,UAAU;AACf,aAAO;AAAA,IACR;AAGD,SAAK,IAAI,OAAO,YAAY,GAAG,KAAK,iBAAiB,KAAK;AAC1D,SAAK,kBAAkB;AAAA,EACxB;AAED,SAAO,KAAK;AAEZ,QAAM,kBAAkB,OAAO,CAAC;AAKhC,SAAO,OAAO,KAAK;AACjB,UAAM,KAAK,KAAK,MAAM,iBAAiB;AAEvC,QAAI,OAAO,kBACJ,KAAK,GAAG,MAAM,mBACd,OAAO,QAAQ,GAAG,MAAM,KAAK,iBAAiB,GAAG;AACtD,QAAE,KAAK;AACP,UAAI,MAAM;AACR,aAAK,IAAI,MAAM,MAAM,KAAK,SAAS,KAAK,IAAI;AAAA;AAE5C,aAAK,IAAI,MAAM,QAAW,GAAG,GAAG,IAAI;AAEtC,aAAQ,KAAK,UAAU,MAAM;AAAA,IAC9B;AAED,WAAO,IAAI,EAAE;AAAA,EACd;AAQD,SAAO,MAAM,KAAK;AAChB,QAAI,KAAK,GAAG,MAAM,mBACX,CAAC,OAAO,MAAM,KAAK,QAAQ,GAAG,MAAM,GAAG,GAAG;AAC/C,QAAE;AACF;AAAA,IACD;AACD,SAAK,KAAK,YAAY,GAAG,KAAK,GAAG;AACjC,SAAK,kBAAkB,MAAM;AAC7B;AAAA,EACD;AAGD,MAAI,MAAM;AACR,SAAK,IAAI,OAAO,MAAM,KAAK,SAAS,MAAM,MAAM,MAAM,KAAK,IAAI;AAEjE,OAAK,UAAU;AACf,SAAO;AACT;AAEA,SAAS,YAAY,MAAM,MAAM,KAAK,KAAK;AACzC,QAAM,KAAK,KAAK;AAChB,QAAM,SAAS,KAAK;AACpB,QAAM,SAAS,KAAK;AAEpB,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG,EAAE,KAAK;AACnC,UAAM,KAAM,MAAM,IAAI,GAAG,SAAS,GAAG,IAAI,KAAK,GAAG;AACjD,QAAI,OAAO,OAAO,CAAC;AACjB,aAAO;AAAA,EACV;AACD,SAAO;AACT;AAEA,IAAA,OAAiB;;"}