@tanstack/pacer 0.22.0 → 0.23.0

package/dist/async-queuer.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-queuer.cjs","names":["Store","parseFunctionOrValue","#setState","#checkExpiredItems","#getConcurrency","#getWait","#timeoutIds","#tick","AsyncRetryer","#clearTimeouts","#getAllItems"],"sources":["../src/async-queuer.ts"],"sourcesContent":["import { Store } from '@tanstack/store'\nimport { AsyncRetryer } from './async-retryer'\nimport { parseFunctionOrValue } from './utils'\nimport { emitChange, pacerEventClient } from './event-client'\nimport type { AsyncRetryerOptions } from './async-retryer'\nimport type { OptionalKeys } from './types'\nimport type { QueuePosition } from './queuer'\n\nexport interface AsyncQueuerState<TValue> {\n  /**\n   * Items currently being processed by the queuer\n   */\n  activeItems: Array<TValue>\n  /**\n   * Number of times addItem has been called (for reduction calculations)\n   */\n  addItemCount: number\n  /**\n   * Number of task executions that have resulted in errors\n   */\n  errorCount: number\n  /**\n   * Number of times execute has been called\n   */\n  executeCount: number\n  /**\n   * Number of items that have been removed from the queue due to expiration\n   */\n  expirationCount: number\n  /**\n   * Whether the queuer has no items to process (items array is empty)\n   */\n  isEmpty: boolean\n  /**\n   * Whether the queuer is currently executing\n   */\n  isExecuting: boolean\n  /**\n   * Whether the queuer has reached its maximum capacity\n   */\n  isFull: boolean\n  /**\n   * Whether the queuer is not currently processing any items\n   */\n  isIdle: boolean\n  /**\n   * Whether the queuer is active and will process items automatically\n   */\n  isRunning: boolean\n  /**\n   * Array of items currently waiting to be processed\n   */\n  items: Array<TValue>\n  /**\n   * Timestamps when items were added to the queue for expiration tracking\n   */\n  itemTimestamps: Array<number>\n  /**\n   * The result from the most recent task execution\n   */\n  lastResult: any\n  /**\n   * Whether the queuer has a pending timeout for processing the next item\n   */\n  pendingTick: boolean\n  /**\n   * Number of items that have been rejected from being added to the queue\n   */\n  rejectionCount: number\n  /**\n   * Number of task executions that have completed (either successfully or with errors)\n   */\n  settledCount: number\n  /**\n   * Number of items currently in the queue\n   */\n  size: number\n  /**\n   * Current processing status - 'idle' when not processing, 'running' when active, 'stopped' when paused\n   */\n  status: 'idle' | 'running' | 'stopped'\n  /**\n   * Number of task executions that have completed successfully\n   */\n  successCount: number\n}\n\nfunction getDefaultAsyncQueuerState<TValue>(): AsyncQueuerState<TValue> {\n  return {\n    activeItems: [],\n    addItemCount: 0,\n    errorCount: 0,\n    executeCount: 0,\n    expirationCount: 0,\n    isEmpty: true,\n    isExecuting: false,\n    isFull: false,\n    isIdle: true,\n    isRunning: true,\n    itemTimestamps: [],\n    items: [],\n    lastResult: null,\n    pendingTick: false,\n    rejectionCount: 0,\n    settledCount: 0,\n    size: 0,\n    status: 'idle',\n    successCount: 0,\n  }\n}\n\nexport interface AsyncQueuerOptions<TValue> {\n  /**\n   * Options for configuring the underlying async retryer\n   */\n  asyncRetryerOptions?: AsyncRetryerOptions<(item: TValue) => Promise<any>>\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   * Can be a number or a function that returns a number.\n   * @default 1\n   */\n  concurrency?: number | ((queuer: AsyncQueuer<TValue>) => number)\n  /**\n   * Maximum time in milliseconds that an item can stay in the queue\n   * If not provided, items will never expire\n   */\n  expirationDuration?: number\n  /**\n   * Function to determine if an item has expired\n   * If provided, this overrides the expirationDuration behavior\n   */\n  getIsExpired?: (item: TValue, addedAt: number) => boolean\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: TValue) => number\n  /**\n   * Initial items to populate the queuer with\n   */\n  initialItems?: Array<TValue>\n  /**\n   * Initial state for the async queuer\n   */\n  initialState?: Partial<AsyncQueuerState<TValue>>\n  /**\n   * Optional key to identify this async queuer instance.\n   * If provided, the async queuer will be identified by this key in the devtools and PacerProvider if applicable.\n   */\n  key?: string\n  /**\n   * Maximum number of items allowed in the queuer\n   */\n  maxSize?: number\n  /**\n   * Optional error handler for when a task throws.\n   * If provided, the handler will be called with the error and queuer instance.\n   * This can be used alongside throwOnError - the handler will be called before any error is thrown.\n   */\n  onError?: (error: Error, item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Callback fired whenever an item expires in the queuer\n   */\n  onExpire?: (item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Callback fired whenever an item is added or removed from the queuer\n   */\n  onItemsChange?: (queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Callback fired whenever an item is rejected from being added to the queuer\n   */\n  onReject?: (item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Optional callback to call when a task is settled\n   */\n  onSettled?: (item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Optional callback to call when a task succeeds\n   */\n  onSuccess?: (result: any, item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Whether the queuer should start processing tasks immediately or not.\n   */\n  started?: boolean\n  /**\n   * Whether to throw errors when they occur.\n   * Defaults to true if no onError handler is provided, false if an onError handler is provided.\n   * Can be explicitly set to override these defaults.\n   */\n  throwOnError?: boolean\n  /**\n   * Time in milliseconds to wait between processing items.\n   * Can be a number or a function that returns a number.\n   * @default 0\n   */\n  wait?: number | ((queuer: AsyncQueuer<TValue>) => number)\n}\n\n/**\n * Utility function for sharing common `AsyncQueuerOptions` options between different `AsyncQueuer` instances.\n */\nexport function asyncQueuerOptions<\n  TValue = any,\n  TOptions extends Partial<AsyncQueuerOptions<TValue>> = Partial<\n    AsyncQueuerOptions<TValue>\n  >,\n>(options: TOptions): TOptions {\n  return options\n}\n\ntype AsyncQueuerOptionsWithOptionalCallbacks = OptionalKeys<\n  Required<AsyncQueuerOptions<any>>,\n  | 'initialState'\n  | 'throwOnError'\n  | 'onSuccess'\n  | 'onSettled'\n  | 'onReject'\n  | 'onItemsChange'\n  | 'onExpire'\n  | 'onError'\n  | 'key'\n>\n\nconst defaultOptions: AsyncQueuerOptionsWithOptionalCallbacks = {\n  addItemsTo: 'back',\n  asyncRetryerOptions: {\n    maxAttempts: 1,\n  },\n  concurrency: 1,\n  expirationDuration: Infinity,\n  getIsExpired: () => false,\n  getItemsFrom: 'front',\n  getPriority: (item: any) => item?.priority ?? 0,\n  initialItems: [],\n  maxSize: Infinity,\n  started: true,\n  wait: 0,\n}\n\n/**\n * A flexible asynchronous queue for processing tasks with configurable concurrency, priority, and expiration.\n *\n * Async vs Sync Versions:\n * The async version provides advanced features over the sync Queuer:\n * - Returns promises that can be awaited for task results\n * - Built-in retry support via AsyncRetryer integration for each queued task\n * - Abort support to cancel in-flight task executions\n * - Comprehensive error handling with onError callbacks and throwOnError control\n * - Detailed execution tracking (success/error/settle counts)\n * - Concurrent execution support (process multiple items simultaneously)\n *\n * The sync Queuer is lighter weight and simpler when you don't need async features,\n * return values, or execution control.\n *\n * What is Queuing?\n * Queuing is a technique for managing and processing items sequentially or with controlled concurrency.\n * Tasks are processed up to the configured concurrency limit. When a task completes,\n * the next pending task is processed if the concurrency limit allows.\n *\n * Key Features:\n * - Priority queue support via the getPriority option\n * - Configurable concurrency limit\n * - Callbacks for task success, error, completion, and queue state changes\n * - FIFO (First In First Out) or LIFO (Last In First Out) queue behavior\n * - Pause and resume processing\n * - Item expiration to remove stale items from the queue\n *\n * Error Handling:\n * - If an `onError` handler is provided, it will be called with the error and queuer instance\n * - If `throwOnError` is true (default when no onError handler is provided), the error will be thrown\n * - If `throwOnError` is false (default when onError handler is provided), the error will be swallowed\n * - Both onError and throwOnError can be used together; the handler will be called before any error is thrown\n * - The error state can be checked using the AsyncQueuer instance\n *\n * State Management:\n * - Uses TanStack Store for reactive state management\n * - Use `initialState` to provide initial state values when creating the async queuer\n * - Use `onSuccess` callback to react to successful task execution and implement custom logic\n * - Use `onError` callback to react to task execution errors and implement custom error handling\n * - Use `onSettled` callback to react to task execution completion (success or error) and implement custom logic\n * - Use `onItemsChange` callback to react to items being added or removed from the queue\n * - Use `onExpire` callback to react to items expiring and implement custom logic\n * - Use `onReject` callback to react to items being rejected when the queue is full\n * - The state includes error count, expiration count, rejection count, running status, and success/settle counts\n * - State can be accessed via `asyncQueuer.store.state` when using the class directly\n * - When using framework adapters (React/Solid), state is accessed from `asyncQueuer.state`\n *\n * Example usage:\n * ```ts\n * const asyncQueuer = new AsyncQueuer<string>(async (item) => {\n *   // process item\n *   return item.toUpperCase();\n * }, {\n *   concurrency: 2,\n *   onSuccess: (result) => {\n *     console.log(result);\n *   }\n * });\n *\n * asyncQueuer.addItem('hello');\n * asyncQueuer.start();\n * ```\n */\nexport class AsyncQueuer<TValue> {\n  readonly store: Store<Readonly<AsyncQueuerState<TValue>>> = new Store<\n    AsyncQueuerState<TValue>\n  >(getDefaultAsyncQueuerState<TValue>())\n  key: string | undefined\n  options: AsyncQueuerOptions<TValue>\n  asyncRetryers = new Map<\n    number,\n    AsyncRetryer<(item: TValue) => Promise<any>>\n  >()\n  #timeoutIds: Set<ReturnType<typeof setTimeout>> = new Set()\n\n  constructor(\n    public fn: (item: TValue) => Promise<any>,\n    initialOptions: AsyncQueuerOptions<TValue> = {},\n  ) {\n    this.key = initialOptions.key\n    this.options = {\n      ...defaultOptions,\n      ...initialOptions,\n      throwOnError: initialOptions.throwOnError ?? !initialOptions.onError,\n    }\n    const isInitiallyRunning =\n      this.options.initialState?.isRunning ?? this.options.started ?? true\n    this.#setState({\n      ...this.options.initialState,\n      isRunning: isInitiallyRunning,\n    })\n\n    if (this.options.initialState?.items) {\n      if (this.store.state.isRunning) {\n        this.#tick()\n      }\n    } else {\n      for (let i = 0; i < (this.options.initialItems?.length ?? 0); i++) {\n        const item = this.options.initialItems![i]!\n        const isLast = i === (this.options.initialItems?.length ?? 0) - 1\n        this.addItem(item, this.options.addItemsTo ?? 'back', isLast)\n      }\n    }\n\n    if (this.key) {\n      pacerEventClient.on('d-AsyncQueuer', (e) => {\n        if (e.payload.key !== this.key) return\n        this.#setState(\n          e.payload.store.state as Partial<AsyncQueuerState<TValue>>,\n        )\n        this.setOptions(\n          e.payload.options as Partial<AsyncQueuerOptions<TValue>>,\n        )\n      })\n    }\n  }\n\n  /**\n   * Updates the queuer options. New options are merged with existing options.\n   */\n  setOptions = (newOptions: Partial<AsyncQueuerOptions<TValue>>): void => {\n    this.options = { ...this.options, ...newOptions }\n  }\n\n  #setState = (newState: Partial<AsyncQueuerState<TValue>>): void => {\n    this.store.setState((state) => {\n      const combinedState = {\n        ...state,\n        ...newState,\n      }\n\n      const { activeItems, items, isRunning } = combinedState\n\n      const size = items.length\n      const isFull = size >= (this.options.maxSize ?? Infinity)\n      const isEmpty = size === 0\n      const isIdle = isRunning && isEmpty && activeItems.length === 0\n\n      const status = isIdle ? 'idle' : isRunning ? 'running' : 'stopped'\n\n      return {\n        ...combinedState,\n        isEmpty,\n        isFull,\n        isIdle,\n        size,\n        status,\n      }\n    })\n    emitChange('AsyncQueuer', this)\n  }\n\n  /**\n   * Returns the current wait time (in milliseconds) between processing items.\n   * If a function is provided, it is called with the queuer instance.\n   */\n  #getWait = (): number => {\n    return parseFunctionOrValue(this.options.wait ?? 0, this)\n  }\n\n  /**\n   * Returns the current concurrency limit for processing items.\n   * If a function is provided, it is called with the queuer instance.\n   */\n  #getConcurrency = (): number => {\n    return parseFunctionOrValue(this.options.concurrency ?? 1, this)\n  }\n\n  /**\n   * Processes items in the queue up to the concurrency limit. Internal use only.\n   */\n  #tick = () => {\n    if (!this.store.state.isRunning) {\n      this.#setState({ pendingTick: false })\n      return\n    }\n    this.#setState({ pendingTick: true })\n\n    // Check for expired items\n    this.#checkExpiredItems()\n\n    // Process items concurrently up to the concurrency limit\n    let scheduledAsyncWork = false\n    const activeItems = [...this.store.state.activeItems]\n    while (\n      activeItems.length < this.#getConcurrency() &&\n      this.store.state.items.length > 0\n    ) {\n      const nextItem = this.peekNextItem()\n      if (nextItem === undefined) {\n        break\n      }\n      activeItems.push(nextItem)\n      this.#setState({\n        activeItems: [...activeItems],\n      })\n      scheduledAsyncWork = true\n      ;(async () => {\n        try {\n          await this.execute()\n        } catch {\n          // errors are already surfaced via onError/errorCount (and rethrown to\n          // direct execute/flush callers); swallowing here prevents unhandled\n          // rejections and keeps the processing chain alive\n        }\n\n        const wait = this.#getWait()\n        if (wait > 0) {\n          const timeoutId = setTimeout(() => {\n            this.#timeoutIds.delete(timeoutId)\n            this.#tick()\n          }, wait)\n          this.#timeoutIds.add(timeoutId)\n          return\n        }\n\n        this.#tick()\n      })()\n    }\n\n    // pendingTick must stay true while executions or wait timers are pending so\n    // that addItem does not trigger an extra tick that bypasses the wait period\n    if (!scheduledAsyncWork) {\n      this.#setState({ pendingTick: false })\n    }\n  }\n\n  /**\n   * Adds an item to the queue. If the queue is full, the item is rejected and onReject is called.\n   * Items can be inserted based on priority or at the front/back depending on configuration.\n   * `undefined` cannot be queued (it is the internal \"no item\" sentinel) and is always rejected.\n   *\n   * @example\n   * ```ts\n   * queuer.addItem({ value: 'task', priority: 10 });\n   * queuer.addItem('task2', 'front');\n   * ```\n   */\n  addItem = (\n    item: TValue,\n    position: QueuePosition = this.options.addItemsTo ?? 'back',\n    runOnItemsChange: boolean = true,\n  ): boolean => {\n    this.#setState({\n      addItemCount: this.store.state.addItemCount + 1,\n    })\n\n    // undefined is the internal \"no item\" sentinel (peekNextItem/getNextItem);\n    // queuing it would wedge the processing loop and block items behind it\n    if (item === undefined) {\n      this.#setState({\n        rejectionCount: this.store.state.rejectionCount + 1,\n      })\n      this.options.onReject?.(item, this)\n      return false\n    }\n\n    if (this.store.state.items.length >= (this.options.maxSize ?? Infinity)) {\n      this.#setState({\n        rejectionCount: this.store.state.rejectionCount + 1,\n      })\n      this.options.onReject?.(item, this)\n      return false\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!(item)\n        : (item as any)?.priority\n\n    const items = this.store.state.items\n    const itemTimestamps = this.store.state.itemTimestamps\n\n    if (priority !== undefined) {\n      // Insert based on priority - higher priority items go to front\n      const insertIndex = 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        items.push(item)\n        itemTimestamps.push(Date.now())\n      } else {\n        items.splice(insertIndex, 0, item)\n        itemTimestamps.splice(insertIndex, 0, Date.now())\n      }\n    } else {\n      if (position === 'front') {\n        // Default FIFO/LIFO behavior\n        items.unshift(item)\n        itemTimestamps.unshift(Date.now())\n      } else {\n        // LIFO\n        items.push(item)\n        itemTimestamps.push(Date.now())\n      }\n    }\n\n    this.#setState({\n      items,\n      itemTimestamps,\n    })\n\n    if (runOnItemsChange) {\n      this.options.onItemsChange?.(this)\n    }\n\n    if (this.store.state.isRunning && !this.store.state.pendingTick) {\n      this.#tick()\n    }\n\n    return true\n  }\n\n  /**\n   * Removes and returns the next item from the queue without executing the task function.\n   * Use for manual queue management. Normally, use execute() to process items.\n   *\n   * @example\n   * ```ts\n   * // FIFO\n   * queuer.getNextItem();\n   * // LIFO\n   * queuer.getNextItem('back');\n   * ```\n   */\n  getNextItem = (\n    position: QueuePosition = this.options.getItemsFrom ?? 'front',\n  ): TValue | undefined => {\n    const { items, itemTimestamps } = this.store.state\n    let item: TValue | undefined\n\n    // When priority function is provided or position is 'front', always get from front (highest priority)\n    // Priority takes precedence over FIFO/LIFO behavior\n    if (\n      this.options.getPriority !== defaultOptions.getPriority ||\n      position === 'front'\n    ) {\n      item = items[0]\n      if (item !== undefined) {\n        this.#setState({\n          items: items.slice(1),\n          itemTimestamps: itemTimestamps.slice(1),\n        })\n      }\n    } else {\n      item = items[items.length - 1]\n      if (item !== undefined) {\n        this.#setState({\n          items: items.slice(0, -1),\n          itemTimestamps: itemTimestamps.slice(0, -1),\n        })\n      }\n    }\n\n    if (item !== undefined) {\n      this.options.onItemsChange?.(this)\n    }\n\n    return item\n  }\n\n  #getAllItems = (): Array<TValue> => {\n    const items = this.peekAllItems()\n    this.clear()\n    return items\n  }\n\n  /**\n   * Removes and returns the next item from the queue and executes the task function with it.\n   *\n   * @example\n   * ```ts\n   * queuer.execute();\n   * // LIFO\n   * queuer.execute('back');\n   * ```\n   */\n  execute = async (position?: QueuePosition): Promise<any> => {\n    const item = this.getNextItem(position)\n\n    if (item !== undefined) {\n      const currentExecuteCount = this.store.state.executeCount + 1\n      this.#setState({\n        executeCount: currentExecuteCount,\n        isExecuting: true,\n      })\n      try {\n        const currentAsyncRetryer = new AsyncRetryer(\n          this.fn,\n          this.options.asyncRetryerOptions,\n        )\n        this.asyncRetryers.set(currentExecuteCount, currentAsyncRetryer)\n        const lastResult = await currentAsyncRetryer.execute(item) // EXECUTE!\n        this.#setState({\n          successCount: this.store.state.successCount + 1,\n          lastResult,\n        })\n        this.options.onSuccess?.(lastResult, item, this)\n      } catch (error) {\n        this.#setState({\n          errorCount: this.store.state.errorCount + 1,\n        })\n        this.options.onError?.(error as Error, item, this)\n        if (this.options.throwOnError) {\n          throw error\n        }\n      } finally {\n        this.asyncRetryers.delete(currentExecuteCount) // dispose retryer\n        // remove only one occurrence so duplicate item values keep accurate\n        // concurrency accounting\n        const remainingActiveItems = [...this.store.state.activeItems]\n        const activeItemIndex = remainingActiveItems.indexOf(item)\n        if (activeItemIndex !== -1) {\n          remainingActiveItems.splice(activeItemIndex, 1)\n        }\n        this.#setState({\n          activeItems: remainingActiveItems,\n          // other executions may still be in flight (concurrency > 1 or flush)\n          isExecuting: this.asyncRetryers.size > 0,\n          settledCount: this.store.state.settledCount + 1,\n        })\n        this.options.onSettled?.(item, this)\n      }\n    }\n    return item\n  }\n\n  /**\n   * Processes a specified number of items to execute immediately with no wait time\n   * If no numberOfItems is provided, all items will be processed\n   */\n  flush = async (\n    numberOfItems: number = this.store.state.items.length,\n    position?: QueuePosition,\n  ): Promise<void> => {\n    this.#clearTimeouts() // clear any pending timeouts (kills the tick chain)\n    const results = await Promise.allSettled(\n      Array.from({ length: numberOfItems }, () => this.execute(position)),\n    )\n    // the tick chain was killed above; restart it so remaining and future items\n    // process even when a flushed task rejected. Remaining items resume with the\n    // normal wait spacing after the flushed executions.\n    this.#setState({ pendingTick: false })\n    if (this.store.state.isRunning && this.store.state.items.length > 0) {\n      const wait = this.#getWait()\n      if (wait > 0) {\n        this.#setState({ pendingTick: true })\n        const timeoutId = setTimeout(() => {\n          this.#timeoutIds.delete(timeoutId)\n          this.#tick()\n        }, wait)\n        this.#timeoutIds.add(timeoutId)\n      } else {\n        this.#tick()\n      }\n    }\n    const failure = results.find(\n      (result): result is PromiseRejectedResult => result.status === 'rejected',\n    )\n    if (failure) {\n      throw failure.reason\n    }\n  }\n\n  /**\n   * Processes all items in the queue as a batch using the provided function as an argument\n   * The queue is cleared after processing\n   */\n  flushAsBatch = async (\n    batchFunction: (items: Array<TValue>) => Promise<any>,\n  ): Promise<void> => {\n    this.#clearTimeouts() // clear any pending timeouts (kills the tick chain)\n    const items = this.#getAllItems()\n    try {\n      await batchFunction(items)\n    } finally {\n      // restore the tick chain even when the batch function rejects\n      this.#setState({ pendingTick: false })\n      if (this.store.state.isRunning && this.store.state.items.length > 0) {\n        this.#tick()\n      }\n    }\n  }\n\n  /**\n   * Checks for expired items in the queue and removes them. Calls onExpire for each expired item.\n   * Internal use only.\n   */\n  #checkExpiredItems = (): void => {\n    if (\n      (this.options.expirationDuration ?? Infinity) === Infinity &&\n      this.options.getIsExpired === defaultOptions.getIsExpired\n    ) {\n      return\n    }\n\n    const now = Date.now()\n    const expiredIndices: Array<number> = []\n\n    // Find indices of expired items\n    for (let i = 0; i < this.store.state.items.length; i++) {\n      const timestamp = this.store.state.itemTimestamps[i]\n      if (timestamp === undefined) continue\n\n      const item = this.store.state.items[i]\n      if (item === undefined) continue\n\n      const isExpired =\n        this.options.getIsExpired !== defaultOptions.getIsExpired\n          ? this.options.getIsExpired!(item, timestamp)\n          : now - timestamp > (this.options.expirationDuration ?? Infinity)\n\n      if (isExpired) {\n        expiredIndices.push(i)\n      }\n    }\n\n    // Remove expired items from back to front to maintain indices\n    for (let i = expiredIndices.length - 1; i >= 0; i--) {\n      const index = expiredIndices[i]\n      if (index === undefined) continue\n\n      const expiredItem = this.store.state.items[index]\n      if (expiredItem === undefined) continue\n\n      const newItems = [...this.store.state.items]\n      const newTimestamps = [...this.store.state.itemTimestamps]\n      newItems.splice(index, 1)\n      newTimestamps.splice(index, 1)\n      this.#setState({\n        items: newItems,\n        itemTimestamps: newTimestamps,\n        expirationCount: this.store.state.expirationCount + 1,\n      })\n      this.options.onExpire?.(expiredItem, this)\n    }\n\n    if (expiredIndices.length > 0) {\n      this.options.onItemsChange?.(this)\n    }\n  }\n\n  /**\n   * Returns the next item in the queue without removing it.\n   *\n   * @example\n   * ```ts\n   * queuer.peekNextItem(); // front\n   * queuer.peekNextItem('back'); // back\n   * ```\n   */\n  peekNextItem = (position: QueuePosition = 'front'): TValue | undefined => {\n    if (position === 'front') {\n      return this.store.state.items[0]\n    }\n    return this.store.state.items[this.store.state.items.length - 1]\n  }\n\n  /**\n   * Returns a copy of all items in the queue, including active and pending items.\n   */\n  peekAllItems = (): Array<TValue> => {\n    return [...this.peekActiveItems(), ...this.peekPendingItems()]\n  }\n\n  /**\n   * Returns the items currently being processed (active tasks).\n   */\n  peekActiveItems = (): Array<TValue> => {\n    return [...this.store.state.activeItems]\n  }\n\n  /**\n   * Returns the items waiting to be processed (pending tasks).\n   */\n  peekPendingItems = (): Array<TValue> => {\n    return [...this.store.state.items]\n  }\n\n  /**\n   * Starts processing items in the queue. If already running, does nothing.\n   */\n  start = (): void => {\n    this.#setState({ isRunning: true })\n    if (!this.store.state.pendingTick && this.store.state.items.length > 0) {\n      this.#tick()\n    }\n  }\n\n  /**\n   * Stops processing items in the queue. Does not clear the queue.\n   */\n  stop = (): void => {\n    this.#clearTimeouts()\n    this.#setState({ isRunning: false, pendingTick: false })\n  }\n\n  #clearTimeouts = (): void => {\n    this.#timeoutIds.forEach((timeoutId) => clearTimeout(timeoutId))\n    this.#timeoutIds.clear()\n  }\n\n  /**\n   * Removes all pending items from the queue.\n   * Does NOT affect active tasks.\n   */\n  clear = (): void => {\n    this.#setState({ items: [], itemTimestamps: [] })\n    this.options.onItemsChange?.(this)\n  }\n\n  /**\n   * Returns the AbortSignal for a specific execution.\n   * If no executeCount is provided, returns the signal for the most recent execution.\n   * Returns null if no execution is found or not currently executing.\n   *\n   * @param executeCount - Optional specific execution to get signal for\n   * @example\n   * ```typescript\n   * const queuer = new AsyncQueuer(\n   *   async (item: string) => {\n   *     const signal = queuer.getAbortSignal()\n   *     if (signal) {\n   *       const response = await fetch(`/api/process/${item}`, { signal })\n   *       return response.json()\n   *     }\n   *   },\n   *   { concurrency: 2 }\n   * )\n   * ```\n   */\n  getAbortSignal = (executeCount?: number): AbortSignal | null => {\n    const count = executeCount ?? this.store.state.executeCount\n    const retryer = this.asyncRetryers.get(count)\n    return retryer?.getAbortSignal() ?? null\n  }\n\n  /**\n   * Aborts all ongoing executions with the internal abort controllers.\n   * Does NOT clear out the items.\n   */\n  abort = (): void => {\n    this.asyncRetryers.forEach((retryer) => retryer.abort())\n    this.asyncRetryers.clear()\n    this.#setState({\n      isExecuting: false,\n    })\n  }\n\n  /**\n   * Resets the queuer state to its default values\n   */\n  reset = (): void => {\n    this.#setState(getDefaultAsyncQueuerState<TValue>())\n    this.options.onItemsChange?.(this)\n    this.asyncRetryers.forEach((retryer) => retryer.reset())\n  }\n}\n\n/**\n * Creates a new AsyncQueuer instance and returns a bound addItem function for adding tasks.\n * The queuer is started automatically and ready to process items.\n *\n * Async vs Sync Versions:\n * The async version provides advanced features over the sync queue function:\n * - Returns promises that can be awaited for task results\n * - Built-in retry support via AsyncRetryer integration for each queued task\n * - Abort support to cancel in-flight task executions\n * - Comprehensive error handling with onError callbacks and throwOnError control\n * - Detailed execution tracking (success/error/settle counts)\n * - Concurrent execution support (process multiple items simultaneously)\n *\n * The sync queue function is lighter weight and simpler when you don't need async features,\n * return values, or execution control.\n *\n * What is Queuing?\n * Queuing is a technique for managing and processing items sequentially or with controlled concurrency.\n * Tasks are processed up to the configured concurrency limit. When a task completes,\n * the next pending task is processed if the concurrency limit allows.\n *\n * Configuration Options:\n * - `concurrency`: Maximum number of concurrent tasks (default: 1)\n * - `wait`: Time to wait between processing items (default: 0)\n * - `maxSize`: Maximum number of items allowed in the queue (default: Infinity)\n * - `getPriority`: Function to determine item priority\n * - `addItemsTo`: Default position to add items ('back' or 'front', default: 'back')\n * - `getItemsFrom`: Default position to get items ('front' or 'back', default: 'front')\n * - `expirationDuration`: Maximum time items can stay in queue\n * - `started`: Whether to start processing immediately (default: true)\n * - `asyncRetryerOptions`: Configure retry behavior for task executions\n *\n * Error Handling:\n * - If an `onError` handler is provided, it will be called with the error and queuer instance\n * - If `throwOnError` is true (default when no onError handler is provided), the error will be thrown\n * - If `throwOnError` is false (default when onError handler is provided), the error will be swallowed\n * - Both onError and throwOnError can be used together; the handler will be called before any error is thrown\n * - The error state can be checked using the underlying AsyncQueuer instance\n *\n * State Management:\n * - Uses TanStack Store for reactive state management\n * - Use `initialState` to provide initial state values when creating the async queuer\n * - Use `onSuccess` callback to react to successful task execution and implement custom logic\n * - Use `onError` callback to react to task execution errors and implement custom error handling\n * - Use `onSettled` callback to react to task execution completion (success or error) and implement custom logic\n * - Use `onItemsChange` callback to react to items being added or removed from the queue\n * - Use `onExpire` callback to react to items expiring and implement custom logic\n * - Use `onReject` callback to react to items being rejected when the queue is full\n * - The state includes error count, expiration count, rejection count, running status, and success/settle counts\n * - State can be accessed via the underlying AsyncQueuer instance's `store.state` property\n * - When using framework adapters (React/Solid), state is accessed from the hook's state property\n *\n * @example\n * ```ts\n * const enqueue = asyncQueue<string>(async (item) => {\n *   return item.toUpperCase();\n * }, {\n *   concurrency: 2,\n *   wait: 100,\n *   onSuccess: (result) => console.log('Processed:', result)\n * });\n *\n * enqueue('hello');\n * ```\n */\nexport function asyncQueue<TValue>(\n  fn: (value: TValue) => Promise<any>,\n  initialOptions: AsyncQueuerOptions<TValue>,\n) {\n  const asyncQueuer = new AsyncQueuer<TValue>(fn, initialOptions)\n  return asyncQueuer.addItem\n}\n"],"mappings":";;;;;;;AAuFA,SAAS,6BAA+D;CACtE,OAAO;EACL,aAAa,CAAC;EACd,cAAc;EACd,YAAY;EACZ,cAAc;EACd,iBAAiB;EACjB,SAAS;EACT,aAAa;EACb,QAAQ;EACR,QAAQ;EACR,WAAW;EACX,gBAAgB,CAAC;EACjB,OAAO,CAAC;EACR,YAAY;EACZ,aAAa;EACb,gBAAgB;EAChB,cAAc;EACd,MAAM;EACN,QAAQ;EACR,cAAc;CAChB;AACF;;;;AAuGA,SAAgB,mBAKd,SAA6B;CAC7B,OAAO;AACT;AAeA,MAAM,iBAA0D;CAC9D,YAAY;CACZ,qBAAqB,EACnB,aAAa,EACf;CACA,aAAa;CACb,oBAAoB;CACpB,oBAAoB;CACpB,cAAc;CACd,cAAc,SAAc,MAAM,YAAY;CAC9C,cAAc,CAAC;CACf,SAAS;CACT,SAAS;CACT,MAAM;AACR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkEA,IAAa,cAAb,MAAiC;CAU/B;CAEA,YACE,AAAO,IACP,iBAA6C,CAAC,GAC9C;EAFO;eAZmD,IAAIA,sBAE9D,2BAAmC,CAAC;uCAGtB,IAAI,IAGlB;qCACgD,IAAI,IAAI;qBA+C5C,eAA0D;GACtE,KAAK,UAAU;IAAE,GAAG,KAAK;IAAS,GAAG;GAAW;EAClD;oBAEa,aAAsD;GACjE,KAAK,MAAM,UAAU,UAAU;IAC7B,MAAM,gBAAgB;KACpB,GAAG;KACH,GAAG;IACL;IAEA,MAAM,EAAE,aAAa,OAAO,cAAc;IAE1C,MAAM,OAAO,MAAM;IACnB,MAAM,SAAS,SAAS,KAAK,QAAQ,WAAW;IAChD,MAAM,UAAU,SAAS;IACzB,MAAM,SAAS,aAAa,WAAW,YAAY,WAAW;IAE9D,MAAM,SAAS,SAAS,SAAS,YAAY,YAAY;IAEzD,OAAO;KACL,GAAG;KACH;KACA;KACA;KACA;KACA;IACF;GACF,CAAC;GACD,gCAAW,eAAe,IAAI;EAChC;wBAMyB;GACvB,OAAOC,mCAAqB,KAAK,QAAQ,QAAQ,GAAG,IAAI;EAC1D;+BAMgC;GAC9B,OAAOA,mCAAqB,KAAK,QAAQ,eAAe,GAAG,IAAI;EACjE;qBAKc;GACZ,IAAI,CAAC,KAAK,MAAM,MAAM,WAAW;IAC/B,KAAKC,UAAU,EAAE,aAAa,MAAM,CAAC;IACrC;GACF;GACA,KAAKA,UAAU,EAAE,aAAa,KAAK,CAAC;GAGpC,KAAKC,mBAAmB;GAGxB,IAAI,qBAAqB;GACzB,MAAM,cAAc,CAAC,GAAG,KAAK,MAAM,MAAM,WAAW;GACpD,OACE,YAAY,SAAS,KAAKC,gBAAgB,KAC1C,KAAK,MAAM,MAAM,MAAM,SAAS,GAChC;IACA,MAAM,WAAW,KAAK,aAAa;IACnC,IAAI,aAAa,QACf;IAEF,YAAY,KAAK,QAAQ;IACzB,KAAKF,UAAU,EACb,aAAa,CAAC,GAAG,WAAW,EAC9B,CAAC;IACD,qBAAqB;IACpB,CAAC,YAAY;KACZ,IAAI;MACF,MAAM,KAAK,QAAQ;KACrB,QAAQ,CAIR;KAEA,MAAM,OAAO,KAAKG,SAAS;KAC3B,IAAI,OAAO,GAAG;MACZ,MAAM,YAAY,iBAAiB;OACjC,KAAKC,YAAY,OAAO,SAAS;OACjC,KAAKC,MAAM;MACb,GAAG,IAAI;MACP,KAAKD,YAAY,IAAI,SAAS;MAC9B;KACF;KAEA,KAAKC,MAAM;IACb,EAAC,CAAE;GACL;GAIA,IAAI,CAAC,oBACH,KAAKL,UAAU,EAAE,aAAa,MAAM,CAAC;EAEzC;kBAcE,MACA,WAA0B,KAAK,QAAQ,cAAc,QACrD,mBAA4B,SAChB;GACZ,KAAKA,UAAU,EACb,cAAc,KAAK,MAAM,MAAM,eAAe,EAChD,CAAC;GAID,IAAI,SAAS,QAAW;IACtB,KAAKA,UAAU,EACb,gBAAgB,KAAK,MAAM,MAAM,iBAAiB,EACpD,CAAC;IACD,KAAK,QAAQ,WAAW,MAAM,IAAI;IAClC,OAAO;GACT;GAEA,IAAI,KAAK,MAAM,MAAM,MAAM,WAAW,KAAK,QAAQ,WAAW,WAAW;IACvE,KAAKA,UAAU,EACb,gBAAgB,KAAK,MAAM,MAAM,iBAAiB,EACpD,CAAC;IACD,KAAK,QAAQ,WAAW,MAAM,IAAI;IAClC,OAAO;GACT;GAGA,MAAM,WACJ,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAa,IAAI,IAC7B,MAAc;GAErB,MAAM,QAAQ,KAAK,MAAM,MAAM;GAC/B,MAAM,iBAAiB,KAAK,MAAM,MAAM;GAExC,IAAI,aAAa,QAAW;IAE1B,MAAM,cAAc,MAAM,WAAW,aAAa;KAKhD,QAHE,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAa,QAAQ,IACjC,UAAkB,YACC;IAC5B,CAAC;IAED,IAAI,gBAAgB,IAAI;KACtB,MAAM,KAAK,IAAI;KACf,eAAe,KAAK,KAAK,IAAI,CAAC;IAChC,OAAO;KACL,MAAM,OAAO,aAAa,GAAG,IAAI;KACjC,eAAe,OAAO,aAAa,GAAG,KAAK,IAAI,CAAC;IAClD;GACF,OACE,IAAI,aAAa,SAAS;IAExB,MAAM,QAAQ,IAAI;IAClB,eAAe,QAAQ,KAAK,IAAI,CAAC;GACnC,OAAO;IAEL,MAAM,KAAK,IAAI;IACf,eAAe,KAAK,KAAK,IAAI,CAAC;GAChC;GAGF,KAAKA,UAAU;IACb;IACA;GACF,CAAC;GAED,IAAI,kBACF,KAAK,QAAQ,gBAAgB,IAAI;GAGnC,IAAI,KAAK,MAAM,MAAM,aAAa,CAAC,KAAK,MAAM,MAAM,aAClD,KAAKK,MAAM;GAGb,OAAO;EACT;sBAeE,WAA0B,KAAK,QAAQ,gBAAgB,YAChC;GACvB,MAAM,EAAE,OAAO,mBAAmB,KAAK,MAAM;GAC7C,IAAI;GAIJ,IACE,KAAK,QAAQ,gBAAgB,eAAe,eAC5C,aAAa,SACb;IACA,OAAO,MAAM;IACb,IAAI,SAAS,QACX,KAAKL,UAAU;KACb,OAAO,MAAM,MAAM,CAAC;KACpB,gBAAgB,eAAe,MAAM,CAAC;IACxC,CAAC;GAEL,OAAO;IACL,OAAO,MAAM,MAAM,SAAS;IAC5B,IAAI,SAAS,QACX,KAAKA,UAAU;KACb,OAAO,MAAM,MAAM,GAAG,EAAE;KACxB,gBAAgB,eAAe,MAAM,GAAG,EAAE;IAC5C,CAAC;GAEL;GAEA,IAAI,SAAS,QACX,KAAK,QAAQ,gBAAgB,IAAI;GAGnC,OAAO;EACT;4BAEoC;GAClC,MAAM,QAAQ,KAAK,aAAa;GAChC,KAAK,MAAM;GACX,OAAO;EACT;iBAYU,OAAO,aAA2C;GAC1D,MAAM,OAAO,KAAK,YAAY,QAAQ;GAEtC,IAAI,SAAS,QAAW;IACtB,MAAM,sBAAsB,KAAK,MAAM,MAAM,eAAe;IAC5D,KAAKA,UAAU;KACb,cAAc;KACd,aAAa;IACf,CAAC;IACD,IAAI;KACF,MAAM,sBAAsB,IAAIM,mCAC9B,KAAK,IACL,KAAK,QAAQ,mBACf;KACA,KAAK,cAAc,IAAI,qBAAqB,mBAAmB;KAC/D,MAAM,aAAa,MAAM,oBAAoB,QAAQ,IAAI;KACzD,KAAKN,UAAU;MACb,cAAc,KAAK,MAAM,MAAM,eAAe;MAC9C;KACF,CAAC;KACD,KAAK,QAAQ,YAAY,YAAY,MAAM,IAAI;IACjD,SAAS,OAAO;KACd,KAAKA,UAAU,EACb,YAAY,KAAK,MAAM,MAAM,aAAa,EAC5C,CAAC;KACD,KAAK,QAAQ,UAAU,OAAgB,MAAM,IAAI;KACjD,IAAI,KAAK,QAAQ,cACf,MAAM;IAEV,UAAU;KACR,KAAK,cAAc,OAAO,mBAAmB;KAG7C,MAAM,uBAAuB,CAAC,GAAG,KAAK,MAAM,MAAM,WAAW;KAC7D,MAAM,kBAAkB,qBAAqB,QAAQ,IAAI;KACzD,IAAI,oBAAoB,IACtB,qBAAqB,OAAO,iBAAiB,CAAC;KAEhD,KAAKA,UAAU;MACb,aAAa;MAEb,aAAa,KAAK,cAAc,OAAO;MACvC,cAAc,KAAK,MAAM,MAAM,eAAe;KAChD,CAAC;KACD,KAAK,QAAQ,YAAY,MAAM,IAAI;IACrC;GACF;GACA,OAAO;EACT;eAMQ,OACN,gBAAwB,KAAK,MAAM,MAAM,MAAM,QAC/C,aACkB;GAClB,KAAKO,eAAe;GACpB,MAAM,UAAU,MAAM,QAAQ,WAC5B,MAAM,KAAK,EAAE,QAAQ,cAAc,SAAS,KAAK,QAAQ,QAAQ,CAAC,CACpE;GAIA,KAAKP,UAAU,EAAE,aAAa,MAAM,CAAC;GACrC,IAAI,KAAK,MAAM,MAAM,aAAa,KAAK,MAAM,MAAM,MAAM,SAAS,GAAG;IACnE,MAAM,OAAO,KAAKG,SAAS;IAC3B,IAAI,OAAO,GAAG;KACZ,KAAKH,UAAU,EAAE,aAAa,KAAK,CAAC;KACpC,MAAM,YAAY,iBAAiB;MACjC,KAAKI,YAAY,OAAO,SAAS;MACjC,KAAKC,MAAM;KACb,GAAG,IAAI;KACP,KAAKD,YAAY,IAAI,SAAS;IAChC,OACE,KAAKC,MAAM;GAEf;GACA,MAAM,UAAU,QAAQ,MACrB,WAA4C,OAAO,WAAW,UACjE;GACA,IAAI,SACF,MAAM,QAAQ;EAElB;sBAMe,OACb,kBACkB;GAClB,KAAKE,eAAe;GACpB,MAAM,QAAQ,KAAKC,aAAa;GAChC,IAAI;IACF,MAAM,cAAc,KAAK;GAC3B,UAAU;IAER,KAAKR,UAAU,EAAE,aAAa,MAAM,CAAC;IACrC,IAAI,KAAK,MAAM,MAAM,aAAa,KAAK,MAAM,MAAM,MAAM,SAAS,GAChE,KAAKK,MAAM;GAEf;EACF;kCAMiC;GAC/B,KACG,KAAK,QAAQ,sBAAsB,cAAc,YAClD,KAAK,QAAQ,iBAAiB,eAAe,cAE7C;GAGF,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,iBAAgC,CAAC;GAGvC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,MAAM,MAAM,QAAQ,KAAK;IACtD,MAAM,YAAY,KAAK,MAAM,MAAM,eAAe;IAClD,IAAI,cAAc,QAAW;IAE7B,MAAM,OAAO,KAAK,MAAM,MAAM,MAAM;IACpC,IAAI,SAAS,QAAW;IAOxB,IAJE,KAAK,QAAQ,iBAAiB,eAAe,eACzC,KAAK,QAAQ,aAAc,MAAM,SAAS,IAC1C,MAAM,aAAa,KAAK,QAAQ,sBAAsB,WAG1D,eAAe,KAAK,CAAC;GAEzB;GAGA,KAAK,IAAI,IAAI,eAAe,SAAS,GAAG,KAAK,GAAG,KAAK;IACnD,MAAM,QAAQ,eAAe;IAC7B,IAAI,UAAU,QAAW;IAEzB,MAAM,cAAc,KAAK,MAAM,MAAM,MAAM;IAC3C,IAAI,gBAAgB,QAAW;IAE/B,MAAM,WAAW,CAAC,GAAG,KAAK,MAAM,MAAM,KAAK;IAC3C,MAAM,gBAAgB,CAAC,GAAG,KAAK,MAAM,MAAM,cAAc;IACzD,SAAS,OAAO,OAAO,CAAC;IACxB,cAAc,OAAO,OAAO,CAAC;IAC7B,KAAKL,UAAU;KACb,OAAO;KACP,gBAAgB;KAChB,iBAAiB,KAAK,MAAM,MAAM,kBAAkB;IACtD,CAAC;IACD,KAAK,QAAQ,WAAW,aAAa,IAAI;GAC3C;GAEA,IAAI,eAAe,SAAS,GAC1B,KAAK,QAAQ,gBAAgB,IAAI;EAErC;uBAWgB,WAA0B,YAAgC;GACxE,IAAI,aAAa,SACf,OAAO,KAAK,MAAM,MAAM,MAAM;GAEhC,OAAO,KAAK,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,SAAS;EAChE;4BAKoC;GAClC,OAAO,CAAC,GAAG,KAAK,gBAAgB,GAAG,GAAG,KAAK,iBAAiB,CAAC;EAC/D;+BAKuC;GACrC,OAAO,CAAC,GAAG,KAAK,MAAM,MAAM,WAAW;EACzC;gCAKwC;GACtC,OAAO,CAAC,GAAG,KAAK,MAAM,MAAM,KAAK;EACnC;qBAKoB;GAClB,KAAKA,UAAU,EAAE,WAAW,KAAK,CAAC;GAClC,IAAI,CAAC,KAAK,MAAM,MAAM,eAAe,KAAK,MAAM,MAAM,MAAM,SAAS,GACnE,KAAKK,MAAM;EAEf;oBAKmB;GACjB,KAAKE,eAAe;GACpB,KAAKP,UAAU;IAAE,WAAW;IAAO,aAAa;GAAM,CAAC;EACzD;8BAE6B;GAC3B,KAAKI,YAAY,SAAS,cAAc,aAAa,SAAS,CAAC;GAC/D,KAAKA,YAAY,MAAM;EACzB;qBAMoB;GAClB,KAAKJ,UAAU;IAAE,OAAO,CAAC;IAAG,gBAAgB,CAAC;GAAE,CAAC;GAChD,KAAK,QAAQ,gBAAgB,IAAI;EACnC;yBAsBkB,iBAA8C;GAC9D,MAAM,QAAQ,gBAAgB,KAAK,MAAM,MAAM;GAE/C,OADgB,KAAK,cAAc,IAAI,KAC1B,CAAC,EAAE,eAAe,KAAK;EACtC;qBAMoB;GAClB,KAAK,cAAc,SAAS,YAAY,QAAQ,MAAM,CAAC;GACvD,KAAK,cAAc,MAAM;GACzB,KAAKA,UAAU,EACb,aAAa,MACf,CAAC;EACH;qBAKoB;GAClB,KAAKA,UAAU,2BAAmC,CAAC;GACnD,KAAK,QAAQ,gBAAgB,IAAI;GACjC,KAAK,cAAc,SAAS,YAAY,QAAQ,MAAM,CAAC;EACzD;EAvkBE,KAAK,MAAM,eAAe;EAC1B,KAAK,UAAU;GACb,GAAG;GACH,GAAG;GACH,cAAc,eAAe,gBAAgB,CAAC,eAAe;EAC/D;EACA,MAAM,qBACJ,KAAK,QAAQ,cAAc,aAAa,KAAK,QAAQ,WAAW;EAClE,KAAKA,UAAU;GACb,GAAG,KAAK,QAAQ;GAChB,WAAW;EACb,CAAC;EAED,IAAI,KAAK,QAAQ,cAAc,OAC7B;OAAI,KAAK,MAAM,MAAM,WACnB,KAAKK,MAAM;EACb,OAEA,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,QAAQ,cAAc,UAAU,IAAI,KAAK;GACjE,MAAM,OAAO,KAAK,QAAQ,aAAc;GACxC,MAAM,SAAS,OAAO,KAAK,QAAQ,cAAc,UAAU,KAAK;GAChE,KAAK,QAAQ,MAAM,KAAK,QAAQ,cAAc,QAAQ,MAAM;EAC9D;EAGF,IAAI,KAAK,KACP,sCAAiB,GAAG,kBAAkB,MAAM;GAC1C,IAAI,EAAE,QAAQ,QAAQ,KAAK,KAAK;GAChC,KAAKL,UACH,EAAE,QAAQ,MAAM,KAClB;GACA,KAAK,WACH,EAAE,QAAQ,OACZ;EACF,CAAC;CAEL;CASA;;;;;CAgCA;;;;;CAQA;;;;CAOA;CAoMA;;;;;CA+HA;CA6GA;AA4DF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmEA,SAAgB,WACd,IACA,gBACA;CAEA,OAAO,IADiB,YAAoB,IAAI,cAC/B,CAAC,CAAC;AACrB"}

package/dist/async-queuer.d.cts

@@ -1,440 +0,0 @@
-import { AsyncRetryer, AsyncRetryerOptions } from "./async-retryer.cjs";
-import { QueuePosition } from "./queuer.cjs";
-import { Store } from "@tanstack/store";
-//#region src/async-queuer.d.ts
-interface AsyncQueuerState<TValue> {
-  /**
-   * Items currently being processed by the queuer
-   */
-  activeItems: Array<TValue>;
-  /**
-   * Number of times addItem has been called (for reduction calculations)
-   */
-  addItemCount: number;
-  /**
-   * Number of task executions that have resulted in errors
-   */
-  errorCount: number;
-  /**
-   * Number of times execute has been called
-   */
-  executeCount: 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 is currently executing
-   */
-  isExecuting: 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>;
-  /**
-   * The result from the most recent task execution
-   */
-  lastResult: any;
-  /**
-   * 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 task executions that have completed (either successfully or with errors)
-   */
-  settledCount: 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';
-  /**
-   * Number of task executions that have completed successfully
-   */
-  successCount: number;
-}
-interface AsyncQueuerOptions<TValue> {
-  /**
-   * Options for configuring the underlying async retryer
-   */
-  asyncRetryerOptions?: AsyncRetryerOptions<(item: TValue) => Promise<any>>;
-  /**
-   * Default position to add items to the queuer
-   * @default 'back'
-   */
-  addItemsTo?: QueuePosition;
-  /**
-   * Maximum number of concurrent tasks to process.
-   * Can be a number or a function that returns a number.
-   * @default 1
-   */
-  concurrency?: number | ((queuer: AsyncQueuer<TValue>) => number);
-  /**
-   * 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
-   * If not provided, will use static priority values attached to tasks
-   */
-  getPriority?: (item: TValue) => number;
-  /**
-   * Initial items to populate the queuer with
-   */
-  initialItems?: Array<TValue>;
-  /**
-   * Initial state for the async queuer
-   */
-  initialState?: Partial<AsyncQueuerState<TValue>>;
-  /**
-   * Optional key to identify this async queuer instance.
-   * If provided, the async 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;
-  /**
-   * Optional error handler for when a task throws.
-   * If provided, the handler will be called with the error and queuer instance.
-   * This can be used alongside throwOnError - the handler will be called before any error is thrown.
-   */
-  onError?: (error: Error, item: TValue, queuer: AsyncQueuer<TValue>) => void;
-  /**
-   * Callback fired whenever an item expires in the queuer
-   */
-  onExpire?: (item: TValue, queuer: AsyncQueuer<TValue>) => void;
-  /**
-   * Callback fired whenever an item is added or removed from the queuer
-   */
-  onItemsChange?: (queuer: AsyncQueuer<TValue>) => void;
-  /**
-   * Callback fired whenever an item is rejected from being added to the queuer
-   */
-  onReject?: (item: TValue, queuer: AsyncQueuer<TValue>) => void;
-  /**
-   * Optional callback to call when a task is settled
-   */
-  onSettled?: (item: TValue, queuer: AsyncQueuer<TValue>) => void;
-  /**
-   * Optional callback to call when a task succeeds
-   */
-  onSuccess?: (result: any, item: TValue, queuer: AsyncQueuer<TValue>) => void;
-  /**
-   * Whether the queuer should start processing tasks immediately or not.
-   */
-  started?: boolean;
-  /**
-   * Whether to throw errors when they occur.
-   * Defaults to true if no onError handler is provided, false if an onError handler is provided.
-   * Can be explicitly set to override these defaults.
-   */
-  throwOnError?: 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: AsyncQueuer<TValue>) => number);
-}
-/**
- * Utility function for sharing common `AsyncQueuerOptions` options between different `AsyncQueuer` instances.
- */
-declare function asyncQueuerOptions<TValue = any, TOptions extends Partial<AsyncQueuerOptions<TValue>> = Partial<AsyncQueuerOptions<TValue>>>(options: TOptions): TOptions;
-/**
- * A flexible asynchronous queue for processing tasks with configurable concurrency, priority, and expiration.
- *
- * Async vs Sync Versions:
- * The async version provides advanced features over the sync Queuer:
- * - Returns promises that can be awaited for task results
- * - Built-in retry support via AsyncRetryer integration for each queued task
- * - Abort support to cancel in-flight task executions
- * - Comprehensive error handling with onError callbacks and throwOnError control
- * - Detailed execution tracking (success/error/settle counts)
- * - Concurrent execution support (process multiple items simultaneously)
- *
- * The sync Queuer is lighter weight and simpler when you don't need async features,
- * return values, or execution control.
- *
- * What is Queuing?
- * Queuing is a technique for managing and processing items sequentially or with controlled concurrency.
- * Tasks are processed up to the configured concurrency limit. When a task completes,
- * the next pending task is processed if the concurrency limit allows.
- *
- * Key Features:
- * - Priority queue support via the getPriority option
- * - Configurable concurrency limit
- * - Callbacks for task success, error, completion, and queue state changes
- * - FIFO (First In First Out) or LIFO (Last In First Out) queue behavior
- * - Pause and resume processing
- * - Item expiration to remove stale items from the queue
- *
- * Error Handling:
- * - If an `onError` handler is provided, it will be called with the error and queuer instance
- * - If `throwOnError` is true (default when no onError handler is provided), the error will be thrown
- * - If `throwOnError` is false (default when onError handler is provided), the error will be swallowed
- * - Both onError and throwOnError can be used together; the handler will be called before any error is thrown
- * - The error state can be checked using the AsyncQueuer instance
- *
- * State Management:
- * - Uses TanStack Store for reactive state management
- * - Use `initialState` to provide initial state values when creating the async queuer
- * - Use `onSuccess` callback to react to successful task execution and implement custom logic
- * - Use `onError` callback to react to task execution errors and implement custom error handling
- * - Use `onSettled` callback to react to task execution completion (success or error) 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 error count, expiration count, rejection count, running status, and success/settle counts
- * - State can be accessed via `asyncQueuer.store.state` when using the class directly
- * - When using framework adapters (React/Solid), state is accessed from `asyncQueuer.state`
- *
- * Example usage:
- * ```ts
- * const asyncQueuer = new AsyncQueuer<string>(async (item) => {
- *   // process item
- *   return item.toUpperCase();
- * }, {
- *   concurrency: 2,
- *   onSuccess: (result) => {
- *     console.log(result);
- *   }
- * });
- *
- * asyncQueuer.addItem('hello');
- * asyncQueuer.start();
- * ```
- */
-declare class AsyncQueuer<TValue> {
-  #private;
-  fn: (item: TValue) => Promise<any>;
-  readonly store: Store<Readonly<AsyncQueuerState<TValue>>>;
-  key: string | undefined;
-  options: AsyncQueuerOptions<TValue>;
-  asyncRetryers: Map<number, AsyncRetryer<(item: TValue) => Promise<any>>>;
-  constructor(fn: (item: TValue) => Promise<any>, initialOptions?: AsyncQueuerOptions<TValue>);
-  /**
-   * Updates the queuer options. New options are merged with existing options.
-   */
-  setOptions: (newOptions: Partial<AsyncQueuerOptions<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.
-   * `undefined` cannot be queued (it is the internal "no item" sentinel) and is always rejected.
-   *
-   * @example
-   * ```ts
-   * queuer.addItem({ value: 'task', priority: 10 });
-   * queuer.addItem('task2', 'front');
-   * ```
-   */
-  addItem: (item: TValue, position?: QueuePosition, runOnItemsChange?: boolean) => boolean;
-  /**
-   * Removes and returns the next item from the queue without executing the task function.
-   * Use for manual queue management. Normally, use execute() to process items.
-   *
-   * @example
-   * ```ts
-   * // FIFO
-   * queuer.getNextItem();
-   * // LIFO
-   * queuer.getNextItem('back');
-   * ```
-   */
-  getNextItem: (position?: QueuePosition) => TValue | undefined;
-  /**
-   * Removes and returns the next item from the queue and executes the task function with it.
-   *
-   * @example
-   * ```ts
-   * queuer.execute();
-   * // LIFO
-   * queuer.execute('back');
-   * ```
-   */
-  execute: (position?: QueuePosition) => Promise<any>;
-  /**
-   * 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) => Promise<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>) => Promise<any>) => Promise<void>;
-  /**
-   * Returns the next item in the queue without removing it.
-   *
-   * @example
-   * ```ts
-   * queuer.peekNextItem(); // front
-   * queuer.peekNextItem('back'); // back
-   * ```
-   */
-  peekNextItem: (position?: QueuePosition) => TValue | undefined;
-  /**
-   * Returns a copy of all items in the queue, including active and pending items.
-   */
-  peekAllItems: () => Array<TValue>;
-  /**
-   * Returns the items currently being processed (active tasks).
-   */
-  peekActiveItems: () => Array<TValue>;
-  /**
-   * Returns the items waiting to be processed (pending tasks).
-   */
-  peekPendingItems: () => Array<TValue>;
-  /**
-   * Starts processing items in the queue. If already running, 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 active tasks.
-   */
-  clear: () => void;
-  /**
-   * Returns the AbortSignal for a specific execution.
-   * If no executeCount is provided, returns the signal for the most recent execution.
-   * Returns null if no execution is found or not currently executing.
-   *
-   * @param executeCount - Optional specific execution to get signal for
-   * @example
-   * ```typescript
-   * const queuer = new AsyncQueuer(
-   *   async (item: string) => {
-   *     const signal = queuer.getAbortSignal()
-   *     if (signal) {
-   *       const response = await fetch(`/api/process/${item}`, { signal })
-   *       return response.json()
-   *     }
-   *   },
-   *   { concurrency: 2 }
-   * )
-   * ```
-   */
-  getAbortSignal: (executeCount?: number) => AbortSignal | null;
-  /**
-   * Aborts all ongoing executions with the internal abort controllers.
-   * Does NOT clear out the items.
-   */
-  abort: () => void;
-  /**
-   * Resets the queuer state to its default values
-   */
-  reset: () => void;
-}
-/**
- * Creates a new AsyncQueuer instance and returns a bound addItem function for adding tasks.
- * The queuer is started automatically and ready to process items.
- *
- * Async vs Sync Versions:
- * The async version provides advanced features over the sync queue function:
- * - Returns promises that can be awaited for task results
- * - Built-in retry support via AsyncRetryer integration for each queued task
- * - Abort support to cancel in-flight task executions
- * - Comprehensive error handling with onError callbacks and throwOnError control
- * - Detailed execution tracking (success/error/settle counts)
- * - Concurrent execution support (process multiple items simultaneously)
- *
- * The sync queue function is lighter weight and simpler when you don't need async features,
- * return values, or execution control.
- *
- * What is Queuing?
- * Queuing is a technique for managing and processing items sequentially or with controlled concurrency.
- * Tasks are processed up to the configured concurrency limit. When a task completes,
- * the next pending task is processed if the concurrency limit allows.
- *
- * Configuration Options:
- * - `concurrency`: Maximum number of concurrent tasks (default: 1)
- * - `wait`: Time to wait between processing items (default: 0)
- * - `maxSize`: Maximum number of items allowed in the queue (default: Infinity)
- * - `getPriority`: Function to determine item priority
- * - `addItemsTo`: Default position to add items ('back' or 'front', default: 'back')
- * - `getItemsFrom`: Default position to get items ('front' or 'back', default: 'front')
- * - `expirationDuration`: Maximum time items can stay in queue
- * - `started`: Whether to start processing immediately (default: true)
- * - `asyncRetryerOptions`: Configure retry behavior for task executions
- *
- * Error Handling:
- * - If an `onError` handler is provided, it will be called with the error and queuer instance
- * - If `throwOnError` is true (default when no onError handler is provided), the error will be thrown
- * - If `throwOnError` is false (default when onError handler is provided), the error will be swallowed
- * - Both onError and throwOnError can be used together; the handler will be called before any error is thrown
- * - The error state can be checked using the underlying AsyncQueuer instance
- *
- * State Management:
- * - Uses TanStack Store for reactive state management
- * - Use `initialState` to provide initial state values when creating the async queuer
- * - Use `onSuccess` callback to react to successful task execution and implement custom logic
- * - Use `onError` callback to react to task execution errors and implement custom error handling
- * - Use `onSettled` callback to react to task execution completion (success or error) 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 error count, expiration count, rejection count, running status, and success/settle counts
- * - State can be accessed via the underlying AsyncQueuer instance's `store.state` property
- * - When using framework adapters (React/Solid), state is accessed from the hook's state property
- *
- * @example
- * ```ts
- * const enqueue = asyncQueue<string>(async (item) => {
- *   return item.toUpperCase();
- * }, {
- *   concurrency: 2,
- *   wait: 100,
- *   onSuccess: (result) => console.log('Processed:', result)
- * });
- *
- * enqueue('hello');
- * ```
- */
-declare function asyncQueue<TValue>(fn: (value: TValue) => Promise<any>, initialOptions: AsyncQueuerOptions<TValue>): (item: TValue, position?: QueuePosition, runOnItemsChange?: boolean) => boolean;
-//#endregion
-export { AsyncQueuer, AsyncQueuerOptions, AsyncQueuerState, asyncQueue, asyncQueuerOptions };
-//# sourceMappingURL=async-queuer.d.cts.map

package/dist/async-queuer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-queuer.js","names":["#setState","#checkExpiredItems","#getConcurrency","#getWait","#timeoutIds","#tick","#clearTimeouts","#getAllItems"],"sources":["../src/async-queuer.ts"],"sourcesContent":["import { Store } from '@tanstack/store'\nimport { AsyncRetryer } from './async-retryer'\nimport { parseFunctionOrValue } from './utils'\nimport { emitChange, pacerEventClient } from './event-client'\nimport type { AsyncRetryerOptions } from './async-retryer'\nimport type { OptionalKeys } from './types'\nimport type { QueuePosition } from './queuer'\n\nexport interface AsyncQueuerState<TValue> {\n  /**\n   * Items currently being processed by the queuer\n   */\n  activeItems: Array<TValue>\n  /**\n   * Number of times addItem has been called (for reduction calculations)\n   */\n  addItemCount: number\n  /**\n   * Number of task executions that have resulted in errors\n   */\n  errorCount: number\n  /**\n   * Number of times execute has been called\n   */\n  executeCount: number\n  /**\n   * Number of items that have been removed from the queue due to expiration\n   */\n  expirationCount: number\n  /**\n   * Whether the queuer has no items to process (items array is empty)\n   */\n  isEmpty: boolean\n  /**\n   * Whether the queuer is currently executing\n   */\n  isExecuting: boolean\n  /**\n   * Whether the queuer has reached its maximum capacity\n   */\n  isFull: boolean\n  /**\n   * Whether the queuer is not currently processing any items\n   */\n  isIdle: boolean\n  /**\n   * Whether the queuer is active and will process items automatically\n   */\n  isRunning: boolean\n  /**\n   * Array of items currently waiting to be processed\n   */\n  items: Array<TValue>\n  /**\n   * Timestamps when items were added to the queue for expiration tracking\n   */\n  itemTimestamps: Array<number>\n  /**\n   * The result from the most recent task execution\n   */\n  lastResult: any\n  /**\n   * Whether the queuer has a pending timeout for processing the next item\n   */\n  pendingTick: boolean\n  /**\n   * Number of items that have been rejected from being added to the queue\n   */\n  rejectionCount: number\n  /**\n   * Number of task executions that have completed (either successfully or with errors)\n   */\n  settledCount: number\n  /**\n   * Number of items currently in the queue\n   */\n  size: number\n  /**\n   * Current processing status - 'idle' when not processing, 'running' when active, 'stopped' when paused\n   */\n  status: 'idle' | 'running' | 'stopped'\n  /**\n   * Number of task executions that have completed successfully\n   */\n  successCount: number\n}\n\nfunction getDefaultAsyncQueuerState<TValue>(): AsyncQueuerState<TValue> {\n  return {\n    activeItems: [],\n    addItemCount: 0,\n    errorCount: 0,\n    executeCount: 0,\n    expirationCount: 0,\n    isEmpty: true,\n    isExecuting: false,\n    isFull: false,\n    isIdle: true,\n    isRunning: true,\n    itemTimestamps: [],\n    items: [],\n    lastResult: null,\n    pendingTick: false,\n    rejectionCount: 0,\n    settledCount: 0,\n    size: 0,\n    status: 'idle',\n    successCount: 0,\n  }\n}\n\nexport interface AsyncQueuerOptions<TValue> {\n  /**\n   * Options for configuring the underlying async retryer\n   */\n  asyncRetryerOptions?: AsyncRetryerOptions<(item: TValue) => Promise<any>>\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   * Can be a number or a function that returns a number.\n   * @default 1\n   */\n  concurrency?: number | ((queuer: AsyncQueuer<TValue>) => number)\n  /**\n   * Maximum time in milliseconds that an item can stay in the queue\n   * If not provided, items will never expire\n   */\n  expirationDuration?: number\n  /**\n   * Function to determine if an item has expired\n   * If provided, this overrides the expirationDuration behavior\n   */\n  getIsExpired?: (item: TValue, addedAt: number) => boolean\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: TValue) => number\n  /**\n   * Initial items to populate the queuer with\n   */\n  initialItems?: Array<TValue>\n  /**\n   * Initial state for the async queuer\n   */\n  initialState?: Partial<AsyncQueuerState<TValue>>\n  /**\n   * Optional key to identify this async queuer instance.\n   * If provided, the async queuer will be identified by this key in the devtools and PacerProvider if applicable.\n   */\n  key?: string\n  /**\n   * Maximum number of items allowed in the queuer\n   */\n  maxSize?: number\n  /**\n   * Optional error handler for when a task throws.\n   * If provided, the handler will be called with the error and queuer instance.\n   * This can be used alongside throwOnError - the handler will be called before any error is thrown.\n   */\n  onError?: (error: Error, item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Callback fired whenever an item expires in the queuer\n   */\n  onExpire?: (item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Callback fired whenever an item is added or removed from the queuer\n   */\n  onItemsChange?: (queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Callback fired whenever an item is rejected from being added to the queuer\n   */\n  onReject?: (item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Optional callback to call when a task is settled\n   */\n  onSettled?: (item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Optional callback to call when a task succeeds\n   */\n  onSuccess?: (result: any, item: TValue, queuer: AsyncQueuer<TValue>) => void\n  /**\n   * Whether the queuer should start processing tasks immediately or not.\n   */\n  started?: boolean\n  /**\n   * Whether to throw errors when they occur.\n   * Defaults to true if no onError handler is provided, false if an onError handler is provided.\n   * Can be explicitly set to override these defaults.\n   */\n  throwOnError?: boolean\n  /**\n   * Time in milliseconds to wait between processing items.\n   * Can be a number or a function that returns a number.\n   * @default 0\n   */\n  wait?: number | ((queuer: AsyncQueuer<TValue>) => number)\n}\n\n/**\n * Utility function for sharing common `AsyncQueuerOptions` options between different `AsyncQueuer` instances.\n */\nexport function asyncQueuerOptions<\n  TValue = any,\n  TOptions extends Partial<AsyncQueuerOptions<TValue>> = Partial<\n    AsyncQueuerOptions<TValue>\n  >,\n>(options: TOptions): TOptions {\n  return options\n}\n\ntype AsyncQueuerOptionsWithOptionalCallbacks = OptionalKeys<\n  Required<AsyncQueuerOptions<any>>,\n  | 'initialState'\n  | 'throwOnError'\n  | 'onSuccess'\n  | 'onSettled'\n  | 'onReject'\n  | 'onItemsChange'\n  | 'onExpire'\n  | 'onError'\n  | 'key'\n>\n\nconst defaultOptions: AsyncQueuerOptionsWithOptionalCallbacks = {\n  addItemsTo: 'back',\n  asyncRetryerOptions: {\n    maxAttempts: 1,\n  },\n  concurrency: 1,\n  expirationDuration: Infinity,\n  getIsExpired: () => false,\n  getItemsFrom: 'front',\n  getPriority: (item: any) => item?.priority ?? 0,\n  initialItems: [],\n  maxSize: Infinity,\n  started: true,\n  wait: 0,\n}\n\n/**\n * A flexible asynchronous queue for processing tasks with configurable concurrency, priority, and expiration.\n *\n * Async vs Sync Versions:\n * The async version provides advanced features over the sync Queuer:\n * - Returns promises that can be awaited for task results\n * - Built-in retry support via AsyncRetryer integration for each queued task\n * - Abort support to cancel in-flight task executions\n * - Comprehensive error handling with onError callbacks and throwOnError control\n * - Detailed execution tracking (success/error/settle counts)\n * - Concurrent execution support (process multiple items simultaneously)\n *\n * The sync Queuer is lighter weight and simpler when you don't need async features,\n * return values, or execution control.\n *\n * What is Queuing?\n * Queuing is a technique for managing and processing items sequentially or with controlled concurrency.\n * Tasks are processed up to the configured concurrency limit. When a task completes,\n * the next pending task is processed if the concurrency limit allows.\n *\n * Key Features:\n * - Priority queue support via the getPriority option\n * - Configurable concurrency limit\n * - Callbacks for task success, error, completion, and queue state changes\n * - FIFO (First In First Out) or LIFO (Last In First Out) queue behavior\n * - Pause and resume processing\n * - Item expiration to remove stale items from the queue\n *\n * Error Handling:\n * - If an `onError` handler is provided, it will be called with the error and queuer instance\n * - If `throwOnError` is true (default when no onError handler is provided), the error will be thrown\n * - If `throwOnError` is false (default when onError handler is provided), the error will be swallowed\n * - Both onError and throwOnError can be used together; the handler will be called before any error is thrown\n * - The error state can be checked using the AsyncQueuer instance\n *\n * State Management:\n * - Uses TanStack Store for reactive state management\n * - Use `initialState` to provide initial state values when creating the async queuer\n * - Use `onSuccess` callback to react to successful task execution and implement custom logic\n * - Use `onError` callback to react to task execution errors and implement custom error handling\n * - Use `onSettled` callback to react to task execution completion (success or error) and implement custom logic\n * - Use `onItemsChange` callback to react to items being added or removed from the queue\n * - Use `onExpire` callback to react to items expiring and implement custom logic\n * - Use `onReject` callback to react to items being rejected when the queue is full\n * - The state includes error count, expiration count, rejection count, running status, and success/settle counts\n * - State can be accessed via `asyncQueuer.store.state` when using the class directly\n * - When using framework adapters (React/Solid), state is accessed from `asyncQueuer.state`\n *\n * Example usage:\n * ```ts\n * const asyncQueuer = new AsyncQueuer<string>(async (item) => {\n *   // process item\n *   return item.toUpperCase();\n * }, {\n *   concurrency: 2,\n *   onSuccess: (result) => {\n *     console.log(result);\n *   }\n * });\n *\n * asyncQueuer.addItem('hello');\n * asyncQueuer.start();\n * ```\n */\nexport class AsyncQueuer<TValue> {\n  readonly store: Store<Readonly<AsyncQueuerState<TValue>>> = new Store<\n    AsyncQueuerState<TValue>\n  >(getDefaultAsyncQueuerState<TValue>())\n  key: string | undefined\n  options: AsyncQueuerOptions<TValue>\n  asyncRetryers = new Map<\n    number,\n    AsyncRetryer<(item: TValue) => Promise<any>>\n  >()\n  #timeoutIds: Set<ReturnType<typeof setTimeout>> = new Set()\n\n  constructor(\n    public fn: (item: TValue) => Promise<any>,\n    initialOptions: AsyncQueuerOptions<TValue> = {},\n  ) {\n    this.key = initialOptions.key\n    this.options = {\n      ...defaultOptions,\n      ...initialOptions,\n      throwOnError: initialOptions.throwOnError ?? !initialOptions.onError,\n    }\n    const isInitiallyRunning =\n      this.options.initialState?.isRunning ?? this.options.started ?? true\n    this.#setState({\n      ...this.options.initialState,\n      isRunning: isInitiallyRunning,\n    })\n\n    if (this.options.initialState?.items) {\n      if (this.store.state.isRunning) {\n        this.#tick()\n      }\n    } else {\n      for (let i = 0; i < (this.options.initialItems?.length ?? 0); i++) {\n        const item = this.options.initialItems![i]!\n        const isLast = i === (this.options.initialItems?.length ?? 0) - 1\n        this.addItem(item, this.options.addItemsTo ?? 'back', isLast)\n      }\n    }\n\n    if (this.key) {\n      pacerEventClient.on('d-AsyncQueuer', (e) => {\n        if (e.payload.key !== this.key) return\n        this.#setState(\n          e.payload.store.state as Partial<AsyncQueuerState<TValue>>,\n        )\n        this.setOptions(\n          e.payload.options as Partial<AsyncQueuerOptions<TValue>>,\n        )\n      })\n    }\n  }\n\n  /**\n   * Updates the queuer options. New options are merged with existing options.\n   */\n  setOptions = (newOptions: Partial<AsyncQueuerOptions<TValue>>): void => {\n    this.options = { ...this.options, ...newOptions }\n  }\n\n  #setState = (newState: Partial<AsyncQueuerState<TValue>>): void => {\n    this.store.setState((state) => {\n      const combinedState = {\n        ...state,\n        ...newState,\n      }\n\n      const { activeItems, items, isRunning } = combinedState\n\n      const size = items.length\n      const isFull = size >= (this.options.maxSize ?? Infinity)\n      const isEmpty = size === 0\n      const isIdle = isRunning && isEmpty && activeItems.length === 0\n\n      const status = isIdle ? 'idle' : isRunning ? 'running' : 'stopped'\n\n      return {\n        ...combinedState,\n        isEmpty,\n        isFull,\n        isIdle,\n        size,\n        status,\n      }\n    })\n    emitChange('AsyncQueuer', this)\n  }\n\n  /**\n   * Returns the current wait time (in milliseconds) between processing items.\n   * If a function is provided, it is called with the queuer instance.\n   */\n  #getWait = (): number => {\n    return parseFunctionOrValue(this.options.wait ?? 0, this)\n  }\n\n  /**\n   * Returns the current concurrency limit for processing items.\n   * If a function is provided, it is called with the queuer instance.\n   */\n  #getConcurrency = (): number => {\n    return parseFunctionOrValue(this.options.concurrency ?? 1, this)\n  }\n\n  /**\n   * Processes items in the queue up to the concurrency limit. Internal use only.\n   */\n  #tick = () => {\n    if (!this.store.state.isRunning) {\n      this.#setState({ pendingTick: false })\n      return\n    }\n    this.#setState({ pendingTick: true })\n\n    // Check for expired items\n    this.#checkExpiredItems()\n\n    // Process items concurrently up to the concurrency limit\n    let scheduledAsyncWork = false\n    const activeItems = [...this.store.state.activeItems]\n    while (\n      activeItems.length < this.#getConcurrency() &&\n      this.store.state.items.length > 0\n    ) {\n      const nextItem = this.peekNextItem()\n      if (nextItem === undefined) {\n        break\n      }\n      activeItems.push(nextItem)\n      this.#setState({\n        activeItems: [...activeItems],\n      })\n      scheduledAsyncWork = true\n      ;(async () => {\n        try {\n          await this.execute()\n        } catch {\n          // errors are already surfaced via onError/errorCount (and rethrown to\n          // direct execute/flush callers); swallowing here prevents unhandled\n          // rejections and keeps the processing chain alive\n        }\n\n        const wait = this.#getWait()\n        if (wait > 0) {\n          const timeoutId = setTimeout(() => {\n            this.#timeoutIds.delete(timeoutId)\n            this.#tick()\n          }, wait)\n          this.#timeoutIds.add(timeoutId)\n          return\n        }\n\n        this.#tick()\n      })()\n    }\n\n    // pendingTick must stay true while executions or wait timers are pending so\n    // that addItem does not trigger an extra tick that bypasses the wait period\n    if (!scheduledAsyncWork) {\n      this.#setState({ pendingTick: false })\n    }\n  }\n\n  /**\n   * Adds an item to the queue. If the queue is full, the item is rejected and onReject is called.\n   * Items can be inserted based on priority or at the front/back depending on configuration.\n   * `undefined` cannot be queued (it is the internal \"no item\" sentinel) and is always rejected.\n   *\n   * @example\n   * ```ts\n   * queuer.addItem({ value: 'task', priority: 10 });\n   * queuer.addItem('task2', 'front');\n   * ```\n   */\n  addItem = (\n    item: TValue,\n    position: QueuePosition = this.options.addItemsTo ?? 'back',\n    runOnItemsChange: boolean = true,\n  ): boolean => {\n    this.#setState({\n      addItemCount: this.store.state.addItemCount + 1,\n    })\n\n    // undefined is the internal \"no item\" sentinel (peekNextItem/getNextItem);\n    // queuing it would wedge the processing loop and block items behind it\n    if (item === undefined) {\n      this.#setState({\n        rejectionCount: this.store.state.rejectionCount + 1,\n      })\n      this.options.onReject?.(item, this)\n      return false\n    }\n\n    if (this.store.state.items.length >= (this.options.maxSize ?? Infinity)) {\n      this.#setState({\n        rejectionCount: this.store.state.rejectionCount + 1,\n      })\n      this.options.onReject?.(item, this)\n      return false\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!(item)\n        : (item as any)?.priority\n\n    const items = this.store.state.items\n    const itemTimestamps = this.store.state.itemTimestamps\n\n    if (priority !== undefined) {\n      // Insert based on priority - higher priority items go to front\n      const insertIndex = 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        items.push(item)\n        itemTimestamps.push(Date.now())\n      } else {\n        items.splice(insertIndex, 0, item)\n        itemTimestamps.splice(insertIndex, 0, Date.now())\n      }\n    } else {\n      if (position === 'front') {\n        // Default FIFO/LIFO behavior\n        items.unshift(item)\n        itemTimestamps.unshift(Date.now())\n      } else {\n        // LIFO\n        items.push(item)\n        itemTimestamps.push(Date.now())\n      }\n    }\n\n    this.#setState({\n      items,\n      itemTimestamps,\n    })\n\n    if (runOnItemsChange) {\n      this.options.onItemsChange?.(this)\n    }\n\n    if (this.store.state.isRunning && !this.store.state.pendingTick) {\n      this.#tick()\n    }\n\n    return true\n  }\n\n  /**\n   * Removes and returns the next item from the queue without executing the task function.\n   * Use for manual queue management. Normally, use execute() to process items.\n   *\n   * @example\n   * ```ts\n   * // FIFO\n   * queuer.getNextItem();\n   * // LIFO\n   * queuer.getNextItem('back');\n   * ```\n   */\n  getNextItem = (\n    position: QueuePosition = this.options.getItemsFrom ?? 'front',\n  ): TValue | undefined => {\n    const { items, itemTimestamps } = this.store.state\n    let item: TValue | undefined\n\n    // When priority function is provided or position is 'front', always get from front (highest priority)\n    // Priority takes precedence over FIFO/LIFO behavior\n    if (\n      this.options.getPriority !== defaultOptions.getPriority ||\n      position === 'front'\n    ) {\n      item = items[0]\n      if (item !== undefined) {\n        this.#setState({\n          items: items.slice(1),\n          itemTimestamps: itemTimestamps.slice(1),\n        })\n      }\n    } else {\n      item = items[items.length - 1]\n      if (item !== undefined) {\n        this.#setState({\n          items: items.slice(0, -1),\n          itemTimestamps: itemTimestamps.slice(0, -1),\n        })\n      }\n    }\n\n    if (item !== undefined) {\n      this.options.onItemsChange?.(this)\n    }\n\n    return item\n  }\n\n  #getAllItems = (): Array<TValue> => {\n    const items = this.peekAllItems()\n    this.clear()\n    return items\n  }\n\n  /**\n   * Removes and returns the next item from the queue and executes the task function with it.\n   *\n   * @example\n   * ```ts\n   * queuer.execute();\n   * // LIFO\n   * queuer.execute('back');\n   * ```\n   */\n  execute = async (position?: QueuePosition): Promise<any> => {\n    const item = this.getNextItem(position)\n\n    if (item !== undefined) {\n      const currentExecuteCount = this.store.state.executeCount + 1\n      this.#setState({\n        executeCount: currentExecuteCount,\n        isExecuting: true,\n      })\n      try {\n        const currentAsyncRetryer = new AsyncRetryer(\n          this.fn,\n          this.options.asyncRetryerOptions,\n        )\n        this.asyncRetryers.set(currentExecuteCount, currentAsyncRetryer)\n        const lastResult = await currentAsyncRetryer.execute(item) // EXECUTE!\n        this.#setState({\n          successCount: this.store.state.successCount + 1,\n          lastResult,\n        })\n        this.options.onSuccess?.(lastResult, item, this)\n      } catch (error) {\n        this.#setState({\n          errorCount: this.store.state.errorCount + 1,\n        })\n        this.options.onError?.(error as Error, item, this)\n        if (this.options.throwOnError) {\n          throw error\n        }\n      } finally {\n        this.asyncRetryers.delete(currentExecuteCount) // dispose retryer\n        // remove only one occurrence so duplicate item values keep accurate\n        // concurrency accounting\n        const remainingActiveItems = [...this.store.state.activeItems]\n        const activeItemIndex = remainingActiveItems.indexOf(item)\n        if (activeItemIndex !== -1) {\n          remainingActiveItems.splice(activeItemIndex, 1)\n        }\n        this.#setState({\n          activeItems: remainingActiveItems,\n          // other executions may still be in flight (concurrency > 1 or flush)\n          isExecuting: this.asyncRetryers.size > 0,\n          settledCount: this.store.state.settledCount + 1,\n        })\n        this.options.onSettled?.(item, this)\n      }\n    }\n    return item\n  }\n\n  /**\n   * Processes a specified number of items to execute immediately with no wait time\n   * If no numberOfItems is provided, all items will be processed\n   */\n  flush = async (\n    numberOfItems: number = this.store.state.items.length,\n    position?: QueuePosition,\n  ): Promise<void> => {\n    this.#clearTimeouts() // clear any pending timeouts (kills the tick chain)\n    const results = await Promise.allSettled(\n      Array.from({ length: numberOfItems }, () => this.execute(position)),\n    )\n    // the tick chain was killed above; restart it so remaining and future items\n    // process even when a flushed task rejected. Remaining items resume with the\n    // normal wait spacing after the flushed executions.\n    this.#setState({ pendingTick: false })\n    if (this.store.state.isRunning && this.store.state.items.length > 0) {\n      const wait = this.#getWait()\n      if (wait > 0) {\n        this.#setState({ pendingTick: true })\n        const timeoutId = setTimeout(() => {\n          this.#timeoutIds.delete(timeoutId)\n          this.#tick()\n        }, wait)\n        this.#timeoutIds.add(timeoutId)\n      } else {\n        this.#tick()\n      }\n    }\n    const failure = results.find(\n      (result): result is PromiseRejectedResult => result.status === 'rejected',\n    )\n    if (failure) {\n      throw failure.reason\n    }\n  }\n\n  /**\n   * Processes all items in the queue as a batch using the provided function as an argument\n   * The queue is cleared after processing\n   */\n  flushAsBatch = async (\n    batchFunction: (items: Array<TValue>) => Promise<any>,\n  ): Promise<void> => {\n    this.#clearTimeouts() // clear any pending timeouts (kills the tick chain)\n    const items = this.#getAllItems()\n    try {\n      await batchFunction(items)\n    } finally {\n      // restore the tick chain even when the batch function rejects\n      this.#setState({ pendingTick: false })\n      if (this.store.state.isRunning && this.store.state.items.length > 0) {\n        this.#tick()\n      }\n    }\n  }\n\n  /**\n   * Checks for expired items in the queue and removes them. Calls onExpire for each expired item.\n   * Internal use only.\n   */\n  #checkExpiredItems = (): void => {\n    if (\n      (this.options.expirationDuration ?? Infinity) === Infinity &&\n      this.options.getIsExpired === defaultOptions.getIsExpired\n    ) {\n      return\n    }\n\n    const now = Date.now()\n    const expiredIndices: Array<number> = []\n\n    // Find indices of expired items\n    for (let i = 0; i < this.store.state.items.length; i++) {\n      const timestamp = this.store.state.itemTimestamps[i]\n      if (timestamp === undefined) continue\n\n      const item = this.store.state.items[i]\n      if (item === undefined) continue\n\n      const isExpired =\n        this.options.getIsExpired !== defaultOptions.getIsExpired\n          ? this.options.getIsExpired!(item, timestamp)\n          : now - timestamp > (this.options.expirationDuration ?? Infinity)\n\n      if (isExpired) {\n        expiredIndices.push(i)\n      }\n    }\n\n    // Remove expired items from back to front to maintain indices\n    for (let i = expiredIndices.length - 1; i >= 0; i--) {\n      const index = expiredIndices[i]\n      if (index === undefined) continue\n\n      const expiredItem = this.store.state.items[index]\n      if (expiredItem === undefined) continue\n\n      const newItems = [...this.store.state.items]\n      const newTimestamps = [...this.store.state.itemTimestamps]\n      newItems.splice(index, 1)\n      newTimestamps.splice(index, 1)\n      this.#setState({\n        items: newItems,\n        itemTimestamps: newTimestamps,\n        expirationCount: this.store.state.expirationCount + 1,\n      })\n      this.options.onExpire?.(expiredItem, this)\n    }\n\n    if (expiredIndices.length > 0) {\n      this.options.onItemsChange?.(this)\n    }\n  }\n\n  /**\n   * Returns the next item in the queue without removing it.\n   *\n   * @example\n   * ```ts\n   * queuer.peekNextItem(); // front\n   * queuer.peekNextItem('back'); // back\n   * ```\n   */\n  peekNextItem = (position: QueuePosition = 'front'): TValue | undefined => {\n    if (position === 'front') {\n      return this.store.state.items[0]\n    }\n    return this.store.state.items[this.store.state.items.length - 1]\n  }\n\n  /**\n   * Returns a copy of all items in the queue, including active and pending items.\n   */\n  peekAllItems = (): Array<TValue> => {\n    return [...this.peekActiveItems(), ...this.peekPendingItems()]\n  }\n\n  /**\n   * Returns the items currently being processed (active tasks).\n   */\n  peekActiveItems = (): Array<TValue> => {\n    return [...this.store.state.activeItems]\n  }\n\n  /**\n   * Returns the items waiting to be processed (pending tasks).\n   */\n  peekPendingItems = (): Array<TValue> => {\n    return [...this.store.state.items]\n  }\n\n  /**\n   * Starts processing items in the queue. If already running, does nothing.\n   */\n  start = (): void => {\n    this.#setState({ isRunning: true })\n    if (!this.store.state.pendingTick && this.store.state.items.length > 0) {\n      this.#tick()\n    }\n  }\n\n  /**\n   * Stops processing items in the queue. Does not clear the queue.\n   */\n  stop = (): void => {\n    this.#clearTimeouts()\n    this.#setState({ isRunning: false, pendingTick: false })\n  }\n\n  #clearTimeouts = (): void => {\n    this.#timeoutIds.forEach((timeoutId) => clearTimeout(timeoutId))\n    this.#timeoutIds.clear()\n  }\n\n  /**\n   * Removes all pending items from the queue.\n   * Does NOT affect active tasks.\n   */\n  clear = (): void => {\n    this.#setState({ items: [], itemTimestamps: [] })\n    this.options.onItemsChange?.(this)\n  }\n\n  /**\n   * Returns the AbortSignal for a specific execution.\n   * If no executeCount is provided, returns the signal for the most recent execution.\n   * Returns null if no execution is found or not currently executing.\n   *\n   * @param executeCount - Optional specific execution to get signal for\n   * @example\n   * ```typescript\n   * const queuer = new AsyncQueuer(\n   *   async (item: string) => {\n   *     const signal = queuer.getAbortSignal()\n   *     if (signal) {\n   *       const response = await fetch(`/api/process/${item}`, { signal })\n   *       return response.json()\n   *     }\n   *   },\n   *   { concurrency: 2 }\n   * )\n   * ```\n   */\n  getAbortSignal = (executeCount?: number): AbortSignal | null => {\n    const count = executeCount ?? this.store.state.executeCount\n    const retryer = this.asyncRetryers.get(count)\n    return retryer?.getAbortSignal() ?? null\n  }\n\n  /**\n   * Aborts all ongoing executions with the internal abort controllers.\n   * Does NOT clear out the items.\n   */\n  abort = (): void => {\n    this.asyncRetryers.forEach((retryer) => retryer.abort())\n    this.asyncRetryers.clear()\n    this.#setState({\n      isExecuting: false,\n    })\n  }\n\n  /**\n   * Resets the queuer state to its default values\n   */\n  reset = (): void => {\n    this.#setState(getDefaultAsyncQueuerState<TValue>())\n    this.options.onItemsChange?.(this)\n    this.asyncRetryers.forEach((retryer) => retryer.reset())\n  }\n}\n\n/**\n * Creates a new AsyncQueuer instance and returns a bound addItem function for adding tasks.\n * The queuer is started automatically and ready to process items.\n *\n * Async vs Sync Versions:\n * The async version provides advanced features over the sync queue function:\n * - Returns promises that can be awaited for task results\n * - Built-in retry support via AsyncRetryer integration for each queued task\n * - Abort support to cancel in-flight task executions\n * - Comprehensive error handling with onError callbacks and throwOnError control\n * - Detailed execution tracking (success/error/settle counts)\n * - Concurrent execution support (process multiple items simultaneously)\n *\n * The sync queue function is lighter weight and simpler when you don't need async features,\n * return values, or execution control.\n *\n * What is Queuing?\n * Queuing is a technique for managing and processing items sequentially or with controlled concurrency.\n * Tasks are processed up to the configured concurrency limit. When a task completes,\n * the next pending task is processed if the concurrency limit allows.\n *\n * Configuration Options:\n * - `concurrency`: Maximum number of concurrent tasks (default: 1)\n * - `wait`: Time to wait between processing items (default: 0)\n * - `maxSize`: Maximum number of items allowed in the queue (default: Infinity)\n * - `getPriority`: Function to determine item priority\n * - `addItemsTo`: Default position to add items ('back' or 'front', default: 'back')\n * - `getItemsFrom`: Default position to get items ('front' or 'back', default: 'front')\n * - `expirationDuration`: Maximum time items can stay in queue\n * - `started`: Whether to start processing immediately (default: true)\n * - `asyncRetryerOptions`: Configure retry behavior for task executions\n *\n * Error Handling:\n * - If an `onError` handler is provided, it will be called with the error and queuer instance\n * - If `throwOnError` is true (default when no onError handler is provided), the error will be thrown\n * - If `throwOnError` is false (default when onError handler is provided), the error will be swallowed\n * - Both onError and throwOnError can be used together; the handler will be called before any error is thrown\n * - The error state can be checked using the underlying AsyncQueuer instance\n *\n * State Management:\n * - Uses TanStack Store for reactive state management\n * - Use `initialState` to provide initial state values when creating the async queuer\n * - Use `onSuccess` callback to react to successful task execution and implement custom logic\n * - Use `onError` callback to react to task execution errors and implement custom error handling\n * - Use `onSettled` callback to react to task execution completion (success or error) and implement custom logic\n * - Use `onItemsChange` callback to react to items being added or removed from the queue\n * - Use `onExpire` callback to react to items expiring and implement custom logic\n * - Use `onReject` callback to react to items being rejected when the queue is full\n * - The state includes error count, expiration count, rejection count, running status, and success/settle counts\n * - State can be accessed via the underlying AsyncQueuer instance's `store.state` property\n * - When using framework adapters (React/Solid), state is accessed from the hook's state property\n *\n * @example\n * ```ts\n * const enqueue = asyncQueue<string>(async (item) => {\n *   return item.toUpperCase();\n * }, {\n *   concurrency: 2,\n *   wait: 100,\n *   onSuccess: (result) => console.log('Processed:', result)\n * });\n *\n * enqueue('hello');\n * ```\n */\nexport function asyncQueue<TValue>(\n  fn: (value: TValue) => Promise<any>,\n  initialOptions: AsyncQueuerOptions<TValue>,\n) {\n  const asyncQueuer = new AsyncQueuer<TValue>(fn, initialOptions)\n  return asyncQueuer.addItem\n}\n"],"mappings":";;;;;;AAuFA,SAAS,6BAA+D;CACtE,OAAO;EACL,aAAa,CAAC;EACd,cAAc;EACd,YAAY;EACZ,cAAc;EACd,iBAAiB;EACjB,SAAS;EACT,aAAa;EACb,QAAQ;EACR,QAAQ;EACR,WAAW;EACX,gBAAgB,CAAC;EACjB,OAAO,CAAC;EACR,YAAY;EACZ,aAAa;EACb,gBAAgB;EAChB,cAAc;EACd,MAAM;EACN,QAAQ;EACR,cAAc;CAChB;AACF;;;;AAuGA,SAAgB,mBAKd,SAA6B;CAC7B,OAAO;AACT;AAeA,MAAM,iBAA0D;CAC9D,YAAY;CACZ,qBAAqB,EACnB,aAAa,EACf;CACA,aAAa;CACb,oBAAoB;CACpB,oBAAoB;CACpB,cAAc;CACd,cAAc,SAAc,MAAM,YAAY;CAC9C,cAAc,CAAC;CACf,SAAS;CACT,SAAS;CACT,MAAM;AACR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkEA,IAAa,cAAb,MAAiC;CAU/B;CAEA,YACE,AAAO,IACP,iBAA6C,CAAC,GAC9C;EAFO;eAZmD,IAAI,MAE9D,2BAAmC,CAAC;uCAGtB,IAAI,IAGlB;qCACgD,IAAI,IAAI;qBA+C5C,eAA0D;GACtE,KAAK,UAAU;IAAE,GAAG,KAAK;IAAS,GAAG;GAAW;EAClD;oBAEa,aAAsD;GACjE,KAAK,MAAM,UAAU,UAAU;IAC7B,MAAM,gBAAgB;KACpB,GAAG;KACH,GAAG;IACL;IAEA,MAAM,EAAE,aAAa,OAAO,cAAc;IAE1C,MAAM,OAAO,MAAM;IACnB,MAAM,SAAS,SAAS,KAAK,QAAQ,WAAW;IAChD,MAAM,UAAU,SAAS;IACzB,MAAM,SAAS,aAAa,WAAW,YAAY,WAAW;IAE9D,MAAM,SAAS,SAAS,SAAS,YAAY,YAAY;IAEzD,OAAO;KACL,GAAG;KACH;KACA;KACA;KACA;KACA;IACF;GACF,CAAC;GACD,WAAW,eAAe,IAAI;EAChC;wBAMyB;GACvB,OAAO,qBAAqB,KAAK,QAAQ,QAAQ,GAAG,IAAI;EAC1D;+BAMgC;GAC9B,OAAO,qBAAqB,KAAK,QAAQ,eAAe,GAAG,IAAI;EACjE;qBAKc;GACZ,IAAI,CAAC,KAAK,MAAM,MAAM,WAAW;IAC/B,KAAKA,UAAU,EAAE,aAAa,MAAM,CAAC;IACrC;GACF;GACA,KAAKA,UAAU,EAAE,aAAa,KAAK,CAAC;GAGpC,KAAKC,mBAAmB;GAGxB,IAAI,qBAAqB;GACzB,MAAM,cAAc,CAAC,GAAG,KAAK,MAAM,MAAM,WAAW;GACpD,OACE,YAAY,SAAS,KAAKC,gBAAgB,KAC1C,KAAK,MAAM,MAAM,MAAM,SAAS,GAChC;IACA,MAAM,WAAW,KAAK,aAAa;IACnC,IAAI,aAAa,QACf;IAEF,YAAY,KAAK,QAAQ;IACzB,KAAKF,UAAU,EACb,aAAa,CAAC,GAAG,WAAW,EAC9B,CAAC;IACD,qBAAqB;IACpB,CAAC,YAAY;KACZ,IAAI;MACF,MAAM,KAAK,QAAQ;KACrB,QAAQ,CAIR;KAEA,MAAM,OAAO,KAAKG,SAAS;KAC3B,IAAI,OAAO,GAAG;MACZ,MAAM,YAAY,iBAAiB;OACjC,KAAKC,YAAY,OAAO,SAAS;OACjC,KAAKC,MAAM;MACb,GAAG,IAAI;MACP,KAAKD,YAAY,IAAI,SAAS;MAC9B;KACF;KAEA,KAAKC,MAAM;IACb,EAAC,CAAE;GACL;GAIA,IAAI,CAAC,oBACH,KAAKL,UAAU,EAAE,aAAa,MAAM,CAAC;EAEzC;kBAcE,MACA,WAA0B,KAAK,QAAQ,cAAc,QACrD,mBAA4B,SAChB;GACZ,KAAKA,UAAU,EACb,cAAc,KAAK,MAAM,MAAM,eAAe,EAChD,CAAC;GAID,IAAI,SAAS,QAAW;IACtB,KAAKA,UAAU,EACb,gBAAgB,KAAK,MAAM,MAAM,iBAAiB,EACpD,CAAC;IACD,KAAK,QAAQ,WAAW,MAAM,IAAI;IAClC,OAAO;GACT;GAEA,IAAI,KAAK,MAAM,MAAM,MAAM,WAAW,KAAK,QAAQ,WAAW,WAAW;IACvE,KAAKA,UAAU,EACb,gBAAgB,KAAK,MAAM,MAAM,iBAAiB,EACpD,CAAC;IACD,KAAK,QAAQ,WAAW,MAAM,IAAI;IAClC,OAAO;GACT;GAGA,MAAM,WACJ,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAa,IAAI,IAC7B,MAAc;GAErB,MAAM,QAAQ,KAAK,MAAM,MAAM;GAC/B,MAAM,iBAAiB,KAAK,MAAM,MAAM;GAExC,IAAI,aAAa,QAAW;IAE1B,MAAM,cAAc,MAAM,WAAW,aAAa;KAKhD,QAHE,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAa,QAAQ,IACjC,UAAkB,YACC;IAC5B,CAAC;IAED,IAAI,gBAAgB,IAAI;KACtB,MAAM,KAAK,IAAI;KACf,eAAe,KAAK,KAAK,IAAI,CAAC;IAChC,OAAO;KACL,MAAM,OAAO,aAAa,GAAG,IAAI;KACjC,eAAe,OAAO,aAAa,GAAG,KAAK,IAAI,CAAC;IAClD;GACF,OACE,IAAI,aAAa,SAAS;IAExB,MAAM,QAAQ,IAAI;IAClB,eAAe,QAAQ,KAAK,IAAI,CAAC;GACnC,OAAO;IAEL,MAAM,KAAK,IAAI;IACf,eAAe,KAAK,KAAK,IAAI,CAAC;GAChC;GAGF,KAAKA,UAAU;IACb;IACA;GACF,CAAC;GAED,IAAI,kBACF,KAAK,QAAQ,gBAAgB,IAAI;GAGnC,IAAI,KAAK,MAAM,MAAM,aAAa,CAAC,KAAK,MAAM,MAAM,aAClD,KAAKK,MAAM;GAGb,OAAO;EACT;sBAeE,WAA0B,KAAK,QAAQ,gBAAgB,YAChC;GACvB,MAAM,EAAE,OAAO,mBAAmB,KAAK,MAAM;GAC7C,IAAI;GAIJ,IACE,KAAK,QAAQ,gBAAgB,eAAe,eAC5C,aAAa,SACb;IACA,OAAO,MAAM;IACb,IAAI,SAAS,QACX,KAAKL,UAAU;KACb,OAAO,MAAM,MAAM,CAAC;KACpB,gBAAgB,eAAe,MAAM,CAAC;IACxC,CAAC;GAEL,OAAO;IACL,OAAO,MAAM,MAAM,SAAS;IAC5B,IAAI,SAAS,QACX,KAAKA,UAAU;KACb,OAAO,MAAM,MAAM,GAAG,EAAE;KACxB,gBAAgB,eAAe,MAAM,GAAG,EAAE;IAC5C,CAAC;GAEL;GAEA,IAAI,SAAS,QACX,KAAK,QAAQ,gBAAgB,IAAI;GAGnC,OAAO;EACT;4BAEoC;GAClC,MAAM,QAAQ,KAAK,aAAa;GAChC,KAAK,MAAM;GACX,OAAO;EACT;iBAYU,OAAO,aAA2C;GAC1D,MAAM,OAAO,KAAK,YAAY,QAAQ;GAEtC,IAAI,SAAS,QAAW;IACtB,MAAM,sBAAsB,KAAK,MAAM,MAAM,eAAe;IAC5D,KAAKA,UAAU;KACb,cAAc;KACd,aAAa;IACf,CAAC;IACD,IAAI;KACF,MAAM,sBAAsB,IAAI,aAC9B,KAAK,IACL,KAAK,QAAQ,mBACf;KACA,KAAK,cAAc,IAAI,qBAAqB,mBAAmB;KAC/D,MAAM,aAAa,MAAM,oBAAoB,QAAQ,IAAI;KACzD,KAAKA,UAAU;MACb,cAAc,KAAK,MAAM,MAAM,eAAe;MAC9C;KACF,CAAC;KACD,KAAK,QAAQ,YAAY,YAAY,MAAM,IAAI;IACjD,SAAS,OAAO;KACd,KAAKA,UAAU,EACb,YAAY,KAAK,MAAM,MAAM,aAAa,EAC5C,CAAC;KACD,KAAK,QAAQ,UAAU,OAAgB,MAAM,IAAI;KACjD,IAAI,KAAK,QAAQ,cACf,MAAM;IAEV,UAAU;KACR,KAAK,cAAc,OAAO,mBAAmB;KAG7C,MAAM,uBAAuB,CAAC,GAAG,KAAK,MAAM,MAAM,WAAW;KAC7D,MAAM,kBAAkB,qBAAqB,QAAQ,IAAI;KACzD,IAAI,oBAAoB,IACtB,qBAAqB,OAAO,iBAAiB,CAAC;KAEhD,KAAKA,UAAU;MACb,aAAa;MAEb,aAAa,KAAK,cAAc,OAAO;MACvC,cAAc,KAAK,MAAM,MAAM,eAAe;KAChD,CAAC;KACD,KAAK,QAAQ,YAAY,MAAM,IAAI;IACrC;GACF;GACA,OAAO;EACT;eAMQ,OACN,gBAAwB,KAAK,MAAM,MAAM,MAAM,QAC/C,aACkB;GAClB,KAAKM,eAAe;GACpB,MAAM,UAAU,MAAM,QAAQ,WAC5B,MAAM,KAAK,EAAE,QAAQ,cAAc,SAAS,KAAK,QAAQ,QAAQ,CAAC,CACpE;GAIA,KAAKN,UAAU,EAAE,aAAa,MAAM,CAAC;GACrC,IAAI,KAAK,MAAM,MAAM,aAAa,KAAK,MAAM,MAAM,MAAM,SAAS,GAAG;IACnE,MAAM,OAAO,KAAKG,SAAS;IAC3B,IAAI,OAAO,GAAG;KACZ,KAAKH,UAAU,EAAE,aAAa,KAAK,CAAC;KACpC,MAAM,YAAY,iBAAiB;MACjC,KAAKI,YAAY,OAAO,SAAS;MACjC,KAAKC,MAAM;KACb,GAAG,IAAI;KACP,KAAKD,YAAY,IAAI,SAAS;IAChC,OACE,KAAKC,MAAM;GAEf;GACA,MAAM,UAAU,QAAQ,MACrB,WAA4C,OAAO,WAAW,UACjE;GACA,IAAI,SACF,MAAM,QAAQ;EAElB;sBAMe,OACb,kBACkB;GAClB,KAAKC,eAAe;GACpB,MAAM,QAAQ,KAAKC,aAAa;GAChC,IAAI;IACF,MAAM,cAAc,KAAK;GAC3B,UAAU;IAER,KAAKP,UAAU,EAAE,aAAa,MAAM,CAAC;IACrC,IAAI,KAAK,MAAM,MAAM,aAAa,KAAK,MAAM,MAAM,MAAM,SAAS,GAChE,KAAKK,MAAM;GAEf;EACF;kCAMiC;GAC/B,KACG,KAAK,QAAQ,sBAAsB,cAAc,YAClD,KAAK,QAAQ,iBAAiB,eAAe,cAE7C;GAGF,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,iBAAgC,CAAC;GAGvC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,MAAM,MAAM,QAAQ,KAAK;IACtD,MAAM,YAAY,KAAK,MAAM,MAAM,eAAe;IAClD,IAAI,cAAc,QAAW;IAE7B,MAAM,OAAO,KAAK,MAAM,MAAM,MAAM;IACpC,IAAI,SAAS,QAAW;IAOxB,IAJE,KAAK,QAAQ,iBAAiB,eAAe,eACzC,KAAK,QAAQ,aAAc,MAAM,SAAS,IAC1C,MAAM,aAAa,KAAK,QAAQ,sBAAsB,WAG1D,eAAe,KAAK,CAAC;GAEzB;GAGA,KAAK,IAAI,IAAI,eAAe,SAAS,GAAG,KAAK,GAAG,KAAK;IACnD,MAAM,QAAQ,eAAe;IAC7B,IAAI,UAAU,QAAW;IAEzB,MAAM,cAAc,KAAK,MAAM,MAAM,MAAM;IAC3C,IAAI,gBAAgB,QAAW;IAE/B,MAAM,WAAW,CAAC,GAAG,KAAK,MAAM,MAAM,KAAK;IAC3C,MAAM,gBAAgB,CAAC,GAAG,KAAK,MAAM,MAAM,cAAc;IACzD,SAAS,OAAO,OAAO,CAAC;IACxB,cAAc,OAAO,OAAO,CAAC;IAC7B,KAAKL,UAAU;KACb,OAAO;KACP,gBAAgB;KAChB,iBAAiB,KAAK,MAAM,MAAM,kBAAkB;IACtD,CAAC;IACD,KAAK,QAAQ,WAAW,aAAa,IAAI;GAC3C;GAEA,IAAI,eAAe,SAAS,GAC1B,KAAK,QAAQ,gBAAgB,IAAI;EAErC;uBAWgB,WAA0B,YAAgC;GACxE,IAAI,aAAa,SACf,OAAO,KAAK,MAAM,MAAM,MAAM;GAEhC,OAAO,KAAK,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,SAAS;EAChE;4BAKoC;GAClC,OAAO,CAAC,GAAG,KAAK,gBAAgB,GAAG,GAAG,KAAK,iBAAiB,CAAC;EAC/D;+BAKuC;GACrC,OAAO,CAAC,GAAG,KAAK,MAAM,MAAM,WAAW;EACzC;gCAKwC;GACtC,OAAO,CAAC,GAAG,KAAK,MAAM,MAAM,KAAK;EACnC;qBAKoB;GAClB,KAAKA,UAAU,EAAE,WAAW,KAAK,CAAC;GAClC,IAAI,CAAC,KAAK,MAAM,MAAM,eAAe,KAAK,MAAM,MAAM,MAAM,SAAS,GACnE,KAAKK,MAAM;EAEf;oBAKmB;GACjB,KAAKC,eAAe;GACpB,KAAKN,UAAU;IAAE,WAAW;IAAO,aAAa;GAAM,CAAC;EACzD;8BAE6B;GAC3B,KAAKI,YAAY,SAAS,cAAc,aAAa,SAAS,CAAC;GAC/D,KAAKA,YAAY,MAAM;EACzB;qBAMoB;GAClB,KAAKJ,UAAU;IAAE,OAAO,CAAC;IAAG,gBAAgB,CAAC;GAAE,CAAC;GAChD,KAAK,QAAQ,gBAAgB,IAAI;EACnC;yBAsBkB,iBAA8C;GAC9D,MAAM,QAAQ,gBAAgB,KAAK,MAAM,MAAM;GAE/C,OADgB,KAAK,cAAc,IAAI,KAC1B,CAAC,EAAE,eAAe,KAAK;EACtC;qBAMoB;GAClB,KAAK,cAAc,SAAS,YAAY,QAAQ,MAAM,CAAC;GACvD,KAAK,cAAc,MAAM;GACzB,KAAKA,UAAU,EACb,aAAa,MACf,CAAC;EACH;qBAKoB;GAClB,KAAKA,UAAU,2BAAmC,CAAC;GACnD,KAAK,QAAQ,gBAAgB,IAAI;GACjC,KAAK,cAAc,SAAS,YAAY,QAAQ,MAAM,CAAC;EACzD;EAvkBE,KAAK,MAAM,eAAe;EAC1B,KAAK,UAAU;GACb,GAAG;GACH,GAAG;GACH,cAAc,eAAe,gBAAgB,CAAC,eAAe;EAC/D;EACA,MAAM,qBACJ,KAAK,QAAQ,cAAc,aAAa,KAAK,QAAQ,WAAW;EAClE,KAAKA,UAAU;GACb,GAAG,KAAK,QAAQ;GAChB,WAAW;EACb,CAAC;EAED,IAAI,KAAK,QAAQ,cAAc,OAC7B;OAAI,KAAK,MAAM,MAAM,WACnB,KAAKK,MAAM;EACb,OAEA,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,QAAQ,cAAc,UAAU,IAAI,KAAK;GACjE,MAAM,OAAO,KAAK,QAAQ,aAAc;GACxC,MAAM,SAAS,OAAO,KAAK,QAAQ,cAAc,UAAU,KAAK;GAChE,KAAK,QAAQ,MAAM,KAAK,QAAQ,cAAc,QAAQ,MAAM;EAC9D;EAGF,IAAI,KAAK,KACP,iBAAiB,GAAG,kBAAkB,MAAM;GAC1C,IAAI,EAAE,QAAQ,QAAQ,KAAK,KAAK;GAChC,KAAKL,UACH,EAAE,QAAQ,MAAM,KAClB;GACA,KAAK,WACH,EAAE,QAAQ,OACZ;EACF,CAAC;CAEL;CASA;;;;;CAgCA;;;;;CAQA;;;;CAOA;CAoMA;;;;;CA+HA;CA6GA;AA4DF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmEA,SAAgB,WACd,IACA,gBACA;CAEA,OAAO,IADiB,YAAoB,IAAI,cAC/B,CAAC,CAAC;AACrB"}