@tanstack/pacer 0.16.3 → 0.16.4

package/dist/cjs/queuer.d.cts

@@ -1,340 +0,0 @@
-import { Store } from '@tanstack/store';
-export interface QueuerState<TValue> {
-    /**
-     * Number of times addItem has been called (for reduction calculations)
-     */
-    addItemCount: number;
-    /**
-     * Number of items that have been processed by the queuer
-     */
-    executionCount: number;
-    /**
-     * Number of items that have been removed from the queue due to expiration
-     */
-    expirationCount: number;
-    /**
-     * Whether the queuer has no items to process (items array is empty)
-     */
-    isEmpty: boolean;
-    /**
-     * Whether the queuer has reached its maximum capacity
-     */
-    isFull: boolean;
-    /**
-     * Whether the queuer is not currently processing any items
-     */
-    isIdle: boolean;
-    /**
-     * Whether the queuer is active and will process items automatically
-     */
-    isRunning: boolean;
-    /**
-     * Array of items currently waiting to be processed
-     */
-    items: Array<TValue>;
-    /**
-     * Timestamps when items were added to the queue for expiration tracking
-     */
-    itemTimestamps: Array<number>;
-    /**
-     * Whether the queuer has a pending timeout for processing the next item
-     */
-    pendingTick: boolean;
-    /**
-     * Number of items that have been rejected from being added to the queue
-     */
-    rejectionCount: number;
-    /**
-     * Number of items currently in the queue
-     */
-    size: number;
-    /**
-     * Current processing status - 'idle' when not processing, 'running' when active, 'stopped' when paused
-     */
-    status: 'idle' | 'running' | 'stopped';
-}
-/**
- * Options for configuring a Queuer instance.
- *
- * These options control queue behavior, item expiration, callbacks, and more.
- */
-export interface QueuerOptions<TValue> {
-    /**
-     * Default position to add items to the queuer
-     * @default 'back'
-     */
-    addItemsTo?: QueuePosition;
-    /**
-     * Maximum time in milliseconds that an item can stay in the queue
-     * If not provided, items will never expire
-     */
-    expirationDuration?: number;
-    /**
-     * Function to determine if an item has expired
-     * If provided, this overrides the expirationDuration behavior
-     */
-    getIsExpired?: (item: TValue, addedAt: number) => boolean;
-    /**
-     * Default position to get items from during processing
-     * @default 'front'
-     */
-    getItemsFrom?: QueuePosition;
-    /**
-     * Function to determine priority of items in the queuer
-     * Higher priority items will be processed first
-     */
-    getPriority?: (item: TValue) => number;
-    /**
-     * Initial items to populate the queuer with
-     */
-    initialItems?: Array<TValue>;
-    /**
-     * Initial state for the queuer
-     */
-    initialState?: Partial<QueuerState<TValue>>;
-    /**
-     * Optional key to identify this queuer instance.
-     * If provided, the queuer will be identified by this key in the devtools and PacerProvider if applicable.
-     */
-    key?: string;
-    /**
-     * Maximum number of items allowed in the queuer
-     */
-    maxSize?: number;
-    /**
-     * Callback fired whenever an item is removed from the queuer
-     */
-    onExecute?: (item: TValue, queuer: Queuer<TValue>) => void;
-    /**
-     * Callback fired whenever an item expires in the queuer
-     */
-    onExpire?: (item: TValue, queuer: Queuer<TValue>) => void;
-    /**
-     * Callback fired whenever an item is added or removed from the queuer
-     */
-    onItemsChange?: (queuer: Queuer<TValue>) => void;
-    /**
-     * Callback fired whenever an item is rejected from being added to the queuer
-     */
-    onReject?: (item: TValue, queuer: Queuer<TValue>) => void;
-    /**
-     * Whether the queuer should start processing tasks immediately
-     */
-    started?: boolean;
-    /**
-     * Time in milliseconds to wait between processing items.
-     * Can be a number or a function that returns a number.
-     * @default 0
-     */
-    wait?: number | ((queuer: Queuer<TValue>) => number);
-}
-/**
- * Utility function for sharing common `QueuerOptions` options between different `Queuer` instances.
- */
-export declare function queuerOptions<TValue = any, TOptions extends Partial<QueuerOptions<TValue>> = Partial<QueuerOptions<TValue>>>(options: TOptions): TOptions;
-/**
- * Position type for addItem and getNextItem operations.
- *
- * - 'front': Operate on the front of the queue (FIFO)
- * - 'back': Operate on the back of the queue (LIFO)
- */
-export type QueuePosition = 'front' | 'back';
-/**
- * A flexible queue that processes items with configurable wait times, expiration, and priority.
- *
- * This synchronous version is lighter weight and often all you need - upgrade to AsyncQueuer when you need promises, retry support, abort capabilities, concurrent execution, or advanced error handling.
- *
- * Features:
- * - Automatic or manual processing of items
- * - FIFO (First In First Out), LIFO (Last In First Out), or double-ended queue behavior
- * - Priority-based ordering when getPriority is provided
- * - Item expiration and removal of stale items
- * - Callbacks for queue state changes, execution, rejection, and expiration
- *
- * Running behavior:
- * - `start()`: Begins automatically processing items in the queue (defaults to isRunning)
- * - `stop()`: Pauses processing but maintains queue state
- * - `wait`: Configurable delay between processing items
- * - `onItemsChange`/`onExecute`: Callbacks for monitoring queue state
- *
- * Manual processing is also supported when automatic processing is disabled:
- * - `execute()`: Processes the next item using the provided function
- * - `getNextItem()`: Removes and returns the next item without processing
- *
- * Queue behavior defaults to FIFO:
- * - `addItem(item)`: Adds to the back of the queue
- * - Items processed from the front of the queue
- *
- * Priority queue:
- * - Provide a `getPriority` function; higher values are processed first
- *
- * Stack (LIFO):
- * - `addItem(item, 'back')`: Adds to the back
- * - `getNextItem('back')`: Removes from the back
- *
- * Double-ended queue:
- * - `addItem(item, position)`: Adds to specified position ('front'/'back')
- * - `getNextItem(position)`: Removes from specified position
- *
- * Item expiration:
- * - `expirationDuration`: Maximum time items can stay in the queue
- * - `getIsExpired`: Function to override default expiration
- * - `onExpire`: Callback for expired items
- *
- * State Management:
- * - Uses TanStack Store for reactive state management
- * - Use `initialState` to provide initial state values when creating the queuer
- * - Use `onExecute` callback to react to item execution and implement custom logic
- * - Use `onItemsChange` callback to react to items being added or removed from the queue
- * - Use `onExpire` callback to react to items expiring and implement custom logic
- * - Use `onReject` callback to react to items being rejected when the queue is full
- * - The state includes execution count, expiration count, rejection count, and isRunning status
- * - State can be accessed via `queuer.store.state` when using the class directly
- * - When using framework adapters (React/Solid), state is accessed from `queuer.state`
- *
- * Example usage:
- * ```ts
- * // Auto-processing queue with wait time
- * const autoQueue = new Queuer<number>((n) => console.log(n), {
- *   started: true, // Begin processing immediately
- *   wait: 1000, // Wait 1s between items
- *   onExecute: (item, queuer) => console.log(`Processed ${item}`)
- * });
- * autoQueue.addItem(1); // Will process after 1s
- * autoQueue.addItem(2); // Will process 1s after first item
- *
- * // Manual processing queue
- * const manualQueue = new Queuer<number>((n) => console.log(n), {
- *   started: false
- * });
- * manualQueue.addItem(1); // [1]
- * manualQueue.addItem(2); // [1, 2]
- * manualQueue.execute(); // logs 1, queue is [2]
- * manualQueue.getNextItem(); // returns 2, queue is empty
- * ```
- */
-export declare class Queuer<TValue> {
-    #private;
-    fn: (item: TValue) => void;
-    readonly store: Store<Readonly<QueuerState<TValue>>>;
-    key: string | undefined;
-    options: QueuerOptions<TValue>;
-    constructor(fn: (item: TValue) => void, initialOptions?: QueuerOptions<TValue>);
-    /**
-     * Updates the queuer options. New options are merged with existing options.
-     */
-    setOptions: (newOptions: Partial<QueuerOptions<TValue>>) => void;
-    /**
-     * Adds an item to the queue. If the queue is full, the item is rejected and onReject is called.
-     * Items can be inserted based on priority or at the front/back depending on configuration.
-     *
-     * Returns true if the item was added, false if the queue is full.
-     *
-     * Example usage:
-     * ```ts
-     * queuer.addItem('task');
-     * queuer.addItem('task2', 'front');
-     * ```
-     */
-    addItem: (item: TValue, position?: QueuePosition, runOnItemsChange?: boolean) => boolean;
-    /**
-     * Removes and returns the next item from the queue without executing the function.
-     * Use for manual queue management. Normally, use execute() to process items.
-     *
-     * Example usage:
-     * ```ts
-     * // FIFO
-     * queuer.getNextItem();
-     * // LIFO
-     * queuer.getNextItem('back');
-     * ```
-     */
-    getNextItem: (position?: QueuePosition) => TValue | undefined;
-    /**
-     * Removes and returns the next item from the queue and processes it using the provided function.
-     *
-     * Example usage:
-     * ```ts
-     * queuer.execute();
-     * // LIFO
-     * queuer.execute('back');
-     * ```
-     */
-    execute: (position?: QueuePosition) => TValue | undefined;
-    /**
-     * Processes a specified number of items to execute immediately with no wait time
-     * If no numberOfItems is provided, all items will be processed
-     */
-    flush: (numberOfItems?: number, position?: QueuePosition) => void;
-    /**
-     * Processes all items in the queue as a batch using the provided function as an argument
-     * The queue is cleared after processing
-     */
-    flushAsBatch: (batchFunction: (items: Array<TValue>) => void) => void;
-    /**
-     * Returns the next item in the queue without removing it.
-     *
-     * Example usage:
-     * ```ts
-     * queuer.peekNextItem(); // front
-     * queuer.peekNextItem('back'); // back
-     * ```
-     */
-    peekNextItem: (position?: QueuePosition) => TValue | undefined;
-    /**
-     * Returns a copy of all items in the queue.
-     */
-    peekAllItems: () => Array<TValue>;
-    /**
-     * Starts processing items in the queue. If already isRunning, does nothing.
-     */
-    start: () => void;
-    /**
-     * Stops processing items in the queue. Does not clear the queue.
-     */
-    stop: () => void;
-    /**
-     * Removes all pending items from the queue. Does not affect items being processed.
-     */
-    clear: () => void;
-    /**
-     * Resets the queuer state to its default values
-     */
-    reset: () => void;
-}
-/**
- * Creates a queue that processes items immediately upon addition.
- * Items are processed sequentially in FIFO order by default.
- *
- * This synchronous version is lighter weight and often all you need - upgrade to asyncQueue when you need promises, retry support, abort capabilities, concurrent execution, or advanced error handling.
- *
- * State Management:
- * - Uses TanStack Store for reactive state management
- * - Use `initialState` to provide initial state values when creating the queuer
- * - Use `onExecute` callback to react to item execution and implement custom logic
- * - Use `onItemsChange` callback to react to items being added or removed from the queue
- * - Use `onExpire` callback to react to items expiring and implement custom logic
- * - Use `onReject` callback to react to items being rejected when the queue is full
- * - The state includes execution count, expiration count, rejection count, and isRunning status
- * - State can be accessed via the underlying Queuer instance's `store.state` property
- * - When using framework adapters (React/Solid), state is accessed from the hook's state property
- *
- * Example usage:
- * ```ts
- * // Basic sequential processing
- * const processItems = queue<number>((n) => console.log(n), {
- *   wait: 1000,
- *   onItemsChange: (queuer) => console.log(queuer.peekAllItems())
- * });
- * processItems(1); // Logs: 1
- * processItems(2); // Logs: 2 after 1 completes
- *
- * // Priority queue
- * const processPriority = queue<number>((n) => console.log(n), {
- *   getPriority: n => n // Higher numbers processed first
- * });
- * processPriority(1);
- * processPriority(3); // Processed before 1
- * ```
- */
-export declare function queue<TValue>(fn: (item: TValue) => void, initialOptions: QueuerOptions<TValue>): (item: TValue, position?: QueuePosition, runOnItemsChange?: boolean) => boolean;

package/dist/cjs/rate-limiter.cjs

@@ -1,181 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const store = require("@tanstack/store");
-const utils = require("./utils.cjs");
-const eventClient = require("./event-client.cjs");
-function getDefaultRateLimiterState() {
-  return {
-    executionCount: 0,
-    executionTimes: [],
-    isExceeded: false,
-    rejectionCount: 0,
-    status: "idle",
-    maybeExecuteCount: 0
-  };
-}
-function rateLimiterOptions(options) {
-  return options;
-}
-const defaultOptions = {
-  enabled: true,
-  limit: 1,
-  window: 0,
-  windowType: "fixed"
-};
-class RateLimiter {
-  constructor(fn, initialOptions) {
-    this.fn = fn;
-    this.store = new store.Store(getDefaultRateLimiterState());
-    this.#timeoutIds = /* @__PURE__ */ new Set();
-    this.setOptions = (newOptions) => {
-      this.options = { ...this.options, ...newOptions };
-    };
-    this.#setState = (newState) => {
-      this.store.setState((state) => {
-        const combinedState = {
-          ...state,
-          ...newState
-        };
-        const isExceeded = combinedState.executionTimes.length >= this.#getLimit();
-        const status = !this.#getEnabled() ? "disabled" : isExceeded ? "exceeded" : "idle";
-        return {
-          ...combinedState,
-          isExceeded,
-          status
-        };
-      });
-      eventClient.emitChange("RateLimiter", this);
-    };
-    this.#getEnabled = () => {
-      return !!utils.parseFunctionOrValue(this.options.enabled, this);
-    };
-    this.#getLimit = () => {
-      return utils.parseFunctionOrValue(this.options.limit, this);
-    };
-    this.#getWindow = () => {
-      return utils.parseFunctionOrValue(this.options.window, this);
-    };
-    this.maybeExecute = (...args) => {
-      this.#setState({
-        maybeExecuteCount: this.store.state.maybeExecuteCount + 1
-      });
-      this.#cleanupOldExecutions();
-      const relevantExecutionTimes = this.#getExecutionTimesInWindow();
-      if (relevantExecutionTimes.length < this.#getLimit()) {
-        this.#execute(...args);
-        return true;
-      }
-      this.#setState({
-        rejectionCount: this.store.state.rejectionCount + 1
-      });
-      this.options.onReject?.(this);
-      return false;
-    };
-    this.#execute = (...args) => {
-      if (!this.#getEnabled()) return;
-      const now = Date.now();
-      this.fn(...args);
-      this.store.state.executionTimes.push(now);
-      this.#setCleanupTimeout(now);
-      this.#setState({
-        executionCount: this.store.state.executionCount + 1
-      });
-      this.options.onExecute?.(args, this);
-    };
-    this.#getExecutionTimesInWindow = () => {
-      if (this.options.windowType === "sliding") {
-        return this.store.state.executionTimes.filter(
-          (time) => time > Date.now() - this.#getWindow()
-        );
-      } else {
-        if (this.store.state.executionTimes.length === 0) {
-          return [];
-        }
-        const oldestExecution = Math.min(...this.store.state.executionTimes);
-        const windowStart = oldestExecution;
-        const windowEnd = windowStart + this.#getWindow();
-        const now = Date.now();
-        if (now > windowEnd) {
-          return [];
-        }
-        return this.store.state.executionTimes.filter(
-          (time) => time >= windowStart && time <= windowEnd
-        );
-      }
-    };
-    this.#setCleanupTimeout = (executionTime) => {
-      if (this.options.windowType === "sliding" || this.#timeoutIds.size === 0) {
-        const now = Date.now();
-        const timeUntilExpiration = executionTime - now + this.#getWindow() + 1;
-        const timeoutId = setTimeout(() => {
-          this.#cleanupOldExecutions();
-          this.#clearTimeout(timeoutId);
-        }, timeUntilExpiration);
-        this.#timeoutIds.add(timeoutId);
-      }
-    };
-    this.#clearTimeout = (timeoutId) => {
-      clearTimeout(timeoutId);
-      this.#timeoutIds.delete(timeoutId);
-    };
-    this.#clearTimeouts = () => {
-      this.#timeoutIds.forEach((timeoutId) => clearTimeout(timeoutId));
-      this.#timeoutIds.clear();
-    };
-    this.#cleanupOldExecutions = () => {
-      this.#setState({
-        executionTimes: this.#getExecutionTimesInWindow()
-      });
-    };
-    this.getRemainingInWindow = () => {
-      const relevantExecutionTimes = this.#getExecutionTimesInWindow();
-      return Math.max(0, this.#getLimit() - relevantExecutionTimes.length);
-    };
-    this.getMsUntilNextWindow = () => {
-      if (this.getRemainingInWindow() > 0) {
-        return 0;
-      }
-      const oldestExecution = this.store.state.executionTimes[0] ?? Infinity;
-      return oldestExecution + this.#getWindow() - Date.now();
-    };
-    this.reset = () => {
-      this.#setState(getDefaultRateLimiterState());
-      this.#clearTimeouts();
-    };
-    this.key = initialOptions.key;
-    this.options = {
-      ...defaultOptions,
-      ...initialOptions
-    };
-    this.#setState(this.options.initialState ?? {});
-    for (const executionTime of this.#getExecutionTimesInWindow()) {
-      this.#setCleanupTimeout(executionTime);
-    }
-    if (this.key) {
-      eventClient.pacerEventClient.on("d-RateLimiter", (event) => {
-        if (event.payload.key !== this.key) return;
-        this.#setState(event.payload.store.state);
-        this.setOptions(event.payload.options);
-      });
-    }
-  }
-  #timeoutIds;
-  #setState;
-  #getEnabled;
-  #getLimit;
-  #getWindow;
-  #execute;
-  #getExecutionTimesInWindow;
-  #setCleanupTimeout;
-  #clearTimeout;
-  #clearTimeouts;
-  #cleanupOldExecutions;
-}
-function rateLimit(fn, initialOptions) {
-  const rateLimiter = new RateLimiter(fn, initialOptions);
-  return rateLimiter.maybeExecute;
-}
-exports.RateLimiter = RateLimiter;
-exports.rateLimit = rateLimit;
-exports.rateLimiterOptions = rateLimiterOptions;
-//# sourceMappingURL=rate-limiter.cjs.map

package/dist/cjs/rate-limiter.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"rate-limiter.cjs","sources":["../../src/rate-limiter.ts"],"sourcesContent":["import { Store } from '@tanstack/store'\nimport { parseFunctionOrValue } from './utils'\nimport { emitChange, pacerEventClient } from './event-client'\nimport type { AnyFunction } from './types'\n\nexport interface RateLimiterState {\n  /**\n   * Number of function executions that have been completed\n   */\n  executionCount: number\n  /**\n   * Array of timestamps when executions occurred for rate limiting calculations\n   */\n  executionTimes: Array<number>\n  /**\n   * Whether the rate limiter has exceeded the limit\n   */\n  isExceeded: boolean\n  /**\n   * Number of times maybeExecute has been called (for reduction calculations)\n   */\n  maybeExecuteCount: number\n  /**\n   * Number of function executions that have been rejected due to rate limiting\n   */\n  rejectionCount: number\n  /**\n   * Current execution status - 'disabled' when not active, 'executing' when executing, 'idle' when not executing, 'exceeded' when rate limit is exceeded\n   */\n  status: 'disabled' | 'exceeded' | 'idle'\n}\n\nfunction getDefaultRateLimiterState(): RateLimiterState {\n  return {\n    executionCount: 0,\n    executionTimes: [],\n    isExceeded: false,\n    rejectionCount: 0,\n    status: 'idle',\n    maybeExecuteCount: 0,\n  }\n}\n\n/**\n * Options for configuring a rate-limited function\n */\nexport interface RateLimiterOptions<TFn extends AnyFunction> {\n  /**\n   * Whether the rate limiter is enabled. When disabled, maybeExecute will not trigger any executions.\n   * Defaults to true.\n   */\n  enabled?: boolean | ((rateLimiter: RateLimiter<TFn>) => boolean)\n  /**\n   * Initial state for the rate limiter\n   */\n  initialState?: Partial<RateLimiterState>\n  /**\n   * Optional key to identify this rate limiter instance.\n   * If provided, the rate limiter will be identified by this key in the devtools and PacerProvider if applicable.\n   */\n  key?: string\n  /**\n   * Maximum number of executions allowed within the time window.\n   * Can be a number or a callback function that receives the rate limiter instance and returns a number.\n   */\n  limit: number | ((rateLimiter: RateLimiter<TFn>) => number)\n  /**\n   * Callback function that is called after the function is executed\n   */\n  onExecute?: (args: Parameters<TFn>, rateLimiter: RateLimiter<TFn>) => void\n  /**\n   * Optional callback function that is called when an execution is rejected due to rate limiting\n   */\n  onReject?: (rateLimiter: RateLimiter<TFn>) => void\n  /**\n   * Time window in milliseconds within which the limit applies.\n   * Can be a number or a callback function that receives the rate limiter instance and returns a number.\n   */\n  window: number | ((rateLimiter: RateLimiter<TFn>) => number)\n  /**\n   * Type of window to use for rate limiting\n   * - 'fixed': Uses a fixed window that resets after the window period\n   * - 'sliding': Uses a sliding window that allows executions as old ones expire\n   * Defaults to 'fixed'\n   */\n  windowType?: 'fixed' | 'sliding'\n}\n\n/**\n * Utility function for sharing common `RateLimiterOptions` options between different `RateLimiter` instances.\n */\nexport function rateLimiterOptions<\n  TFn extends AnyFunction = AnyFunction,\n  TOptions extends Partial<RateLimiterOptions<TFn>> = Partial<\n    RateLimiterOptions<TFn>\n  >,\n>(options: TOptions): TOptions {\n  return options\n}\n\nconst defaultOptions: Omit<\n  Required<RateLimiterOptions<any>>,\n  'initialState' | 'onExecute' | 'onReject' | 'key'\n> = {\n  enabled: true,\n  limit: 1,\n  window: 0,\n  windowType: 'fixed',\n}\n\n/**\n * A class that creates a 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 * This synchronous version is lighter weight and often all you need - upgrade to AsyncRateLimiter when you need promises, retry support, abort capabilities, or advanced error handling.\n *\n * The rate limiter supports two types of windows:\n * - 'fixed': A strict window that resets after the window period. All executions within the window count\n *   towards the limit, and the window resets completely after the period.\n * - 'sliding': A rolling window that allows executions as old ones expire. This provides a more\n *   consistent rate of execution over time.\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 * State Management:\n * - Uses TanStack Store for reactive state management\n * - Use `initialState` to provide initial state values when creating the rate limiter\n * - Use `onExecute` callback to react to function execution and implement custom logic\n * - Use `onReject` callback to react to executions being rejected when rate limit is exceeded\n * - The state includes execution count, execution times, and rejection count\n * - State can be accessed via `rateLimiter.store.state` when using the class directly\n * - When using framework adapters (React/Solid), state is accessed from `rateLimiter.state`\n *\n * @example\n * ```ts\n * const rateLimiter = new RateLimiter(\n *   (id: string) => api.getData(id),\n *   {\n *     limit: 5,\n *     window: 1000,\n *     windowType: 'sliding',\n *   }\n * );\n *\n * // Will execute immediately until limit reached, then block\n * rateLimiter.maybeExecute('123');\n * ```\n */\nexport class RateLimiter<TFn extends AnyFunction> {\n  readonly store: Store<Readonly<RateLimiterState>> =\n    new Store<RateLimiterState>(getDefaultRateLimiterState())\n  key: string | undefined\n  options: RateLimiterOptions<TFn>\n  #timeoutIds: Set<NodeJS.Timeout> = new Set()\n\n  constructor(\n    public fn: TFn,\n    initialOptions: RateLimiterOptions<TFn>,\n  ) {\n    this.key = initialOptions.key\n    this.options = {\n      ...defaultOptions,\n      ...initialOptions,\n    }\n    this.#setState(this.options.initialState ?? {})\n    for (const executionTime of this.#getExecutionTimesInWindow()) {\n      this.#setCleanupTimeout(executionTime)\n    }\n\n    if (this.key) {\n      pacerEventClient.on('d-RateLimiter', (event) => {\n        if (event.payload.key !== this.key) return\n        this.#setState(event.payload.store.state)\n        this.setOptions(event.payload.options)\n      })\n    }\n  }\n\n  /**\n   * Updates the rate limiter options\n   */\n  setOptions = (newOptions: Partial<RateLimiterOptions<TFn>>): void => {\n    this.options = { ...this.options, ...newOptions }\n  }\n\n  #setState = (newState: Partial<RateLimiterState>): void => {\n    this.store.setState((state) => {\n      const combinedState = {\n        ...state,\n        ...newState,\n      }\n      const isExceeded = combinedState.executionTimes.length >= this.#getLimit()\n      const status = !this.#getEnabled()\n        ? 'disabled'\n        : isExceeded\n          ? 'exceeded'\n          : 'idle'\n      return {\n        ...combinedState,\n        isExceeded,\n        status,\n      }\n    })\n    emitChange('RateLimiter', this)\n  }\n\n  /**\n   * Returns the current enabled state of the rate limiter\n   */\n  #getEnabled = (): boolean => {\n    return !!parseFunctionOrValue(this.options.enabled, this)\n  }\n\n  /**\n   * Returns the current limit of executions allowed within the time window\n   */\n  #getLimit = (): number => {\n    return parseFunctionOrValue(this.options.limit, this)\n  }\n\n  /**\n   * Returns the current time window in milliseconds\n   */\n  #getWindow = (): number => {\n    return parseFunctionOrValue(this.options.window, this)\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   *\n   * @example\n   * ```ts\n   * const rateLimiter = new RateLimiter(fn, { limit: 5, window: 1000 });\n   *\n   * // First 5 calls will return true\n   * rateLimiter.maybeExecute('arg1', 'arg2'); // true\n   *\n   * // Additional calls within the window will return false\n   * rateLimiter.maybeExecute('arg1', 'arg2'); // false\n   * ```\n   */\n  maybeExecute = (...args: Parameters<TFn>): boolean => {\n    this.#setState({\n      maybeExecuteCount: this.store.state.maybeExecuteCount + 1,\n    })\n\n    this.#cleanupOldExecutions()\n\n    const relevantExecutionTimes = this.#getExecutionTimesInWindow()\n\n    if (relevantExecutionTimes.length < this.#getLimit()) {\n      this.#execute(...args)\n      return true\n    }\n\n    this.#setState({\n      rejectionCount: this.store.state.rejectionCount + 1,\n    })\n    this.options.onReject?.(this)\n    return false\n  }\n\n  #execute = (...args: Parameters<TFn>): void => {\n    if (!this.#getEnabled()) return\n    const now = Date.now()\n    this.fn(...args) // EXECUTE!\n    this.store.state.executionTimes.push(now) // mutate state directly for performance\n\n    this.#setCleanupTimeout(now)\n\n    this.#setState({\n      executionCount: this.store.state.executionCount + 1,\n    })\n    this.options.onExecute?.(args, this)\n  }\n\n  #getExecutionTimesInWindow = (): Array<number> => {\n    if (this.options.windowType === 'sliding') {\n      // For sliding window, return all executions within the current window\n      return this.store.state.executionTimes.filter(\n        (time) => time > Date.now() - this.#getWindow(),\n      )\n    } else {\n      // For fixed window, return all executions in the current window\n      // The window starts from the oldest execution time\n      if (this.store.state.executionTimes.length === 0) {\n        return []\n      }\n      const oldestExecution = Math.min(...this.store.state.executionTimes)\n      const windowStart = oldestExecution\n      const windowEnd = windowStart + this.#getWindow()\n      const now = Date.now()\n\n      // If the window has expired, return empty array\n      if (now > windowEnd) {\n        return []\n      }\n\n      // Otherwise, return all executions in the current window\n      return this.store.state.executionTimes.filter(\n        (time) => time >= windowStart && time <= windowEnd,\n      )\n    }\n  }\n\n  #setCleanupTimeout = (executionTime: number): void => {\n    if (\n      this.options.windowType === 'sliding' ||\n      this.#timeoutIds.size === 0 // new fixed window\n    ) {\n      const now = Date.now()\n      const timeUntilExpiration = executionTime - now + this.#getWindow() + 1\n      const timeoutId = setTimeout(() => {\n        this.#cleanupOldExecutions()\n        this.#clearTimeout(timeoutId)\n      }, timeUntilExpiration)\n      this.#timeoutIds.add(timeoutId)\n    }\n  }\n\n  #clearTimeout = (timeoutId: NodeJS.Timeout): void => {\n    clearTimeout(timeoutId)\n    this.#timeoutIds.delete(timeoutId)\n  }\n\n  #clearTimeouts = (): void => {\n    this.#timeoutIds.forEach((timeoutId) => clearTimeout(timeoutId))\n    this.#timeoutIds.clear()\n  }\n\n  #cleanupOldExecutions = (): void => {\n    this.#setState({\n      executionTimes: this.#getExecutionTimesInWindow(),\n    })\n  }\n\n  /**\n   * Returns the number of remaining executions allowed in the current window\n   */\n  getRemainingInWindow = (): number => {\n    const relevantExecutionTimes = this.#getExecutionTimesInWindow()\n    return Math.max(0, this.#getLimit() - relevantExecutionTimes.length)\n  }\n\n  /**\n   * Returns the number of milliseconds until the next execution will be possible\n   */\n  getMsUntilNextWindow = (): number => {\n    if (this.getRemainingInWindow() > 0) {\n      return 0\n    }\n    const oldestExecution = this.store.state.executionTimes[0] ?? Infinity\n    return oldestExecution + this.#getWindow() - Date.now()\n  }\n\n  /**\n   * Resets the rate limiter state\n   */\n  reset = (): void => {\n    this.#setState(getDefaultRateLimiterState())\n    this.#clearTimeouts()\n  }\n}\n\n/**\n * Creates a rate-limited function that will execute the provided function up to a maximum number of times within a time window.\n *\n * This synchronous version is lighter weight and often all you need - upgrade to asyncRateLimit when you need promises, retry support, abort capabilities, or advanced error handling.\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 * The rate limiter supports two types of windows:\n * - 'fixed': A strict window that resets after the window period. All executions within the window count\n *   towards the limit, and the window resets completely after the period.\n * - 'sliding': A rolling window that allows executions as old ones expire. This provides a more\n *   consistent rate of execution over time.\n *\n * State Management:\n * - Uses TanStack Store for reactive state management\n * - Use `initialState` to provide initial state values when creating the rate limiter\n * - Use `onExecute` callback to react to function execution and implement custom logic\n * - Use `onReject` callback to react to executions being rejected when rate limit is exceeded\n * - The state includes execution count, execution times, and rejection count\n * - State can be accessed via the underlying RateLimiter instance's `store.state` property\n * - When using framework adapters (React/Solid), state is accessed from the hook's state property\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 with a sliding window\n * const rateLimited = rateLimit(makeApiCall, {\n *   limit: 5,\n *   window: 60000,\n *   windowType: 'sliding',\n *   onReject: (rateLimiter) => {\n *     console.log(`Rate limit exceeded. Try again in ${rateLimiter.getMsUntilNextWindow()}ms`);\n *   }\n * });\n *\n * // First 5 calls will execute immediately\n * // Additional calls will be rejected until the minute window resets\n * 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 rateLimit<TFn extends AnyFunction>(\n  fn: TFn,\n  initialOptions: RateLimiterOptions<TFn>,\n) {\n  const rateLimiter = new RateLimiter(fn, initialOptions)\n  return rateLimiter.maybeExecute\n}\n"],"names":["Store","emitChange","parseFunctionOrValue","pacerEventClient"],"mappings":";;;;;AAgCA,SAAS,6BAA+C;AACtD,SAAO;AAAA,IACL,gBAAgB;AAAA,IAChB,gBAAgB,CAAA;AAAA,IAChB,YAAY;AAAA,IACZ,gBAAgB;AAAA,IAChB,QAAQ;AAAA,IACR,mBAAmB;AAAA,EAAA;AAEvB;AAkDO,SAAS,mBAKd,SAA6B;AAC7B,SAAO;AACT;AAEA,MAAM,iBAGF;AAAA,EACF,SAAS;AAAA,EACT,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,YAAY;AACd;AA+CO,MAAM,YAAqC;AAAA,EAOhD,YACS,IACP,gBACA;AAFO,SAAA,KAAA;AAPT,SAAS,QACP,IAAIA,MAAAA,MAAwB,2BAAA,CAA4B;AAG1D,SAAA,kCAAuC,IAAA;AA4BvC,SAAA,aAAa,CAAC,eAAuD;AACnE,WAAK,UAAU,EAAE,GAAG,KAAK,SAAS,GAAG,WAAA;AAAA,IACvC;AAEA,SAAA,YAAY,CAAC,aAA8C;AACzD,WAAK,MAAM,SAAS,CAAC,UAAU;AAC7B,cAAM,gBAAgB;AAAA,UACpB,GAAG;AAAA,UACH,GAAG;AAAA,QAAA;AAEL,cAAM,aAAa,cAAc,eAAe,UAAU,KAAK,UAAA;AAC/D,cAAM,SAAS,CAAC,KAAK,gBACjB,aACA,aACE,aACA;AACN,eAAO;AAAA,UACL,GAAG;AAAA,UACH;AAAA,UACA;AAAA,QAAA;AAAA,MAEJ,CAAC;AACDC,kBAAAA,WAAW,eAAe,IAAI;AAAA,IAChC;AAKA,SAAA,cAAc,MAAe;AAC3B,aAAO,CAAC,CAACC,MAAAA,qBAAqB,KAAK,QAAQ,SAAS,IAAI;AAAA,IAC1D;AAKA,SAAA,YAAY,MAAc;AACxB,aAAOA,MAAAA,qBAAqB,KAAK,QAAQ,OAAO,IAAI;AAAA,IACtD;AAKA,SAAA,aAAa,MAAc;AACzB,aAAOA,MAAAA,qBAAqB,KAAK,QAAQ,QAAQ,IAAI;AAAA,IACvD;AAiBA,SAAA,eAAe,IAAI,SAAmC;AACpD,WAAK,UAAU;AAAA,QACb,mBAAmB,KAAK,MAAM,MAAM,oBAAoB;AAAA,MAAA,CACzD;AAED,WAAK,sBAAA;AAEL,YAAM,yBAAyB,KAAK,2BAAA;AAEpC,UAAI,uBAAuB,SAAS,KAAK,UAAA,GAAa;AACpD,aAAK,SAAS,GAAG,IAAI;AACrB,eAAO;AAAA,MACT;AAEA,WAAK,UAAU;AAAA,QACb,gBAAgB,KAAK,MAAM,MAAM,iBAAiB;AAAA,MAAA,CACnD;AACD,WAAK,QAAQ,WAAW,IAAI;AAC5B,aAAO;AAAA,IACT;AAEA,SAAA,WAAW,IAAI,SAAgC;AAC7C,UAAI,CAAC,KAAK,cAAe;AACzB,YAAM,MAAM,KAAK,IAAA;AACjB,WAAK,GAAG,GAAG,IAAI;AACf,WAAK,MAAM,MAAM,eAAe,KAAK,GAAG;AAExC,WAAK,mBAAmB,GAAG;AAE3B,WAAK,UAAU;AAAA,QACb,gBAAgB,KAAK,MAAM,MAAM,iBAAiB;AAAA,MAAA,CACnD;AACD,WAAK,QAAQ,YAAY,MAAM,IAAI;AAAA,IACrC;AAEA,SAAA,6BAA6B,MAAqB;AAChD,UAAI,KAAK,QAAQ,eAAe,WAAW;AAEzC,eAAO,KAAK,MAAM,MAAM,eAAe;AAAA,UACrC,CAAC,SAAS,OAAO,KAAK,IAAA,IAAQ,KAAK,WAAA;AAAA,QAAW;AAAA,MAElD,OAAO;AAGL,YAAI,KAAK,MAAM,MAAM,eAAe,WAAW,GAAG;AAChD,iBAAO,CAAA;AAAA,QACT;AACA,cAAM,kBAAkB,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,cAAc;AACnE,cAAM,cAAc;AACpB,cAAM,YAAY,cAAc,KAAK,WAAA;AACrC,cAAM,MAAM,KAAK,IAAA;AAGjB,YAAI,MAAM,WAAW;AACnB,iBAAO,CAAA;AAAA,QACT;AAGA,eAAO,KAAK,MAAM,MAAM,eAAe;AAAA,UACrC,CAAC,SAAS,QAAQ,eAAe,QAAQ;AAAA,QAAA;AAAA,MAE7C;AAAA,IACF;AAEA,SAAA,qBAAqB,CAAC,kBAAgC;AACpD,UACE,KAAK,QAAQ,eAAe,aAC5B,KAAK,YAAY,SAAS,GAC1B;AACA,cAAM,MAAM,KAAK,IAAA;AACjB,cAAM,sBAAsB,gBAAgB,MAAM,KAAK,eAAe;AACtE,cAAM,YAAY,WAAW,MAAM;AACjC,eAAK,sBAAA;AACL,eAAK,cAAc,SAAS;AAAA,QAC9B,GAAG,mBAAmB;AACtB,aAAK,YAAY,IAAI,SAAS;AAAA,MAChC;AAAA,IACF;AAEA,SAAA,gBAAgB,CAAC,cAAoC;AACnD,mBAAa,SAAS;AACtB,WAAK,YAAY,OAAO,SAAS;AAAA,IACnC;AAEA,SAAA,iBAAiB,MAAY;AAC3B,WAAK,YAAY,QAAQ,CAAC,cAAc,aAAa,SAAS,CAAC;AAC/D,WAAK,YAAY,MAAA;AAAA,IACnB;AAEA,SAAA,wBAAwB,MAAY;AAClC,WAAK,UAAU;AAAA,QACb,gBAAgB,KAAK,2BAAA;AAAA,MAA2B,CACjD;AAAA,IACH;AAKA,SAAA,uBAAuB,MAAc;AACnC,YAAM,yBAAyB,KAAK,2BAAA;AACpC,aAAO,KAAK,IAAI,GAAG,KAAK,UAAA,IAAc,uBAAuB,MAAM;AAAA,IACrE;AAKA,SAAA,uBAAuB,MAAc;AACnC,UAAI,KAAK,qBAAA,IAAyB,GAAG;AACnC,eAAO;AAAA,MACT;AACA,YAAM,kBAAkB,KAAK,MAAM,MAAM,eAAe,CAAC,KAAK;AAC9D,aAAO,kBAAkB,KAAK,WAAA,IAAe,KAAK,IAAA;AAAA,IACpD;AAKA,SAAA,QAAQ,MAAY;AAClB,WAAK,UAAU,4BAA4B;AAC3C,WAAK,eAAA;AAAA,IACP;AA3ME,SAAK,MAAM,eAAe;AAC1B,SAAK,UAAU;AAAA,MACb,GAAG;AAAA,MACH,GAAG;AAAA,IAAA;AAEL,SAAK,UAAU,KAAK,QAAQ,gBAAgB,CAAA,CAAE;AAC9C,eAAW,iBAAiB,KAAK,8BAA8B;AAC7D,WAAK,mBAAmB,aAAa;AAAA,IACvC;AAEA,QAAI,KAAK,KAAK;AACZC,kBAAAA,iBAAiB,GAAG,iBAAiB,CAAC,UAAU;AAC9C,YAAI,MAAM,QAAQ,QAAQ,KAAK,IAAK;AACpC,aAAK,UAAU,MAAM,QAAQ,MAAM,KAAK;AACxC,aAAK,WAAW,MAAM,QAAQ,OAAO;AAAA,MACvC,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAvBA;AAAA,EAgCA;AAAA,EAwBA;AAAA,EAOA;AAAA,EAOA;AAAA,EAwCA;AAAA,EAcA;AAAA,EA6BA;AAAA,EAeA;AAAA,EAKA;AAAA,EAKA;AAgCF;AAkDO,SAAS,UACd,IACA,gBACA;AACA,QAAM,cAAc,IAAI,YAAY,IAAI,cAAc;AACtD,SAAO,YAAY;AACrB;;;;"}