@tanstack/pacer 0.16.3 → 0.17.0

package/dist/async-queuer.js

@@ -0,0 +1,494 @@
+import { parseFunctionOrValue } from "./utils.js";
+import { emitChange, pacerEventClient } from "./event-client.js";
+import { AsyncRetryer } from "./async-retryer.js";
+import { Store } from "@tanstack/store";
+
+//#region src/async-queuer.ts
+function getDefaultAsyncQueuerState() {
+	return {
+		activeItems: [],
+		addItemCount: 0,
+		errorCount: 0,
+		executeCount: 0,
+		expirationCount: 0,
+		isEmpty: true,
+		isExecuting: false,
+		isFull: false,
+		isIdle: true,
+		isRunning: true,
+		itemTimestamps: [],
+		items: [],
+		lastResult: null,
+		pendingTick: false,
+		rejectionCount: 0,
+		settledCount: 0,
+		size: 0,
+		status: "idle",
+		successCount: 0
+	};
+}
+/**
+* Utility function for sharing common `AsyncQueuerOptions` options between different `AsyncQueuer` instances.
+*/
+function asyncQueuerOptions(options) {
+	return options;
+}
+const defaultOptions = {
+	addItemsTo: "back",
+	asyncRetryerOptions: { maxAttempts: 1 },
+	concurrency: 1,
+	expirationDuration: Infinity,
+	getIsExpired: () => false,
+	getItemsFrom: "front",
+	getPriority: (item) => item?.priority ?? 0,
+	initialItems: [],
+	maxSize: Infinity,
+	started: true,
+	wait: 0
+};
+/**
+* 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();
+* ```
+*/
+var AsyncQueuer = class {
+	#timeoutIds = /* @__PURE__ */ new Set();
+	constructor(fn, initialOptions = {}) {
+		this.fn = fn;
+		this.store = new Store(getDefaultAsyncQueuerState());
+		this.asyncRetryers = /* @__PURE__ */ new Map();
+		this.setOptions = (newOptions) => {
+			this.options = {
+				...this.options,
+				...newOptions
+			};
+		};
+		this.addItem = (item, position = this.options.addItemsTo ?? "back", runOnItemsChange = true) => {
+			this.#setState({ addItemCount: this.store.state.addItemCount + 1 });
+			if (this.store.state.items.length >= (this.options.maxSize ?? Infinity)) {
+				this.#setState({ rejectionCount: this.store.state.rejectionCount + 1 });
+				this.options.onReject?.(item, this);
+				return false;
+			}
+			const priority = this.options.getPriority !== defaultOptions.getPriority ? this.options.getPriority(item) : item.priority;
+			const items = this.store.state.items;
+			const itemTimestamps = this.store.state.itemTimestamps;
+			if (priority !== void 0) {
+				const insertIndex = items.findIndex((existing) => {
+					return (this.options.getPriority !== defaultOptions.getPriority ? this.options.getPriority(existing) : existing.priority) < priority;
+				});
+				if (insertIndex === -1) {
+					items.push(item);
+					itemTimestamps.push(Date.now());
+				} else {
+					items.splice(insertIndex, 0, item);
+					itemTimestamps.splice(insertIndex, 0, Date.now());
+				}
+			} else if (position === "front") {
+				items.unshift(item);
+				itemTimestamps.unshift(Date.now());
+			} else {
+				items.push(item);
+				itemTimestamps.push(Date.now());
+			}
+			this.#setState({
+				items,
+				itemTimestamps
+			});
+			if (runOnItemsChange) this.options.onItemsChange?.(this);
+			if (this.store.state.isRunning && !this.store.state.pendingTick) this.#tick();
+			return true;
+		};
+		this.getNextItem = (position = this.options.getItemsFrom ?? "front") => {
+			const { items, itemTimestamps } = this.store.state;
+			let item;
+			if (this.options.getPriority !== defaultOptions.getPriority || position === "front") {
+				item = items[0];
+				if (item !== void 0) this.#setState({
+					items: items.slice(1),
+					itemTimestamps: itemTimestamps.slice(1)
+				});
+			} else {
+				item = items[items.length - 1];
+				if (item !== void 0) this.#setState({
+					items: items.slice(0, -1),
+					itemTimestamps: itemTimestamps.slice(0, -1)
+				});
+			}
+			if (item !== void 0) this.options.onItemsChange?.(this);
+			return item;
+		};
+		this.execute = async (position) => {
+			const item = this.getNextItem(position);
+			if (item !== void 0) {
+				const currentExecuteCount = this.store.state.executeCount + 1;
+				this.#setState({
+					executeCount: currentExecuteCount,
+					isExecuting: true
+				});
+				try {
+					const currentAsyncRetryer = new AsyncRetryer(this.fn, {
+						...this.options.asyncRetryerOptions,
+						key: `${this.key}-retryer-${currentExecuteCount}`
+					});
+					this.asyncRetryers.set(currentExecuteCount, currentAsyncRetryer);
+					const lastResult = await currentAsyncRetryer.execute(item);
+					this.#setState({
+						successCount: this.store.state.successCount + 1,
+						lastResult
+					});
+					this.options.onSuccess?.(lastResult, item, this);
+				} catch (error) {
+					this.#setState({ errorCount: this.store.state.errorCount + 1 });
+					this.options.onError?.(error, item, this);
+					if (this.options.throwOnError) throw error;
+				} finally {
+					this.asyncRetryers.delete(currentExecuteCount);
+					this.#setState({
+						activeItems: this.store.state.activeItems.filter((activeItem) => activeItem !== item),
+						isExecuting: false,
+						settledCount: this.store.state.settledCount + 1
+					});
+					this.options.onSettled?.(item, this);
+				}
+			}
+			return item;
+		};
+		this.flush = async (numberOfItems = this.store.state.items.length, position) => {
+			this.#clearTimeouts();
+			await Promise.all(Array.from({ length: numberOfItems }, () => this.execute(position)));
+		};
+		this.flushAsBatch = async (batchFunction) => {
+			this.#clearTimeouts();
+			await batchFunction(this.#getAllItems());
+		};
+		this.peekNextItem = (position = "front") => {
+			if (position === "front") return this.store.state.items[0];
+			return this.store.state.items[this.store.state.items.length - 1];
+		};
+		this.peekAllItems = () => {
+			return [...this.peekActiveItems(), ...this.peekPendingItems()];
+		};
+		this.peekActiveItems = () => {
+			return [...this.store.state.activeItems];
+		};
+		this.peekPendingItems = () => {
+			return [...this.store.state.items];
+		};
+		this.start = () => {
+			this.#setState({ isRunning: true });
+			if (!this.store.state.pendingTick && this.store.state.items.length > 0) this.#tick();
+		};
+		this.stop = () => {
+			this.#clearTimeouts();
+			this.#setState({
+				isRunning: false,
+				pendingTick: false
+			});
+		};
+		this.clear = () => {
+			this.#setState({
+				items: [],
+				itemTimestamps: []
+			});
+			this.options.onItemsChange?.(this);
+		};
+		this.abort = () => {
+			this.asyncRetryers.forEach((retryer) => retryer.abort());
+			this.asyncRetryers.clear();
+			this.#setState({ isExecuting: false });
+		};
+		this.reset = () => {
+			this.#setState(getDefaultAsyncQueuerState());
+			this.options.onItemsChange?.(this);
+			this.asyncRetryers.forEach((retryer) => retryer.reset());
+		};
+		this.key = initialOptions.key;
+		this.options = {
+			...defaultOptions,
+			...initialOptions,
+			throwOnError: initialOptions.throwOnError ?? !initialOptions.onError
+		};
+		const isInitiallyRunning = this.options.initialState?.isRunning ?? this.options.started ?? true;
+		this.#setState({
+			...this.options.initialState,
+			isRunning: isInitiallyRunning
+		});
+		if (this.options.initialState?.items) {
+			if (this.store.state.isRunning) this.#tick();
+		} else for (let i = 0; i < (this.options.initialItems?.length ?? 0); i++) {
+			const item = this.options.initialItems[i];
+			const isLast = i === (this.options.initialItems?.length ?? 0) - 1;
+			this.addItem(item, this.options.addItemsTo ?? "back", isLast);
+		}
+		if (this.key) pacerEventClient.on("d-AsyncQueuer", (e) => {
+			if (e.payload.key !== this.key) return;
+			this.#setState(e.payload.store.state);
+			this.setOptions(e.payload.options);
+		});
+	}
+	#setState = (newState) => {
+		this.store.setState((state) => {
+			const combinedState = {
+				...state,
+				...newState
+			};
+			const { activeItems, items, isRunning } = combinedState;
+			const size = items.length;
+			const isFull = size >= (this.options.maxSize ?? Infinity);
+			const isEmpty = size === 0;
+			const isIdle = isRunning && isEmpty && activeItems.length === 0;
+			const status = isIdle ? "idle" : isRunning ? "running" : "stopped";
+			return {
+				...combinedState,
+				isEmpty,
+				isFull,
+				isIdle,
+				size,
+				status
+			};
+		});
+		emitChange("AsyncQueuer", this);
+	};
+	/**
+	* Returns the current wait time (in milliseconds) between processing items.
+	* If a function is provided, it is called with the queuer instance.
+	*/
+	#getWait = () => {
+		return parseFunctionOrValue(this.options.wait ?? 0, this);
+	};
+	/**
+	* Returns the current concurrency limit for processing items.
+	* If a function is provided, it is called with the queuer instance.
+	*/
+	#getConcurrency = () => {
+		return parseFunctionOrValue(this.options.concurrency ?? 1, this);
+	};
+	/**
+	* Processes items in the queue up to the concurrency limit. Internal use only.
+	*/
+	#tick = () => {
+		if (!this.store.state.isRunning) {
+			this.#setState({ pendingTick: false });
+			return;
+		}
+		this.#setState({ pendingTick: true });
+		this.#checkExpiredItems();
+		const activeItems = this.store.state.activeItems;
+		while (activeItems.length < this.#getConcurrency() && this.store.state.items.length > 0) {
+			const nextItem = this.peekNextItem();
+			if (!nextItem) break;
+			activeItems.push(nextItem);
+			this.#setState({ activeItems });
+			(async () => {
+				const result = await this.execute();
+				this.#setState({ lastResult: result });
+				const wait = this.#getWait();
+				if (wait > 0) {
+					const timeoutId = setTimeout(() => this.#tick(), wait);
+					this.#timeoutIds.add(timeoutId);
+					return;
+				}
+				this.#tick();
+			})();
+		}
+		this.#setState({ pendingTick: false });
+	};
+	#getAllItems = () => {
+		const items = this.peekAllItems();
+		this.clear();
+		return items;
+	};
+	/**
+	* Checks for expired items in the queue and removes them. Calls onExpire for each expired item.
+	* Internal use only.
+	*/
+	#checkExpiredItems = () => {
+		if ((this.options.expirationDuration ?? Infinity) === Infinity && this.options.getIsExpired === defaultOptions.getIsExpired) return;
+		const now = Date.now();
+		const expiredIndices = [];
+		for (let i = 0; i < this.store.state.items.length; i++) {
+			const timestamp = this.store.state.itemTimestamps[i];
+			if (timestamp === void 0) continue;
+			const item = this.store.state.items[i];
+			if (item === void 0) continue;
+			if (this.options.getIsExpired !== defaultOptions.getIsExpired ? this.options.getIsExpired(item, timestamp) : now - timestamp > (this.options.expirationDuration ?? Infinity)) expiredIndices.push(i);
+		}
+		for (let i = expiredIndices.length - 1; i >= 0; i--) {
+			const index = expiredIndices[i];
+			if (index === void 0) continue;
+			const expiredItem = this.store.state.items[index];
+			if (expiredItem === void 0) continue;
+			const newItems = [...this.store.state.items];
+			const newTimestamps = [...this.store.state.itemTimestamps];
+			newItems.splice(index, 1);
+			newTimestamps.splice(index, 1);
+			this.#setState({
+				items: newItems,
+				itemTimestamps: newTimestamps,
+				expirationCount: this.store.state.expirationCount + 1
+			});
+			this.options.onExpire?.(expiredItem, this);
+		}
+		if (expiredIndices.length > 0) this.options.onItemsChange?.(this);
+	};
+	#clearTimeouts = () => {
+		this.#timeoutIds.forEach((timeoutId) => clearTimeout(timeoutId));
+		this.#timeoutIds.clear();
+	};
+	/**
+	* 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) {
+		const count = executeCount ?? this.store.state.executeCount;
+		return this.asyncRetryers.get(count)?.getAbortSignal() ?? null;
+	}
+};
+/**
+* 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');
+* ```
+*/
+function asyncQueue(fn, initialOptions) {
+	return new AsyncQueuer(fn, initialOptions).addItem;
+}
+
+//#endregion
+export { AsyncQueuer, asyncQueue, asyncQueuerOptions };
+//# sourceMappingURL=async-queuer.js.map

package/dist/async-queuer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"async-queuer.js","names":["defaultOptions: AsyncQueuerOptionsWithOptionalCallbacks","fn: (item: TValue) => Promise<any>","#setState","#tick","item: TValue | undefined","#clearTimeouts","#getAllItems","#checkExpiredItems","#getConcurrency","#getWait","#timeoutIds","expiredIndices: Array<number>"],"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<NodeJS.Timeout> = 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(e.payload.store.state)\n        this.setOptions(e.payload.options)\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    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) {\n        break\n      }\n      activeItems.push(nextItem)\n      this.#setState({\n        activeItems,\n      })\n      ;(async () => {\n        const result = await this.execute()\n        this.#setState({ lastResult: result })\n\n        const wait = this.#getWait()\n        if (wait > 0) {\n          const timeoutId = setTimeout(() => this.#tick(), wait)\n          this.#timeoutIds.add(timeoutId)\n          return\n        }\n\n        this.#tick()\n      })()\n    }\n\n    this.#setState({ pendingTick: false })\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   *\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    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(this.fn, {\n          ...this.options.asyncRetryerOptions,\n          key: `${this.key}-retryer-${currentExecuteCount}`,\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        this.#setState({\n          activeItems: this.store.state.activeItems.filter(\n            (activeItem) => activeItem !== item,\n          ),\n          isExecuting: false,\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\n    await Promise.all(\n      Array.from({ length: numberOfItems }, () => this.execute(position)),\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\n    const items = this.#getAllItems()\n    await batchFunction(items)\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;AACtE,QAAO;EACL,aAAa,EAAE;EACf,cAAc;EACd,YAAY;EACZ,cAAc;EACd,iBAAiB;EACjB,SAAS;EACT,aAAa;EACb,QAAQ;EACR,QAAQ;EACR,WAAW;EACX,gBAAgB,EAAE;EAClB,OAAO,EAAE;EACT,YAAY;EACZ,aAAa;EACb,gBAAgB;EAChB,cAAc;EACd,MAAM;EACN,QAAQ;EACR,cAAc;EACf;;;;;AAwGH,SAAgB,mBAKd,SAA6B;AAC7B,QAAO;;AAgBT,MAAMA,iBAA0D;CAC9D,YAAY;CACZ,qBAAqB,EACnB,aAAa,GACd;CACD,aAAa;CACb,oBAAoB;CACpB,oBAAoB;CACpB,cAAc;CACd,cAAc,SAAc,MAAM,YAAY;CAC9C,cAAc,EAAE;CAChB,SAAS;CACT,SAAS;CACT,MAAM;CACP;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkED,IAAa,cAAb,MAAiC;CAU/B,8BAAmC,IAAI,KAAK;CAE5C,YACE,AAAOC,IACP,iBAA6C,EAAE,EAC/C;EAFO;eAZmD,IAAI,MAE9D,4BAAoC,CAAC;uCAGvB,IAAI,KAGjB;qBA4CW,eAA0D;AACtE,QAAK,UAAU;IAAE,GAAG,KAAK;IAAS,GAAG;IAAY;;kBAuGjD,MACA,WAA0B,KAAK,QAAQ,cAAc,QACrD,mBAA4B,SAChB;AACZ,SAAKC,SAAU,EACb,cAAc,KAAK,MAAM,MAAM,eAAe,GAC/C,CAAC;AAEF,OAAI,KAAK,MAAM,MAAM,MAAM,WAAW,KAAK,QAAQ,WAAW,WAAW;AACvE,UAAKA,SAAU,EACb,gBAAgB,KAAK,MAAM,MAAM,iBAAiB,GACnD,CAAC;AACF,SAAK,QAAQ,WAAW,MAAM,KAAK;AACnC,WAAO;;GAIT,MAAM,WACJ,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAa,KAAK,GAC9B,KAAa;GAEpB,MAAM,QAAQ,KAAK,MAAM,MAAM;GAC/B,MAAM,iBAAiB,KAAK,MAAM,MAAM;AAExC,OAAI,aAAa,QAAW;IAE1B,MAAM,cAAc,MAAM,WAAW,aAAa;AAKhD,aAHE,KAAK,QAAQ,gBAAgB,eAAe,cACxC,KAAK,QAAQ,YAAa,SAAS,GAClC,SAAiB,YACE;MAC1B;AAEF,QAAI,gBAAgB,IAAI;AACtB,WAAM,KAAK,KAAK;AAChB,oBAAe,KAAK,KAAK,KAAK,CAAC;WAC1B;AACL,WAAM,OAAO,aAAa,GAAG,KAAK;AAClC,oBAAe,OAAO,aAAa,GAAG,KAAK,KAAK,CAAC;;cAG/C,aAAa,SAAS;AAExB,UAAM,QAAQ,KAAK;AACnB,mBAAe,QAAQ,KAAK,KAAK,CAAC;UAC7B;AAEL,UAAM,KAAK,KAAK;AAChB,mBAAe,KAAK,KAAK,KAAK,CAAC;;AAInC,SAAKA,SAAU;IACb;IACA;IACD,CAAC;AAEF,OAAI,iBACF,MAAK,QAAQ,gBAAgB,KAAK;AAGpC,OAAI,KAAK,MAAM,MAAM,aAAa,CAAC,KAAK,MAAM,MAAM,YAClD,OAAKC,MAAO;AAGd,UAAO;;sBAgBP,WAA0B,KAAK,QAAQ,gBAAgB,YAChC;GACvB,MAAM,EAAE,OAAO,mBAAmB,KAAK,MAAM;GAC7C,IAAIC;AAIJ,OACE,KAAK,QAAQ,gBAAgB,eAAe,eAC5C,aAAa,SACb;AACA,WAAO,MAAM;AACb,QAAI,SAAS,OACX,OAAKF,SAAU;KACb,OAAO,MAAM,MAAM,EAAE;KACrB,gBAAgB,eAAe,MAAM,EAAE;KACxC,CAAC;UAEC;AACL,WAAO,MAAM,MAAM,SAAS;AAC5B,QAAI,SAAS,OACX,OAAKA,SAAU;KACb,OAAO,MAAM,MAAM,GAAG,GAAG;KACzB,gBAAgB,eAAe,MAAM,GAAG,GAAG;KAC5C,CAAC;;AAIN,OAAI,SAAS,OACX,MAAK,QAAQ,gBAAgB,KAAK;AAGpC,UAAO;;iBAmBC,OAAO,aAA2C;GAC1D,MAAM,OAAO,KAAK,YAAY,SAAS;AAEvC,OAAI,SAAS,QAAW;IACtB,MAAM,sBAAsB,KAAK,MAAM,MAAM,eAAe;AAC5D,UAAKA,SAAU;KACb,cAAc;KACd,aAAa;KACd,CAAC;AACF,QAAI;KACF,MAAM,sBAAsB,IAAI,aAAa,KAAK,IAAI;MACpD,GAAG,KAAK,QAAQ;MAChB,KAAK,GAAG,KAAK,IAAI,WAAW;MAC7B,CAAC;AACF,UAAK,cAAc,IAAI,qBAAqB,oBAAoB;KAChE,MAAM,aAAa,MAAM,oBAAoB,QAAQ,KAAK;AAC1D,WAAKA,SAAU;MACb,cAAc,KAAK,MAAM,MAAM,eAAe;MAC9C;MACD,CAAC;AACF,UAAK,QAAQ,YAAY,YAAY,MAAM,KAAK;aACzC,OAAO;AACd,WAAKA,SAAU,EACb,YAAY,KAAK,MAAM,MAAM,aAAa,GAC3C,CAAC;AACF,UAAK,QAAQ,UAAU,OAAgB,MAAM,KAAK;AAClD,SAAI,KAAK,QAAQ,aACf,OAAM;cAEA;AACR,UAAK,cAAc,OAAO,oBAAoB;AAC9C,WAAKA,SAAU;MACb,aAAa,KAAK,MAAM,MAAM,YAAY,QACvC,eAAe,eAAe,KAChC;MACD,aAAa;MACb,cAAc,KAAK,MAAM,MAAM,eAAe;MAC/C,CAAC;AACF,UAAK,QAAQ,YAAY,MAAM,KAAK;;;AAGxC,UAAO;;eAOD,OACN,gBAAwB,KAAK,MAAM,MAAM,MAAM,QAC/C,aACkB;AAClB,SAAKG,eAAgB;AACrB,SAAM,QAAQ,IACZ,MAAM,KAAK,EAAE,QAAQ,eAAe,QAAQ,KAAK,QAAQ,SAAS,CAAC,CACpE;;sBAOY,OACb,kBACkB;AAClB,SAAKA,eAAgB;AAErB,SAAM,cADQ,MAAKC,aAAc,CACP;;uBAsEZ,WAA0B,YAAgC;AACxE,OAAI,aAAa,QACf,QAAO,KAAK,MAAM,MAAM,MAAM;AAEhC,UAAO,KAAK,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,SAAS;;4BAM5B;AAClC,UAAO,CAAC,GAAG,KAAK,iBAAiB,EAAE,GAAG,KAAK,kBAAkB,CAAC;;+BAMzB;AACrC,UAAO,CAAC,GAAG,KAAK,MAAM,MAAM,YAAY;;gCAMF;AACtC,UAAO,CAAC,GAAG,KAAK,MAAM,MAAM,MAAM;;qBAMhB;AAClB,SAAKJ,SAAU,EAAE,WAAW,MAAM,CAAC;AACnC,OAAI,CAAC,KAAK,MAAM,MAAM,eAAe,KAAK,MAAM,MAAM,MAAM,SAAS,EACnE,OAAKC,MAAO;;oBAOG;AACjB,SAAKE,eAAgB;AACrB,SAAKH,SAAU;IAAE,WAAW;IAAO,aAAa;IAAO,CAAC;;qBAYtC;AAClB,SAAKA,SAAU;IAAE,OAAO,EAAE;IAAE,gBAAgB,EAAE;IAAE,CAAC;AACjD,QAAK,QAAQ,gBAAgB,KAAK;;qBAiChB;AAClB,QAAK,cAAc,SAAS,YAAY,QAAQ,OAAO,CAAC;AACxD,QAAK,cAAc,OAAO;AAC1B,SAAKA,SAAU,EACb,aAAa,OACd,CAAC;;qBAMgB;AAClB,SAAKA,SAAU,4BAAoC,CAAC;AACpD,QAAK,QAAQ,gBAAgB,KAAK;AAClC,QAAK,cAAc,SAAS,YAAY,QAAQ,OAAO,CAAC;;AApgBxD,OAAK,MAAM,eAAe;AAC1B,OAAK,UAAU;GACb,GAAG;GACH,GAAG;GACH,cAAc,eAAe,gBAAgB,CAAC,eAAe;GAC9D;EACD,MAAM,qBACJ,KAAK,QAAQ,cAAc,aAAa,KAAK,QAAQ,WAAW;AAClE,QAAKA,SAAU;GACb,GAAG,KAAK,QAAQ;GAChB,WAAW;GACZ,CAAC;AAEF,MAAI,KAAK,QAAQ,cAAc,OAC7B;OAAI,KAAK,MAAM,MAAM,UACnB,OAAKC,MAAO;QAGd,MAAK,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;AAChE,QAAK,QAAQ,MAAM,KAAK,QAAQ,cAAc,QAAQ,OAAO;;AAIjE,MAAI,KAAK,IACP,kBAAiB,GAAG,kBAAkB,MAAM;AAC1C,OAAI,EAAE,QAAQ,QAAQ,KAAK,IAAK;AAChC,SAAKD,SAAU,EAAE,QAAQ,MAAM,MAAM;AACrC,QAAK,WAAW,EAAE,QAAQ,QAAQ;IAClC;;CAWN,aAAa,aAAsD;AACjE,OAAK,MAAM,UAAU,UAAU;GAC7B,MAAM,gBAAgB;IACpB,GAAG;IACH,GAAG;IACJ;GAED,MAAM,EAAE,aAAa,OAAO,cAAc;GAE1C,MAAM,OAAO,MAAM;GACnB,MAAM,SAAS,SAAS,KAAK,QAAQ,WAAW;GAChD,MAAM,UAAU,SAAS;GACzB,MAAM,SAAS,aAAa,WAAW,YAAY,WAAW;GAE9D,MAAM,SAAS,SAAS,SAAS,YAAY,YAAY;AAEzD,UAAO;IACL,GAAG;IACH;IACA;IACA;IACA;IACA;IACD;IACD;AACF,aAAW,eAAe,KAAK;;;;;;CAOjC,iBAAyB;AACvB,SAAO,qBAAqB,KAAK,QAAQ,QAAQ,GAAG,KAAK;;;;;;CAO3D,wBAAgC;AAC9B,SAAO,qBAAqB,KAAK,QAAQ,eAAe,GAAG,KAAK;;;;;CAMlE,cAAc;AACZ,MAAI,CAAC,KAAK,MAAM,MAAM,WAAW;AAC/B,SAAKA,SAAU,EAAE,aAAa,OAAO,CAAC;AACtC;;AAEF,QAAKA,SAAU,EAAE,aAAa,MAAM,CAAC;AAGrC,QAAKK,mBAAoB;EAGzB,MAAM,cAAc,KAAK,MAAM,MAAM;AACrC,SACE,YAAY,SAAS,MAAKC,gBAAiB,IAC3C,KAAK,MAAM,MAAM,MAAM,SAAS,GAChC;GACA,MAAM,WAAW,KAAK,cAAc;AACpC,OAAI,CAAC,SACH;AAEF,eAAY,KAAK,SAAS;AAC1B,SAAKN,SAAU,EACb,aACD,CAAC;AACD,IAAC,YAAY;IACZ,MAAM,SAAS,MAAM,KAAK,SAAS;AACnC,UAAKA,SAAU,EAAE,YAAY,QAAQ,CAAC;IAEtC,MAAM,OAAO,MAAKO,SAAU;AAC5B,QAAI,OAAO,GAAG;KACZ,MAAM,YAAY,iBAAiB,MAAKN,MAAO,EAAE,KAAK;AACtD,WAAKO,WAAY,IAAI,UAAU;AAC/B;;AAGF,UAAKP,MAAO;OACV;;AAGN,QAAKD,SAAU,EAAE,aAAa,OAAO,CAAC;;CAoIxC,qBAAoC;EAClC,MAAM,QAAQ,KAAK,cAAc;AACjC,OAAK,OAAO;AACZ,SAAO;;;;;;CAuFT,2BAAiC;AAC/B,OACG,KAAK,QAAQ,sBAAsB,cAAc,YAClD,KAAK,QAAQ,iBAAiB,eAAe,aAE7C;EAGF,MAAM,MAAM,KAAK,KAAK;EACtB,MAAMS,iBAAgC,EAAE;AAGxC,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,MAAM,MAAM,QAAQ,KAAK;GACtD,MAAM,YAAY,KAAK,MAAM,MAAM,eAAe;AAClD,OAAI,cAAc,OAAW;GAE7B,MAAM,OAAO,KAAK,MAAM,MAAM,MAAM;AACpC,OAAI,SAAS,OAAW;AAOxB,OAJE,KAAK,QAAQ,iBAAiB,eAAe,eACzC,KAAK,QAAQ,aAAc,MAAM,UAAU,GAC3C,MAAM,aAAa,KAAK,QAAQ,sBAAsB,UAG1D,gBAAe,KAAK,EAAE;;AAK1B,OAAK,IAAI,IAAI,eAAe,SAAS,GAAG,KAAK,GAAG,KAAK;GACnD,MAAM,QAAQ,eAAe;AAC7B,OAAI,UAAU,OAAW;GAEzB,MAAM,cAAc,KAAK,MAAM,MAAM,MAAM;AAC3C,OAAI,gBAAgB,OAAW;GAE/B,MAAM,WAAW,CAAC,GAAG,KAAK,MAAM,MAAM,MAAM;GAC5C,MAAM,gBAAgB,CAAC,GAAG,KAAK,MAAM,MAAM,eAAe;AAC1D,YAAS,OAAO,OAAO,EAAE;AACzB,iBAAc,OAAO,OAAO,EAAE;AAC9B,SAAKT,SAAU;IACb,OAAO;IACP,gBAAgB;IAChB,iBAAiB,KAAK,MAAM,MAAM,kBAAkB;IACrD,CAAC;AACF,QAAK,QAAQ,WAAW,aAAa,KAAK;;AAG5C,MAAI,eAAe,SAAS,EAC1B,MAAK,QAAQ,gBAAgB,KAAK;;CA2DtC,uBAA6B;AAC3B,QAAKQ,WAAY,SAAS,cAAc,aAAa,UAAU,CAAC;AAChE,QAAKA,WAAY,OAAO;;;;;;;;;;;;;;;;;;;;;;CAgC1B,eAAe,cAA2C;EACxD,MAAM,QAAQ,gBAAgB,KAAK,MAAM,MAAM;AAE/C,SADgB,KAAK,cAAc,IAAI,MAAM,EAC7B,gBAAgB,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0FxC,SAAgB,WACd,IACA,gBACA;AAEA,QADoB,IAAI,YAAoB,IAAI,eAAe,CAC5C"}