@asaidimu/utils-sync 2.0.2 → 2.1.0

package/index.d.mts

@@ -1,3 +1,182 @@
+interface DebouncerOptions {
+    /**
+     * Quiet period in milliseconds. The last-enqueued function runs after
+     * no new calls have arrived for this duration.
+     * @default 300
+     */
+    delay?: number;
+    /**
+     * If true, also fires immediately on the leading edge (first call in a
+     * quiet period), then debounces subsequent calls normally.
+     *
+     * Leading-edge semantics: the leading call fires immediately and clears
+     * _pendingFn. Any calls arriving *while* the leading execution is in flight
+     * register as a new trailing call and will be resolved by the trailing timer
+     * when the quiet period expires. Calls arriving during the leading execution
+     * are never lost.
+     *
+     * @default false
+     */
+    leading?: boolean;
+}
+/**
+ * Result when the debounced function successfully executed.
+ */
+type DebouncerOk<T> = {
+    status: "ok";
+    value: T;
+};
+/**
+ * Result when the debounced function threw an error.
+ */
+type DebouncerError = {
+    status: "error";
+    error: unknown;
+};
+/**
+ * Result when the debounced call was cancelled before execution.
+ */
+type DebouncerCancelled = {
+    status: "cancelled";
+};
+/**
+ * Discriminated union of all possible Debouncer outcomes.
+ *
+ * - `DebouncerOk<T>`: function ran and returned a value.
+ * - `DebouncerError`: function ran and threw an error.
+ * - `DebouncerCancelled`: call was cancelled before it ran.
+ */
+type DebouncerResult<T> = DebouncerOk<T> | DebouncerError | DebouncerCancelled;
+/**
+ * Collapses rapid successive calls into a single execution.
+ *
+ * Each call to `do()` returns a promise that resolves with the result of the
+ * debounced execution — i.e. all callers within the same quiet window share
+ * the same result. The function that actually runs is always the *last* one
+ * enqueued before the delay expires.
+ *
+ * @example
+ * const debounced = new Debouncer({ delay: 200 });
+ * // Called rapidly three times — only the last fn runs.
+ * const [a, b, c] = await Promise.all([
+ *   debounced.do(() => fetch("/api/search?q=h")),
+ *   debounced.do(() => fetch("/api/search?q=he")),
+ *   debounced.do(() => fetch("/api/search?q=hel")),
+ * ]);
+ * // a.status === "ok" and a.value is the result of the third fetch.
+ * // b and c share the same result as a.
+ */
+declare class Debouncer<T = void> {
+    private _delay;
+    private _leading;
+    private _timer;
+    private _pendingFn;
+    private _pendingResolvers;
+    private _leadingFired;
+    constructor(options?: DebouncerOptions);
+    /**
+     * Enqueues a function and returns a promise that resolves with its result.
+     *
+     * All callers within the same quiet window share the same result — the
+     * function that actually runs is the *last* one enqueued before the delay
+     * expires. Use this when you need the return value of the debounced call.
+     *
+     * For fire-and-forget use (void fns, event handlers), prefer `fire()` to
+     * avoid unhandled-promise-rejection warnings and make intent explicit.
+     *
+     * @param fn - The function to debounce.
+     * @returns A promise resolving with a DebouncerResult discriminated union.
+     */
+    do(fn: () => Promise<T> | T): Promise<DebouncerResult<T>>;
+    /**
+     * Enqueues a function without returning a promise (fire-and-forget).
+     *
+     * Identical debounce semantics to `do()` — the last-enqueued function runs
+     * after the quiet period. Use this for void callbacks, DOM event handlers,
+     * or any caller that doesn't care about the result. No dangling promise,
+     * no unhandled-rejection risk.
+     *
+     * @param fn - The function to debounce.
+     */
+    fire(fn: () => Promise<T> | T): void;
+    /**
+     * Shared enqueue logic for both `do()` and `fire()`.
+     *
+     */
+    private _enqueue;
+    /**
+     * Immediately cancels any pending debounced execution.
+     * All waiting callers resolve with `{ status: "cancelled" }`.
+     */
+    cancel(): void;
+    /**
+     * Immediately executes the pending function (if any), bypassing the remaining delay.
+     * All waiting callers receive the result.
+     */
+    flush(): Promise<DebouncerResult<T> | null>;
+    /** Returns true if a debounced call is currently pending. */
+    pending(): boolean;
+    /**
+     * Executes the latest pending function and resolves all waiting callers.
+     */
+    private _fire;
+}
+
+/** Represents all errors within the sync system */
+declare class SyncError extends Error {
+    constructor(message: string, cause?: unknown);
+}
+declare class TimeoutError extends SyncError {
+    constructor(message?: string);
+}
+declare class OnceExecutionConflict extends SyncError {
+    constructor(cause?: unknown);
+}
+declare class SerializerExecutionDone extends SyncError {
+    constructor(cause?: unknown);
+}
+
+/**
+ * A one-shot gate that starts closed and opens exactly once.
+ *
+ * All current and future `wait()` callers resolve immediately once `open()` is
+ * called. Unlike Once, Latch carries no return value and has no retry logic —
+ * it is a pure signalling primitive.
+ *
+ * Typical use: coordinate startup, signal that an initialisation phase is done,
+ * or gate downstream work on a single event.
+ *
+ * @example
+ * const ready = new Latch();
+ * // Consumer
+ * await ready.wait();
+ * // Producer (elsewhere)
+ * ready.open();
+ */
+declare class Latch {
+    private _open;
+    private _resolve;
+    private _promise;
+    constructor();
+    /**
+     * Opens the latch. All current and future waiters resolve immediately.
+     * Calling open() more than once is a no-op.
+     */
+    open(): void;
+    /**
+     * Returns a promise that resolves when the latch is opened.
+     * If already open, resolves on the next microtask checkpoint.
+     *
+     * @param timeout - Optional maximum wait time in milliseconds.
+     * @throws {TimeoutError} If the latch does not open within the timeout.
+     */
+    wait(timeout?: number): Promise<void>;
+    /**
+     * Synchronously checks whether the latch has been opened.
+     */
+    isOpen(): boolean;
+}
+
 interface MutexOptions {
     /**
      * Maximum number of pending requests allowed in the queue.
@@ -64,61 +243,7 @@ declare class Mutex {
     /** Returns the number of operations waiting for the lock. */
     pending(): number;
 }
-interface SemaphoreOptions extends MutexOptions {
-    /**
-     * Number of concurrent holders allowed.
-     * Inherits `capacity` and `yieldMode` from MutexOptions.
-     * @default 1 (equivalent to a Mutex)
-     */
-    slots?: number;
-}
-/**
- * A counting semaphore — generalises Mutex to allow up to N concurrent holders.
- *
- * Useful for rate-limiting concurrency: e.g. "at most 3 in-flight HTTP requests".
- * With slots=1 it behaves identically to Mutex.
- *
- * Accepts the same `capacity` and `yieldMode` options as Mutex, plus `slots`.
- */
-declare class Semaphore {
-    private _slots;
-    private _available;
-    private _capacity;
-    private _yieldMode;
-    private waiters;
-    constructor(options?: SemaphoreOptions);
-    /**
-     * Acquires one slot. If all slots are taken, waits until one is released.
-     *
-     * @param timeout - Optional maximum wait time in milliseconds.
-     * @throws {TimeoutError} If a slot cannot be acquired within the timeout.
-     * @throws {Error} If the wait queue is full.
-     */
-    acquire(timeout?: number): Promise<void>;
-    /**
-     * Attempts to acquire a slot without waiting.
-     * @returns `true` if a slot was acquired, `false` otherwise.
-     */
-    tryAcquire(): boolean;
-    /**
-     * Releases one slot. If waiters are queued, the next one is scheduled
-     * according to yieldMode.
-     *
-     * @throws {Error} If no slot is currently held (release without acquire).
-     */
-    release(): void;
-    /**
-     * Runs a function with one acquired slot, releasing it when done.
-     * Convenience wrapper — prefer this over manual acquire/release.
-     */
-    run<T>(fn: () => Promise<T> | T, timeout?: number): Promise<T>;
-    /** Number of slots currently free. */
-    available(): number;
-    /** Number of callers waiting for a slot. */
-    pending(): number;
-    /** Total slot count (as configured). */
-    slots(): number;
-}
+
 type OnceResult<T> = {
     value: T | null;
     error?: unknown;
@@ -161,13 +286,6 @@ declare class Once<T = void> {
      * @returns The result of the execution.
      */
     doSync(fn: () => T): OnceResult<T>;
-    /**
-     * Returns true if the operation has completed (success or non-retryable failure)
-     * and the internal promise has been cleared.
-     *
-     * This is the canonical "safe to read" check — prefer it over `done()`.
-     */
-    ready(): boolean;
     /**
      * Returns true if the operation is currently executing.
      *
@@ -210,116 +328,18 @@ declare class Once<T = void> {
      */
     private _awaitWithTimeout;
 }
-type SerializerResult<T> = {
-    value: T | null;
-    error?: unknown;
-};
-interface SerializerOptions {
-    /**
-     * Max items in queue. If full, .do() returns an error immediately.
-     * @default 1000
-     */
-    capacity?: number;
+
+interface RWMutexOptions {
     /**
-     * Yield mode for the internal mutex. Defaults to "macrotask" for
-     * coarse-grained serializers. Use "microtask" for fine-grained
-     * latency-sensitive serializers.
-     */
-    yieldMode?: "macrotask" | "microtask";
-}
-/**
- * Ensures tasks are executed sequentially (FIFO).
- * Maintains the result of the last successful execution.
- * Includes backpressure protection via configurable queue capacity.
- */
-declare class Serializer<T = void> {
-    private mutex;
-    private _done;
-    private _lastValue;
-    private _lastError;
-    private _hasRun;
-    constructor(options?: SerializerOptions);
-    /**
-     * Enqueue a function to be executed after all previous tasks complete.
-     *
-     * @param fn - The function to execute.
-     * @param timeout - Max time to wait to acquire the lock.
-     * @returns Object containing the value or error.
-     */
-    do(fn: () => Promise<T> | T, timeout?: number): Promise<SerializerResult<T | null>>;
-    /**
-     * Returns the result of the last execution.
-     *
-     * Returns `{ value: null, error: undefined }` both when the serializer has
-     * never run and when it ran and returned null — use `hasRun()` to distinguish
-     * these two cases.
-     */
-    peek(): SerializerResult<T | null>;
-    /**
-     * Returns true if at least one task has been executed (successfully or not).
-     */
-    hasRun(): boolean;
-    /**
-     * Permanently closes the serializer.
-     * Subsequent calls to `do()` will fail immediately with SerializerExecutionDone.
-     */
-    close(): void;
-    /** Returns the number of tasks currently waiting. */
-    pending(): number;
-    /** Returns true if a task is currently executing. */
-    running(): boolean;
-}
-/**
- * A one-shot gate that starts closed and opens exactly once.
- *
- * All current and future `wait()` callers resolve immediately once `open()` is
- * called. Unlike Once, Latch carries no return value and has no retry logic —
- * it is a pure signalling primitive.
- *
- * Typical use: coordinate startup, signal that an initialisation phase is done,
- * or gate downstream work on a single event.
- *
- * @example
- * const ready = new Latch();
- * // Consumer
- * await ready.wait();
- * // Producer (elsewhere)
- * ready.open();
- */
-declare class Latch {
-    private _open;
-    private _resolve;
-    private _promise;
-    constructor();
-    /**
-     * Opens the latch. All current and future waiters resolve immediately.
-     * Calling open() more than once is a no-op.
-     */
-    open(): void;
-    /**
-     * Returns a promise that resolves when the latch is opened.
-     * If already open, resolves on the next microtask checkpoint.
-     *
-     * @param timeout - Optional maximum wait time in milliseconds.
-     * @throws {TimeoutError} If the latch does not open within the timeout.
-     */
-    wait(timeout?: number): Promise<void>;
-    /**
-     * Synchronously checks whether the latch has been opened.
-     */
-    isOpen(): boolean;
-}
-interface RWMutexOptions {
-    /**
-     * Controls how lock handoff is scheduled when a waiter is unblocked.
-     *
-     * - `"microtask"` (default): Uses queueMicrotask(fn). Near-zero latency
-     *   between handoffs. Appropriate for RWMutex because readers are woken in
-     *   bulk and writers are rarely contended enough to cause starvation.
-     *
-     * - `"macrotask"`: Uses setTimeout(fn, 0) to yield to the event loop between
-     *   handoffs. Use if you observe microtask starvation under extreme write
-     *   contention on this specific lock.
+     * Controls how lock handoff is scheduled when a waiter is unblocked.
+     *
+     * - `"microtask"` (default): Uses queueMicrotask(fn). Near-zero latency
+     *   between handoffs. Appropriate for RWMutex because readers are woken in
+     *   bulk and writers are rarely contended enough to cause starvation.
+     *
+     * - `"macrotask"`: Uses setTimeout(fn, 0) to yield to the event loop between
+     *   handoffs. Use if you observe microtask starvation under extreme write
+     *   contention on this specific lock.
      */
     yieldMode?: "macrotask" | "microtask";
 }
@@ -402,128 +422,121 @@ declare class RWMutex {
      */
     private _schedule;
 }
-interface DebouncerOptions {
-    /**
-     * Quiet period in milliseconds. The last-enqueued function runs after
-     * no new calls have arrived for this duration.
-     * @default 300
-     */
-    delay?: number;
+
+interface SemaphoreOptions extends MutexOptions {
     /**
-     * If true, also fires immediately on the leading edge (first call in a
-     * quiet period), then debounces subsequent calls normally.
-     *
-     * Leading-edge semantics: the leading call fires immediately and clears
-     * _pendingFn. Any calls arriving *while* the leading execution is in flight
-     * register as a new trailing call and will be resolved by the trailing timer
-     * when the quiet period expires. Calls arriving during the leading execution
-     * are never lost.
-     *
-     * @default false
+     * Number of concurrent holders allowed.
+     * Inherits `capacity` and `yieldMode` from MutexOptions.
+     * @default 1 (equivalent to a Mutex)
      */
-    leading?: boolean;
+    slots?: number;
 }
 /**
- * Result when the debounced function successfully executed.
- */
-type DebouncerOk<T> = {
-    status: "ok";
-    value: T;
-};
-/**
- * Result when the debounced function threw an error.
- */
-type DebouncerError = {
-    status: "error";
-    error: unknown;
-};
-/**
- * Result when the debounced call was cancelled before execution.
- */
-type DebouncerCancelled = {
-    status: "cancelled";
-};
-/**
- * Discriminated union of all possible Debouncer outcomes.
- *
- * - `DebouncerOk<T>`: function ran and returned a value.
- * - `DebouncerError`: function ran and threw an error.
- * - `DebouncerCancelled`: call was cancelled before it ran.
- */
-type DebouncerResult<T> = DebouncerOk<T> | DebouncerError | DebouncerCancelled;
-/**
- * Collapses rapid successive calls into a single execution.
+ * A counting semaphore — generalises Mutex to allow up to N concurrent holders.
  *
- * Each call to `do()` returns a promise that resolves with the result of the
- * debounced execution — i.e. all callers within the same quiet window share
- * the same result. The function that actually runs is always the *last* one
- * enqueued before the delay expires.
+ * Useful for rate-limiting concurrency: e.g. "at most 3 in-flight HTTP requests".
+ * With slots=1 it behaves identically to Mutex.
  *
- * @example
- * const debounced = new Debouncer({ delay: 200 });
- * // Called rapidly three times — only the last fn runs.
- * const [a, b, c] = await Promise.all([
- *   debounced.do(() => fetch("/api/search?q=h")),
- *   debounced.do(() => fetch("/api/search?q=he")),
- *   debounced.do(() => fetch("/api/search?q=hel")),
- * ]);
- * // a.status === "ok" and a.value is the result of the third fetch.
- * // b and c share the same result as a.
+ * Accepts the same `capacity` and `yieldMode` options as Mutex, plus `slots`.
  */
-declare class Debouncer<T = void> {
-    private _delay;
-    private _leading;
-    private _timer;
-    private _pendingFn;
-    private _pendingResolvers;
-    private _leadingFired;
-    constructor(options?: DebouncerOptions);
+declare class Semaphore {
+    private _slots;
+    private _available;
+    private _capacity;
+    private _yieldMode;
+    private waiters;
+    constructor(options?: SemaphoreOptions);
     /**
-     * Enqueues a function and returns a promise that resolves with its result.
-     *
-     * All callers within the same quiet window share the same result — the
-     * function that actually runs is the *last* one enqueued before the delay
-     * expires. Use this when you need the return value of the debounced call.
-     *
-     * For fire-and-forget use (void fns, event handlers), prefer `fire()` to
-     * avoid unhandled-promise-rejection warnings and make intent explicit.
+     * Acquires one slot. If all slots are taken, waits until one is released.
      *
-     * @param fn - The function to debounce.
-     * @returns A promise resolving with a DebouncerResult discriminated union.
+     * @param timeout - Optional maximum wait time in milliseconds.
+     * @throws {TimeoutError} If a slot cannot be acquired within the timeout.
+     * @throws {Error} If the wait queue is full.
      */
-    do(fn: () => Promise<T> | T): Promise<DebouncerResult<T>>;
+    acquire(timeout?: number): Promise<void>;
     /**
-     * Enqueues a function without returning a promise (fire-and-forget).
-     *
-     * Identical debounce semantics to `do()` — the last-enqueued function runs
-     * after the quiet period. Use this for void callbacks, DOM event handlers,
-     * or any caller that doesn't care about the result. No dangling promise,
-     * no unhandled-rejection risk.
+     * Attempts to acquire a slot without waiting.
+     * @returns `true` if a slot was acquired, `false` otherwise.
+     */
+    tryAcquire(): boolean;
+    /**
+     * Releases one slot. If waiters are queued, the next one is scheduled
+     * according to yieldMode.
      *
-     * @param fn - The function to debounce.
+     * @throws {Error} If no slot is currently held (release without acquire).
      */
-    fire(fn: () => Promise<T> | T): void;
+    release(): void;
     /**
-     * Shared enqueue logic for both `do()` and `fire()`.
+     * Runs a function with one acquired slot, releasing it when done.
+     * Convenience wrapper — prefer this over manual acquire/release.
+     */
+    run<T>(fn: () => Promise<T> | T, timeout?: number): Promise<T>;
+    /** Number of slots currently free. */
+    available(): number;
+    /** Number of callers waiting for a slot. */
+    pending(): number;
+    /** Total slot count (as configured). */
+    slots(): number;
+}
+
+type SerializerResult<T> = {
+    value: T | null;
+    error?: unknown;
+};
+interface SerializerOptions {
+    /**
+     * Max items in queue. If full, .do() returns an error immediately.
+     * @default 1000
+     */
+    capacity?: number;
+    /**
+     * Yield mode for the internal mutex. Defaults to "macrotask" for
+     * coarse-grained serializers. Use "microtask" for fine-grained
+     * latency-sensitive serializers.
+     */
+    yieldMode?: "macrotask" | "microtask";
+}
+/**
+ * Ensures tasks are executed sequentially (FIFO).
+ * Maintains the result of the last successful execution.
+ * Includes backpressure protection via configurable queue capacity.
+ */
+declare class Serializer<T = void> {
+    private mutex;
+    private _done;
+    private _lastValue;
+    private _lastError;
+    private _hasRun;
+    constructor(options?: SerializerOptions);
+    /**
+     * Enqueue a function to be executed after all previous tasks complete.
      *
+     * @param fn - The function to execute.
+     * @param timeout - Max time to wait to acquire the lock.
+     * @returns Object containing the value or error.
      */
-    private _enqueue;
+    do(fn: () => Promise<T> | T, timeout?: number): Promise<SerializerResult<T | null>>;
     /**
-     * Immediately cancels any pending debounced execution.
-     * All waiting callers resolve with `{ status: "cancelled" }`.
+     * Returns the result of the last execution.
+     *
+     * Returns `{ value: null, error: undefined }` both when the serializer has
+     * never run and when it ran and returned null — use `hasRun()` to distinguish
+     * these two cases.
      */
-    cancel(): void;
+    peek(): SerializerResult<T | null>;
     /**
-     * Immediately executes the pending function (if any), bypassing the remaining delay.
-     * All waiting callers receive the result.
+     * Returns true if at least one task has been executed (successfully or not).
      */
-    flush(): Promise<DebouncerResult<T> | null>;
-    /** Returns true if a debounced call is currently pending. */
-    pending(): boolean;
+    hasRun(): boolean;
     /**
-     * Executes the latest pending function and resolves all waiting callers.
+     * Permanently closes the serializer.
+     * Subsequent calls to `do()` will fail immediately with SerializerExecutionDone.
      */
-    private _fire;
+    close(): void;
+    /** Returns the number of tasks currently waiting. */
+    pending(): number;
+    /** Returns true if a task is currently executing. */
+    running(): boolean;
 }
 
-export { Debouncer, type DebouncerCancelled, type DebouncerError, type DebouncerOk, type DebouncerOptions, type DebouncerResult, Latch, Mutex, type MutexOptions, Once, type OnceResult, RWMutex, type RWMutexOptions, Semaphore, type SemaphoreOptions, Serializer, type SerializerOptions, type SerializerResult };
+export { Debouncer, type DebouncerCancelled, type DebouncerError, type DebouncerOk, type DebouncerOptions, type DebouncerResult, Latch, Mutex, type MutexOptions, Once, OnceExecutionConflict, type OnceResult, RWMutex, type RWMutexOptions, Semaphore, type SemaphoreOptions, Serializer, SerializerExecutionDone, type SerializerOptions, type SerializerResult, SyncError, TimeoutError };

package/index.d.ts

@@ -1,3 +1,182 @@
+interface DebouncerOptions {
+    /**
+     * Quiet period in milliseconds. The last-enqueued function runs after
+     * no new calls have arrived for this duration.
+     * @default 300
+     */
+    delay?: number;
+    /**
+     * If true, also fires immediately on the leading edge (first call in a
+     * quiet period), then debounces subsequent calls normally.
+     *
+     * Leading-edge semantics: the leading call fires immediately and clears
+     * _pendingFn. Any calls arriving *while* the leading execution is in flight
+     * register as a new trailing call and will be resolved by the trailing timer
+     * when the quiet period expires. Calls arriving during the leading execution
+     * are never lost.
+     *
+     * @default false
+     */
+    leading?: boolean;
+}
+/**
+ * Result when the debounced function successfully executed.
+ */
+type DebouncerOk<T> = {
+    status: "ok";
+    value: T;
+};
+/**
+ * Result when the debounced function threw an error.
+ */
+type DebouncerError = {
+    status: "error";
+    error: unknown;
+};
+/**
+ * Result when the debounced call was cancelled before execution.
+ */
+type DebouncerCancelled = {
+    status: "cancelled";
+};
+/**
+ * Discriminated union of all possible Debouncer outcomes.
+ *
+ * - `DebouncerOk<T>`: function ran and returned a value.
+ * - `DebouncerError`: function ran and threw an error.
+ * - `DebouncerCancelled`: call was cancelled before it ran.
+ */
+type DebouncerResult<T> = DebouncerOk<T> | DebouncerError | DebouncerCancelled;
+/**
+ * Collapses rapid successive calls into a single execution.
+ *
+ * Each call to `do()` returns a promise that resolves with the result of the
+ * debounced execution — i.e. all callers within the same quiet window share
+ * the same result. The function that actually runs is always the *last* one
+ * enqueued before the delay expires.
+ *
+ * @example
+ * const debounced = new Debouncer({ delay: 200 });
+ * // Called rapidly three times — only the last fn runs.
+ * const [a, b, c] = await Promise.all([
+ *   debounced.do(() => fetch("/api/search?q=h")),
+ *   debounced.do(() => fetch("/api/search?q=he")),
+ *   debounced.do(() => fetch("/api/search?q=hel")),
+ * ]);
+ * // a.status === "ok" and a.value is the result of the third fetch.
+ * // b and c share the same result as a.
+ */
+declare class Debouncer<T = void> {
+    private _delay;
+    private _leading;
+    private _timer;
+    private _pendingFn;
+    private _pendingResolvers;
+    private _leadingFired;
+    constructor(options?: DebouncerOptions);
+    /**
+     * Enqueues a function and returns a promise that resolves with its result.
+     *
+     * All callers within the same quiet window share the same result — the
+     * function that actually runs is the *last* one enqueued before the delay
+     * expires. Use this when you need the return value of the debounced call.
+     *
+     * For fire-and-forget use (void fns, event handlers), prefer `fire()` to
+     * avoid unhandled-promise-rejection warnings and make intent explicit.
+     *
+     * @param fn - The function to debounce.
+     * @returns A promise resolving with a DebouncerResult discriminated union.
+     */
+    do(fn: () => Promise<T> | T): Promise<DebouncerResult<T>>;
+    /**
+     * Enqueues a function without returning a promise (fire-and-forget).
+     *
+     * Identical debounce semantics to `do()` — the last-enqueued function runs
+     * after the quiet period. Use this for void callbacks, DOM event handlers,
+     * or any caller that doesn't care about the result. No dangling promise,
+     * no unhandled-rejection risk.
+     *
+     * @param fn - The function to debounce.
+     */
+    fire(fn: () => Promise<T> | T): void;
+    /**
+     * Shared enqueue logic for both `do()` and `fire()`.
+     *
+     */
+    private _enqueue;
+    /**
+     * Immediately cancels any pending debounced execution.
+     * All waiting callers resolve with `{ status: "cancelled" }`.
+     */
+    cancel(): void;
+    /**
+     * Immediately executes the pending function (if any), bypassing the remaining delay.
+     * All waiting callers receive the result.
+     */
+    flush(): Promise<DebouncerResult<T> | null>;
+    /** Returns true if a debounced call is currently pending. */
+    pending(): boolean;
+    /**
+     * Executes the latest pending function and resolves all waiting callers.
+     */
+    private _fire;
+}
+
+/** Represents all errors within the sync system */
+declare class SyncError extends Error {
+    constructor(message: string, cause?: unknown);
+}
+declare class TimeoutError extends SyncError {
+    constructor(message?: string);
+}
+declare class OnceExecutionConflict extends SyncError {
+    constructor(cause?: unknown);
+}
+declare class SerializerExecutionDone extends SyncError {
+    constructor(cause?: unknown);
+}
+
+/**
+ * A one-shot gate that starts closed and opens exactly once.
+ *
+ * All current and future `wait()` callers resolve immediately once `open()` is
+ * called. Unlike Once, Latch carries no return value and has no retry logic —
+ * it is a pure signalling primitive.
+ *
+ * Typical use: coordinate startup, signal that an initialisation phase is done,
+ * or gate downstream work on a single event.
+ *
+ * @example
+ * const ready = new Latch();
+ * // Consumer
+ * await ready.wait();
+ * // Producer (elsewhere)
+ * ready.open();
+ */
+declare class Latch {
+    private _open;
+    private _resolve;
+    private _promise;
+    constructor();
+    /**
+     * Opens the latch. All current and future waiters resolve immediately.
+     * Calling open() more than once is a no-op.
+     */
+    open(): void;
+    /**
+     * Returns a promise that resolves when the latch is opened.
+     * If already open, resolves on the next microtask checkpoint.
+     *
+     * @param timeout - Optional maximum wait time in milliseconds.
+     * @throws {TimeoutError} If the latch does not open within the timeout.
+     */
+    wait(timeout?: number): Promise<void>;
+    /**
+     * Synchronously checks whether the latch has been opened.
+     */
+    isOpen(): boolean;
+}
+
 interface MutexOptions {
     /**
      * Maximum number of pending requests allowed in the queue.
@@ -64,61 +243,7 @@ declare class Mutex {
     /** Returns the number of operations waiting for the lock. */
     pending(): number;
 }
-interface SemaphoreOptions extends MutexOptions {
-    /**
-     * Number of concurrent holders allowed.
-     * Inherits `capacity` and `yieldMode` from MutexOptions.
-     * @default 1 (equivalent to a Mutex)
-     */
-    slots?: number;
-}
-/**
- * A counting semaphore — generalises Mutex to allow up to N concurrent holders.
- *
- * Useful for rate-limiting concurrency: e.g. "at most 3 in-flight HTTP requests".
- * With slots=1 it behaves identically to Mutex.
- *
- * Accepts the same `capacity` and `yieldMode` options as Mutex, plus `slots`.
- */
-declare class Semaphore {
-    private _slots;
-    private _available;
-    private _capacity;
-    private _yieldMode;
-    private waiters;
-    constructor(options?: SemaphoreOptions);
-    /**
-     * Acquires one slot. If all slots are taken, waits until one is released.
-     *
-     * @param timeout - Optional maximum wait time in milliseconds.
-     * @throws {TimeoutError} If a slot cannot be acquired within the timeout.
-     * @throws {Error} If the wait queue is full.
-     */
-    acquire(timeout?: number): Promise<void>;
-    /**
-     * Attempts to acquire a slot without waiting.
-     * @returns `true` if a slot was acquired, `false` otherwise.
-     */
-    tryAcquire(): boolean;
-    /**
-     * Releases one slot. If waiters are queued, the next one is scheduled
-     * according to yieldMode.
-     *
-     * @throws {Error} If no slot is currently held (release without acquire).
-     */
-    release(): void;
-    /**
-     * Runs a function with one acquired slot, releasing it when done.
-     * Convenience wrapper — prefer this over manual acquire/release.
-     */
-    run<T>(fn: () => Promise<T> | T, timeout?: number): Promise<T>;
-    /** Number of slots currently free. */
-    available(): number;
-    /** Number of callers waiting for a slot. */
-    pending(): number;
-    /** Total slot count (as configured). */
-    slots(): number;
-}
+
 type OnceResult<T> = {
     value: T | null;
     error?: unknown;
@@ -161,13 +286,6 @@ declare class Once<T = void> {
      * @returns The result of the execution.
      */
     doSync(fn: () => T): OnceResult<T>;
-    /**
-     * Returns true if the operation has completed (success or non-retryable failure)
-     * and the internal promise has been cleared.
-     *
-     * This is the canonical "safe to read" check — prefer it over `done()`.
-     */
-    ready(): boolean;
     /**
      * Returns true if the operation is currently executing.
      *
@@ -210,116 +328,18 @@ declare class Once<T = void> {
      */
     private _awaitWithTimeout;
 }
-type SerializerResult<T> = {
-    value: T | null;
-    error?: unknown;
-};
-interface SerializerOptions {
-    /**
-     * Max items in queue. If full, .do() returns an error immediately.
-     * @default 1000
-     */
-    capacity?: number;
+
+interface RWMutexOptions {
     /**
-     * Yield mode for the internal mutex. Defaults to "macrotask" for
-     * coarse-grained serializers. Use "microtask" for fine-grained
-     * latency-sensitive serializers.
-     */
-    yieldMode?: "macrotask" | "microtask";
-}
-/**
- * Ensures tasks are executed sequentially (FIFO).
- * Maintains the result of the last successful execution.
- * Includes backpressure protection via configurable queue capacity.
- */
-declare class Serializer<T = void> {
-    private mutex;
-    private _done;
-    private _lastValue;
-    private _lastError;
-    private _hasRun;
-    constructor(options?: SerializerOptions);
-    /**
-     * Enqueue a function to be executed after all previous tasks complete.
-     *
-     * @param fn - The function to execute.
-     * @param timeout - Max time to wait to acquire the lock.
-     * @returns Object containing the value or error.
-     */
-    do(fn: () => Promise<T> | T, timeout?: number): Promise<SerializerResult<T | null>>;
-    /**
-     * Returns the result of the last execution.
-     *
-     * Returns `{ value: null, error: undefined }` both when the serializer has
-     * never run and when it ran and returned null — use `hasRun()` to distinguish
-     * these two cases.
-     */
-    peek(): SerializerResult<T | null>;
-    /**
-     * Returns true if at least one task has been executed (successfully or not).
-     */
-    hasRun(): boolean;
-    /**
-     * Permanently closes the serializer.
-     * Subsequent calls to `do()` will fail immediately with SerializerExecutionDone.
-     */
-    close(): void;
-    /** Returns the number of tasks currently waiting. */
-    pending(): number;
-    /** Returns true if a task is currently executing. */
-    running(): boolean;
-}
-/**
- * A one-shot gate that starts closed and opens exactly once.
- *
- * All current and future `wait()` callers resolve immediately once `open()` is
- * called. Unlike Once, Latch carries no return value and has no retry logic —
- * it is a pure signalling primitive.
- *
- * Typical use: coordinate startup, signal that an initialisation phase is done,
- * or gate downstream work on a single event.
- *
- * @example
- * const ready = new Latch();
- * // Consumer
- * await ready.wait();
- * // Producer (elsewhere)
- * ready.open();
- */
-declare class Latch {
-    private _open;
-    private _resolve;
-    private _promise;
-    constructor();
-    /**
-     * Opens the latch. All current and future waiters resolve immediately.
-     * Calling open() more than once is a no-op.
-     */
-    open(): void;
-    /**
-     * Returns a promise that resolves when the latch is opened.
-     * If already open, resolves on the next microtask checkpoint.
-     *
-     * @param timeout - Optional maximum wait time in milliseconds.
-     * @throws {TimeoutError} If the latch does not open within the timeout.
-     */
-    wait(timeout?: number): Promise<void>;
-    /**
-     * Synchronously checks whether the latch has been opened.
-     */
-    isOpen(): boolean;
-}
-interface RWMutexOptions {
-    /**
-     * Controls how lock handoff is scheduled when a waiter is unblocked.
-     *
-     * - `"microtask"` (default): Uses queueMicrotask(fn). Near-zero latency
-     *   between handoffs. Appropriate for RWMutex because readers are woken in
-     *   bulk and writers are rarely contended enough to cause starvation.
-     *
-     * - `"macrotask"`: Uses setTimeout(fn, 0) to yield to the event loop between
-     *   handoffs. Use if you observe microtask starvation under extreme write
-     *   contention on this specific lock.
+     * Controls how lock handoff is scheduled when a waiter is unblocked.
+     *
+     * - `"microtask"` (default): Uses queueMicrotask(fn). Near-zero latency
+     *   between handoffs. Appropriate for RWMutex because readers are woken in
+     *   bulk and writers are rarely contended enough to cause starvation.
+     *
+     * - `"macrotask"`: Uses setTimeout(fn, 0) to yield to the event loop between
+     *   handoffs. Use if you observe microtask starvation under extreme write
+     *   contention on this specific lock.
      */
     yieldMode?: "macrotask" | "microtask";
 }
@@ -402,128 +422,121 @@ declare class RWMutex {
      */
     private _schedule;
 }
-interface DebouncerOptions {
-    /**
-     * Quiet period in milliseconds. The last-enqueued function runs after
-     * no new calls have arrived for this duration.
-     * @default 300
-     */
-    delay?: number;
+
+interface SemaphoreOptions extends MutexOptions {
     /**
-     * If true, also fires immediately on the leading edge (first call in a
-     * quiet period), then debounces subsequent calls normally.
-     *
-     * Leading-edge semantics: the leading call fires immediately and clears
-     * _pendingFn. Any calls arriving *while* the leading execution is in flight
-     * register as a new trailing call and will be resolved by the trailing timer
-     * when the quiet period expires. Calls arriving during the leading execution
-     * are never lost.
-     *
-     * @default false
+     * Number of concurrent holders allowed.
+     * Inherits `capacity` and `yieldMode` from MutexOptions.
+     * @default 1 (equivalent to a Mutex)
      */
-    leading?: boolean;
+    slots?: number;
 }
 /**
- * Result when the debounced function successfully executed.
- */
-type DebouncerOk<T> = {
-    status: "ok";
-    value: T;
-};
-/**
- * Result when the debounced function threw an error.
- */
-type DebouncerError = {
-    status: "error";
-    error: unknown;
-};
-/**
- * Result when the debounced call was cancelled before execution.
- */
-type DebouncerCancelled = {
-    status: "cancelled";
-};
-/**
- * Discriminated union of all possible Debouncer outcomes.
- *
- * - `DebouncerOk<T>`: function ran and returned a value.
- * - `DebouncerError`: function ran and threw an error.
- * - `DebouncerCancelled`: call was cancelled before it ran.
- */
-type DebouncerResult<T> = DebouncerOk<T> | DebouncerError | DebouncerCancelled;
-/**
- * Collapses rapid successive calls into a single execution.
+ * A counting semaphore — generalises Mutex to allow up to N concurrent holders.
  *
- * Each call to `do()` returns a promise that resolves with the result of the
- * debounced execution — i.e. all callers within the same quiet window share
- * the same result. The function that actually runs is always the *last* one
- * enqueued before the delay expires.
+ * Useful for rate-limiting concurrency: e.g. "at most 3 in-flight HTTP requests".
+ * With slots=1 it behaves identically to Mutex.
  *
- * @example
- * const debounced = new Debouncer({ delay: 200 });
- * // Called rapidly three times — only the last fn runs.
- * const [a, b, c] = await Promise.all([
- *   debounced.do(() => fetch("/api/search?q=h")),
- *   debounced.do(() => fetch("/api/search?q=he")),
- *   debounced.do(() => fetch("/api/search?q=hel")),
- * ]);
- * // a.status === "ok" and a.value is the result of the third fetch.
- * // b and c share the same result as a.
+ * Accepts the same `capacity` and `yieldMode` options as Mutex, plus `slots`.
  */
-declare class Debouncer<T = void> {
-    private _delay;
-    private _leading;
-    private _timer;
-    private _pendingFn;
-    private _pendingResolvers;
-    private _leadingFired;
-    constructor(options?: DebouncerOptions);
+declare class Semaphore {
+    private _slots;
+    private _available;
+    private _capacity;
+    private _yieldMode;
+    private waiters;
+    constructor(options?: SemaphoreOptions);
     /**
-     * Enqueues a function and returns a promise that resolves with its result.
-     *
-     * All callers within the same quiet window share the same result — the
-     * function that actually runs is the *last* one enqueued before the delay
-     * expires. Use this when you need the return value of the debounced call.
-     *
-     * For fire-and-forget use (void fns, event handlers), prefer `fire()` to
-     * avoid unhandled-promise-rejection warnings and make intent explicit.
+     * Acquires one slot. If all slots are taken, waits until one is released.
      *
-     * @param fn - The function to debounce.
-     * @returns A promise resolving with a DebouncerResult discriminated union.
+     * @param timeout - Optional maximum wait time in milliseconds.
+     * @throws {TimeoutError} If a slot cannot be acquired within the timeout.
+     * @throws {Error} If the wait queue is full.
      */
-    do(fn: () => Promise<T> | T): Promise<DebouncerResult<T>>;
+    acquire(timeout?: number): Promise<void>;
     /**
-     * Enqueues a function without returning a promise (fire-and-forget).
-     *
-     * Identical debounce semantics to `do()` — the last-enqueued function runs
-     * after the quiet period. Use this for void callbacks, DOM event handlers,
-     * or any caller that doesn't care about the result. No dangling promise,
-     * no unhandled-rejection risk.
+     * Attempts to acquire a slot without waiting.
+     * @returns `true` if a slot was acquired, `false` otherwise.
+     */
+    tryAcquire(): boolean;
+    /**
+     * Releases one slot. If waiters are queued, the next one is scheduled
+     * according to yieldMode.
      *
-     * @param fn - The function to debounce.
+     * @throws {Error} If no slot is currently held (release without acquire).
      */
-    fire(fn: () => Promise<T> | T): void;
+    release(): void;
     /**
-     * Shared enqueue logic for both `do()` and `fire()`.
+     * Runs a function with one acquired slot, releasing it when done.
+     * Convenience wrapper — prefer this over manual acquire/release.
+     */
+    run<T>(fn: () => Promise<T> | T, timeout?: number): Promise<T>;
+    /** Number of slots currently free. */
+    available(): number;
+    /** Number of callers waiting for a slot. */
+    pending(): number;
+    /** Total slot count (as configured). */
+    slots(): number;
+}
+
+type SerializerResult<T> = {
+    value: T | null;
+    error?: unknown;
+};
+interface SerializerOptions {
+    /**
+     * Max items in queue. If full, .do() returns an error immediately.
+     * @default 1000
+     */
+    capacity?: number;
+    /**
+     * Yield mode for the internal mutex. Defaults to "macrotask" for
+     * coarse-grained serializers. Use "microtask" for fine-grained
+     * latency-sensitive serializers.
+     */
+    yieldMode?: "macrotask" | "microtask";
+}
+/**
+ * Ensures tasks are executed sequentially (FIFO).
+ * Maintains the result of the last successful execution.
+ * Includes backpressure protection via configurable queue capacity.
+ */
+declare class Serializer<T = void> {
+    private mutex;
+    private _done;
+    private _lastValue;
+    private _lastError;
+    private _hasRun;
+    constructor(options?: SerializerOptions);
+    /**
+     * Enqueue a function to be executed after all previous tasks complete.
      *
+     * @param fn - The function to execute.
+     * @param timeout - Max time to wait to acquire the lock.
+     * @returns Object containing the value or error.
      */
-    private _enqueue;
+    do(fn: () => Promise<T> | T, timeout?: number): Promise<SerializerResult<T | null>>;
     /**
-     * Immediately cancels any pending debounced execution.
-     * All waiting callers resolve with `{ status: "cancelled" }`.
+     * Returns the result of the last execution.
+     *
+     * Returns `{ value: null, error: undefined }` both when the serializer has
+     * never run and when it ran and returned null — use `hasRun()` to distinguish
+     * these two cases.
      */
-    cancel(): void;
+    peek(): SerializerResult<T | null>;
     /**
-     * Immediately executes the pending function (if any), bypassing the remaining delay.
-     * All waiting callers receive the result.
+     * Returns true if at least one task has been executed (successfully or not).
      */
-    flush(): Promise<DebouncerResult<T> | null>;
-    /** Returns true if a debounced call is currently pending. */
-    pending(): boolean;
+    hasRun(): boolean;
     /**
-     * Executes the latest pending function and resolves all waiting callers.
+     * Permanently closes the serializer.
+     * Subsequent calls to `do()` will fail immediately with SerializerExecutionDone.
      */
-    private _fire;
+    close(): void;
+    /** Returns the number of tasks currently waiting. */
+    pending(): number;
+    /** Returns true if a task is currently executing. */
+    running(): boolean;
 }
 
-export { Debouncer, type DebouncerCancelled, type DebouncerError, type DebouncerOk, type DebouncerOptions, type DebouncerResult, Latch, Mutex, type MutexOptions, Once, type OnceResult, RWMutex, type RWMutexOptions, Semaphore, type SemaphoreOptions, Serializer, type SerializerOptions, type SerializerResult };
+export { Debouncer, type DebouncerCancelled, type DebouncerError, type DebouncerOk, type DebouncerOptions, type DebouncerResult, Latch, Mutex, type MutexOptions, Once, OnceExecutionConflict, type OnceResult, RWMutex, type RWMutexOptions, Semaphore, type SemaphoreOptions, Serializer, SerializerExecutionDone, type SerializerOptions, type SerializerResult, SyncError, TimeoutError };

package/index.js

@@ -1 +1 @@
-"use strict";var e=class e extends Error{constructor(t,i){super(t,{cause:i}),this.name="SyncError",Object.setPrototypeOf(this,e.prototype)}},t=class extends e{constructor(e){super(`[ArtifactContainer] Operation timed out: ${e}`)}},i=class extends e{constructor(e){super("[Serializer] The serializer has been marked as done!",e)}},r=class{_locked=!1;_capacity;_yieldMode;waiters=[];constructor(e){this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask"}async lock(e){if(!this._locked)return void(this._locked=!0);if(this.waiters.length>=this._capacity)throw new Error(`Mutex queue is full (capacity: ${this._capacity})`);let i;const r=new Promise((e=>i=e));if(this.waiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(i);-1!==e&&this.waiters.splice(e,1),o(new t("Mutex lock timed out"))}),e)}))])}tryLock(){return!this._locked&&(this._locked=!0,!0)}unlock(){if(!this._locked)throw new Error("Mutex is not locked");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._locked=!1}locked(){return this._locked}pending(){return this.waiters.length}};exports.Debouncer=class{_delay;_leading;_timer;_pendingFn;_pendingResolvers=[];_leadingFired=!1;constructor(e){this._delay=e?.delay??300,this._leading=e?.leading??!1}do(e){return new Promise((t=>{this._enqueue(e,t)}))}fire(e){this._enqueue(e,void 0)}_enqueue(e,t){if(this._pendingFn=e,t&&this._pendingResolvers.push(t),this._leading&&!this._leadingFired)return this._leadingFired=!0,this._fire(),clearTimeout(this._timer),void(this._timer=setTimeout((()=>{this._leadingFired=!1,void 0!==this._pendingFn&&this._fire()}),this._delay));clearTimeout(this._timer),this._timer=setTimeout((()=>{this._leadingFired=!1,this._fire()}),this._delay)}cancel(){clearTimeout(this._timer),this._timer=void 0,this._pendingFn=void 0,this._leadingFired=!1;const e=this._pendingResolvers.splice(0);for(const t of e)t({status:"cancelled"})}async flush(){return this._pendingFn?(clearTimeout(this._timer),this._timer=void 0,this._leadingFired=!1,this._fire()):null}pending(){return void 0!==this._pendingFn}async _fire(){const e=this._pendingFn,t=this._pendingResolvers.splice(0);let i;this._pendingFn=void 0;try{i={status:"ok",value:await e()}}catch(e){i={status:"error",error:e}}for(const e of t)e(i);return i}},exports.Latch=class{_open=!1;_resolve;_promise;constructor(){this._promise=new Promise((e=>{this._resolve=e}))}open(){this._open||(this._open=!0,this._resolve())}async wait(e){if(this._open)return;if(null==e)return this._promise;let i;await Promise.race([this._promise.then((()=>clearTimeout(i))),new Promise(((r,s)=>{i=setTimeout((()=>s(new t("Latch timed out"))),e)}))])}isOpen(){return this._open}},exports.Mutex=r,exports.Once=class{mutex=new r({yieldMode:"microtask"});promise=null;_value=null;_error;_done=!1;retry;throws;constructor({retry:e,throws:t}={}){this.retry=Boolean(e),this.throws=Boolean(t)}async do(e,t){return this._done?this.peek():this.promise?this._awaitWithTimeout(this.promise,t,"Once do() timed out"):(await this.mutex.lock(),this.promise?(this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")):(this.promise=(async()=>{try{const t=await e();this._value=t,this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.promise=null}return this.peek()})(),this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")))}doSync(e){if(this._done){if(this.throws&&this._error)throw this._error;return this.peek()}if(this.promise){const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}if(!this.mutex.tryLock()){const e=new Error("Cannot execute doSync: lock is currently held.");if(this.throws)throw e;return{value:null,error:e}}if(this.promise||this._done){if(this.mutex.unlock(),this._done){if(this.throws&&this._error)throw this._error;return this.peek()}const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}try{const t=e();this._value=t,this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.mutex.unlock()}return this.peek()}ready(){return this._done}running(){return null!==this.promise&&!this.ready()}peek(){return{value:this._value,error:this._error}}get(){if(!this._done)throw new Error("Once operation is not yet complete");if(this._error)throw this._error;return this._value}reset(){if(this.running())throw new Error("Cannot reset Once while an operation is in progress.");this._done=!1,this.promise=null,this._value=null,this._error=void 0}done(){return this._done}current(){return this.promise}_awaitWithTimeout(e,i,r="Operation timed out"){if(null==i)return e;let s;return Promise.race([e.then((e=>(clearTimeout(s),e))),new Promise(((e,o)=>{s=setTimeout((()=>o(new t(r))),i)}))])}},exports.RWMutex=class{_readers=0;_writeLocked=!1;_pendingWriters=0;_yieldMode;readerWaiters=[];writerWaiters=[];constructor(e){this._yieldMode=e?.yieldMode??"microtask"}async rlock(e){if(!this._writeLocked&&0===this._pendingWriters)return void this._readers++;let i;const r=new Promise((e=>i=e));if(this.readerWaiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.readerWaiters.indexOf(i);-1!==e&&this.readerWaiters.splice(e,1),o(new t("RWMutex rlock timed out"))}),e)}))])}runlock(){if(this._readers<=0)throw new Error("RWMutex: runlock called without a matching rlock");this._readers--,this._tryWakeWriter()}async lock(e){if(!this._writeLocked&&0===this._readers)return void(this._writeLocked=!0);let i;this._pendingWriters++;const r=new Promise((e=>i=e));if(this.writerWaiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.writerWaiters.indexOf(i);-1!==e&&(this.writerWaiters.splice(e,1),this._pendingWriters--),o(new t("RWMutex lock timed out"))}),e)}))])}unlock(){if(!this._writeLocked)throw new Error("RWMutex: unlock called without a matching lock");this._writeLocked=!1,this._tryWakeWriter()||this._wakeAllReaders()}async read(e,t){await this.rlock(t);try{return await e()}finally{this.runlock()}}async write(e,t){await this.lock(t);try{return await e()}finally{this.unlock()}}writeLocked(){return this._writeLocked}readers(){return this._readers}pendingWriters(){return this._pendingWriters}pendingReaders(){return this.readerWaiters.length}_tryWakeWriter(){if(this._writeLocked||this._readers>0)return!1;const e=this.writerWaiters.shift();return!!e&&(this._writeLocked=!0,this._pendingWriters--,this._schedule(e),!0)}_wakeAllReaders(){const e=this.readerWaiters.splice(0);if(0!==e.length){this._readers+=e.length;for(const t of e)this._schedule(t)}}_schedule(e){"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0)}},exports.Semaphore=class{_slots;_available;_capacity;_yieldMode;waiters=[];constructor(e){if(this._slots=e?.slots??1,this._available=this._slots,this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask",this._slots<1)throw new Error("Semaphore slots must be >= 1")}async acquire(e){if(this._available>0)return void this._available--;if(this.waiters.length>=this._capacity)throw new Error(`Semaphore queue is full (capacity: ${this._capacity})`);let i;const r=new Promise((e=>i=e));if(this.waiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(i);-1!==e&&this.waiters.splice(e,1),o(new t("Semaphore acquire timed out"))}),e)}))])}tryAcquire(){return this._available>0&&(this._available--,!0)}release(){if(this._available>=this._slots)throw new Error("Semaphore released more times than acquired");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._available++}async run(e,t){await this.acquire(t);try{return await e()}finally{this.release()}}available(){return this._available}pending(){return this.waiters.length}slots(){return this._slots}},exports.Serializer=class{mutex;_done=!1;_lastValue=null;_lastError=void 0;_hasRun=!1;constructor(e){this.mutex=new r({capacity:e?.capacity??1e3,yieldMode:e?.yieldMode??"macrotask"})}async do(e,t){if(this._done)return{value:null,error:new i};try{await this.mutex.lock(t)}catch(e){return{value:null,error:e}}let r,s=null;try{if(this._done)throw new i;s=await e(),this._lastValue=s,this._lastError=void 0,this._hasRun=!0}catch(e){r=e,this._lastError=e,this._hasRun=!0}finally{this.mutex.unlock()}return{value:s,error:r}}peek(){return{value:this._lastValue,error:this._lastError}}hasRun(){return this._hasRun}close(){this._done=!0}pending(){return this.mutex.pending()}running(){return this.mutex.locked()}};
+"use strict";var e=class e extends Error{constructor(t,i){super(t,{cause:i}),this.name="SyncError",Object.setPrototypeOf(this,e.prototype)}},t=class extends e{constructor(e){super(`[ArtifactContainer] Operation timed out: ${e}`)}},i=class extends e{constructor(e){super("[Serializer] The serializer has been marked as done!",e)}},r=class{_locked=!1;_capacity;_yieldMode;waiters=[];constructor(e){this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask"}async lock(e){if(!this._locked)return void(this._locked=!0);if(this.waiters.length>=this._capacity)throw new Error(`Mutex queue is full (capacity: ${this._capacity})`);let i;const r=new Promise((e=>i=e));if(this.waiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(i);-1!==e&&this.waiters.splice(e,1),o(new t("Mutex lock timed out"))}),e)}))])}tryLock(){return!this._locked&&(this._locked=!0,!0)}unlock(){if(!this._locked)throw new Error("Mutex is not locked");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._locked=!1}locked(){return this._locked}pending(){return this.waiters.length}};exports.Debouncer=class{_delay;_leading;_timer;_pendingFn;_pendingResolvers=[];_leadingFired=!1;constructor(e){this._delay=e?.delay??300,this._leading=e?.leading??!1}do(e){return new Promise((t=>{this._enqueue(e,t)}))}fire(e){this._enqueue(e,void 0)}_enqueue(e,t){if(this._pendingFn=e,t&&this._pendingResolvers.push(t),this._leading&&!this._leadingFired)return this._leadingFired=!0,this._fire(),clearTimeout(this._timer),void(this._timer=setTimeout((()=>{this._leadingFired=!1,void 0!==this._pendingFn&&this._fire()}),this._delay));clearTimeout(this._timer),this._timer=setTimeout((()=>{this._leadingFired=!1,this._fire()}),this._delay)}cancel(){clearTimeout(this._timer),this._timer=void 0,this._pendingFn=void 0,this._leadingFired=!1;const e=this._pendingResolvers.splice(0);for(const t of e)t({status:"cancelled"})}async flush(){return this._pendingFn?(clearTimeout(this._timer),this._timer=void 0,this._leadingFired=!1,this._fire()):null}pending(){return void 0!==this._pendingFn}async _fire(){const e=this._pendingFn,t=this._pendingResolvers.splice(0);let i;this._pendingFn=void 0;try{i={status:"ok",value:await e()}}catch(e){i={status:"error",error:e}}for(const e of t)e(i);return i}},exports.Latch=class{_open=!1;_resolve;_promise;constructor(){this._promise=new Promise((e=>{this._resolve=e}))}open(){this._open||(this._open=!0,this._resolve())}async wait(e){if(this._open)return;if(null==e)return this._promise;let i;await Promise.race([this._promise.then((()=>clearTimeout(i))),new Promise(((r,s)=>{i=setTimeout((()=>s(new t("Latch timed out"))),e)}))])}isOpen(){return this._open}},exports.Mutex=r,exports.Once=class{mutex=new r({yieldMode:"microtask"});promise=null;_value=null;_error;_done=!1;retry;throws;constructor({retry:e,throws:t}={}){this.retry=Boolean(e),this.throws=Boolean(t)}async do(e,t){return this._done?this.peek():this.promise?this._awaitWithTimeout(this.promise,t,"Once do() timed out"):(await this.mutex.lock(),this.promise?(this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")):(this.promise=(async()=>{try{this._value=await e(),this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.retry&&!this._done&&(this.promise=null)}return this.peek()})(),this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")))}doSync(e){if(this._done){if(this.throws&&this._error)throw this._error;return this.peek()}if(this.promise){const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}if(!this.mutex.tryLock()){const e=new Error("Cannot execute doSync: lock is currently held.");if(this.throws)throw e;return{value:null,error:e}}if(this.promise||this._done){if(this.mutex.unlock(),this._done){if(this.throws&&this._error)throw this._error;return this.peek()}const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}try{const t=e();this._value=t,this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.mutex.unlock()}return this.peek()}running(){return null!==this.promise&&!this.done()}peek(){return{value:this._value,error:this._error}}get(){if(!this._done)throw new Error("Once operation is not yet complete");if(this._error)throw this._error;return this._value}reset(){if(this.running())throw new Error("Cannot reset Once while an operation is in progress.");this._done=!1,this.promise=null,this._value=null,this._error=void 0}done(){return this._done}current(){return this.promise}_awaitWithTimeout(e,i,r="Operation timed out"){if(null==i)return e;let s;return Promise.race([e.then((e=>(clearTimeout(s),e))),new Promise(((e,o)=>{s=setTimeout((()=>o(new t(r))),i)}))])}},exports.OnceExecutionConflict=class extends e{constructor(e){super("[Once] A method has already been registered!",e)}},exports.RWMutex=class{_readers=0;_writeLocked=!1;_pendingWriters=0;_yieldMode;readerWaiters=[];writerWaiters=[];constructor(e){this._yieldMode=e?.yieldMode??"microtask"}async rlock(e){if(!this._writeLocked&&0===this._pendingWriters)return void this._readers++;let i;const r=new Promise((e=>i=e));if(this.readerWaiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.readerWaiters.indexOf(i);-1!==e&&this.readerWaiters.splice(e,1),o(new t("RWMutex rlock timed out"))}),e)}))])}runlock(){if(this._readers<=0)throw new Error("RWMutex: runlock called without a matching rlock");this._readers--,this._tryWakeWriter()}async lock(e){if(!this._writeLocked&&0===this._readers)return void(this._writeLocked=!0);let i;this._pendingWriters++;const r=new Promise((e=>i=e));if(this.writerWaiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.writerWaiters.indexOf(i);-1!==e&&(this.writerWaiters.splice(e,1),this._pendingWriters--),o(new t("RWMutex lock timed out"))}),e)}))])}unlock(){if(!this._writeLocked)throw new Error("RWMutex: unlock called without a matching lock");this._writeLocked=!1,this._tryWakeWriter()||this._wakeAllReaders()}async read(e,t){await this.rlock(t);try{return await e()}finally{this.runlock()}}async write(e,t){await this.lock(t);try{return await e()}finally{this.unlock()}}writeLocked(){return this._writeLocked}readers(){return this._readers}pendingWriters(){return this._pendingWriters}pendingReaders(){return this.readerWaiters.length}_tryWakeWriter(){if(this._writeLocked||this._readers>0)return!1;const e=this.writerWaiters.shift();return!!e&&(this._writeLocked=!0,this._pendingWriters--,this._schedule(e),!0)}_wakeAllReaders(){const e=this.readerWaiters.splice(0);if(0!==e.length){this._readers+=e.length;for(const t of e)this._schedule(t)}}_schedule(e){"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0)}},exports.Semaphore=class{_slots;_available;_capacity;_yieldMode;waiters=[];constructor(e){if(this._slots=e?.slots??1,this._available=this._slots,this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask",this._slots<1)throw new Error("Semaphore slots must be >= 1")}async acquire(e){if(this._available>0)return void this._available--;if(this.waiters.length>=this._capacity)throw new Error(`Semaphore queue is full (capacity: ${this._capacity})`);let i;const r=new Promise((e=>i=e));if(this.waiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(i);-1!==e&&this.waiters.splice(e,1),o(new t("Semaphore acquire timed out"))}),e)}))])}tryAcquire(){return this._available>0&&(this._available--,!0)}release(){if(this._available>=this._slots)throw new Error("Semaphore released more times than acquired");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._available++}async run(e,t){await this.acquire(t);try{return await e()}finally{this.release()}}available(){return this._available}pending(){return this.waiters.length}slots(){return this._slots}},exports.Serializer=class{mutex;_done=!1;_lastValue=null;_lastError=void 0;_hasRun=!1;constructor(e){this.mutex=new r({capacity:e?.capacity??1e3,yieldMode:e?.yieldMode??"macrotask"})}async do(e,t){if(this._done)return{value:null,error:new i};try{await this.mutex.lock(t)}catch(e){return{value:null,error:e}}let r,s=null;try{if(this._done)throw new i;s=await e(),this._lastValue=s,this._lastError=void 0,this._hasRun=!0}catch(e){r=e,this._lastError=e,this._hasRun=!0}finally{this.mutex.unlock()}return{value:s,error:r}}peek(){return{value:this._lastValue,error:this._lastError}}hasRun(){return this._hasRun}close(){this._done=!0}pending(){return this.mutex.pending()}running(){return this.mutex.locked()}},exports.SerializerExecutionDone=i,exports.SyncError=e,exports.TimeoutError=t;

package/index.mjs

@@ -1 +1 @@
-var e=class e extends Error{constructor(t,i){super(t,{cause:i}),this.name="SyncError",Object.setPrototypeOf(this,e.prototype)}},t=class extends e{constructor(e){super(`[ArtifactContainer] Operation timed out: ${e}`)}},i=class extends e{constructor(e){super("[Serializer] The serializer has been marked as done!",e)}},r=class{_locked=!1;_capacity;_yieldMode;waiters=[];constructor(e){this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask"}async lock(e){if(!this._locked)return void(this._locked=!0);if(this.waiters.length>=this._capacity)throw new Error(`Mutex queue is full (capacity: ${this._capacity})`);let i;const r=new Promise((e=>i=e));if(this.waiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(i);-1!==e&&this.waiters.splice(e,1),o(new t("Mutex lock timed out"))}),e)}))])}tryLock(){return!this._locked&&(this._locked=!0,!0)}unlock(){if(!this._locked)throw new Error("Mutex is not locked");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._locked=!1}locked(){return this._locked}pending(){return this.waiters.length}},s=class{_slots;_available;_capacity;_yieldMode;waiters=[];constructor(e){if(this._slots=e?.slots??1,this._available=this._slots,this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask",this._slots<1)throw new Error("Semaphore slots must be >= 1")}async acquire(e){if(this._available>0)return void this._available--;if(this.waiters.length>=this._capacity)throw new Error(`Semaphore queue is full (capacity: ${this._capacity})`);let i;const r=new Promise((e=>i=e));if(this.waiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(i);-1!==e&&this.waiters.splice(e,1),o(new t("Semaphore acquire timed out"))}),e)}))])}tryAcquire(){return this._available>0&&(this._available--,!0)}release(){if(this._available>=this._slots)throw new Error("Semaphore released more times than acquired");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._available++}async run(e,t){await this.acquire(t);try{return await e()}finally{this.release()}}available(){return this._available}pending(){return this.waiters.length}slots(){return this._slots}},o=class{mutex=new r({yieldMode:"microtask"});promise=null;_value=null;_error;_done=!1;retry;throws;constructor({retry:e,throws:t}={}){this.retry=Boolean(e),this.throws=Boolean(t)}async do(e,t){return this._done?this.peek():this.promise?this._awaitWithTimeout(this.promise,t,"Once do() timed out"):(await this.mutex.lock(),this.promise?(this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")):(this.promise=(async()=>{try{const t=await e();this._value=t,this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.promise=null}return this.peek()})(),this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")))}doSync(e){if(this._done){if(this.throws&&this._error)throw this._error;return this.peek()}if(this.promise){const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}if(!this.mutex.tryLock()){const e=new Error("Cannot execute doSync: lock is currently held.");if(this.throws)throw e;return{value:null,error:e}}if(this.promise||this._done){if(this.mutex.unlock(),this._done){if(this.throws&&this._error)throw this._error;return this.peek()}const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}try{const t=e();this._value=t,this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.mutex.unlock()}return this.peek()}ready(){return this._done}running(){return null!==this.promise&&!this.ready()}peek(){return{value:this._value,error:this._error}}get(){if(!this._done)throw new Error("Once operation is not yet complete");if(this._error)throw this._error;return this._value}reset(){if(this.running())throw new Error("Cannot reset Once while an operation is in progress.");this._done=!1,this.promise=null,this._value=null,this._error=void 0}done(){return this._done}current(){return this.promise}_awaitWithTimeout(e,i,r="Operation timed out"){if(null==i)return e;let s;return Promise.race([e.then((e=>(clearTimeout(s),e))),new Promise(((e,o)=>{s=setTimeout((()=>o(new t(r))),i)}))])}},n=class{mutex;_done=!1;_lastValue=null;_lastError=void 0;_hasRun=!1;constructor(e){this.mutex=new r({capacity:e?.capacity??1e3,yieldMode:e?.yieldMode??"macrotask"})}async do(e,t){if(this._done)return{value:null,error:new i};try{await this.mutex.lock(t)}catch(e){return{value:null,error:e}}let r,s=null;try{if(this._done)throw new i;s=await e(),this._lastValue=s,this._lastError=void 0,this._hasRun=!0}catch(e){r=e,this._lastError=e,this._hasRun=!0}finally{this.mutex.unlock()}return{value:s,error:r}}peek(){return{value:this._lastValue,error:this._lastError}}hasRun(){return this._hasRun}close(){this._done=!0}pending(){return this.mutex.pending()}running(){return this.mutex.locked()}},a=class{_open=!1;_resolve;_promise;constructor(){this._promise=new Promise((e=>{this._resolve=e}))}open(){this._open||(this._open=!0,this._resolve())}async wait(e){if(this._open)return;if(null==e)return this._promise;let i;await Promise.race([this._promise.then((()=>clearTimeout(i))),new Promise(((r,s)=>{i=setTimeout((()=>s(new t("Latch timed out"))),e)}))])}isOpen(){return this._open}},h=class{_readers=0;_writeLocked=!1;_pendingWriters=0;_yieldMode;readerWaiters=[];writerWaiters=[];constructor(e){this._yieldMode=e?.yieldMode??"microtask"}async rlock(e){if(!this._writeLocked&&0===this._pendingWriters)return void this._readers++;let i;const r=new Promise((e=>i=e));if(this.readerWaiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.readerWaiters.indexOf(i);-1!==e&&this.readerWaiters.splice(e,1),o(new t("RWMutex rlock timed out"))}),e)}))])}runlock(){if(this._readers<=0)throw new Error("RWMutex: runlock called without a matching rlock");this._readers--,this._tryWakeWriter()}async lock(e){if(!this._writeLocked&&0===this._readers)return void(this._writeLocked=!0);let i;this._pendingWriters++;const r=new Promise((e=>i=e));if(this.writerWaiters.push(i),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.writerWaiters.indexOf(i);-1!==e&&(this.writerWaiters.splice(e,1),this._pendingWriters--),o(new t("RWMutex lock timed out"))}),e)}))])}unlock(){if(!this._writeLocked)throw new Error("RWMutex: unlock called without a matching lock");this._writeLocked=!1,this._tryWakeWriter()||this._wakeAllReaders()}async read(e,t){await this.rlock(t);try{return await e()}finally{this.runlock()}}async write(e,t){await this.lock(t);try{return await e()}finally{this.unlock()}}writeLocked(){return this._writeLocked}readers(){return this._readers}pendingWriters(){return this._pendingWriters}pendingReaders(){return this.readerWaiters.length}_tryWakeWriter(){if(this._writeLocked||this._readers>0)return!1;const e=this.writerWaiters.shift();return!!e&&(this._writeLocked=!0,this._pendingWriters--,this._schedule(e),!0)}_wakeAllReaders(){const e=this.readerWaiters.splice(0);if(0!==e.length){this._readers+=e.length;for(const t of e)this._schedule(t)}}_schedule(e){"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0)}},l=class{_delay;_leading;_timer;_pendingFn;_pendingResolvers=[];_leadingFired=!1;constructor(e){this._delay=e?.delay??300,this._leading=e?.leading??!1}do(e){return new Promise((t=>{this._enqueue(e,t)}))}fire(e){this._enqueue(e,void 0)}_enqueue(e,t){if(this._pendingFn=e,t&&this._pendingResolvers.push(t),this._leading&&!this._leadingFired)return this._leadingFired=!0,this._fire(),clearTimeout(this._timer),void(this._timer=setTimeout((()=>{this._leadingFired=!1,void 0!==this._pendingFn&&this._fire()}),this._delay));clearTimeout(this._timer),this._timer=setTimeout((()=>{this._leadingFired=!1,this._fire()}),this._delay)}cancel(){clearTimeout(this._timer),this._timer=void 0,this._pendingFn=void 0,this._leadingFired=!1;const e=this._pendingResolvers.splice(0);for(const t of e)t({status:"cancelled"})}async flush(){return this._pendingFn?(clearTimeout(this._timer),this._timer=void 0,this._leadingFired=!1,this._fire()):null}pending(){return void 0!==this._pendingFn}async _fire(){const e=this._pendingFn,t=this._pendingResolvers.splice(0);let i;this._pendingFn=void 0;try{i={status:"ok",value:await e()}}catch(e){i={status:"error",error:e}}for(const e of t)e(i);return i}};export{l as Debouncer,a as Latch,r as Mutex,o as Once,h as RWMutex,s as Semaphore,n as Serializer};
+var e=class{_delay;_leading;_timer;_pendingFn;_pendingResolvers=[];_leadingFired=!1;constructor(e){this._delay=e?.delay??300,this._leading=e?.leading??!1}do(e){return new Promise((t=>{this._enqueue(e,t)}))}fire(e){this._enqueue(e,void 0)}_enqueue(e,t){if(this._pendingFn=e,t&&this._pendingResolvers.push(t),this._leading&&!this._leadingFired)return this._leadingFired=!0,this._fire(),clearTimeout(this._timer),void(this._timer=setTimeout((()=>{this._leadingFired=!1,void 0!==this._pendingFn&&this._fire()}),this._delay));clearTimeout(this._timer),this._timer=setTimeout((()=>{this._leadingFired=!1,this._fire()}),this._delay)}cancel(){clearTimeout(this._timer),this._timer=void 0,this._pendingFn=void 0,this._leadingFired=!1;const e=this._pendingResolvers.splice(0);for(const t of e)t({status:"cancelled"})}async flush(){return this._pendingFn?(clearTimeout(this._timer),this._timer=void 0,this._leadingFired=!1,this._fire()):null}pending(){return void 0!==this._pendingFn}async _fire(){const e=this._pendingFn,t=this._pendingResolvers.splice(0);let i;this._pendingFn=void 0;try{i={status:"ok",value:await e()}}catch(e){i={status:"error",error:e}}for(const e of t)e(i);return i}},t=class e extends Error{constructor(t,i){super(t,{cause:i}),this.name="SyncError",Object.setPrototypeOf(this,e.prototype)}},i=class extends t{constructor(e){super(`[ArtifactContainer] Operation timed out: ${e}`)}},r=class extends t{constructor(e){super("[Once] A method has already been registered!",e)}},s=class extends t{constructor(e){super("[Serializer] The serializer has been marked as done!",e)}},o=class{_open=!1;_resolve;_promise;constructor(){this._promise=new Promise((e=>{this._resolve=e}))}open(){this._open||(this._open=!0,this._resolve())}async wait(e){if(this._open)return;if(null==e)return this._promise;let t;await Promise.race([this._promise.then((()=>clearTimeout(t))),new Promise(((r,s)=>{t=setTimeout((()=>s(new i("Latch timed out"))),e)}))])}isOpen(){return this._open}},n=class{_locked=!1;_capacity;_yieldMode;waiters=[];constructor(e){this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask"}async lock(e){if(!this._locked)return void(this._locked=!0);if(this.waiters.length>=this._capacity)throw new Error(`Mutex queue is full (capacity: ${this._capacity})`);let t;const r=new Promise((e=>t=e));if(this.waiters.push(t),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(t);-1!==e&&this.waiters.splice(e,1),o(new i("Mutex lock timed out"))}),e)}))])}tryLock(){return!this._locked&&(this._locked=!0,!0)}unlock(){if(!this._locked)throw new Error("Mutex is not locked");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._locked=!1}locked(){return this._locked}pending(){return this.waiters.length}},a=class{mutex=new n({yieldMode:"microtask"});promise=null;_value=null;_error;_done=!1;retry;throws;constructor({retry:e,throws:t}={}){this.retry=Boolean(e),this.throws=Boolean(t)}async do(e,t){return this._done?this.peek():this.promise?this._awaitWithTimeout(this.promise,t,"Once do() timed out"):(await this.mutex.lock(),this.promise?(this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")):(this.promise=(async()=>{try{this._value=await e(),this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.retry&&!this._done&&(this.promise=null)}return this.peek()})(),this.mutex.unlock(),this._awaitWithTimeout(this.promise,t,"Once do() timed out")))}doSync(e){if(this._done){if(this.throws&&this._error)throw this._error;return this.peek()}if(this.promise){const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}if(!this.mutex.tryLock()){const e=new Error("Cannot execute doSync: lock is currently held.");if(this.throws)throw e;return{value:null,error:e}}if(this.promise||this._done){if(this.mutex.unlock(),this._done){if(this.throws&&this._error)throw this._error;return this.peek()}const e=new Error("Cannot execute doSync while an async operation is pending.");if(this.throws)throw e;return{value:null,error:e}}try{const t=e();this._value=t,this._done=!0}catch(e){if(this._error=e,this.retry||(this._done=!0),this.throws)throw e}finally{this.mutex.unlock()}return this.peek()}running(){return null!==this.promise&&!this.done()}peek(){return{value:this._value,error:this._error}}get(){if(!this._done)throw new Error("Once operation is not yet complete");if(this._error)throw this._error;return this._value}reset(){if(this.running())throw new Error("Cannot reset Once while an operation is in progress.");this._done=!1,this.promise=null,this._value=null,this._error=void 0}done(){return this._done}current(){return this.promise}_awaitWithTimeout(e,t,r="Operation timed out"){if(null==t)return e;let s;return Promise.race([e.then((e=>(clearTimeout(s),e))),new Promise(((e,o)=>{s=setTimeout((()=>o(new i(r))),t)}))])}},h=class{_readers=0;_writeLocked=!1;_pendingWriters=0;_yieldMode;readerWaiters=[];writerWaiters=[];constructor(e){this._yieldMode=e?.yieldMode??"microtask"}async rlock(e){if(!this._writeLocked&&0===this._pendingWriters)return void this._readers++;let t;const r=new Promise((e=>t=e));if(this.readerWaiters.push(t),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.readerWaiters.indexOf(t);-1!==e&&this.readerWaiters.splice(e,1),o(new i("RWMutex rlock timed out"))}),e)}))])}runlock(){if(this._readers<=0)throw new Error("RWMutex: runlock called without a matching rlock");this._readers--,this._tryWakeWriter()}async lock(e){if(!this._writeLocked&&0===this._readers)return void(this._writeLocked=!0);let t;this._pendingWriters++;const r=new Promise((e=>t=e));if(this.writerWaiters.push(t),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.writerWaiters.indexOf(t);-1!==e&&(this.writerWaiters.splice(e,1),this._pendingWriters--),o(new i("RWMutex lock timed out"))}),e)}))])}unlock(){if(!this._writeLocked)throw new Error("RWMutex: unlock called without a matching lock");this._writeLocked=!1,this._tryWakeWriter()||this._wakeAllReaders()}async read(e,t){await this.rlock(t);try{return await e()}finally{this.runlock()}}async write(e,t){await this.lock(t);try{return await e()}finally{this.unlock()}}writeLocked(){return this._writeLocked}readers(){return this._readers}pendingWriters(){return this._pendingWriters}pendingReaders(){return this.readerWaiters.length}_tryWakeWriter(){if(this._writeLocked||this._readers>0)return!1;const e=this.writerWaiters.shift();return!!e&&(this._writeLocked=!0,this._pendingWriters--,this._schedule(e),!0)}_wakeAllReaders(){const e=this.readerWaiters.splice(0);if(0!==e.length){this._readers+=e.length;for(const t of e)this._schedule(t)}}_schedule(e){"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0)}},l=class{_slots;_available;_capacity;_yieldMode;waiters=[];constructor(e){if(this._slots=e?.slots??1,this._available=this._slots,this._capacity=e?.capacity??1/0,this._yieldMode=e?.yieldMode??"macrotask",this._slots<1)throw new Error("Semaphore slots must be >= 1")}async acquire(e){if(this._available>0)return void this._available--;if(this.waiters.length>=this._capacity)throw new Error(`Semaphore queue is full (capacity: ${this._capacity})`);let t;const r=new Promise((e=>t=e));if(this.waiters.push(t),null==e)return void await r;let s;await Promise.race([r.then((()=>clearTimeout(s))),new Promise(((r,o)=>{s=setTimeout((()=>{const e=this.waiters.indexOf(t);-1!==e&&this.waiters.splice(e,1),o(new i("Semaphore acquire timed out"))}),e)}))])}tryAcquire(){return this._available>0&&(this._available--,!0)}release(){if(this._available>=this._slots)throw new Error("Semaphore released more times than acquired");const e=this.waiters.shift();e?"microtask"===this._yieldMode?queueMicrotask(e):setTimeout(e,0):this._available++}async run(e,t){await this.acquire(t);try{return await e()}finally{this.release()}}available(){return this._available}pending(){return this.waiters.length}slots(){return this._slots}},c=class{mutex;_done=!1;_lastValue=null;_lastError=void 0;_hasRun=!1;constructor(e){this.mutex=new n({capacity:e?.capacity??1e3,yieldMode:e?.yieldMode??"macrotask"})}async do(e,t){if(this._done)return{value:null,error:new s};try{await this.mutex.lock(t)}catch(e){return{value:null,error:e}}let i,r=null;try{if(this._done)throw new s;r=await e(),this._lastValue=r,this._lastError=void 0,this._hasRun=!0}catch(e){i=e,this._lastError=e,this._hasRun=!0}finally{this.mutex.unlock()}return{value:r,error:i}}peek(){return{value:this._lastValue,error:this._lastError}}hasRun(){return this._hasRun}close(){this._done=!0}pending(){return this.mutex.pending()}running(){return this.mutex.locked()}};export{e as Debouncer,o as Latch,n as Mutex,a as Once,r as OnceExecutionConflict,h as RWMutex,l as Semaphore,c as Serializer,s as SerializerExecutionDone,t as SyncError,i as TimeoutError};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@asaidimu/utils-sync",
-  "version": "2.0.2",
+  "version": "2.1.0",
   "description": "A collection of sync utilities.",
   "main": "index.js",
   "module": "index.mjs",