@_davideast/stitch-mcp 0.5.0 → 0.5.1

package/dist/chunk-a5xra9jn.js

@@ -0,0 +1,159 @@
+// node_modules/yocto-queue/index.js
+class Node {
+  value;
+  next;
+  constructor(value) {
+    this.value = value;
+  }
+}
+
+class Queue {
+  #head;
+  #tail;
+  #size;
+  constructor() {
+    this.clear();
+  }
+  enqueue(value) {
+    const node = new Node(value);
+    if (this.#head) {
+      this.#tail.next = node;
+      this.#tail = node;
+    } else {
+      this.#head = node;
+      this.#tail = node;
+    }
+    this.#size++;
+  }
+  dequeue() {
+    const current = this.#head;
+    if (!current) {
+      return;
+    }
+    this.#head = this.#head.next;
+    this.#size--;
+    if (!this.#head) {
+      this.#tail = undefined;
+    }
+    return current.value;
+  }
+  peek() {
+    if (!this.#head) {
+      return;
+    }
+    return this.#head.value;
+  }
+  clear() {
+    this.#head = undefined;
+    this.#tail = undefined;
+    this.#size = 0;
+  }
+  get size() {
+    return this.#size;
+  }
+  *[Symbol.iterator]() {
+    let current = this.#head;
+    while (current) {
+      yield current.value;
+      current = current.next;
+    }
+  }
+  *drain() {
+    while (this.#head) {
+      yield this.dequeue();
+    }
+  }
+}
+
+// node_modules/p-limit/index.js
+function pLimit(concurrency) {
+  let rejectOnClear = false;
+  if (typeof concurrency === "object") {
+    ({ concurrency, rejectOnClear = false } = concurrency);
+  }
+  validateConcurrency(concurrency);
+  if (typeof rejectOnClear !== "boolean") {
+    throw new TypeError("Expected `rejectOnClear` to be a boolean");
+  }
+  const queue = new Queue;
+  let activeCount = 0;
+  const resumeNext = () => {
+    if (activeCount < concurrency && queue.size > 0) {
+      activeCount++;
+      queue.dequeue().run();
+    }
+  };
+  const next = () => {
+    activeCount--;
+    resumeNext();
+  };
+  const run = async (function_, resolve, arguments_) => {
+    const result = (async () => function_(...arguments_))();
+    resolve(result);
+    try {
+      await result;
+    } catch {}
+    next();
+  };
+  const enqueue = (function_, resolve, reject, arguments_) => {
+    const queueItem = { reject };
+    new Promise((internalResolve) => {
+      queueItem.run = internalResolve;
+      queue.enqueue(queueItem);
+    }).then(run.bind(undefined, function_, resolve, arguments_));
+    if (activeCount < concurrency) {
+      resumeNext();
+    }
+  };
+  const generator = (function_, ...arguments_) => new Promise((resolve, reject) => {
+    enqueue(function_, resolve, reject, arguments_);
+  });
+  Object.defineProperties(generator, {
+    activeCount: {
+      get: () => activeCount
+    },
+    pendingCount: {
+      get: () => queue.size
+    },
+    clearQueue: {
+      value() {
+        if (!rejectOnClear) {
+          queue.clear();
+          return;
+        }
+        const abortError = AbortSignal.abort().reason;
+        while (queue.size > 0) {
+          queue.dequeue().reject(abortError);
+        }
+      }
+    },
+    concurrency: {
+      get: () => concurrency,
+      set(newConcurrency) {
+        validateConcurrency(newConcurrency);
+        concurrency = newConcurrency;
+        queueMicrotask(() => {
+          while (activeCount < concurrency && queue.size > 0) {
+            resumeNext();
+          }
+        });
+      }
+    },
+    map: {
+      async value(iterable, function_) {
+        const promises = Array.from(iterable, (value, index) => this(function_, value, index));
+        return Promise.all(promises);
+      }
+    }
+  });
+  return generator;
+}
+function validateConcurrency(concurrency) {
+  if (!((Number.isInteger(concurrency) || concurrency === Number.POSITIVE_INFINITY) && concurrency > 0)) {
+    throw new TypeError("Expected `concurrency` to be a number from 1 and up");
+  }
+}
+
+export { pLimit };
+
+//# debugId=3D76B2D56E7211BE64756E2164756E21

package/dist/chunk-a5xra9jn.js.map

@@ -0,0 +1,11 @@
+{
+  "version": 3,
+  "sources": ["../node_modules/yocto-queue/index.js", "../node_modules/p-limit/index.js"],
+  "sourcesContent": [
+    "/*\nHow it works:\n`this.#head` is an instance of `Node` which keeps track of its current value and nests another instance of `Node` that keeps the value that comes after it. When a value is provided to `.enqueue()`, the code needs to iterate through `this.#head`, going deeper and deeper to find the last value. However, iterating through every single item is slow. This problem is solved by saving a reference to the last value as `this.#tail` so that it can reference it to add a new value.\n*/\n\nclass Node {\n\tvalue;\n\tnext;\n\n\tconstructor(value) {\n\t\tthis.value = value;\n\t}\n}\n\nexport default class Queue {\n\t#head;\n\t#tail;\n\t#size;\n\n\tconstructor() {\n\t\tthis.clear();\n\t}\n\n\tenqueue(value) {\n\t\tconst node = new Node(value);\n\n\t\tif (this.#head) {\n\t\t\tthis.#tail.next = node;\n\t\t\tthis.#tail = node;\n\t\t} else {\n\t\t\tthis.#head = node;\n\t\t\tthis.#tail = node;\n\t\t}\n\n\t\tthis.#size++;\n\t}\n\n\tdequeue() {\n\t\tconst current = this.#head;\n\t\tif (!current) {\n\t\t\treturn;\n\t\t}\n\n\t\tthis.#head = this.#head.next;\n\t\tthis.#size--;\n\n\t\t// Clean up tail reference when queue becomes empty\n\t\tif (!this.#head) {\n\t\t\tthis.#tail = undefined;\n\t\t}\n\n\t\treturn current.value;\n\t}\n\n\tpeek() {\n\t\tif (!this.#head) {\n\t\t\treturn;\n\t\t}\n\n\t\treturn this.#head.value;\n\n\t\t// TODO: Node.js 18.\n\t\t// return this.#head?.value;\n\t}\n\n\tclear() {\n\t\tthis.#head = undefined;\n\t\tthis.#tail = undefined;\n\t\tthis.#size = 0;\n\t}\n\n\tget size() {\n\t\treturn this.#size;\n\t}\n\n\t* [Symbol.iterator]() {\n\t\tlet current = this.#head;\n\n\t\twhile (current) {\n\t\t\tyield current.value;\n\t\t\tcurrent = current.next;\n\t\t}\n\t}\n\n\t* drain() {\n\t\twhile (this.#head) {\n\t\t\tyield this.dequeue();\n\t\t}\n\t}\n}\n",
+    "import Queue from 'yocto-queue';\n\nexport default function pLimit(concurrency) {\n\tlet rejectOnClear = false;\n\n\tif (typeof concurrency === 'object') {\n\t\t({concurrency, rejectOnClear = false} = concurrency);\n\t}\n\n\tvalidateConcurrency(concurrency);\n\n\tif (typeof rejectOnClear !== 'boolean') {\n\t\tthrow new TypeError('Expected `rejectOnClear` to be a boolean');\n\t}\n\n\tconst queue = new Queue();\n\tlet activeCount = 0;\n\n\tconst resumeNext = () => {\n\t\t// Process the next queued function if we're under the concurrency limit\n\t\tif (activeCount < concurrency && queue.size > 0) {\n\t\t\tactiveCount++;\n\t\t\tqueue.dequeue().run();\n\t\t}\n\t};\n\n\tconst next = () => {\n\t\tactiveCount--;\n\t\tresumeNext();\n\t};\n\n\tconst run = async (function_, resolve, arguments_) => {\n\t\t// Execute the function and capture the result promise\n\t\tconst result = (async () => function_(...arguments_))();\n\n\t\t// Resolve immediately with the promise (don't wait for completion)\n\t\tresolve(result);\n\n\t\t// Wait for the function to complete (success or failure)\n\t\t// We catch errors here to prevent unhandled rejections,\n\t\t// but the original promise rejection is preserved for the caller\n\t\ttry {\n\t\t\tawait result;\n\t\t} catch {}\n\n\t\t// Decrement active count and process next queued function\n\t\tnext();\n\t};\n\n\tconst enqueue = (function_, resolve, reject, arguments_) => {\n\t\tconst queueItem = {reject};\n\n\t\t// Queue the internal resolve function instead of the run function\n\t\t// to preserve the asynchronous execution context.\n\t\tnew Promise(internalResolve => { // eslint-disable-line promise/param-names\n\t\t\tqueueItem.run = internalResolve;\n\t\t\tqueue.enqueue(queueItem);\n\t\t}).then(run.bind(undefined, function_, resolve, arguments_)); // eslint-disable-line promise/prefer-await-to-then\n\n\t\t// Start processing immediately if we haven't reached the concurrency limit\n\t\tif (activeCount < concurrency) {\n\t\t\tresumeNext();\n\t\t}\n\t};\n\n\tconst generator = (function_, ...arguments_) => new Promise((resolve, reject) => {\n\t\tenqueue(function_, resolve, reject, arguments_);\n\t});\n\n\tObject.defineProperties(generator, {\n\t\tactiveCount: {\n\t\t\tget: () => activeCount,\n\t\t},\n\t\tpendingCount: {\n\t\t\tget: () => queue.size,\n\t\t},\n\t\tclearQueue: {\n\t\t\tvalue() {\n\t\t\t\tif (!rejectOnClear) {\n\t\t\t\t\tqueue.clear();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst abortError = AbortSignal.abort().reason;\n\n\t\t\t\twhile (queue.size > 0) {\n\t\t\t\t\tqueue.dequeue().reject(abortError);\n\t\t\t\t}\n\t\t\t},\n\t\t},\n\t\tconcurrency: {\n\t\t\tget: () => concurrency,\n\n\t\t\tset(newConcurrency) {\n\t\t\t\tvalidateConcurrency(newConcurrency);\n\t\t\t\tconcurrency = newConcurrency;\n\n\t\t\t\tqueueMicrotask(() => {\n\t\t\t\t\t// eslint-disable-next-line no-unmodified-loop-condition\n\t\t\t\t\twhile (activeCount < concurrency && queue.size > 0) {\n\t\t\t\t\t\tresumeNext();\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t},\n\t\t},\n\t\tmap: {\n\t\t\tasync value(iterable, function_) {\n\t\t\t\tconst promises = Array.from(iterable, (value, index) => this(function_, value, index));\n\t\t\t\treturn Promise.all(promises);\n\t\t\t},\n\t\t},\n\t});\n\n\treturn generator;\n}\n\nexport function limitFunction(function_, options) {\n\tconst limit = pLimit(options);\n\n\treturn (...arguments_) => limit(() => function_(...arguments_));\n}\n\nfunction validateConcurrency(concurrency) {\n\tif (!((Number.isInteger(concurrency) || concurrency === Number.POSITIVE_INFINITY) && concurrency > 0)) {\n\t\tthrow new TypeError('Expected `concurrency` to be a number from 1 and up');\n\t}\n}\n"
+  ],
+  "mappings": ";AAKA,MAAM,KAAK;AAAA,EACV;AAAA,EACA;AAAA,EAEA,WAAW,CAAC,OAAO;AAAA,IAClB,KAAK,QAAQ;AAAA;AAEf;AAAA;AAEA,MAAqB,MAAM;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EAEA,WAAW,GAAG;AAAA,IACb,KAAK,MAAM;AAAA;AAAA,EAGZ,OAAO,CAAC,OAAO;AAAA,IACd,MAAM,OAAO,IAAI,KAAK,KAAK;AAAA,IAE3B,IAAI,KAAK,OAAO;AAAA,MACf,KAAK,MAAM,OAAO;AAAA,MAClB,KAAK,QAAQ;AAAA,IACd,EAAO;AAAA,MACN,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA;AAAA,IAGd,KAAK;AAAA;AAAA,EAGN,OAAO,GAAG;AAAA,IACT,MAAM,UAAU,KAAK;AAAA,IACrB,IAAI,CAAC,SAAS;AAAA,MACb;AAAA,IACD;AAAA,IAEA,KAAK,QAAQ,KAAK,MAAM;AAAA,IACxB,KAAK;AAAA,IAGL,IAAI,CAAC,KAAK,OAAO;AAAA,MAChB,KAAK,QAAQ;AAAA,IACd;AAAA,IAEA,OAAO,QAAQ;AAAA;AAAA,EAGhB,IAAI,GAAG;AAAA,IACN,IAAI,CAAC,KAAK,OAAO;AAAA,MAChB;AAAA,IACD;AAAA,IAEA,OAAO,KAAK,MAAM;AAAA;AAAA,EAMnB,KAAK,GAAG;AAAA,IACP,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA;AAAA,MAGV,IAAI,GAAG;AAAA,IACV,OAAO,KAAK;AAAA;AAAA,IAGV,OAAO,SAAS,GAAG;AAAA,IACrB,IAAI,UAAU,KAAK;AAAA,IAEnB,OAAO,SAAS;AAAA,MACf,MAAM,QAAQ;AAAA,MACd,UAAU,QAAQ;AAAA,IACnB;AAAA;AAAA,GAGC,KAAK,GAAG;AAAA,IACT,OAAO,KAAK,OAAO;AAAA,MAClB,MAAM,KAAK,QAAQ;AAAA,IACpB;AAAA;AAEF;;;ACvFA,SAAwB,MAAM,CAAC,aAAa;AAAA,EAC3C,IAAI,gBAAgB;AAAA,EAEpB,IAAI,OAAO,gBAAgB,UAAU;AAAA,KACnC,EAAC,aAAa,gBAAgB,MAAK,IAAI;AAAA,EACzC;AAAA,EAEA,oBAAoB,WAAW;AAAA,EAE/B,IAAI,OAAO,kBAAkB,WAAW;AAAA,IACvC,MAAM,IAAI,UAAU,0CAA0C;AAAA,EAC/D;AAAA,EAEA,MAAM,QAAQ,IAAI;AAAA,EAClB,IAAI,cAAc;AAAA,EAElB,MAAM,aAAa,MAAM;AAAA,IAExB,IAAI,cAAc,eAAe,MAAM,OAAO,GAAG;AAAA,MAChD;AAAA,MACA,MAAM,QAAQ,EAAE,IAAI;AAAA,IACrB;AAAA;AAAA,EAGD,MAAM,OAAO,MAAM;AAAA,IAClB;AAAA,IACA,WAAW;AAAA;AAAA,EAGZ,MAAM,MAAM,OAAO,WAAW,SAAS,eAAe;AAAA,IAErD,MAAM,UAAU,YAAY,UAAU,GAAG,UAAU,GAAG;AAAA,IAGtD,QAAQ,MAAM;AAAA,IAKd,IAAI;AAAA,MACH,MAAM;AAAA,MACL,MAAM;AAAA,IAGR,KAAK;AAAA;AAAA,EAGN,MAAM,UAAU,CAAC,WAAW,SAAS,QAAQ,eAAe;AAAA,IAC3D,MAAM,YAAY,EAAC,OAAM;AAAA,IAIzB,IAAI,QAAQ,qBAAmB;AAAA,MAC9B,UAAU,MAAM;AAAA,MAChB,MAAM,QAAQ,SAAS;AAAA,KACvB,EAAE,KAAK,IAAI,KAAK,WAAW,WAAW,SAAS,UAAU,CAAC;AAAA,IAG3D,IAAI,cAAc,aAAa;AAAA,MAC9B,WAAW;AAAA,IACZ;AAAA;AAAA,EAGD,MAAM,YAAY,CAAC,cAAc,eAAe,IAAI,QAAQ,CAAC,SAAS,WAAW;AAAA,IAChF,QAAQ,WAAW,SAAS,QAAQ,UAAU;AAAA,GAC9C;AAAA,EAED,OAAO,iBAAiB,WAAW;AAAA,IAClC,aAAa;AAAA,MACZ,KAAK,MAAM;AAAA,IACZ;AAAA,IACA,cAAc;AAAA,MACb,KAAK,MAAM,MAAM;AAAA,IAClB;AAAA,IACA,YAAY;AAAA,MACX,KAAK,GAAG;AAAA,QACP,IAAI,CAAC,eAAe;AAAA,UACnB,MAAM,MAAM;AAAA,UACZ;AAAA,QACD;AAAA,QAEA,MAAM,aAAa,YAAY,MAAM,EAAE;AAAA,QAEvC,OAAO,MAAM,OAAO,GAAG;AAAA,UACtB,MAAM,QAAQ,EAAE,OAAO,UAAU;AAAA,QAClC;AAAA;AAAA,IAEF;AAAA,IACA,aAAa;AAAA,MACZ,KAAK,MAAM;AAAA,MAEX,GAAG,CAAC,gBAAgB;AAAA,QACnB,oBAAoB,cAAc;AAAA,QAClC,cAAc;AAAA,QAEd,eAAe,MAAM;AAAA,UAEpB,OAAO,cAAc,eAAe,MAAM,OAAO,GAAG;AAAA,YACnD,WAAW;AAAA,UACZ;AAAA,SACA;AAAA;AAAA,IAEH;AAAA,IACA,KAAK;AAAA,WACE,MAAK,CAAC,UAAU,WAAW;AAAA,QAChC,MAAM,WAAW,MAAM,KAAK,UAAU,CAAC,OAAO,UAAU,KAAK,WAAW,OAAO,KAAK,CAAC;AAAA,QACrF,OAAO,QAAQ,IAAI,QAAQ;AAAA;AAAA,IAE7B;AAAA,EACD,CAAC;AAAA,EAED,OAAO;AAAA;AASR,SAAS,mBAAmB,CAAC,aAAa;AAAA,EACzC,IAAI,GAAG,OAAO,UAAU,WAAW,KAAK,gBAAgB,OAAO,sBAAsB,cAAc,IAAI;AAAA,IACtG,MAAM,IAAI,UAAU,qDAAqD;AAAA,EAC1E;AAAA;",
+  "debugId": "3D76B2D56E7211BE64756E2164756E21",
+  "names": []
+}