@tanstack/pacer 0.1.0

package/dist/esm/async-queuer.js

@@ -0,0 +1,293 @@
+const defaultOptions = {
+  addItemsTo: "back",
+  concurrency: 1,
+  getItemsFrom: "front",
+  getPriority: (item) => item.priority ?? 0,
+  initialItems: [],
+  maxSize: Infinity,
+  onGetNextItem: () => {
+  },
+  onUpdate: () => {
+  },
+  started: false,
+  wait: 0
+};
+class AsyncQueuer {
+  constructor(initialOptions = defaultOptions) {
+    this.items = [];
+    this.activeItems = /* @__PURE__ */ new Set();
+    this.onSuccessCallbacks = [];
+    this.onErrorCallbacks = [];
+    this.onSettledCallbacks = [];
+    this.pendingTick = false;
+    this.executionCount = 0;
+    this.options = { ...defaultOptions, ...initialOptions };
+    this.running = this.options.started;
+    for (let i = 0; i < this.options.initialItems.length; i++) {
+      const item = this.options.initialItems[i];
+      const isLast = i === this.options.initialItems.length - 1;
+      this.addItem(item, this.options.addItemsTo, isLast);
+    }
+  }
+  /**
+   * Updates the queuer options
+   * Returns the new options state
+   */
+  setOptions(newOptions) {
+    this.options = { ...this.options, ...newOptions };
+    return this.options;
+  }
+  /**
+   * Processes items in the queuer
+   */
+  tick() {
+    if (!this.running) {
+      this.pendingTick = false;
+      return;
+    }
+    while (this.activeItems.size < this.options.concurrency && !this.isEmpty()) {
+      const nextFn = this.getNextItem();
+      if (!nextFn) {
+        break;
+      }
+      this.activeItems.add(nextFn);
+      (async () => {
+        let success = false;
+        let res;
+        let error;
+        try {
+          res = await nextFn();
+          success = true;
+        } catch (e) {
+          error = e;
+        } finally {
+          this.options.onUpdate(this);
+        }
+        this.activeItems.delete(nextFn);
+        if (success) {
+          this.onSuccessCallbacks.forEach((cb) => cb(res));
+        } else {
+          this.onErrorCallbacks.forEach((cb) => cb(error));
+        }
+        this.onSettledCallbacks.forEach((cb) => cb(success ? res : error));
+        if (this.options.wait > 0) {
+          setTimeout(() => this.tick(), this.options.wait);
+          return;
+        }
+        this.tick();
+      })();
+    }
+    this.pendingTick = false;
+  }
+  /**
+   * Adds a task to the queuer
+   */
+  addItem(fn, position = this.options.addItemsTo, runOnUpdate = true) {
+    if (this.isFull()) {
+      return Promise.reject(new Error("Queuer is full"));
+    }
+    return new Promise((resolve, reject) => {
+      const task = Object.assign(
+        async () => {
+          try {
+            const result = await fn();
+            resolve(result);
+            return result;
+          } catch (error) {
+            reject(error);
+            throw error;
+          }
+        },
+        { priority: fn.priority ?? void 0 }
+      );
+      const priority = this.options.getPriority !== defaultOptions.getPriority ? this.options.getPriority(task) : task.priority;
+      if (priority !== void 0) {
+        const insertIndex = this.items.findIndex((existing) => {
+          const existingPriority = this.options.getPriority !== defaultOptions.getPriority ? this.options.getPriority(existing) : existing.priority;
+          return existingPriority > priority;
+        });
+        if (insertIndex === -1) {
+          this.items.push(task);
+        } else {
+          this.items.splice(insertIndex, 0, task);
+        }
+      } else {
+        if (position === "front") {
+          this.items.unshift(task);
+        } else {
+          this.items.push(task);
+        }
+      }
+      if (runOnUpdate) {
+        this.options.onUpdate(this);
+      }
+      if (this.running && !this.pendingTick) {
+        this.pendingTick = true;
+        this.tick();
+      }
+    });
+  }
+  /**
+   * Removes and returns an item from the queuer
+   */
+  getNextItem(position = this.options.getItemsFrom) {
+    let item;
+    if (position === "front") {
+      item = this.items.shift();
+    } else {
+      item = this.items.pop();
+    }
+    if (item !== void 0) {
+      this.executionCount++;
+      this.options.onUpdate(this);
+      this.options.onGetNextItem(item, this);
+    }
+    return item;
+  }
+  /**
+   * Returns an item without removing it
+   */
+  peek(position = "front") {
+    if (position === "front") {
+      return this.items[0];
+    }
+    return this.items[this.items.length - 1];
+  }
+  /**
+   * Returns true if the queuer is empty
+   */
+  isEmpty() {
+    return this.items.length === 0;
+  }
+  /**
+   * Returns true if the queuer is full
+   */
+  isFull() {
+    return this.items.length >= this.options.maxSize;
+  }
+  /**
+   * Returns the current size of the queuer
+   */
+  size() {
+    return this.items.length;
+  }
+  /**
+   * Removes all items from the queuer
+   */
+  clear() {
+    this.items = [];
+    this.options.onUpdate(this);
+  }
+  /**
+   * Resets the queuer to its initial state
+   */
+  reset(withInitialItems) {
+    this.clear();
+    this.executionCount = 0;
+    if (withInitialItems) {
+      this.items = [...this.options.initialItems];
+    }
+    this.running = this.options.started;
+  }
+  /**
+   * Returns a copy of all items in the queuer
+   */
+  getAllItems() {
+    return [...this.items];
+  }
+  /**
+   * Returns the number of items that have been removed from the queuer
+   */
+  getExecutionCount() {
+    return this.executionCount;
+  }
+  /**
+   * Returns the active items
+   */
+  getActiveItems() {
+    return Array.from(this.activeItems);
+  }
+  /**
+   * Returns the pending items
+   */
+  getPendingItems() {
+    return this.getAllItems();
+  }
+  /**
+   * Adds a callback to be called when a task succeeds
+   */
+  onSuccess(cb) {
+    this.onSuccessCallbacks.push(cb);
+    return () => {
+      this.onSuccessCallbacks = this.onSuccessCallbacks.filter((d) => d !== cb);
+    };
+  }
+  /**
+   * Adds a callback to be called when a task errors
+   */
+  onError(cb) {
+    this.onErrorCallbacks.push(cb);
+    return () => {
+      this.onErrorCallbacks = this.onErrorCallbacks.filter((d) => d !== cb);
+    };
+  }
+  /**
+   * Adds a callback to be called when a task is settled
+   */
+  onSettled(cb) {
+    this.onSettledCallbacks.push(cb);
+    return () => {
+      this.onSettledCallbacks = this.onSettledCallbacks.filter((d) => d !== cb);
+    };
+  }
+  /**
+   * Starts the queuer and processes items
+   */
+  start() {
+    this.running = true;
+    if (!this.pendingTick && !this.isEmpty()) {
+      this.pendingTick = true;
+      this.tick();
+    }
+    this.options.onUpdate(this);
+    return new Promise((resolve) => {
+      const checkIdle = () => {
+        if (this.isIdle()) {
+          resolve();
+        } else {
+          setTimeout(checkIdle, 100);
+        }
+      };
+      checkIdle();
+    });
+  }
+  /**
+   * Stops the queuer from processing items
+   */
+  stop() {
+    this.running = false;
+    this.pendingTick = false;
+    this.options.onUpdate(this);
+  }
+  /**
+   * Returns true if the queuer is running
+   */
+  isRunning() {
+    return this.running;
+  }
+  /**
+   * Returns true if the queuer is running but has no items to process
+   */
+  isIdle() {
+    return this.running && this.isEmpty() && this.activeItems.size === 0;
+  }
+}
+function asyncQueue(options = {}) {
+  const queuer = new AsyncQueuer({ ...options, started: true });
+  return queuer.addItem.bind(queuer);
+}
+export {
+  AsyncQueuer,
+  asyncQueue
+};
+//# sourceMappingURL=async-queuer.js.map

package/dist/esm/async-queuer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"async-queuer.js","sources":["../../src/async-queuer.ts"],"sourcesContent":["import type { QueuePosition } from './queuer'\n\nexport interface AsyncQueuerOptions<TValue> {\n  /**\n   * Default position to add items to the queuer\n   * @default 'back'\n   */\n  addItemsTo?: QueuePosition\n  /**\n   * Maximum number of concurrent tasks to process\n   */\n  concurrency?: number\n  /**\n   * Default position to get items from during processing\n   * @default 'front'\n   */\n  getItemsFrom?: QueuePosition\n  /**\n   * Function to determine priority of items in the queuer\n   * Higher priority items will be processed first\n   * If not provided, will use static priority values attached to tasks\n   */\n  getPriority?: (item: () => Promise<TValue>) => number\n  /**\n   * Initial items to populate the queuer with\n   */\n  initialItems?: Array<(() => Promise<TValue>) & { priority?: number }>\n  /**\n   * Maximum number of items allowed in the queuer\n   */\n  maxSize?: number\n  /**\n   * Callback fired whenever an item is removed from the queuer\n   */\n  onGetNextItem?: (\n    item: () => Promise<TValue>,\n    queuer: AsyncQueuer<TValue>,\n  ) => void\n  /**\n   * Callback fired whenever an item is added or removed from the queuer\n   */\n  onUpdate?: (queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Whether the queuer should start processing tasks immediately\n   */\n  started?: boolean\n  /**\n   * Time in milliseconds to wait between processing items\n   */\n  wait?: number\n}\n\nconst defaultOptions: Required<AsyncQueuerOptions<any>> = {\n  addItemsTo: 'back',\n  concurrency: 1,\n  getItemsFrom: 'front',\n  getPriority: (item) => (item as any).priority ?? 0,\n  initialItems: [],\n  maxSize: Infinity,\n  onGetNextItem: () => {},\n  onUpdate: () => {},\n  started: false,\n  wait: 0,\n}\n\n/**\n * A flexible asynchronous queuer that processes tasks with configurable concurrency control.\n *\n * Features:\n * - Priority queuer support via getPriority option\n * - Configurable concurrency limit\n * - Task success/error/completion callbacks\n * - FIFO (First In First Out) or LIFO (Last In First Out) queuer behavior\n * - Pause/resume task processing\n * - Task cancellation\n *\n * Tasks are processed concurrently up to the configured concurrency limit. When a task completes,\n * the next pending task is processed if below the concurrency limit.\n *\n * @example\n * ```ts\n * const queuer = new AsyncQueuer<string>({ concurrency: 2 });\n *\n * queuer.addItem(async () => {\n *   return 'Hello';\n * });\n *\n * queuer.start();\n *\n * queuer.onSuccess((result) => {\n *   console.log(result); // 'Hello'\n * });\n * ```\n */\nexport class AsyncQueuer<TValue> {\n  protected options: Required<AsyncQueuerOptions<TValue>>\n  private items: Array<() => Promise<TValue>> = []\n  private activeItems: Set<() => Promise<TValue>> = new Set()\n  private onSuccessCallbacks: Array<(result: TValue) => void> = []\n  private onErrorCallbacks: Array<(error: Error) => void> = []\n  private onSettledCallbacks: Array<(result: TValue | Error) => void> = []\n  private running: boolean\n  private pendingTick = false\n  private executionCount = 0\n\n  constructor(initialOptions: AsyncQueuerOptions<TValue> = defaultOptions) {\n    this.options = { ...defaultOptions, ...initialOptions }\n    this.running = this.options.started\n\n    for (let i = 0; i < this.options.initialItems.length; i++) {\n      const item = this.options.initialItems[i]!\n      const isLast = i === this.options.initialItems.length - 1\n      this.addItem(item, this.options.addItemsTo, isLast)\n    }\n  }\n\n  /**\n   * Updates the queuer options\n   * Returns the new options state\n   */\n  setOptions(\n    newOptions: Partial<AsyncQueuerOptions<TValue>>,\n  ): AsyncQueuerOptions<TValue> {\n    this.options = { ...this.options, ...newOptions }\n    return this.options\n  }\n\n  /**\n   * Processes items in the queuer\n   */\n  protected tick() {\n    if (!this.running) {\n      this.pendingTick = false\n      return\n    }\n\n    while (\n      this.activeItems.size < this.options.concurrency &&\n      !this.isEmpty()\n    ) {\n      const nextFn = this.getNextItem()\n      if (!nextFn) {\n        break\n      }\n\n      this.activeItems.add(nextFn)\n      ;(async () => {\n        let success = false\n        let res!: TValue\n        let error: Error | undefined\n\n        try {\n          res = await nextFn()\n          success = true\n        } catch (e) {\n          error = e as Error\n        } finally {\n          this.options.onUpdate(this)\n        }\n\n        this.activeItems.delete(nextFn)\n        if (success) {\n          this.onSuccessCallbacks.forEach((cb) => cb(res))\n        } else {\n          this.onErrorCallbacks.forEach((cb) => cb(error!))\n        }\n        this.onSettledCallbacks.forEach((cb) => cb(success ? res : error!))\n\n        if (this.options.wait > 0) {\n          setTimeout(() => this.tick(), this.options.wait)\n          return\n        }\n\n        this.tick()\n      })()\n    }\n\n    this.pendingTick = false\n  }\n\n  /**\n   * Adds a task to the queuer\n   */\n  addItem(\n    fn: (() => Promise<TValue>) & { priority?: number },\n    position: QueuePosition = this.options.addItemsTo,\n    runOnUpdate: boolean = true,\n  ): Promise<TValue> {\n    if (this.isFull()) {\n      return Promise.reject(new Error('Queuer is full'))\n    }\n\n    return new Promise<TValue>((resolve, reject) => {\n      const task = Object.assign(\n        async () => {\n          try {\n            const result = await fn()\n            resolve(result)\n            return result\n          } catch (error) {\n            reject(error)\n            throw error\n          }\n        },\n        { priority: fn.priority ?? undefined },\n      )\n\n      // Get priority either from the function or from getPriority option\n      const priority =\n        this.options.getPriority !== defaultOptions.getPriority\n          ? this.options.getPriority(task)\n          : task.priority\n\n      if (priority !== undefined) {\n        // Insert based on priority\n        const insertIndex = this.items.findIndex((existing) => {\n          const existingPriority =\n            this.options.getPriority !== defaultOptions.getPriority\n              ? this.options.getPriority(existing)\n              : (existing as any).priority\n          return existingPriority > priority\n        })\n\n        if (insertIndex === -1) {\n          this.items.push(task)\n        } else {\n          this.items.splice(insertIndex, 0, task)\n        }\n      } else {\n        // Default FIFO/LIFO behavior\n        if (position === 'front') {\n          this.items.unshift(task)\n        } else {\n          this.items.push(task)\n        }\n      }\n\n      if (runOnUpdate) {\n        this.options.onUpdate(this)\n      }\n\n      if (this.running && !this.pendingTick) {\n        this.pendingTick = true\n        this.tick()\n      }\n    })\n  }\n\n  /**\n   * Removes and returns an item from the queuer\n   */\n  getNextItem(\n    position: QueuePosition = this.options.getItemsFrom,\n  ): (() => Promise<TValue>) | undefined {\n    let item: (() => Promise<TValue>) | undefined\n\n    if (position === 'front') {\n      item = this.items.shift()\n    } else {\n      item = this.items.pop()\n    }\n\n    if (item !== undefined) {\n      this.executionCount++\n      this.options.onUpdate(this)\n      this.options.onGetNextItem(item, this)\n    }\n    return item\n  }\n\n  /**\n   * Returns an item without removing it\n   */\n  peek(position: QueuePosition = 'front'): (() => Promise<TValue>) | undefined {\n    if (position === 'front') {\n      return this.items[0]\n    }\n    return this.items[this.items.length - 1]\n  }\n\n  /**\n   * Returns true if the queuer is empty\n   */\n  isEmpty(): boolean {\n    return this.items.length === 0\n  }\n\n  /**\n   * Returns true if the queuer is full\n   */\n  isFull(): boolean {\n    return this.items.length >= this.options.maxSize\n  }\n\n  /**\n   * Returns the current size of the queuer\n   */\n  size(): number {\n    return this.items.length\n  }\n\n  /**\n   * Removes all items from the queuer\n   */\n  clear(): void {\n    this.items = []\n    this.options.onUpdate(this)\n  }\n\n  /**\n   * Resets the queuer to its initial state\n   */\n  reset(withInitialItems?: boolean): void {\n    this.clear()\n    this.executionCount = 0\n    if (withInitialItems) {\n      this.items = [...this.options.initialItems]\n    }\n    this.running = this.options.started\n  }\n\n  /**\n   * Returns a copy of all items in the queuer\n   */\n  getAllItems(): Array<() => Promise<TValue>> {\n    return [...this.items]\n  }\n\n  /**\n   * Returns the number of items that have been removed from the queuer\n   */\n  getExecutionCount(): number {\n    return this.executionCount\n  }\n\n  /**\n   * Returns the active items\n   */\n  getActiveItems(): Array<() => Promise<TValue>> {\n    return Array.from(this.activeItems)\n  }\n\n  /**\n   * Returns the pending items\n   */\n  getPendingItems(): Array<() => Promise<TValue>> {\n    return this.getAllItems()\n  }\n\n  /**\n   * Adds a callback to be called when a task succeeds\n   */\n  onSuccess(cb: (result: TValue) => void) {\n    this.onSuccessCallbacks.push(cb)\n    return () => {\n      this.onSuccessCallbacks = this.onSuccessCallbacks.filter((d) => d !== cb)\n    }\n  }\n\n  /**\n   * Adds a callback to be called when a task errors\n   */\n  onError(cb: (error: Error) => void) {\n    this.onErrorCallbacks.push(cb)\n    return () => {\n      this.onErrorCallbacks = this.onErrorCallbacks.filter((d) => d !== cb)\n    }\n  }\n\n  /**\n   * Adds a callback to be called when a task is settled\n   */\n  onSettled(cb: (result: TValue | Error) => void) {\n    this.onSettledCallbacks.push(cb)\n    return () => {\n      this.onSettledCallbacks = this.onSettledCallbacks.filter((d) => d !== cb)\n    }\n  }\n\n  /**\n   * Starts the queuer and processes items\n   */\n  start(): Promise<void> {\n    this.running = true\n    if (!this.pendingTick && !this.isEmpty()) {\n      this.pendingTick = true\n      this.tick()\n    }\n    this.options.onUpdate(this)\n\n    return new Promise<void>((resolve) => {\n      const checkIdle = () => {\n        if (this.isIdle()) {\n          resolve()\n        } else {\n          setTimeout(checkIdle, 100)\n        }\n      }\n      checkIdle()\n    })\n  }\n\n  /**\n   * Stops the queuer from processing items\n   */\n  stop(): void {\n    this.running = false\n    this.pendingTick = false\n    this.options.onUpdate(this)\n  }\n\n  /**\n   * Returns true if the queuer is running\n   */\n  isRunning(): boolean {\n    return this.running\n  }\n\n  /**\n   * Returns true if the queuer is running but has no items to process\n   */\n  isIdle(): boolean {\n    return this.running && this.isEmpty() && this.activeItems.size === 0\n  }\n}\n\n/**\n * Creates a new AsyncQueuer instance with the given options and returns a bound addItem function.\n * The queuer is automatically started and ready to process items.\n *\n * @example\n * ```ts\n * const enqueue = asyncQueue<string>();\n *\n * // Add items to be processed\n * enqueue(async () => {\n *   return 'Hello';\n * });\n * ```\n *\n * @param options - Configuration options for the AsyncQueuer\n * @returns A bound addItem function that can be used to add tasks to the queuer\n */\nexport function asyncQueue<TValue>(options: AsyncQueuerOptions<TValue> = {}) {\n  const queuer = new AsyncQueuer<TValue>({ ...options, started: true })\n  return queuer.addItem.bind(queuer)\n}\n"],"names":[],"mappings":"AAoDA,MAAM,iBAAoD;AAAA,EACxD,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,cAAc;AAAA,EACd,aAAa,CAAC,SAAU,KAAa,YAAY;AAAA,EACjD,cAAc,CAAC;AAAA,EACf,SAAS;AAAA,EACT,eAAe,MAAM;AAAA,EAAC;AAAA,EACtB,UAAU,MAAM;AAAA,EAAC;AAAA,EACjB,SAAS;AAAA,EACT,MAAM;AACR;AA+BO,MAAM,YAAoB;AAAA,EAW/B,YAAY,iBAA6C,gBAAgB;AATzE,SAAQ,QAAsC,CAAC;AACvC,SAAA,kCAA8C,IAAI;AAC1D,SAAQ,qBAAsD,CAAC;AAC/D,SAAQ,mBAAkD,CAAC;AAC3D,SAAQ,qBAA8D,CAAC;AAEvE,SAAQ,cAAc;AACtB,SAAQ,iBAAiB;AAGvB,SAAK,UAAU,EAAE,GAAG,gBAAgB,GAAG,eAAe;AACjD,SAAA,UAAU,KAAK,QAAQ;AAE5B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,aAAa,QAAQ,KAAK;AACzD,YAAM,OAAO,KAAK,QAAQ,aAAa,CAAC;AACxC,YAAM,SAAS,MAAM,KAAK,QAAQ,aAAa,SAAS;AACxD,WAAK,QAAQ,MAAM,KAAK,QAAQ,YAAY,MAAM;AAAA,IAAA;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF,WACE,YAC4B;AAC5B,SAAK,UAAU,EAAE,GAAG,KAAK,SAAS,GAAG,WAAW;AAChD,WAAO,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMJ,OAAO;AACX,QAAA,CAAC,KAAK,SAAS;AACjB,WAAK,cAAc;AACnB;AAAA,IAAA;AAIA,WAAA,KAAK,YAAY,OAAO,KAAK,QAAQ,eACrC,CAAC,KAAK,WACN;AACM,YAAA,SAAS,KAAK,YAAY;AAChC,UAAI,CAAC,QAAQ;AACX;AAAA,MAAA;AAGG,WAAA,YAAY,IAAI,MAAM;AAC1B,OAAC,YAAY;AACZ,YAAI,UAAU;AACV,YAAA;AACA,YAAA;AAEA,YAAA;AACF,gBAAM,MAAM,OAAO;AACT,oBAAA;AAAA,iBACH,GAAG;AACF,kBAAA;AAAA,QAAA,UACR;AACK,eAAA,QAAQ,SAAS,IAAI;AAAA,QAAA;AAGvB,aAAA,YAAY,OAAO,MAAM;AAC9B,YAAI,SAAS;AACX,eAAK,mBAAmB,QAAQ,CAAC,OAAO,GAAG,GAAG,CAAC;AAAA,QAAA,OAC1C;AACL,eAAK,iBAAiB,QAAQ,CAAC,OAAO,GAAG,KAAM,CAAC;AAAA,QAAA;AAE7C,aAAA,mBAAmB,QAAQ,CAAC,OAAO,GAAG,UAAU,MAAM,KAAM,CAAC;AAE9D,YAAA,KAAK,QAAQ,OAAO,GAAG;AACzB,qBAAW,MAAM,KAAK,KAAQ,GAAA,KAAK,QAAQ,IAAI;AAC/C;AAAA,QAAA;AAGF,aAAK,KAAK;AAAA,MAAA,GACT;AAAA,IAAA;AAGL,SAAK,cAAc;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMrB,QACE,IACA,WAA0B,KAAK,QAAQ,YACvC,cAAuB,MACN;AACb,QAAA,KAAK,UAAU;AACjB,aAAO,QAAQ,OAAO,IAAI,MAAM,gBAAgB,CAAC;AAAA,IAAA;AAGnD,WAAO,IAAI,QAAgB,CAAC,SAAS,WAAW;AAC9C,YAAM,OAAO,OAAO;AAAA,QAClB,YAAY;AACN,cAAA;AACI,kBAAA,SAAS,MAAM,GAAG;AACxB,oBAAQ,MAAM;AACP,mBAAA;AAAA,mBACA,OAAO;AACd,mBAAO,KAAK;AACN,kBAAA;AAAA,UAAA;AAAA,QAEV;AAAA,QACA,EAAE,UAAU,GAAG,YAAY,OAAU;AAAA,MACvC;AAGM,YAAA,WACJ,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAY,IAAI,IAC7B,KAAK;AAEX,UAAI,aAAa,QAAW;AAE1B,cAAM,cAAc,KAAK,MAAM,UAAU,CAAC,aAAa;AAC/C,gBAAA,mBACJ,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAY,QAAQ,IAChC,SAAiB;AACxB,iBAAO,mBAAmB;AAAA,QAAA,CAC3B;AAED,YAAI,gBAAgB,IAAI;AACjB,eAAA,MAAM,KAAK,IAAI;AAAA,QAAA,OACf;AACL,eAAK,MAAM,OAAO,aAAa,GAAG,IAAI;AAAA,QAAA;AAAA,MACxC,OACK;AAEL,YAAI,aAAa,SAAS;AACnB,eAAA,MAAM,QAAQ,IAAI;AAAA,QAAA,OAClB;AACA,eAAA,MAAM,KAAK,IAAI;AAAA,QAAA;AAAA,MACtB;AAGF,UAAI,aAAa;AACV,aAAA,QAAQ,SAAS,IAAI;AAAA,MAAA;AAG5B,UAAI,KAAK,WAAW,CAAC,KAAK,aAAa;AACrC,aAAK,cAAc;AACnB,aAAK,KAAK;AAAA,MAAA;AAAA,IACZ,CACD;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMH,YACE,WAA0B,KAAK,QAAQ,cACF;AACjC,QAAA;AAEJ,QAAI,aAAa,SAAS;AACjB,aAAA,KAAK,MAAM,MAAM;AAAA,IAAA,OACnB;AACE,aAAA,KAAK,MAAM,IAAI;AAAA,IAAA;AAGxB,QAAI,SAAS,QAAW;AACjB,WAAA;AACA,WAAA,QAAQ,SAAS,IAAI;AACrB,WAAA,QAAQ,cAAc,MAAM,IAAI;AAAA,IAAA;AAEhC,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMT,KAAK,WAA0B,SAA8C;AAC3E,QAAI,aAAa,SAAS;AACjB,aAAA,KAAK,MAAM,CAAC;AAAA,IAAA;AAErB,WAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMzC,UAAmB;AACV,WAAA,KAAK,MAAM,WAAW;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM/B,SAAkB;AAChB,WAAO,KAAK,MAAM,UAAU,KAAK,QAAQ;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM3C,OAAe;AACb,WAAO,KAAK,MAAM;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMpB,QAAc;AACZ,SAAK,QAAQ,CAAC;AACT,SAAA,QAAQ,SAAS,IAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM5B,MAAM,kBAAkC;AACtC,SAAK,MAAM;AACX,SAAK,iBAAiB;AACtB,QAAI,kBAAkB;AACpB,WAAK,QAAQ,CAAC,GAAG,KAAK,QAAQ,YAAY;AAAA,IAAA;AAEvC,SAAA,UAAU,KAAK,QAAQ;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM9B,cAA4C;AACnC,WAAA,CAAC,GAAG,KAAK,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMvB,oBAA4B;AAC1B,WAAO,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMd,iBAA+C;AACtC,WAAA,MAAM,KAAK,KAAK,WAAW;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMpC,kBAAgD;AAC9C,WAAO,KAAK,YAAY;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM1B,UAAU,IAA8B;AACjC,SAAA,mBAAmB,KAAK,EAAE;AAC/B,WAAO,MAAM;AACX,WAAK,qBAAqB,KAAK,mBAAmB,OAAO,CAAC,MAAM,MAAM,EAAE;AAAA,IAC1E;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMF,QAAQ,IAA4B;AAC7B,SAAA,iBAAiB,KAAK,EAAE;AAC7B,WAAO,MAAM;AACX,WAAK,mBAAmB,KAAK,iBAAiB,OAAO,CAAC,MAAM,MAAM,EAAE;AAAA,IACtE;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMF,UAAU,IAAsC;AACzC,SAAA,mBAAmB,KAAK,EAAE;AAC/B,WAAO,MAAM;AACX,WAAK,qBAAqB,KAAK,mBAAmB,OAAO,CAAC,MAAM,MAAM,EAAE;AAAA,IAC1E;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMF,QAAuB;AACrB,SAAK,UAAU;AACf,QAAI,CAAC,KAAK,eAAe,CAAC,KAAK,WAAW;AACxC,WAAK,cAAc;AACnB,WAAK,KAAK;AAAA,IAAA;AAEP,SAAA,QAAQ,SAAS,IAAI;AAEnB,WAAA,IAAI,QAAc,CAAC,YAAY;AACpC,YAAM,YAAY,MAAM;AAClB,YAAA,KAAK,UAAU;AACT,kBAAA;AAAA,QAAA,OACH;AACL,qBAAW,WAAW,GAAG;AAAA,QAAA;AAAA,MAE7B;AACU,gBAAA;AAAA,IAAA,CACX;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMH,OAAa;AACX,SAAK,UAAU;AACf,SAAK,cAAc;AACd,SAAA,QAAQ,SAAS,IAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM5B,YAAqB;AACnB,WAAO,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMd,SAAkB;AAChB,WAAO,KAAK,WAAW,KAAK,QAAa,KAAA,KAAK,YAAY,SAAS;AAAA,EAAA;AAEvE;AAmBgB,SAAA,WAAmB,UAAsC,IAAI;AACrE,QAAA,SAAS,IAAI,YAAoB,EAAE,GAAG,SAAS,SAAS,MAAM;AAC7D,SAAA,OAAO,QAAQ,KAAK,MAAM;AACnC;"}

package/dist/esm/async-rate-limiter.d.ts

@@ -0,0 +1,132 @@
+import { RateLimitRejectionInfo } from './rate-limiter.js';
+/**
+ * Options for configuring an async rate-limited function
+ */
+export interface AsyncRateLimiterOptions {
+    /**
+     * Whether the rate limiter is enabled. When disabled, maybeExecute will not trigger any executions.
+     * Defaults to true.
+     */
+    enabled?: boolean;
+    /**
+     * Maximum number of executions allowed within the time window
+     */
+    limit: number;
+    /**
+     * Time window in milliseconds within which the limit applies
+     */
+    window: number;
+    /**
+     * Optional callback function that is called when an execution is rejected due to rate limiting
+     */
+    onReject?: (info: RateLimitRejectionInfo) => void;
+    /**
+     * Optional error handler for when the rate-limited function throws
+     */
+    onError?: (error: unknown) => void;
+}
+/**
+ * A class that creates an async rate-limited function.
+ *
+ * Rate limiting is a simple approach that allows a function to execute up to a limit within a time window,
+ * then blocks all subsequent calls until the window passes. This can lead to "bursty" behavior where
+ * all executions happen immediately, followed by a complete block.
+ *
+ * For smoother execution patterns, consider using:
+ * - Throttling: Ensures consistent spacing between executions (e.g. max once per 200ms)
+ * - Debouncing: Waits for a pause in calls before executing (e.g. after 500ms of no calls)
+ *
+ * Rate limiting is best used for hard API limits or resource constraints. For UI updates or
+ * smoothing out frequent events, throttling or debouncing usually provide better user experience.
+ *
+ * @example
+ * ```ts
+ * const rateLimiter = new AsyncRateLimiter(
+ *   async (id: string) => await api.getData(id),
+ *   { limit: 5, window: 1000 } // 5 calls per second
+ * );
+ *
+ * // Will execute immediately until limit reached, then block
+ * await rateLimiter.maybeExecute('123');
+ * ```
+ */
+export declare class AsyncRateLimiter<TFn extends (...args: Array<any>) => Promise<any>, TArgs extends Parameters<TFn>> {
+    private fn;
+    private executionCount;
+    private rejectionCount;
+    private executionTimes;
+    private options;
+    constructor(fn: TFn, initialOptions: AsyncRateLimiterOptions);
+    /**
+     * Updates the rate limiter options
+     * Returns the new options state
+     */
+    setOptions(newOptions: Partial<AsyncRateLimiterOptions>): AsyncRateLimiterOptions;
+    /**
+     * Returns the number of times the function has been executed
+     */
+    getExecutionCount(): number;
+    /**
+     * Returns the number of times the function has been rejected
+     */
+    getRejectionCount(): number;
+    /**
+     * Returns the number of remaining executions allowed in the current window
+     */
+    getRemainingInWindow(): number;
+    /**
+     * Attempts to execute the rate-limited function if within the configured limits.
+     * Will reject execution if the number of calls in the current window exceeds the limit.
+     * If execution is allowed, waits for any previous execution to complete before proceeding.
+     *
+     * @example
+     * ```ts
+     * const rateLimiter = new AsyncRateLimiter(fn, { limit: 5, window: 1000 });
+     *
+     * // First 5 calls will execute
+     * await rateLimiter.maybeExecute('arg1', 'arg2');
+     *
+     * // Additional calls within the window will be rejected
+     * await rateLimiter.maybeExecute('arg1', 'arg2'); // Rejected
+     * ```
+     */
+    maybeExecute(...args: TArgs): Promise<boolean>;
+    private executeFunction;
+    private rejectFunction;
+    private cleanupOldExecutions;
+    /**
+     * Resets the rate limiter state
+     */
+    reset(): void;
+}
+/**
+ * Creates an async rate-limited function that will execute the provided function up to a maximum number of times within a time window.
+ *
+ * Note that rate limiting is a simpler form of execution control compared to throttling or debouncing:
+ * - A rate limiter will allow all executions until the limit is reached, then block all subsequent calls until the window resets
+ * - A throttler ensures even spacing between executions, which can be better for consistent performance
+ * - A debouncer collapses multiple calls into one, which is better for handling bursts of events
+ *
+ * Consider using throttle() or debounce() if you need more intelligent execution control. Use rate limiting when you specifically
+ * need to enforce a hard limit on the number of executions within a time period.
+ *
+ * @example
+ * ```ts
+ * // Rate limit to 5 calls per minute
+ * const rateLimited = asyncRateLimit(makeApiCall, {
+ *   limit: 5,
+ *   window: 60000,
+ *   onReject: ({ msUntilNextWindow }) => {
+ *     console.log(`Rate limit exceeded. Try again in ${msUntilNextWindow}ms`);
+ *   }
+ * });
+ *
+ * // First 5 calls will execute immediately
+ * // Additional calls will be rejected until the minute window resets
+ * await rateLimited();
+ *
+ * // For more even execution, consider using throttle instead:
+ * const throttled = throttle(makeApiCall, { wait: 12000 }); // One call every 12 seconds
+ * ```
+ */
+export declare function asyncRateLimit<TFn extends (...args: Array<any>) => Promise<any>>(fn: TFn, initialOptions: Omit<AsyncRateLimiterOptions, 'enabled'>): (...args: Parameters<TFn>) => Promise<boolean>;

package/dist/esm/async-rate-limiter.js

@@ -0,0 +1,122 @@
+class AsyncRateLimiter {
+  constructor(fn, initialOptions) {
+    this.fn = fn;
+    this.executionCount = 0;
+    this.rejectionCount = 0;
+    this.executionTimes = [];
+    this.options = {
+      enabled: true,
+      ...initialOptions
+    };
+  }
+  /**
+   * Updates the rate limiter options
+   * Returns the new options state
+   */
+  setOptions(newOptions) {
+    this.options = {
+      ...this.options,
+      ...newOptions
+    };
+    return this.options;
+  }
+  /**
+   * Returns the number of times the function has been executed
+   */
+  getExecutionCount() {
+    return this.executionCount;
+  }
+  /**
+   * Returns the number of times the function has been rejected
+   */
+  getRejectionCount() {
+    return this.rejectionCount;
+  }
+  /**
+   * Returns the number of remaining executions allowed in the current window
+   */
+  getRemainingInWindow() {
+    this.cleanupOldExecutions();
+    return Math.max(0, this.options.limit - this.executionTimes.length);
+  }
+  /**
+   * Attempts to execute the rate-limited function if within the configured limits.
+   * Will reject execution if the number of calls in the current window exceeds the limit.
+   * If execution is allowed, waits for any previous execution to complete before proceeding.
+   *
+   * @example
+   * ```ts
+   * const rateLimiter = new AsyncRateLimiter(fn, { limit: 5, window: 1000 });
+   *
+   * // First 5 calls will execute
+   * await rateLimiter.maybeExecute('arg1', 'arg2');
+   *
+   * // Additional calls within the window will be rejected
+   * await rateLimiter.maybeExecute('arg1', 'arg2'); // Rejected
+   * ```
+   */
+  async maybeExecute(...args) {
+    this.cleanupOldExecutions();
+    if (this.executionTimes.length < this.options.limit) {
+      await this.executeFunction(...args);
+      return true;
+    }
+    this.rejectFunction();
+    return false;
+  }
+  async executeFunction(...args) {
+    if (!this.options.enabled) return;
+    const now = Date.now();
+    this.executionCount++;
+    this.executionTimes.push(now);
+    try {
+      await this.fn(...args);
+    } catch (error) {
+      if (this.options.onError) {
+        try {
+          this.options.onError(error);
+        } catch {
+        }
+      }
+      throw error;
+    } finally {
+    }
+  }
+  rejectFunction() {
+    this.rejectionCount++;
+    if (this.options.onReject) {
+      const oldestExecution = Math.min(...this.executionTimes);
+      const msUntilNextWindow = oldestExecution + this.options.window - Date.now();
+      this.options.onReject({
+        msUntilNextWindow,
+        currentExecutions: this.executionTimes.length,
+        limit: this.options.limit,
+        rejectionCount: this.rejectionCount
+      });
+    }
+  }
+  cleanupOldExecutions() {
+    const now = Date.now();
+    const windowStart = now - this.options.window;
+    this.executionTimes = this.executionTimes.filter(
+      (time) => time > windowStart
+    );
+  }
+  /**
+   * Resets the rate limiter state
+   */
+  reset() {
+    this.executionTimes = [];
+    this.executionCount = 0;
+    this.rejectionCount = 0;
+  }
+}
+function asyncRateLimit(fn, initialOptions) {
+  const rateLimiter = new AsyncRateLimiter(fn, initialOptions);
+  return rateLimiter.maybeExecute.bind(rateLimiter);
+}
+export {
+  AsyncRateLimiter,
+  asyncRateLimit
+};
+//# sourceMappingURL=async-rate-limiter.js.map

package/dist/esm/async-rate-limiter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"async-rate-limiter.js","sources":["../../src/async-rate-limiter.ts"],"sourcesContent":["import type { RateLimitRejectionInfo } from './rate-limiter'\n\n/**\n * Options for configuring an async rate-limited function\n */\nexport interface AsyncRateLimiterOptions {\n  /**\n   * Whether the rate limiter is enabled. When disabled, maybeExecute will not trigger any executions.\n   * Defaults to true.\n   */\n  enabled?: boolean\n  /**\n   * Maximum number of executions allowed within the time window\n   */\n  limit: number\n  /**\n   * Time window in milliseconds within which the limit applies\n   */\n  window: number\n  /**\n   * Optional callback function that is called when an execution is rejected due to rate limiting\n   */\n  onReject?: (info: RateLimitRejectionInfo) => void\n  /**\n   * Optional error handler for when the rate-limited function throws\n   */\n  onError?: (error: unknown) => void\n}\n\n/**\n * A class that creates an async rate-limited function.\n *\n * Rate limiting is a simple approach that allows a function to execute up to a limit within a time window,\n * then blocks all subsequent calls until the window passes. This can lead to \"bursty\" behavior where\n * all executions happen immediately, followed by a complete block.\n *\n * For smoother execution patterns, consider using:\n * - Throttling: Ensures consistent spacing between executions (e.g. max once per 200ms)\n * - Debouncing: Waits for a pause in calls before executing (e.g. after 500ms of no calls)\n *\n * Rate limiting is best used for hard API limits or resource constraints. For UI updates or\n * smoothing out frequent events, throttling or debouncing usually provide better user experience.\n *\n * @example\n * ```ts\n * const rateLimiter = new AsyncRateLimiter(\n *   async (id: string) => await api.getData(id),\n *   { limit: 5, window: 1000 } // 5 calls per second\n * );\n *\n * // Will execute immediately until limit reached, then block\n * await rateLimiter.maybeExecute('123');\n * ```\n */\nexport class AsyncRateLimiter<\n  TFn extends (...args: Array<any>) => Promise<any>,\n  TArgs extends Parameters<TFn>,\n> {\n  private executionCount = 0\n  private rejectionCount = 0\n  private executionTimes: Array<number> = []\n  private options: AsyncRateLimiterOptions\n\n  constructor(\n    private fn: TFn,\n    initialOptions: AsyncRateLimiterOptions,\n  ) {\n    this.options = {\n      enabled: true,\n      ...initialOptions,\n    }\n  }\n\n  /**\n   * Updates the rate limiter options\n   * Returns the new options state\n   */\n  setOptions(\n    newOptions: Partial<AsyncRateLimiterOptions>,\n  ): AsyncRateLimiterOptions {\n    this.options = {\n      ...this.options,\n      ...newOptions,\n    }\n    return this.options\n  }\n\n  /**\n   * Returns the number of times the function has been executed\n   */\n  getExecutionCount(): number {\n    return this.executionCount\n  }\n\n  /**\n   * Returns the number of times the function has been rejected\n   */\n  getRejectionCount(): number {\n    return this.rejectionCount\n  }\n\n  /**\n   * Returns the number of remaining executions allowed in the current window\n   */\n  getRemainingInWindow(): number {\n    this.cleanupOldExecutions()\n    return Math.max(0, this.options.limit - this.executionTimes.length)\n  }\n\n  /**\n   * Attempts to execute the rate-limited function if within the configured limits.\n   * Will reject execution if the number of calls in the current window exceeds the limit.\n   * If execution is allowed, waits for any previous execution to complete before proceeding.\n   *\n   * @example\n   * ```ts\n   * const rateLimiter = new AsyncRateLimiter(fn, { limit: 5, window: 1000 });\n   *\n   * // First 5 calls will execute\n   * await rateLimiter.maybeExecute('arg1', 'arg2');\n   *\n   * // Additional calls within the window will be rejected\n   * await rateLimiter.maybeExecute('arg1', 'arg2'); // Rejected\n   * ```\n   */\n  async maybeExecute(...args: TArgs): Promise<boolean> {\n    this.cleanupOldExecutions()\n\n    if (this.executionTimes.length < this.options.limit) {\n      await this.executeFunction(...args)\n      return true\n    }\n\n    this.rejectFunction()\n    return false\n  }\n\n  private async executeFunction(...args: TArgs): Promise<void> {\n    if (!this.options.enabled) return\n    const now = Date.now()\n    this.executionCount++\n    this.executionTimes.push(now)\n\n    try {\n      await this.fn(...args)\n    } catch (error) {\n      if (this.options.onError) {\n        try {\n          this.options.onError(error)\n        } catch {\n          // Ignore errors from error handler\n        }\n      }\n      throw error\n    } finally {\n    }\n  }\n\n  private rejectFunction(): void {\n    this.rejectionCount++\n    if (this.options.onReject) {\n      const oldestExecution = Math.min(...this.executionTimes)\n      const msUntilNextWindow =\n        oldestExecution + this.options.window - Date.now()\n\n      this.options.onReject({\n        msUntilNextWindow,\n        currentExecutions: this.executionTimes.length,\n        limit: this.options.limit,\n        rejectionCount: this.rejectionCount,\n      })\n    }\n  }\n\n  private cleanupOldExecutions(): void {\n    const now = Date.now()\n    const windowStart = now - this.options.window\n    this.executionTimes = this.executionTimes.filter(\n      (time) => time > windowStart,\n    )\n  }\n\n  /**\n   * Resets the rate limiter state\n   */\n  reset(): void {\n    this.executionTimes = []\n    this.executionCount = 0\n    this.rejectionCount = 0\n  }\n}\n\n/**\n * Creates an async rate-limited function that will execute the provided function up to a maximum number of times within a time window.\n *\n * Note that rate limiting is a simpler form of execution control compared to throttling or debouncing:\n * - A rate limiter will allow all executions until the limit is reached, then block all subsequent calls until the window resets\n * - A throttler ensures even spacing between executions, which can be better for consistent performance\n * - A debouncer collapses multiple calls into one, which is better for handling bursts of events\n *\n * Consider using throttle() or debounce() if you need more intelligent execution control. Use rate limiting when you specifically\n * need to enforce a hard limit on the number of executions within a time period.\n *\n * @example\n * ```ts\n * // Rate limit to 5 calls per minute\n * const rateLimited = asyncRateLimit(makeApiCall, {\n *   limit: 5,\n *   window: 60000,\n *   onReject: ({ msUntilNextWindow }) => {\n *     console.log(`Rate limit exceeded. Try again in ${msUntilNextWindow}ms`);\n *   }\n * });\n *\n * // First 5 calls will execute immediately\n * // Additional calls will be rejected until the minute window resets\n * await rateLimited();\n *\n * // For more even execution, consider using throttle instead:\n * const throttled = throttle(makeApiCall, { wait: 12000 }); // One call every 12 seconds\n * ```\n */\nexport function asyncRateLimit<\n  TFn extends (...args: Array<any>) => Promise<any>,\n>(fn: TFn, initialOptions: Omit<AsyncRateLimiterOptions, 'enabled'>) {\n  const rateLimiter = new AsyncRateLimiter(fn, initialOptions)\n  return rateLimiter.maybeExecute.bind(rateLimiter)\n}\n"],"names":[],"mappings":"AAsDO,MAAM,iBAGX;AAAA,EAMA,YACU,IACR,gBACA;AAFQ,SAAA,KAAA;AANV,SAAQ,iBAAiB;AACzB,SAAQ,iBAAiB;AACzB,SAAQ,iBAAgC,CAAC;AAOvC,SAAK,UAAU;AAAA,MACb,SAAS;AAAA,MACT,GAAG;AAAA,IACL;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF,WACE,YACyB;AACzB,SAAK,UAAU;AAAA,MACb,GAAG,KAAK;AAAA,MACR,GAAG;AAAA,IACL;AACA,WAAO,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMd,oBAA4B;AAC1B,WAAO,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMd,oBAA4B;AAC1B,WAAO,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMd,uBAA+B;AAC7B,SAAK,qBAAqB;AACnB,WAAA,KAAK,IAAI,GAAG,KAAK,QAAQ,QAAQ,KAAK,eAAe,MAAM;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBpE,MAAM,gBAAgB,MAA+B;AACnD,SAAK,qBAAqB;AAE1B,QAAI,KAAK,eAAe,SAAS,KAAK,QAAQ,OAAO;AAC7C,YAAA,KAAK,gBAAgB,GAAG,IAAI;AAC3B,aAAA;AAAA,IAAA;AAGT,SAAK,eAAe;AACb,WAAA;AAAA,EAAA;AAAA,EAGT,MAAc,mBAAmB,MAA4B;AACvD,QAAA,CAAC,KAAK,QAAQ,QAAS;AACrB,UAAA,MAAM,KAAK,IAAI;AAChB,SAAA;AACA,SAAA,eAAe,KAAK,GAAG;AAExB,QAAA;AACI,YAAA,KAAK,GAAG,GAAG,IAAI;AAAA,aACd,OAAO;AACV,UAAA,KAAK,QAAQ,SAAS;AACpB,YAAA;AACG,eAAA,QAAQ,QAAQ,KAAK;AAAA,QAAA,QACpB;AAAA,QAAA;AAAA,MAER;AAEI,YAAA;AAAA,IAAA,UACN;AAAA,IAAA;AAAA,EACF;AAAA,EAGM,iBAAuB;AACxB,SAAA;AACD,QAAA,KAAK,QAAQ,UAAU;AACzB,YAAM,kBAAkB,KAAK,IAAI,GAAG,KAAK,cAAc;AACvD,YAAM,oBACJ,kBAAkB,KAAK,QAAQ,SAAS,KAAK,IAAI;AAEnD,WAAK,QAAQ,SAAS;AAAA,QACpB;AAAA,QACA,mBAAmB,KAAK,eAAe;AAAA,QACvC,OAAO,KAAK,QAAQ;AAAA,QACpB,gBAAgB,KAAK;AAAA,MAAA,CACtB;AAAA,IAAA;AAAA,EACH;AAAA,EAGM,uBAA6B;AAC7B,UAAA,MAAM,KAAK,IAAI;AACf,UAAA,cAAc,MAAM,KAAK,QAAQ;AAClC,SAAA,iBAAiB,KAAK,eAAe;AAAA,MACxC,CAAC,SAAS,OAAO;AAAA,IACnB;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMF,QAAc;AACZ,SAAK,iBAAiB,CAAC;AACvB,SAAK,iBAAiB;AACtB,SAAK,iBAAiB;AAAA,EAAA;AAE1B;AAgCgB,SAAA,eAEd,IAAS,gBAA0D;AACnE,QAAM,cAAc,IAAI,iBAAiB,IAAI,cAAc;AACpD,SAAA,YAAY,aAAa,KAAK,WAAW;AAClD;"}