flowx-control 1.0.0

package/dist/queue.js

@@ -0,0 +1,121 @@
+'use strict';
+
+// src/queue.ts
+function createQueue(options) {
+  const { concurrency = 1, autoStart = true, timeout = 0 } = options ?? {};
+  if (concurrency < 1) throw new RangeError("concurrency must be >= 1");
+  let paused = !autoStart;
+  let active = 0;
+  const entries = [];
+  const emptyCallbacks = [];
+  const idleCallbacks = [];
+  function notifyIdle() {
+    if (active === 0 && entries.length === 0) {
+      for (const cb of idleCallbacks.splice(0)) cb();
+    }
+  }
+  function notifyEmpty() {
+    if (entries.length === 0) {
+      for (const cb of emptyCallbacks.splice(0)) cb();
+    }
+  }
+  function tryRun() {
+    if (paused) return;
+    while (active < concurrency && entries.length > 0) {
+      const entry = entries.shift();
+      active++;
+      let timer;
+      const run = async () => {
+        try {
+          let result;
+          if (timeout > 0) {
+            result = await Promise.race([
+              entry.fn(),
+              new Promise((_, rej) => {
+                timer = setTimeout(() => rej(new Error("Queue task timeout")), timeout);
+              })
+            ]);
+          } else {
+            result = await entry.fn();
+          }
+          if (timer) clearTimeout(timer);
+          entry.resolve(result);
+        } catch (error) {
+          if (timer) clearTimeout(timer);
+          entry.reject(error instanceof Error ? error : new Error(String(error)));
+        } finally {
+          active--;
+          notifyEmpty();
+          tryRun();
+          notifyIdle();
+        }
+      };
+      run();
+    }
+    notifyEmpty();
+    notifyIdle();
+  }
+  function add(fn, addOptions) {
+    const priority = addOptions?.priority ?? 0;
+    return new Promise((resolve, reject) => {
+      const entry = { fn, priority, resolve, reject };
+      let inserted = false;
+      for (let i = 0; i < entries.length; i++) {
+        if (priority < entries[i].priority) {
+          entries.splice(i, 0, entry);
+          inserted = true;
+          break;
+        }
+      }
+      if (!inserted) {
+        entries.push(entry);
+      }
+      tryRun();
+    });
+  }
+  function addAll(fns, addOptions) {
+    return Promise.all(fns.map((fn) => add(fn, addOptions)));
+  }
+  function pause() {
+    paused = true;
+  }
+  function resume() {
+    paused = false;
+    tryRun();
+  }
+  function clear() {
+    for (const entry of entries.splice(0)) {
+      entry.reject(new Error("Queue cleared"));
+    }
+  }
+  function onEmpty() {
+    if (entries.length === 0) return Promise.resolve();
+    return new Promise((resolve) => emptyCallbacks.push(resolve));
+  }
+  function onIdle() {
+    if (active === 0 && entries.length === 0) return Promise.resolve();
+    return new Promise((resolve) => idleCallbacks.push(resolve));
+  }
+  return {
+    add,
+    addAll,
+    pause,
+    resume,
+    clear,
+    onEmpty,
+    onIdle,
+    get size() {
+      return entries.length;
+    },
+    get pending() {
+      return active;
+    },
+    get isPaused() {
+      return paused;
+    }
+  };
+}
+
+exports.createQueue = createQueue;
+//# sourceMappingURL=queue.js.map
+//# sourceMappingURL=queue.js.map

package/dist/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/queue.ts"],"names":[],"mappings":";;;AA0DO,SAAS,YAAY,OAAA,EAAoC;AAC9D,EAAA,MAAM,EAAE,cAAc,CAAA,EAAG,SAAA,GAAY,MAAM,OAAA,GAAU,CAAA,EAAE,GAAI,OAAA,IAAW,EAAC;AAEvE,EAAA,IAAI,WAAA,GAAc,CAAA,EAAG,MAAM,IAAI,WAAW,0BAA0B,CAAA;AAEpE,EAAA,IAAI,SAAS,CAAC,SAAA;AACd,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,MAAM,UAAwB,EAAC;AAC/B,EAAA,MAAM,iBAAoC,EAAC;AAC3C,EAAA,MAAM,gBAAmC,EAAC;AAE1C,EAAA,SAAS,UAAA,GAAmB;AAC1B,IAAA,IAAI,MAAA,KAAW,CAAA,IAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACxC,MAAA,KAAA,MAAW,EAAA,IAAM,aAAA,CAAc,MAAA,CAAO,CAAC,GAAG,EAAA,EAAG;AAAA,IAC/C;AAAA,EACF;AAEA,EAAA,SAAS,WAAA,GAAoB;AAC3B,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,MAAA,KAAA,MAAW,EAAA,IAAM,cAAA,CAAe,MAAA,CAAO,CAAC,GAAG,EAAA,EAAG;AAAA,IAChD;AAAA,EACF;AAEA,EAAA,SAAS,MAAA,GAAe;AACtB,IAAA,IAAI,MAAA,EAAQ;AAEZ,IAAA,OAAO,MAAA,GAAS,WAAA,IAAe,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG;AACjD,MAAA,MAAM,KAAA,GAAQ,QAAQ,KAAA,EAAM;AAC5B,MAAA,MAAA,EAAA;AAEA,MAAA,IAAI,KAAA;AAEJ,MAAA,MAAM,MAAM,YAAY;AACtB,QAAA,IAAI;AACF,UAAA,IAAI,MAAA;AACJ,UAAA,IAAI,UAAU,CAAA,EAAG;AACf,YAAA,MAAA,GAAS,MAAM,QAAQ,IAAA,CAAK;AAAA,cAC1B,MAAM,EAAA,EAAG;AAAA,cACT,IAAI,OAAA,CAAe,CAAC,CAAA,EAAG,GAAA,KAAQ;AAC7B,gBAAA,KAAA,GAAQ,UAAA,CAAW,MAAM,GAAA,CAAI,IAAI,MAAM,oBAAoB,CAAC,GAAG,OAAO,CAAA;AAAA,cACxE,CAAC;AAAA,aACF,CAAA;AAAA,UACH,CAAA,MAAO;AACL,YAAA,MAAA,GAAS,MAAM,MAAM,EAAA,EAAG;AAAA,UAC1B;AACA,UAAA,IAAI,KAAA,eAAoB,KAAK,CAAA;AAC7B,UAAA,KAAA,CAAM,QAAQ,MAAM,CAAA;AAAA,QACtB,SAAS,KAAA,EAAO;AACd,UAAA,IAAI,KAAA,eAAoB,KAAK,CAAA;AAC7B,UAAA,KAAA,CAAM,MAAA,CAAO,iBAAiB,KAAA,GAAQ,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,KAAK,CAAC,CAAC,CAAA;AAAA,QACxE,CAAA,SAAE;AACA,UAAA,MAAA,EAAA;AACA,UAAA,WAAA,EAAY;AACZ,UAAA,MAAA,EAAO;AACP,UAAA,UAAA,EAAW;AAAA,QACb;AAAA,MACF,CAAA;AAEA,MAAA,GAAA,EAAI;AAAA,IACN;AAEA,IAAA,WAAA,EAAY;AACZ,IAAA,UAAA,EAAW;AAAA,EACb;AAEA,EAAA,SAAS,GAAA,CAAO,IAAsB,UAAA,EAA0C;AAC9E,IAAA,MAAM,QAAA,GAAW,YAAY,QAAA,IAAY,CAAA;AAEzC,IAAA,OAAO,IAAI,OAAA,CAAW,CAAC,OAAA,EAAS,MAAA,KAAW;AACzC,MAAA,MAAM,KAAA,GAAoB,EAAE,EAAA,EAAI,QAAA,EAAU,SAAS,MAAA,EAAO;AAG1D,MAAA,IAAI,QAAA,GAAW,KAAA;AACf,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACvC,QAAA,IAAI,QAAA,GAAW,OAAA,CAAQ,CAAC,CAAA,CAAE,QAAA,EAAU;AAClC,UAAA,OAAA,CAAQ,MAAA,CAAO,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAC1B,UAAA,QAAA,GAAW,IAAA;AACX,UAAA;AAAA,QACF;AAAA,MACF;AACA,MAAA,IAAI,CAAC,QAAA,EAAU;AACb,QAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,MACpB;AAEA,MAAA,MAAA,EAAO;AAAA,IACT,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,SAAS,MAAA,CAAU,KAA8B,UAAA,EAA4C;AAC3F,IAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,GAAA,CAAI,GAAA,CAAI,CAAC,OAAO,GAAA,CAAI,EAAA,EAAI,UAAU,CAAC,CAAC,CAAA;AAAA,EACzD;AAEA,EAAA,SAAS,KAAA,GAAc;AACrB,IAAA,MAAA,GAAS,IAAA;AAAA,EACX;AAEA,EAAA,SAAS,MAAA,GAAe;AACtB,IAAA,MAAA,GAAS,KAAA;AACT,IAAA,MAAA,EAAO;AAAA,EACT;AAEA,EAAA,SAAS,KAAA,GAAc;AACrB,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,EAAG;AACrC,MAAA,KAAA,CAAM,MAAA,CAAO,IAAI,KAAA,CAAM,eAAe,CAAC,CAAA;AAAA,IACzC;AAAA,EACF;AAEA,EAAA,SAAS,OAAA,GAAyB;AAChC,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,QAAQ,OAAA,EAAQ;AACjD,IAAA,OAAO,IAAI,OAAA,CAAc,CAAC,YAAY,cAAA,CAAe,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,EACpE;AAEA,EAAA,SAAS,MAAA,GAAwB;AAC/B,IAAA,IAAI,WAAW,CAAA,IAAK,OAAA,CAAQ,WAAW,CAAA,EAAG,OAAO,QAAQ,OAAA,EAAQ;AACjE,IAAA,OAAO,IAAI,OAAA,CAAc,CAAC,YAAY,aAAA,CAAc,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,EACnE;AAEA,EAAA,OAAO;AAAA,IACL,GAAA;AAAA,IACA,MAAA;AAAA,IACA,KAAA;AAAA,IACA,MAAA;AAAA,IACA,KAAA;AAAA,IACA,OAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAI,IAAA,GAAO;AACT,MAAA,OAAO,OAAA,CAAQ,MAAA;AAAA,IACjB,CAAA;AAAA,IACA,IAAI,OAAA,GAAU;AACZ,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAAA,IACA,IAAI,QAAA,GAAW;AACb,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACF","file":"queue.js","sourcesContent":["// ============================================================================\n// FlowX — Priority Async Queue\n// ============================================================================\n\nexport interface QueueOptions {\n  /** Maximum concurrent tasks (default: 1) */\n  concurrency?: number;\n  /** Start processing immediately (default: true) */\n  autoStart?: boolean;\n  /** Per-task timeout in ms (0 = no timeout) */\n  timeout?: number;\n}\n\nexport interface QueueAddOptions {\n  /** Task priority — lower number = higher priority (default: 0) */\n  priority?: number;\n}\n\nexport interface AsyncQueue {\n  /** Add a task to the queue */\n  add: <T>(fn: () => Promise<T>, options?: QueueAddOptions) => Promise<T>;\n  /** Add multiple tasks and return all results */\n  addAll: <T>(fns: Array<() => Promise<T>>, options?: QueueAddOptions) => Promise<T[]>;\n  /** Pause processing */\n  pause: () => void;\n  /** Resume processing */\n  resume: () => void;\n  /** Clear all pending tasks */\n  clear: () => void;\n  /** Wait until the queue is empty */\n  onEmpty: () => Promise<void>;\n  /** Wait until the queue is idle (empty + no active tasks) */\n  onIdle: () => Promise<void>;\n  /** Number of pending tasks */\n  readonly size: number;\n  /** Number of active tasks */\n  readonly pending: number;\n  /** Whether the queue is paused */\n  readonly isPaused: boolean;\n}\n\ninterface QueueEntry {\n  fn: () => Promise<any>;\n  priority: number;\n  resolve: (value: any) => void;\n  reject: (error: Error) => void;\n}\n\n/**\n * Create a priority async queue with concurrency control.\n *\n * @example\n * ```ts\n * const queue = createQueue({ concurrency: 3 });\n * const result = await queue.add(() => fetch('/api'), { priority: 1 });\n * await queue.onIdle();\n * ```\n */\nexport function createQueue(options?: QueueOptions): AsyncQueue {\n  const { concurrency = 1, autoStart = true, timeout = 0 } = options ?? {};\n\n  if (concurrency < 1) throw new RangeError('concurrency must be >= 1');\n\n  let paused = !autoStart;\n  let active = 0;\n  const entries: QueueEntry[] = [];\n  const emptyCallbacks: Array<() => void> = [];\n  const idleCallbacks: Array<() => void> = [];\n\n  function notifyIdle(): void {\n    if (active === 0 && entries.length === 0) {\n      for (const cb of idleCallbacks.splice(0)) cb();\n    }\n  }\n\n  function notifyEmpty(): void {\n    if (entries.length === 0) {\n      for (const cb of emptyCallbacks.splice(0)) cb();\n    }\n  }\n\n  function tryRun(): void {\n    if (paused) return;\n\n    while (active < concurrency && entries.length > 0) {\n      const entry = entries.shift()!;\n      active++;\n\n      let timer: ReturnType<typeof setTimeout> | undefined;\n\n      const run = async () => {\n        try {\n          let result: any;\n          if (timeout > 0) {\n            result = await Promise.race([\n              entry.fn(),\n              new Promise<never>((_, rej) => {\n                timer = setTimeout(() => rej(new Error('Queue task timeout')), timeout);\n              }),\n            ]);\n          } else {\n            result = await entry.fn();\n          }\n          if (timer) clearTimeout(timer);\n          entry.resolve(result);\n        } catch (error) {\n          if (timer) clearTimeout(timer);\n          entry.reject(error instanceof Error ? error : new Error(String(error)));\n        } finally {\n          active--;\n          notifyEmpty();\n          tryRun();\n          notifyIdle();\n        }\n      };\n\n      run();\n    }\n\n    notifyEmpty();\n    notifyIdle();\n  }\n\n  function add<T>(fn: () => Promise<T>, addOptions?: QueueAddOptions): Promise<T> {\n    const priority = addOptions?.priority ?? 0;\n\n    return new Promise<T>((resolve, reject) => {\n      const entry: QueueEntry = { fn, priority, resolve, reject };\n\n      // Insert sorted by priority (lower = higher priority)\n      let inserted = false;\n      for (let i = 0; i < entries.length; i++) {\n        if (priority < entries[i].priority) {\n          entries.splice(i, 0, entry);\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        entries.push(entry);\n      }\n\n      tryRun();\n    });\n  }\n\n  function addAll<T>(fns: Array<() => Promise<T>>, addOptions?: QueueAddOptions): Promise<T[]> {\n    return Promise.all(fns.map((fn) => add(fn, addOptions)));\n  }\n\n  function pause(): void {\n    paused = true;\n  }\n\n  function resume(): void {\n    paused = false;\n    tryRun();\n  }\n\n  function clear(): void {\n    for (const entry of entries.splice(0)) {\n      entry.reject(new Error('Queue cleared'));\n    }\n  }\n\n  function onEmpty(): Promise<void> {\n    if (entries.length === 0) return Promise.resolve();\n    return new Promise<void>((resolve) => emptyCallbacks.push(resolve));\n  }\n\n  function onIdle(): Promise<void> {\n    if (active === 0 && entries.length === 0) return Promise.resolve();\n    return new Promise<void>((resolve) => idleCallbacks.push(resolve));\n  }\n\n  return {\n    add,\n    addAll,\n    pause,\n    resume,\n    clear,\n    onEmpty,\n    onIdle,\n    get size() {\n      return entries.length;\n    },\n    get pending() {\n      return active;\n    },\n    get isPaused() {\n      return paused;\n    },\n  };\n}\n"]}

package/dist/queue.mjs

@@ -0,0 +1,119 @@
+// src/queue.ts
+function createQueue(options) {
+  const { concurrency = 1, autoStart = true, timeout = 0 } = options ?? {};
+  if (concurrency < 1) throw new RangeError("concurrency must be >= 1");
+  let paused = !autoStart;
+  let active = 0;
+  const entries = [];
+  const emptyCallbacks = [];
+  const idleCallbacks = [];
+  function notifyIdle() {
+    if (active === 0 && entries.length === 0) {
+      for (const cb of idleCallbacks.splice(0)) cb();
+    }
+  }
+  function notifyEmpty() {
+    if (entries.length === 0) {
+      for (const cb of emptyCallbacks.splice(0)) cb();
+    }
+  }
+  function tryRun() {
+    if (paused) return;
+    while (active < concurrency && entries.length > 0) {
+      const entry = entries.shift();
+      active++;
+      let timer;
+      const run = async () => {
+        try {
+          let result;
+          if (timeout > 0) {
+            result = await Promise.race([
+              entry.fn(),
+              new Promise((_, rej) => {
+                timer = setTimeout(() => rej(new Error("Queue task timeout")), timeout);
+              })
+            ]);
+          } else {
+            result = await entry.fn();
+          }
+          if (timer) clearTimeout(timer);
+          entry.resolve(result);
+        } catch (error) {
+          if (timer) clearTimeout(timer);
+          entry.reject(error instanceof Error ? error : new Error(String(error)));
+        } finally {
+          active--;
+          notifyEmpty();
+          tryRun();
+          notifyIdle();
+        }
+      };
+      run();
+    }
+    notifyEmpty();
+    notifyIdle();
+  }
+  function add(fn, addOptions) {
+    const priority = addOptions?.priority ?? 0;
+    return new Promise((resolve, reject) => {
+      const entry = { fn, priority, resolve, reject };
+      let inserted = false;
+      for (let i = 0; i < entries.length; i++) {
+        if (priority < entries[i].priority) {
+          entries.splice(i, 0, entry);
+          inserted = true;
+          break;
+        }
+      }
+      if (!inserted) {
+        entries.push(entry);
+      }
+      tryRun();
+    });
+  }
+  function addAll(fns, addOptions) {
+    return Promise.all(fns.map((fn) => add(fn, addOptions)));
+  }
+  function pause() {
+    paused = true;
+  }
+  function resume() {
+    paused = false;
+    tryRun();
+  }
+  function clear() {
+    for (const entry of entries.splice(0)) {
+      entry.reject(new Error("Queue cleared"));
+    }
+  }
+  function onEmpty() {
+    if (entries.length === 0) return Promise.resolve();
+    return new Promise((resolve) => emptyCallbacks.push(resolve));
+  }
+  function onIdle() {
+    if (active === 0 && entries.length === 0) return Promise.resolve();
+    return new Promise((resolve) => idleCallbacks.push(resolve));
+  }
+  return {
+    add,
+    addAll,
+    pause,
+    resume,
+    clear,
+    onEmpty,
+    onIdle,
+    get size() {
+      return entries.length;
+    },
+    get pending() {
+      return active;
+    },
+    get isPaused() {
+      return paused;
+    }
+  };
+}
+
+export { createQueue };
+//# sourceMappingURL=queue.mjs.map
+//# sourceMappingURL=queue.mjs.map

package/dist/queue.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/queue.ts"],"names":[],"mappings":";AA0DO,SAAS,YAAY,OAAA,EAAoC;AAC9D,EAAA,MAAM,EAAE,cAAc,CAAA,EAAG,SAAA,GAAY,MAAM,OAAA,GAAU,CAAA,EAAE,GAAI,OAAA,IAAW,EAAC;AAEvE,EAAA,IAAI,WAAA,GAAc,CAAA,EAAG,MAAM,IAAI,WAAW,0BAA0B,CAAA;AAEpE,EAAA,IAAI,SAAS,CAAC,SAAA;AACd,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,MAAM,UAAwB,EAAC;AAC/B,EAAA,MAAM,iBAAoC,EAAC;AAC3C,EAAA,MAAM,gBAAmC,EAAC;AAE1C,EAAA,SAAS,UAAA,GAAmB;AAC1B,IAAA,IAAI,MAAA,KAAW,CAAA,IAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACxC,MAAA,KAAA,MAAW,EAAA,IAAM,aAAA,CAAc,MAAA,CAAO,CAAC,GAAG,EAAA,EAAG;AAAA,IAC/C;AAAA,EACF;AAEA,EAAA,SAAS,WAAA,GAAoB;AAC3B,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,MAAA,KAAA,MAAW,EAAA,IAAM,cAAA,CAAe,MAAA,CAAO,CAAC,GAAG,EAAA,EAAG;AAAA,IAChD;AAAA,EACF;AAEA,EAAA,SAAS,MAAA,GAAe;AACtB,IAAA,IAAI,MAAA,EAAQ;AAEZ,IAAA,OAAO,MAAA,GAAS,WAAA,IAAe,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG;AACjD,MAAA,MAAM,KAAA,GAAQ,QAAQ,KAAA,EAAM;AAC5B,MAAA,MAAA,EAAA;AAEA,MAAA,IAAI,KAAA;AAEJ,MAAA,MAAM,MAAM,YAAY;AACtB,QAAA,IAAI;AACF,UAAA,IAAI,MAAA;AACJ,UAAA,IAAI,UAAU,CAAA,EAAG;AACf,YAAA,MAAA,GAAS,MAAM,QAAQ,IAAA,CAAK;AAAA,cAC1B,MAAM,EAAA,EAAG;AAAA,cACT,IAAI,OAAA,CAAe,CAAC,CAAA,EAAG,GAAA,KAAQ;AAC7B,gBAAA,KAAA,GAAQ,UAAA,CAAW,MAAM,GAAA,CAAI,IAAI,MAAM,oBAAoB,CAAC,GAAG,OAAO,CAAA;AAAA,cACxE,CAAC;AAAA,aACF,CAAA;AAAA,UACH,CAAA,MAAO;AACL,YAAA,MAAA,GAAS,MAAM,MAAM,EAAA,EAAG;AAAA,UAC1B;AACA,UAAA,IAAI,KAAA,eAAoB,KAAK,CAAA;AAC7B,UAAA,KAAA,CAAM,QAAQ,MAAM,CAAA;AAAA,QACtB,SAAS,KAAA,EAAO;AACd,UAAA,IAAI,KAAA,eAAoB,KAAK,CAAA;AAC7B,UAAA,KAAA,CAAM,MAAA,CAAO,iBAAiB,KAAA,GAAQ,KAAA,GAAQ,IAAI,KAAA,CAAM,MAAA,CAAO,KAAK,CAAC,CAAC,CAAA;AAAA,QACxE,CAAA,SAAE;AACA,UAAA,MAAA,EAAA;AACA,UAAA,WAAA,EAAY;AACZ,UAAA,MAAA,EAAO;AACP,UAAA,UAAA,EAAW;AAAA,QACb;AAAA,MACF,CAAA;AAEA,MAAA,GAAA,EAAI;AAAA,IACN;AAEA,IAAA,WAAA,EAAY;AACZ,IAAA,UAAA,EAAW;AAAA,EACb;AAEA,EAAA,SAAS,GAAA,CAAO,IAAsB,UAAA,EAA0C;AAC9E,IAAA,MAAM,QAAA,GAAW,YAAY,QAAA,IAAY,CAAA;AAEzC,IAAA,OAAO,IAAI,OAAA,CAAW,CAAC,OAAA,EAAS,MAAA,KAAW;AACzC,MAAA,MAAM,KAAA,GAAoB,EAAE,EAAA,EAAI,QAAA,EAAU,SAAS,MAAA,EAAO;AAG1D,MAAA,IAAI,QAAA,GAAW,KAAA;AACf,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACvC,QAAA,IAAI,QAAA,GAAW,OAAA,CAAQ,CAAC,CAAA,CAAE,QAAA,EAAU;AAClC,UAAA,OAAA,CAAQ,MAAA,CAAO,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAC1B,UAAA,QAAA,GAAW,IAAA;AACX,UAAA;AAAA,QACF;AAAA,MACF;AACA,MAAA,IAAI,CAAC,QAAA,EAAU;AACb,QAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,MACpB;AAEA,MAAA,MAAA,EAAO;AAAA,IACT,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,SAAS,MAAA,CAAU,KAA8B,UAAA,EAA4C;AAC3F,IAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,GAAA,CAAI,GAAA,CAAI,CAAC,OAAO,GAAA,CAAI,EAAA,EAAI,UAAU,CAAC,CAAC,CAAA;AAAA,EACzD;AAEA,EAAA,SAAS,KAAA,GAAc;AACrB,IAAA,MAAA,GAAS,IAAA;AAAA,EACX;AAEA,EAAA,SAAS,MAAA,GAAe;AACtB,IAAA,MAAA,GAAS,KAAA;AACT,IAAA,MAAA,EAAO;AAAA,EACT;AAEA,EAAA,SAAS,KAAA,GAAc;AACrB,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,EAAG;AACrC,MAAA,KAAA,CAAM,MAAA,CAAO,IAAI,KAAA,CAAM,eAAe,CAAC,CAAA;AAAA,IACzC;AAAA,EACF;AAEA,EAAA,SAAS,OAAA,GAAyB;AAChC,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,QAAQ,OAAA,EAAQ;AACjD,IAAA,OAAO,IAAI,OAAA,CAAc,CAAC,YAAY,cAAA,CAAe,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,EACpE;AAEA,EAAA,SAAS,MAAA,GAAwB;AAC/B,IAAA,IAAI,WAAW,CAAA,IAAK,OAAA,CAAQ,WAAW,CAAA,EAAG,OAAO,QAAQ,OAAA,EAAQ;AACjE,IAAA,OAAO,IAAI,OAAA,CAAc,CAAC,YAAY,aAAA,CAAc,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,EACnE;AAEA,EAAA,OAAO;AAAA,IACL,GAAA;AAAA,IACA,MAAA;AAAA,IACA,KAAA;AAAA,IACA,MAAA;AAAA,IACA,KAAA;AAAA,IACA,OAAA;AAAA,IACA,MAAA;AAAA,IACA,IAAI,IAAA,GAAO;AACT,MAAA,OAAO,OAAA,CAAQ,MAAA;AAAA,IACjB,CAAA;AAAA,IACA,IAAI,OAAA,GAAU;AACZ,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAAA,IACA,IAAI,QAAA,GAAW;AACb,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACF","file":"queue.mjs","sourcesContent":["// ============================================================================\n// FlowX — Priority Async Queue\n// ============================================================================\n\nexport interface QueueOptions {\n  /** Maximum concurrent tasks (default: 1) */\n  concurrency?: number;\n  /** Start processing immediately (default: true) */\n  autoStart?: boolean;\n  /** Per-task timeout in ms (0 = no timeout) */\n  timeout?: number;\n}\n\nexport interface QueueAddOptions {\n  /** Task priority — lower number = higher priority (default: 0) */\n  priority?: number;\n}\n\nexport interface AsyncQueue {\n  /** Add a task to the queue */\n  add: <T>(fn: () => Promise<T>, options?: QueueAddOptions) => Promise<T>;\n  /** Add multiple tasks and return all results */\n  addAll: <T>(fns: Array<() => Promise<T>>, options?: QueueAddOptions) => Promise<T[]>;\n  /** Pause processing */\n  pause: () => void;\n  /** Resume processing */\n  resume: () => void;\n  /** Clear all pending tasks */\n  clear: () => void;\n  /** Wait until the queue is empty */\n  onEmpty: () => Promise<void>;\n  /** Wait until the queue is idle (empty + no active tasks) */\n  onIdle: () => Promise<void>;\n  /** Number of pending tasks */\n  readonly size: number;\n  /** Number of active tasks */\n  readonly pending: number;\n  /** Whether the queue is paused */\n  readonly isPaused: boolean;\n}\n\ninterface QueueEntry {\n  fn: () => Promise<any>;\n  priority: number;\n  resolve: (value: any) => void;\n  reject: (error: Error) => void;\n}\n\n/**\n * Create a priority async queue with concurrency control.\n *\n * @example\n * ```ts\n * const queue = createQueue({ concurrency: 3 });\n * const result = await queue.add(() => fetch('/api'), { priority: 1 });\n * await queue.onIdle();\n * ```\n */\nexport function createQueue(options?: QueueOptions): AsyncQueue {\n  const { concurrency = 1, autoStart = true, timeout = 0 } = options ?? {};\n\n  if (concurrency < 1) throw new RangeError('concurrency must be >= 1');\n\n  let paused = !autoStart;\n  let active = 0;\n  const entries: QueueEntry[] = [];\n  const emptyCallbacks: Array<() => void> = [];\n  const idleCallbacks: Array<() => void> = [];\n\n  function notifyIdle(): void {\n    if (active === 0 && entries.length === 0) {\n      for (const cb of idleCallbacks.splice(0)) cb();\n    }\n  }\n\n  function notifyEmpty(): void {\n    if (entries.length === 0) {\n      for (const cb of emptyCallbacks.splice(0)) cb();\n    }\n  }\n\n  function tryRun(): void {\n    if (paused) return;\n\n    while (active < concurrency && entries.length > 0) {\n      const entry = entries.shift()!;\n      active++;\n\n      let timer: ReturnType<typeof setTimeout> | undefined;\n\n      const run = async () => {\n        try {\n          let result: any;\n          if (timeout > 0) {\n            result = await Promise.race([\n              entry.fn(),\n              new Promise<never>((_, rej) => {\n                timer = setTimeout(() => rej(new Error('Queue task timeout')), timeout);\n              }),\n            ]);\n          } else {\n            result = await entry.fn();\n          }\n          if (timer) clearTimeout(timer);\n          entry.resolve(result);\n        } catch (error) {\n          if (timer) clearTimeout(timer);\n          entry.reject(error instanceof Error ? error : new Error(String(error)));\n        } finally {\n          active--;\n          notifyEmpty();\n          tryRun();\n          notifyIdle();\n        }\n      };\n\n      run();\n    }\n\n    notifyEmpty();\n    notifyIdle();\n  }\n\n  function add<T>(fn: () => Promise<T>, addOptions?: QueueAddOptions): Promise<T> {\n    const priority = addOptions?.priority ?? 0;\n\n    return new Promise<T>((resolve, reject) => {\n      const entry: QueueEntry = { fn, priority, resolve, reject };\n\n      // Insert sorted by priority (lower = higher priority)\n      let inserted = false;\n      for (let i = 0; i < entries.length; i++) {\n        if (priority < entries[i].priority) {\n          entries.splice(i, 0, entry);\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        entries.push(entry);\n      }\n\n      tryRun();\n    });\n  }\n\n  function addAll<T>(fns: Array<() => Promise<T>>, addOptions?: QueueAddOptions): Promise<T[]> {\n    return Promise.all(fns.map((fn) => add(fn, addOptions)));\n  }\n\n  function pause(): void {\n    paused = true;\n  }\n\n  function resume(): void {\n    paused = false;\n    tryRun();\n  }\n\n  function clear(): void {\n    for (const entry of entries.splice(0)) {\n      entry.reject(new Error('Queue cleared'));\n    }\n  }\n\n  function onEmpty(): Promise<void> {\n    if (entries.length === 0) return Promise.resolve();\n    return new Promise<void>((resolve) => emptyCallbacks.push(resolve));\n  }\n\n  function onIdle(): Promise<void> {\n    if (active === 0 && entries.length === 0) return Promise.resolve();\n    return new Promise<void>((resolve) => idleCallbacks.push(resolve));\n  }\n\n  return {\n    add,\n    addAll,\n    pause,\n    resume,\n    clear,\n    onEmpty,\n    onIdle,\n    get size() {\n      return entries.length;\n    },\n    get pending() {\n      return active;\n    },\n    get isPaused() {\n      return paused;\n    },\n  };\n}\n"]}

package/dist/rate-limit.d.mts

@@ -0,0 +1,28 @@
+interface RateLimitOptions {
+    /** Maximum number of executions per interval */
+    limit: number;
+    /** Time window in ms */
+    interval: number;
+    /** Whether to reject or queue when limit is exceeded (default: 'queue') */
+    strategy?: 'queue' | 'reject';
+}
+interface RateLimiter {
+    /** Execute a function within the rate limit */
+    execute: <T>(fn: () => T | Promise<T>) => Promise<T>;
+    /** Reset the rate limiter state */
+    reset: () => void;
+    /** Number of remaining tokens in current window */
+    readonly remaining: number;
+}
+/**
+ * Create a rate limiter using the token bucket algorithm.
+ *
+ * @example
+ * ```ts
+ * const limiter = createRateLimiter({ limit: 10, interval: 1000 });
+ * await limiter.execute(() => fetch('/api'));
+ * ```
+ */
+declare function createRateLimiter(options: RateLimitOptions): RateLimiter;
+
+export { type RateLimitOptions, type RateLimiter, createRateLimiter };

package/dist/rate-limit.d.ts

@@ -0,0 +1,28 @@
+interface RateLimitOptions {
+    /** Maximum number of executions per interval */
+    limit: number;
+    /** Time window in ms */
+    interval: number;
+    /** Whether to reject or queue when limit is exceeded (default: 'queue') */
+    strategy?: 'queue' | 'reject';
+}
+interface RateLimiter {
+    /** Execute a function within the rate limit */
+    execute: <T>(fn: () => T | Promise<T>) => Promise<T>;
+    /** Reset the rate limiter state */
+    reset: () => void;
+    /** Number of remaining tokens in current window */
+    readonly remaining: number;
+}
+/**
+ * Create a rate limiter using the token bucket algorithm.
+ *
+ * @example
+ * ```ts
+ * const limiter = createRateLimiter({ limit: 10, interval: 1000 });
+ * await limiter.execute(() => fetch('/api'));
+ * ```
+ */
+declare function createRateLimiter(options: RateLimitOptions): RateLimiter;
+
+export { type RateLimitOptions, type RateLimiter, createRateLimiter };

package/dist/rate-limit.js

@@ -0,0 +1,94 @@
+'use strict';
+
+// src/types.ts
+var FlowXError = class extends Error {
+  constructor(message, code) {
+    super(message);
+    this.name = "FlowXError";
+    this.code = code;
+    Object.setPrototypeOf(this, new.target.prototype);
+  }
+};
+var RateLimitError = class extends FlowXError {
+  constructor(message = "Rate limit exceeded") {
+    super(message, "ERR_RATE_LIMIT");
+    this.name = "RateLimitError";
+  }
+};
+
+// src/rate-limit.ts
+function createRateLimiter(options) {
+  const { limit, interval, strategy = "queue" } = options;
+  if (limit < 1) throw new RangeError("limit must be >= 1");
+  if (interval < 1) throw new RangeError("interval must be >= 1");
+  let tokens = limit;
+  let lastRefill = Date.now();
+  const queue = [];
+  let drainTimer = null;
+  function refill() {
+    const now = Date.now();
+    const elapsed = now - lastRefill;
+    const refillCount = Math.floor(elapsed / interval) * limit;
+    if (refillCount > 0) {
+      tokens = Math.min(limit, tokens + refillCount);
+      lastRefill = now;
+    }
+  }
+  function drainQueue() {
+    refill();
+    while (queue.length > 0 && tokens > 0) {
+      tokens--;
+      const item = queue.shift();
+      item.resolve();
+    }
+    if (queue.length > 0) {
+      scheduleDrain();
+    } else {
+      drainTimer = null;
+    }
+  }
+  function scheduleDrain() {
+    if (drainTimer) return;
+    const timeToNextToken = interval / limit;
+    drainTimer = setTimeout(() => {
+      drainTimer = null;
+      drainQueue();
+    }, timeToNextToken);
+  }
+  async function execute(fn) {
+    refill();
+    if (tokens > 0) {
+      tokens--;
+      return await fn();
+    }
+    if (strategy === "reject") {
+      throw new RateLimitError();
+    }
+    await new Promise((resolve) => {
+      queue.push({ resolve });
+      scheduleDrain();
+    });
+    return await fn();
+  }
+  function reset() {
+    tokens = limit;
+    lastRefill = Date.now();
+    if (drainTimer) {
+      clearTimeout(drainTimer);
+      drainTimer = null;
+    }
+    drainQueue();
+  }
+  return {
+    execute,
+    reset,
+    get remaining() {
+      refill();
+      return tokens;
+    }
+  };
+}
+
+exports.createRateLimiter = createRateLimiter;
+//# sourceMappingURL=rate-limit.js.map
+//# sourceMappingURL=rate-limit.js.map

package/dist/rate-limit.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/types.ts","../src/rate-limit.ts"],"names":[],"mappings":";;;AAmBO,IAAM,UAAA,GAAN,cAAyB,KAAA,CAAM;AAAA,EAEpC,WAAA,CAAY,SAAiB,IAAA,EAAc;AACzC,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,YAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,MAAA,CAAO,cAAA,CAAe,IAAA,EAAM,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA;AAAA,EAClD;AACF,CAAA;AAmCO,IAAM,cAAA,GAAN,cAA6B,UAAA,CAAW;AAAA,EAC7C,WAAA,CAAY,UAAU,qBAAA,EAAuB;AAC3C,IAAA,KAAA,CAAM,SAAS,gBAAgB,CAAA;AAC/B,IAAA,IAAA,CAAK,IAAA,GAAO,gBAAA;AAAA,EACd;AACF,CAAA;;;ACnCO,SAAS,kBAAkB,OAAA,EAAwC;AACxE,EAAA,MAAM,EAAE,KAAA,EAAO,QAAA,EAAU,QAAA,GAAW,SAAQ,GAAI,OAAA;AAEhD,EAAA,IAAI,KAAA,GAAQ,CAAA,EAAG,MAAM,IAAI,WAAW,oBAAoB,CAAA;AACxD,EAAA,IAAI,QAAA,GAAW,CAAA,EAAG,MAAM,IAAI,WAAW,uBAAuB,CAAA;AAE9D,EAAA,IAAI,MAAA,GAAS,KAAA;AACb,EAAA,IAAI,UAAA,GAAa,KAAK,GAAA,EAAI;AAC1B,EAAA,MAAM,QAAwC,EAAC;AAC/C,EAAA,IAAI,UAAA,GAAmD,IAAA;AAEvD,EAAA,SAAS,MAAA,GAAe;AACtB,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,UAAU,GAAA,GAAM,UAAA;AACtB,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,KAAA,CAAM,OAAA,GAAU,QAAQ,CAAA,GAAI,KAAA;AAErD,IAAA,IAAI,cAAc,CAAA,EAAG;AACnB,MAAA,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,MAAA,GAAS,WAAW,CAAA;AAC7C,MAAA,UAAA,GAAa,GAAA;AAAA,IACf;AAAA,EACF;AAEA,EAAA,SAAS,UAAA,GAAmB;AAC1B,IAAA,MAAA,EAAO;AACP,IAAA,OAAO,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,MAAA,GAAS,CAAA,EAAG;AACrC,MAAA,MAAA,EAAA;AACA,MAAA,MAAM,IAAA,GAAO,MAAM,KAAA,EAAM;AACzB,MAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,IACf;AAEA,IAAA,IAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACpB,MAAA,aAAA,EAAc;AAAA,IAChB,CAAA,MAAO;AACL,MAAA,UAAA,GAAa,IAAA;AAAA,IACf;AAAA,EACF;AAEA,EAAA,SAAS,aAAA,GAAsB;AAC7B,IAAA,IAAI,UAAA,EAAY;AAChB,IAAA,MAAM,kBAAkB,QAAA,GAAW,KAAA;AACnC,IAAA,UAAA,GAAa,WAAW,MAAM;AAC5B,MAAA,UAAA,GAAa,IAAA;AACb,MAAA,UAAA,EAAW;AAAA,IACb,GAAG,eAAe,CAAA;AAAA,EACpB;AAEA,EAAA,eAAe,QAAW,EAAA,EAAsC;AAC9D,IAAA,MAAA,EAAO;AAEP,IAAA,IAAI,SAAS,CAAA,EAAG;AACd,MAAA,MAAA,EAAA;AACA,MAAA,OAAO,MAAM,EAAA,EAAG;AAAA,IAClB;AAEA,IAAA,IAAI,aAAa,QAAA,EAAU;AACzB,MAAA,MAAM,IAAI,cAAA,EAAe;AAAA,IAC3B;AAGA,IAAA,MAAM,IAAI,OAAA,CAAc,CAAC,OAAA,KAAY;AACnC,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,OAAA,EAAS,CAAA;AACtB,MAAA,aAAA,EAAc;AAAA,IAChB,CAAC,CAAA;AAED,IAAA,OAAO,MAAM,EAAA,EAAG;AAAA,EAClB;AAEA,EAAA,SAAS,KAAA,GAAc;AACrB,IAAA,MAAA,GAAS,KAAA;AACT,IAAA,UAAA,GAAa,KAAK,GAAA,EAAI;AACtB,IAAA,IAAI,UAAA,EAAY;AACd,MAAA,YAAA,CAAa,UAAU,CAAA;AACvB,MAAA,UAAA,GAAa,IAAA;AAAA,IACf;AACA,IAAA,UAAA,EAAW;AAAA,EACb;AAEA,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,KAAA;AAAA,IACA,IAAI,SAAA,GAAY;AACd,MAAA,MAAA,EAAO;AACP,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACF","file":"rate-limit.js","sourcesContent":["// ============================================================================\n// FlowX — Types & Error Hierarchy\n// ============================================================================\n\n/** Generic async function signature */\nexport type AsyncFn<TArgs extends any[] = any[], TReturn = any> = (\n  ...args: TArgs\n) => Promise<TReturn>;\n\n/** Backoff strategy for retry/poll operations */\nexport type BackoffStrategy =\n  | 'fixed'\n  | 'linear'\n  | 'exponential'\n  | ((attempt: number, delay: number) => number);\n\n// ── Error Classes ───────────────────────────────────────────────────────────\n\n/** Base error class for all FlowX errors */\nexport class FlowXError extends Error {\n  public readonly code: string;\n  constructor(message: string, code: string) {\n    super(message);\n    this.name = 'FlowXError';\n    this.code = code;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n}\n\n/** Thrown when a promise exceeds its timeout */\nexport class TimeoutError extends FlowXError {\n  constructor(message = 'Operation timed out') {\n    super(message, 'ERR_TIMEOUT');\n    this.name = 'TimeoutError';\n  }\n}\n\n/** Thrown when a circuit breaker is open */\nexport class CircuitBreakerError extends FlowXError {\n  constructor(message = 'Circuit breaker is open') {\n    super(message, 'ERR_CIRCUIT_OPEN');\n    this.name = 'CircuitBreakerError';\n  }\n}\n\n/** Thrown when a bulkhead rejects due to capacity */\nexport class BulkheadError extends FlowXError {\n  constructor(message = 'Bulkhead capacity exceeded') {\n    super(message, 'ERR_BULKHEAD_FULL');\n    this.name = 'BulkheadError';\n  }\n}\n\n/** Thrown when an operation is aborted */\nexport class AbortError extends FlowXError {\n  constructor(message = 'Operation aborted') {\n    super(message, 'ERR_ABORTED');\n    this.name = 'AbortError';\n  }\n}\n\n/** Thrown when rate limit is exceeded */\nexport class RateLimitError extends FlowXError {\n  constructor(message = 'Rate limit exceeded') {\n    super(message, 'ERR_RATE_LIMIT');\n    this.name = 'RateLimitError';\n  }\n}\n\n// ── Utility Helpers ─────────────────────────────────────────────────────────\n\n/** Sleep for the specified duration, respecting AbortSignal */\nexport function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(new AbortError());\n      return;\n    }\n\n    let onAbort: (() => void) | undefined;\n\n    const timer = setTimeout(() => {\n      if (signal && onAbort) {\n        signal.removeEventListener('abort', onAbort);\n      }\n      resolve();\n    }, ms);\n\n    if (signal) {\n      onAbort = () => {\n        clearTimeout(timer);\n        reject(new AbortError());\n      };\n      signal.addEventListener('abort', onAbort, { once: true });\n    }\n  });\n}\n\n/** Calculate delay based on backoff strategy */\nexport function calculateDelay(\n  attempt: number,\n  baseDelay: number,\n  strategy: BackoffStrategy,\n  jitter: boolean | number = false,\n): number {\n  let delay: number;\n\n  if (typeof strategy === 'function') {\n    delay = strategy(attempt, baseDelay);\n  } else {\n    switch (strategy) {\n      case 'fixed':\n        delay = baseDelay;\n        break;\n      case 'linear':\n        delay = baseDelay * attempt;\n        break;\n      case 'exponential':\n        delay = baseDelay * Math.pow(2, attempt - 1);\n        break;\n    }\n  }\n\n  if (jitter) {\n    const factor = typeof jitter === 'number' ? jitter : 1;\n    delay = delay * (1 - factor * 0.5 + Math.random() * factor);\n  }\n\n  return Math.max(0, Math.floor(delay));\n}\n","// ============================================================================\n// FlowX — Token Bucket Rate Limiter\n// ============================================================================\nimport { RateLimitError } from './types';\n\nexport interface RateLimitOptions {\n  /** Maximum number of executions per interval */\n  limit: number;\n  /** Time window in ms */\n  interval: number;\n  /** Whether to reject or queue when limit is exceeded (default: 'queue') */\n  strategy?: 'queue' | 'reject';\n}\n\nexport interface RateLimiter {\n  /** Execute a function within the rate limit */\n  execute: <T>(fn: () => T | Promise<T>) => Promise<T>;\n  /** Reset the rate limiter state */\n  reset: () => void;\n  /** Number of remaining tokens in current window */\n  readonly remaining: number;\n}\n\n/**\n * Create a rate limiter using the token bucket algorithm.\n *\n * @example\n * ```ts\n * const limiter = createRateLimiter({ limit: 10, interval: 1000 });\n * await limiter.execute(() => fetch('/api'));\n * ```\n */\nexport function createRateLimiter(options: RateLimitOptions): RateLimiter {\n  const { limit, interval, strategy = 'queue' } = options;\n\n  if (limit < 1) throw new RangeError('limit must be >= 1');\n  if (interval < 1) throw new RangeError('interval must be >= 1');\n\n  let tokens = limit;\n  let lastRefill = Date.now();\n  const queue: Array<{ resolve: () => void }> = [];\n  let drainTimer: ReturnType<typeof setTimeout> | null = null;\n\n  function refill(): void {\n    const now = Date.now();\n    const elapsed = now - lastRefill;\n    const refillCount = Math.floor(elapsed / interval) * limit;\n\n    if (refillCount > 0) {\n      tokens = Math.min(limit, tokens + refillCount);\n      lastRefill = now;\n    }\n  }\n\n  function drainQueue(): void {\n    refill();\n    while (queue.length > 0 && tokens > 0) {\n      tokens--;\n      const item = queue.shift()!;\n      item.resolve();\n    }\n\n    if (queue.length > 0) {\n      scheduleDrain();\n    } else {\n      drainTimer = null;\n    }\n  }\n\n  function scheduleDrain(): void {\n    if (drainTimer) return;\n    const timeToNextToken = interval / limit;\n    drainTimer = setTimeout(() => {\n      drainTimer = null;\n      drainQueue();\n    }, timeToNextToken);\n  }\n\n  async function execute<T>(fn: () => T | Promise<T>): Promise<T> {\n    refill();\n\n    if (tokens > 0) {\n      tokens--;\n      return await fn();\n    }\n\n    if (strategy === 'reject') {\n      throw new RateLimitError();\n    }\n\n    // Queue strategy — wait for a token\n    await new Promise<void>((resolve) => {\n      queue.push({ resolve });\n      scheduleDrain();\n    });\n\n    return await fn();\n  }\n\n  function reset(): void {\n    tokens = limit;\n    lastRefill = Date.now();\n    if (drainTimer) {\n      clearTimeout(drainTimer);\n      drainTimer = null;\n    }\n    drainQueue();\n  }\n\n  return {\n    execute,\n    reset,\n    get remaining() {\n      refill();\n      return tokens;\n    },\n  };\n}\n"]}

package/dist/rate-limit.mjs

@@ -0,0 +1,92 @@
+// src/types.ts
+var FlowXError = class extends Error {
+  constructor(message, code) {
+    super(message);
+    this.name = "FlowXError";
+    this.code = code;
+    Object.setPrototypeOf(this, new.target.prototype);
+  }
+};
+var RateLimitError = class extends FlowXError {
+  constructor(message = "Rate limit exceeded") {
+    super(message, "ERR_RATE_LIMIT");
+    this.name = "RateLimitError";
+  }
+};
+
+// src/rate-limit.ts
+function createRateLimiter(options) {
+  const { limit, interval, strategy = "queue" } = options;
+  if (limit < 1) throw new RangeError("limit must be >= 1");
+  if (interval < 1) throw new RangeError("interval must be >= 1");
+  let tokens = limit;
+  let lastRefill = Date.now();
+  const queue = [];
+  let drainTimer = null;
+  function refill() {
+    const now = Date.now();
+    const elapsed = now - lastRefill;
+    const refillCount = Math.floor(elapsed / interval) * limit;
+    if (refillCount > 0) {
+      tokens = Math.min(limit, tokens + refillCount);
+      lastRefill = now;
+    }
+  }
+  function drainQueue() {
+    refill();
+    while (queue.length > 0 && tokens > 0) {
+      tokens--;
+      const item = queue.shift();
+      item.resolve();
+    }
+    if (queue.length > 0) {
+      scheduleDrain();
+    } else {
+      drainTimer = null;
+    }
+  }
+  function scheduleDrain() {
+    if (drainTimer) return;
+    const timeToNextToken = interval / limit;
+    drainTimer = setTimeout(() => {
+      drainTimer = null;
+      drainQueue();
+    }, timeToNextToken);
+  }
+  async function execute(fn) {
+    refill();
+    if (tokens > 0) {
+      tokens--;
+      return await fn();
+    }
+    if (strategy === "reject") {
+      throw new RateLimitError();
+    }
+    await new Promise((resolve) => {
+      queue.push({ resolve });
+      scheduleDrain();
+    });
+    return await fn();
+  }
+  function reset() {
+    tokens = limit;
+    lastRefill = Date.now();
+    if (drainTimer) {
+      clearTimeout(drainTimer);
+      drainTimer = null;
+    }
+    drainQueue();
+  }
+  return {
+    execute,
+    reset,
+    get remaining() {
+      refill();
+      return tokens;
+    }
+  };
+}
+
+export { createRateLimiter };
+//# sourceMappingURL=rate-limit.mjs.map
+//# sourceMappingURL=rate-limit.mjs.map

package/dist/rate-limit.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/types.ts","../src/rate-limit.ts"],"names":[],"mappings":";AAmBO,IAAM,UAAA,GAAN,cAAyB,KAAA,CAAM;AAAA,EAEpC,WAAA,CAAY,SAAiB,IAAA,EAAc;AACzC,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,YAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,MAAA,CAAO,cAAA,CAAe,IAAA,EAAM,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA;AAAA,EAClD;AACF,CAAA;AAmCO,IAAM,cAAA,GAAN,cAA6B,UAAA,CAAW;AAAA,EAC7C,WAAA,CAAY,UAAU,qBAAA,EAAuB;AAC3C,IAAA,KAAA,CAAM,SAAS,gBAAgB,CAAA;AAC/B,IAAA,IAAA,CAAK,IAAA,GAAO,gBAAA;AAAA,EACd;AACF,CAAA;;;ACnCO,SAAS,kBAAkB,OAAA,EAAwC;AACxE,EAAA,MAAM,EAAE,KAAA,EAAO,QAAA,EAAU,QAAA,GAAW,SAAQ,GAAI,OAAA;AAEhD,EAAA,IAAI,KAAA,GAAQ,CAAA,EAAG,MAAM,IAAI,WAAW,oBAAoB,CAAA;AACxD,EAAA,IAAI,QAAA,GAAW,CAAA,EAAG,MAAM,IAAI,WAAW,uBAAuB,CAAA;AAE9D,EAAA,IAAI,MAAA,GAAS,KAAA;AACb,EAAA,IAAI,UAAA,GAAa,KAAK,GAAA,EAAI;AAC1B,EAAA,MAAM,QAAwC,EAAC;AAC/C,EAAA,IAAI,UAAA,GAAmD,IAAA;AAEvD,EAAA,SAAS,MAAA,GAAe;AACtB,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,UAAU,GAAA,GAAM,UAAA;AACtB,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,KAAA,CAAM,OAAA,GAAU,QAAQ,CAAA,GAAI,KAAA;AAErD,IAAA,IAAI,cAAc,CAAA,EAAG;AACnB,MAAA,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,MAAA,GAAS,WAAW,CAAA;AAC7C,MAAA,UAAA,GAAa,GAAA;AAAA,IACf;AAAA,EACF;AAEA,EAAA,SAAS,UAAA,GAAmB;AAC1B,IAAA,MAAA,EAAO;AACP,IAAA,OAAO,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,MAAA,GAAS,CAAA,EAAG;AACrC,MAAA,MAAA,EAAA;AACA,MAAA,MAAM,IAAA,GAAO,MAAM,KAAA,EAAM;AACzB,MAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,IACf;AAEA,IAAA,IAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACpB,MAAA,aAAA,EAAc;AAAA,IAChB,CAAA,MAAO;AACL,MAAA,UAAA,GAAa,IAAA;AAAA,IACf;AAAA,EACF;AAEA,EAAA,SAAS,aAAA,GAAsB;AAC7B,IAAA,IAAI,UAAA,EAAY;AAChB,IAAA,MAAM,kBAAkB,QAAA,GAAW,KAAA;AACnC,IAAA,UAAA,GAAa,WAAW,MAAM;AAC5B,MAAA,UAAA,GAAa,IAAA;AACb,MAAA,UAAA,EAAW;AAAA,IACb,GAAG,eAAe,CAAA;AAAA,EACpB;AAEA,EAAA,eAAe,QAAW,EAAA,EAAsC;AAC9D,IAAA,MAAA,EAAO;AAEP,IAAA,IAAI,SAAS,CAAA,EAAG;AACd,MAAA,MAAA,EAAA;AACA,MAAA,OAAO,MAAM,EAAA,EAAG;AAAA,IAClB;AAEA,IAAA,IAAI,aAAa,QAAA,EAAU;AACzB,MAAA,MAAM,IAAI,cAAA,EAAe;AAAA,IAC3B;AAGA,IAAA,MAAM,IAAI,OAAA,CAAc,CAAC,OAAA,KAAY;AACnC,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,OAAA,EAAS,CAAA;AACtB,MAAA,aAAA,EAAc;AAAA,IAChB,CAAC,CAAA;AAED,IAAA,OAAO,MAAM,EAAA,EAAG;AAAA,EAClB;AAEA,EAAA,SAAS,KAAA,GAAc;AACrB,IAAA,MAAA,GAAS,KAAA;AACT,IAAA,UAAA,GAAa,KAAK,GAAA,EAAI;AACtB,IAAA,IAAI,UAAA,EAAY;AACd,MAAA,YAAA,CAAa,UAAU,CAAA;AACvB,MAAA,UAAA,GAAa,IAAA;AAAA,IACf;AACA,IAAA,UAAA,EAAW;AAAA,EACb;AAEA,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,KAAA;AAAA,IACA,IAAI,SAAA,GAAY;AACd,MAAA,MAAA,EAAO;AACP,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACF","file":"rate-limit.mjs","sourcesContent":["// ============================================================================\n// FlowX — Types & Error Hierarchy\n// ============================================================================\n\n/** Generic async function signature */\nexport type AsyncFn<TArgs extends any[] = any[], TReturn = any> = (\n  ...args: TArgs\n) => Promise<TReturn>;\n\n/** Backoff strategy for retry/poll operations */\nexport type BackoffStrategy =\n  | 'fixed'\n  | 'linear'\n  | 'exponential'\n  | ((attempt: number, delay: number) => number);\n\n// ── Error Classes ───────────────────────────────────────────────────────────\n\n/** Base error class for all FlowX errors */\nexport class FlowXError extends Error {\n  public readonly code: string;\n  constructor(message: string, code: string) {\n    super(message);\n    this.name = 'FlowXError';\n    this.code = code;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n}\n\n/** Thrown when a promise exceeds its timeout */\nexport class TimeoutError extends FlowXError {\n  constructor(message = 'Operation timed out') {\n    super(message, 'ERR_TIMEOUT');\n    this.name = 'TimeoutError';\n  }\n}\n\n/** Thrown when a circuit breaker is open */\nexport class CircuitBreakerError extends FlowXError {\n  constructor(message = 'Circuit breaker is open') {\n    super(message, 'ERR_CIRCUIT_OPEN');\n    this.name = 'CircuitBreakerError';\n  }\n}\n\n/** Thrown when a bulkhead rejects due to capacity */\nexport class BulkheadError extends FlowXError {\n  constructor(message = 'Bulkhead capacity exceeded') {\n    super(message, 'ERR_BULKHEAD_FULL');\n    this.name = 'BulkheadError';\n  }\n}\n\n/** Thrown when an operation is aborted */\nexport class AbortError extends FlowXError {\n  constructor(message = 'Operation aborted') {\n    super(message, 'ERR_ABORTED');\n    this.name = 'AbortError';\n  }\n}\n\n/** Thrown when rate limit is exceeded */\nexport class RateLimitError extends FlowXError {\n  constructor(message = 'Rate limit exceeded') {\n    super(message, 'ERR_RATE_LIMIT');\n    this.name = 'RateLimitError';\n  }\n}\n\n// ── Utility Helpers ─────────────────────────────────────────────────────────\n\n/** Sleep for the specified duration, respecting AbortSignal */\nexport function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(new AbortError());\n      return;\n    }\n\n    let onAbort: (() => void) | undefined;\n\n    const timer = setTimeout(() => {\n      if (signal && onAbort) {\n        signal.removeEventListener('abort', onAbort);\n      }\n      resolve();\n    }, ms);\n\n    if (signal) {\n      onAbort = () => {\n        clearTimeout(timer);\n        reject(new AbortError());\n      };\n      signal.addEventListener('abort', onAbort, { once: true });\n    }\n  });\n}\n\n/** Calculate delay based on backoff strategy */\nexport function calculateDelay(\n  attempt: number,\n  baseDelay: number,\n  strategy: BackoffStrategy,\n  jitter: boolean | number = false,\n): number {\n  let delay: number;\n\n  if (typeof strategy === 'function') {\n    delay = strategy(attempt, baseDelay);\n  } else {\n    switch (strategy) {\n      case 'fixed':\n        delay = baseDelay;\n        break;\n      case 'linear':\n        delay = baseDelay * attempt;\n        break;\n      case 'exponential':\n        delay = baseDelay * Math.pow(2, attempt - 1);\n        break;\n    }\n  }\n\n  if (jitter) {\n    const factor = typeof jitter === 'number' ? jitter : 1;\n    delay = delay * (1 - factor * 0.5 + Math.random() * factor);\n  }\n\n  return Math.max(0, Math.floor(delay));\n}\n","// ============================================================================\n// FlowX — Token Bucket Rate Limiter\n// ============================================================================\nimport { RateLimitError } from './types';\n\nexport interface RateLimitOptions {\n  /** Maximum number of executions per interval */\n  limit: number;\n  /** Time window in ms */\n  interval: number;\n  /** Whether to reject or queue when limit is exceeded (default: 'queue') */\n  strategy?: 'queue' | 'reject';\n}\n\nexport interface RateLimiter {\n  /** Execute a function within the rate limit */\n  execute: <T>(fn: () => T | Promise<T>) => Promise<T>;\n  /** Reset the rate limiter state */\n  reset: () => void;\n  /** Number of remaining tokens in current window */\n  readonly remaining: number;\n}\n\n/**\n * Create a rate limiter using the token bucket algorithm.\n *\n * @example\n * ```ts\n * const limiter = createRateLimiter({ limit: 10, interval: 1000 });\n * await limiter.execute(() => fetch('/api'));\n * ```\n */\nexport function createRateLimiter(options: RateLimitOptions): RateLimiter {\n  const { limit, interval, strategy = 'queue' } = options;\n\n  if (limit < 1) throw new RangeError('limit must be >= 1');\n  if (interval < 1) throw new RangeError('interval must be >= 1');\n\n  let tokens = limit;\n  let lastRefill = Date.now();\n  const queue: Array<{ resolve: () => void }> = [];\n  let drainTimer: ReturnType<typeof setTimeout> | null = null;\n\n  function refill(): void {\n    const now = Date.now();\n    const elapsed = now - lastRefill;\n    const refillCount = Math.floor(elapsed / interval) * limit;\n\n    if (refillCount > 0) {\n      tokens = Math.min(limit, tokens + refillCount);\n      lastRefill = now;\n    }\n  }\n\n  function drainQueue(): void {\n    refill();\n    while (queue.length > 0 && tokens > 0) {\n      tokens--;\n      const item = queue.shift()!;\n      item.resolve();\n    }\n\n    if (queue.length > 0) {\n      scheduleDrain();\n    } else {\n      drainTimer = null;\n    }\n  }\n\n  function scheduleDrain(): void {\n    if (drainTimer) return;\n    const timeToNextToken = interval / limit;\n    drainTimer = setTimeout(() => {\n      drainTimer = null;\n      drainQueue();\n    }, timeToNextToken);\n  }\n\n  async function execute<T>(fn: () => T | Promise<T>): Promise<T> {\n    refill();\n\n    if (tokens > 0) {\n      tokens--;\n      return await fn();\n    }\n\n    if (strategy === 'reject') {\n      throw new RateLimitError();\n    }\n\n    // Queue strategy — wait for a token\n    await new Promise<void>((resolve) => {\n      queue.push({ resolve });\n      scheduleDrain();\n    });\n\n    return await fn();\n  }\n\n  function reset(): void {\n    tokens = limit;\n    lastRefill = Date.now();\n    if (drainTimer) {\n      clearTimeout(drainTimer);\n      drainTimer = null;\n    }\n    drainQueue();\n  }\n\n  return {\n    execute,\n    reset,\n    get remaining() {\n      refill();\n      return tokens;\n    },\n  };\n}\n"]}

package/dist/retry.d.mts

@@ -0,0 +1,45 @@
+import { B as BackoffStrategy } from './types-BsCO2J40.mjs';
+
+interface RetryOptions {
+    /** Maximum number of retry attempts (default: 3) */
+    retries?: number;
+    /** Base delay in ms between retries (default: 1000) */
+    delay?: number;
+    /** Backoff strategy (default: 'exponential') */
+    backoff?: BackoffStrategy;
+    /** Add randomized jitter to delays (default: false) */
+    jitter?: boolean | number;
+    /** Maximum delay cap in ms (default: 30000) */
+    maxDelay?: number;
+    /** Custom predicate to decide if retry should happen */
+    shouldRetry?: (error: Error, attempt: number) => boolean | Promise<boolean>;
+    /** Callback fired before each retry */
+    onRetry?: (error: Error, attempt: number) => void | Promise<void>;
+    /** AbortSignal for cancellation */
+    signal?: AbortSignal;
+}
+/**
+ * Execute an async function with automatic retry and configurable backoff.
+ *
+ * @example
+ * ```ts
+ * const data = await retry(() => fetch('/api/data'), {
+ *   retries: 5,
+ *   backoff: 'exponential',
+ *   jitter: true,
+ * });
+ * ```
+ */
+declare function retry<T>(fn: () => T | Promise<T>, options?: RetryOptions): Promise<T>;
+/**
+ * Wrap a function to automatically retry on failure.
+ *
+ * @example
+ * ```ts
+ * const safeFetch = retryable(fetch, { retries: 3 });
+ * const data = await safeFetch('/api/data');
+ * ```
+ */
+declare function retryable<TArgs extends any[], TReturn>(fn: (...args: TArgs) => Promise<TReturn>, options?: RetryOptions): (...args: TArgs) => Promise<TReturn>;
+
+export { type RetryOptions, retry, retryable };

package/dist/retry.d.ts

@@ -0,0 +1,45 @@
+import { B as BackoffStrategy } from './types-BsCO2J40.js';
+
+interface RetryOptions {
+    /** Maximum number of retry attempts (default: 3) */
+    retries?: number;
+    /** Base delay in ms between retries (default: 1000) */
+    delay?: number;
+    /** Backoff strategy (default: 'exponential') */
+    backoff?: BackoffStrategy;
+    /** Add randomized jitter to delays (default: false) */
+    jitter?: boolean | number;
+    /** Maximum delay cap in ms (default: 30000) */
+    maxDelay?: number;
+    /** Custom predicate to decide if retry should happen */
+    shouldRetry?: (error: Error, attempt: number) => boolean | Promise<boolean>;
+    /** Callback fired before each retry */
+    onRetry?: (error: Error, attempt: number) => void | Promise<void>;
+    /** AbortSignal for cancellation */
+    signal?: AbortSignal;
+}
+/**
+ * Execute an async function with automatic retry and configurable backoff.
+ *
+ * @example
+ * ```ts
+ * const data = await retry(() => fetch('/api/data'), {
+ *   retries: 5,
+ *   backoff: 'exponential',
+ *   jitter: true,
+ * });
+ * ```
+ */
+declare function retry<T>(fn: () => T | Promise<T>, options?: RetryOptions): Promise<T>;
+/**
+ * Wrap a function to automatically retry on failure.
+ *
+ * @example
+ * ```ts
+ * const safeFetch = retryable(fetch, { retries: 3 });
+ * const data = await safeFetch('/api/data');
+ * ```
+ */
+declare function retryable<TArgs extends any[], TReturn>(fn: (...args: TArgs) => Promise<TReturn>, options?: RetryOptions): (...args: TArgs) => Promise<TReturn>;
+
+export { type RetryOptions, retry, retryable };