@actuallab/core 12.3.14 → 12.3.29

package/dist/index.cjs

@@ -31,6 +31,7 @@ __export(index_exports, {
   RetryDelayNone: () => RetryDelayNone,
   RetryDelaySeq: () => RetryDelaySeq,
   RetryDelayer: () => RetryDelayer,
+  RingBuffer: () => RingBuffer,
   abortSignalKey: () => abortSignalKey,
   errorResult: () => errorResult,
   resolvedVoidPromise: () => resolvedVoidPromise,
@@ -244,6 +245,98 @@ var EventHandlerSet = class {
   }
 };
 
+// src/ring-buffer.ts
+var RingBuffer = class {
+  _buffer;
+  _start = 0;
+  _end = 0;
+  _count = 0;
+  capacity;
+  get count() {
+    return this._count;
+  }
+  get isEmpty() {
+    return this._count === 0;
+  }
+  get isFull() {
+    return this._count === this.capacity;
+  }
+  get remainingCapacity() {
+    return this.capacity - this._count;
+  }
+  get hasRemainingCapacity() {
+    return this._count < this.capacity;
+  }
+  constructor(capacity) {
+    if (capacity < 1)
+      throw new RangeError(`RingBuffer capacity must be >= 1 (was ${capacity}).`);
+    this.capacity = capacity;
+    this._buffer = new Array(capacity);
+  }
+  /** Read the item at `index` (0-indexed, from head). */
+  get(index) {
+    if (index < 0 || index >= this._count)
+      throw new RangeError(`Index ${index} out of range [0, ${this._count}).`);
+    return this._buffer[(this._start + index) % this.capacity];
+  }
+  /** Add an item at the tail. Throws if the buffer is full. */
+  pushTail(item) {
+    if (this._count >= this.capacity)
+      throw new Error("RingBuffer is full.");
+    this._buffer[this._end] = item;
+    this._end = (this._end + 1) % this.capacity;
+    this._count++;
+  }
+  /** Add an item at the tail, evicting the head item if the buffer is full. */
+  pushTailAndMoveHeadIfFull(item) {
+    if (this._count >= this.capacity) {
+      this._buffer[this._start] = void 0;
+      this._start = (this._start + 1) % this.capacity;
+      this._count--;
+    }
+    this.pushTail(item);
+  }
+  /** Remove the head item. Throws if the buffer is empty. */
+  pullHead() {
+    if (this._count === 0)
+      throw new Error("RingBuffer is empty.");
+    const head = this._buffer[this._start];
+    this._buffer[this._start] = void 0;
+    this._start = (this._start + 1) % this.capacity;
+    this._count--;
+    return head;
+  }
+  /**
+   * Advance the head by `skipCount` slots, releasing references to skipped
+   * items so they can be garbage-collected.
+   */
+  moveHead(skipCount) {
+    if (skipCount === 0) return;
+    if (skipCount < 0 || skipCount > this._count)
+      throw new RangeError(`skipCount ${skipCount} out of range [0, ${this._count}].`);
+    for (let k = 0; k < skipCount; k++) {
+      this._buffer[(this._start + k) % this.capacity] = void 0;
+    }
+    this._start = (this._start + skipCount) % this.capacity;
+    this._count -= skipCount;
+  }
+  /** Remove all items. */
+  clear() {
+    for (let i = 0; i < this.capacity; i++) this._buffer[i] = void 0;
+    this._start = 0;
+    this._end = 0;
+    this._count = 0;
+  }
+  /** Copy the buffer's contents to a new array, head-first. */
+  toArray() {
+    const out = new Array(this._count);
+    for (let i = 0; i < this._count; i++) {
+      out[i] = this._buffer[(this._start + i) % this.capacity];
+    }
+    return out;
+  }
+};
+
 // src/result.ts
 var Result = class _Result {
   hasValue;
@@ -405,6 +498,7 @@ var RetryDelayer = class {
   RetryDelayNone,
   RetryDelaySeq,
   RetryDelayer,
+  RingBuffer,
   abortSignalKey,
   errorResult,
   resolvedVoidPromise,

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts","../src/polyfills.ts","../src/async-context.ts","../src/async-lock.ts","../src/disposable.ts","../src/promise-source.ts","../src/events.ts","../src/result.ts","../src/retry-delay-seq.ts","../src/retry-delayer.ts"],"sourcesContent":["import './polyfills.js';\r\nexport {\r\n    AsyncContext,\r\n    AsyncContextKey,\r\n    abortSignalKey,\r\n} from './async-context.js';\r\nexport { AsyncLock } from './async-lock.js';\r\nexport type { Disposable, AsyncDisposable } from './disposable.js';\r\nexport { DisposableBag } from './disposable.js';\r\nexport { EventHandlerSet } from './events.js';\r\nexport { PromiseSource, resolvedVoidPromise } from './promise-source.js';\r\nexport type { IResult } from './result.js';\r\nexport {\r\n    Result,\r\n    result,\r\n    errorResult,\r\n    resultFrom,\r\n    resultFromAsync,\r\n} from './result.js';\r\nexport { RetryDelaySeq } from './retry-delay-seq.js';\r\nexport type { RetryDelay } from './retry-delayer.js';\r\nexport {\r\n    RetryDelayer,\r\n    RetryDelayNone,\r\n    RetryDelayLimitExceeded,\r\n} from './retry-delayer.js';\r\n","// TC39 decorator metadata polyfill — required for Symbol.metadata support\r\n// in runtimes that don't yet implement it natively.\r\n// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\r\n(Symbol as any).metadata ??= Symbol('Symbol.metadata');\r\n","import type { Disposable } from './disposable.js';\r\n\r\n/** Typed key for values stored in AsyncContext — each subsystem defines its own keys. */\r\nexport class AsyncContextKey<T> {\r\n    readonly id: symbol;\r\n    readonly defaultValue: T;\r\n\r\n    constructor(name: string, defaultValue: T) {\r\n        this.id = Symbol(name);\r\n        this.defaultValue = defaultValue;\r\n    }\r\n}\r\n\r\n/** General-purpose typed context container — named for forward-compatibility with TC39 AsyncContext proposal. */\r\nexport const abortSignalKey = new AsyncContextKey<AbortSignal | undefined>(\r\n    'AbortSignal',\r\n    undefined\r\n);\r\n\r\nexport class AsyncContext {\r\n    static current: AsyncContext | undefined = undefined;\r\n\r\n    /** Immutable empty singleton — avoids allocating new AsyncContext(). */\r\n    static readonly empty: AsyncContext = new AsyncContext();\r\n\r\n    private static _defaults = new Map<symbol, unknown>();\r\n\r\n    private _values: Map<symbol, unknown>;\r\n\r\n    constructor(values?: Map<symbol, unknown>) {\r\n        this._values = values ?? new Map<symbol, unknown>();\r\n    }\r\n\r\n    get<T>(key: AsyncContextKey<T>): T {\r\n        if (this._values.has(key.id)) return this._values.get(key.id) as T;\r\n        if (AsyncContext._defaults.has(key.id))\r\n            return AsyncContext._defaults.get(key.id) as T;\r\n        return key.defaultValue;\r\n    }\r\n\r\n    with<T>(key: AsyncContextKey<T>, value: T): AsyncContext {\r\n        const copy = new Map(this._values);\r\n        copy.set(key.id, value);\r\n        return new AsyncContext(copy);\r\n    }\r\n\r\n    activate(): Disposable {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        return {\r\n            dispose: () => {\r\n                AsyncContext.current = prev;\r\n            },\r\n        };\r\n    }\r\n\r\n    run<R>(fn: () => R): R {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        try {\r\n            return fn();\r\n        } finally {\r\n            AsyncContext.current = prev;\r\n        }\r\n    }\r\n\r\n    /** Strip THIS exact instance from args if it's the last element (reference equality). */\r\n    stripFromArgs(args: unknown[]): unknown[] {\r\n        return args[args.length - 1] === this ? args.slice(0, -1) : args;\r\n    }\r\n\r\n    /** Resolve: return ctx if provided, otherwise AsyncContext.current. */\r\n    static from(ctx: AsyncContext | undefined): AsyncContext | undefined {\r\n        return ctx ?? AsyncContext.current;\r\n    }\r\n\r\n    /** Extract AsyncContext from last arg if instanceof AsyncContext, else fall back to .current. */\r\n    static fromArgs(args: unknown[]): AsyncContext | undefined {\r\n        const last = args[args.length - 1];\r\n        return last instanceof AsyncContext ? last : AsyncContext.current;\r\n    }\r\n\r\n    static setDefault<T>(key: AsyncContextKey<T>, value: T): void {\r\n        AsyncContext._defaults.set(key.id, value);\r\n    }\r\n\r\n    static getOrCreate(): AsyncContext {\r\n        return AsyncContext.current ?? AsyncContext.empty;\r\n    }\r\n}\r\n","/** Promise-based mutual exclusion lock for serializing async operations. */\r\nexport class AsyncLock {\r\n    private _queue: (() => void)[] = [];\r\n    private _locked = false;\r\n\r\n    get isLocked(): boolean {\r\n        return this._locked;\r\n    }\r\n\r\n    async acquire(): Promise<void> {\r\n        if (!this._locked) {\r\n            this._locked = true;\r\n            return;\r\n        }\r\n        return new Promise<void>(resolve => {\r\n            this._queue.push(resolve);\r\n        });\r\n    }\r\n\r\n    release(): void {\r\n        if (!this._locked) throw new Error('AsyncLock is not locked.');\r\n\r\n        const next = this._queue.shift();\r\n        if (next !== undefined) {\r\n            // Transfer lock to the next waiter\r\n            next();\r\n        } else {\r\n            this._locked = false;\r\n        }\r\n    }\r\n\r\n    async run<T>(fn: () => T | Promise<T>): Promise<T> {\r\n        await this.acquire();\r\n        try {\r\n            return await fn();\r\n        } finally {\r\n            this.release();\r\n        }\r\n    }\r\n}\r\n","/** Synchronous dispose pattern, similar to .NET's IDisposable. */\r\nexport interface Disposable {\r\n    dispose(): void;\r\n}\r\n\r\n/** Asynchronous dispose pattern, similar to .NET's IAsyncDisposable. */\r\nexport interface AsyncDisposable {\r\n    disposeAsync(): Promise<void>;\r\n}\r\n\r\n/** Aggregates multiple disposables and disposes them together. */\r\nexport class DisposableBag implements Disposable, AsyncDisposable {\r\n    private _items: (Disposable | AsyncDisposable)[] = [];\r\n    private _disposed = false;\r\n\r\n    get isDisposed(): boolean {\r\n        return this._disposed;\r\n    }\r\n\r\n    add(item: Disposable | AsyncDisposable): void {\r\n        if (this._disposed)\r\n            throw new Error('DisposableBag is already disposed.');\r\n        this._items.push(item);\r\n    }\r\n\r\n    dispose(): void {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        // Dispose in reverse order (LIFO)\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n\r\n    async disposeAsync(): Promise<void> {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('disposeAsync' in item) await item.disposeAsync();\r\n            else if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n}\r\n","/** Externally-resolvable promise — similar to .NET's TaskCompletionSource<T>. */\r\nexport class PromiseSource<T> {\r\n    readonly promise: Promise<T>;\r\n    private _resolve!: (value: T | PromiseLike<T>) => void;\r\n    private _reject!: (reason?: unknown) => void;\r\n    private _isCompleted = false;\r\n\r\n    constructor() {\r\n        this.promise = new Promise<T>((resolve, reject) => {\r\n            this._resolve = resolve;\r\n            this._reject = reject;\r\n        });\r\n    }\r\n\r\n    get isCompleted(): boolean {\r\n        return this._isCompleted;\r\n    }\r\n\r\n    resolve(value: T): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._resolve(value);\r\n        return true;\r\n    }\r\n\r\n    reject(reason?: unknown): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._reject(reason);\r\n        return true;\r\n    }\r\n}\r\n\r\nexport const resolvedVoidPromise: Promise<void> = Promise.resolve();\r\n","import { PromiseSource } from './promise-source.js';\r\n\r\n/** Typed pub/sub event handler set — similar to .NET's EventHandler<T> multicast delegate. */\r\nexport class EventHandlerSet<T> {\r\n    private _handlers = new Set<(arg: T) => void>();\r\n\r\n    get count(): number {\r\n        return this._handlers.size;\r\n    }\r\n\r\n    add(handler: (arg: T) => void): void {\r\n        this._handlers.add(handler);\r\n    }\r\n\r\n    remove(handler: (arg: T) => void): void {\r\n        this._handlers.delete(handler);\r\n    }\r\n\r\n    trigger(arg: T): void {\r\n        for (const handler of this._handlers) handler(arg);\r\n    }\r\n\r\n    clear(): void {\r\n        this._handlers.clear();\r\n    }\r\n\r\n    whenNext(): Promise<T> {\r\n        const ps = new PromiseSource<T>();\r\n        const handler = (arg: T) => {\r\n            this._handlers.delete(handler);\r\n            ps.resolve(arg);\r\n        };\r\n        this._handlers.add(handler);\r\n        return ps.promise;\r\n    }\r\n}\r\n","/** Common interface for types that carry a value-or-error outcome. */\r\nexport interface IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    readonly value: T;\r\n    readonly error: unknown;\r\n    readonly valueOrUndefined: T | undefined;\r\n}\r\n\r\n/** Immutable value-or-error container — similar to .NET's Result<T>. */\r\nexport class Result<T> implements IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    private readonly _value: T | undefined;\r\n    private readonly _error: unknown;\r\n\r\n    public constructor(value: T | undefined, error?: unknown) {\r\n        this.hasValue = error === undefined;\r\n        this.hasError = !this.hasValue;\r\n        this._value = value;\r\n        this._error = error;\r\n    }\r\n\r\n    get value(): T {\r\n        if (this.hasError) throw this._error;\r\n        return this._value as T;\r\n    }\r\n\r\n    get error(): unknown {\r\n        return this._error;\r\n    }\r\n\r\n    get valueOrUndefined(): T | undefined {\r\n        return this.hasValue ? this._value : undefined;\r\n    }\r\n\r\n    static ok<T>(value: T): Result<T> {\r\n        return new Result<T>(value);\r\n    }\r\n\r\n    static error<T>(error: unknown): Result<T> {\r\n        return new Result<T>(undefined, error);\r\n    }\r\n}\r\n\r\nexport function result<T>(value: T, error?: unknown): Result<T> {\r\n    return new Result<T>(value, error);\r\n}\r\n\r\nexport function errorResult<T>(error: unknown): Result<T> {\r\n    return Result.error(error);\r\n}\r\n\r\nexport function resultFrom<T>(fn: () => T): Result<T> {\r\n    try {\r\n        return result(fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n\r\nexport async function resultFromAsync<T>(\r\n    fn: () => Promise<T>\r\n): Promise<Result<T>> {\r\n    try {\r\n        return result(await fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n","// .NET counterpart: ActualLab.Time.RetryDelaySeq\r\n\r\nconst DefaultSpread = 0.1;\r\nconst DefaultMultiplier = 1.41421356237; // Math.sqrt(2)\r\n\r\nfunction applySpread(origin: number, spread: number): number {\r\n    if (spread <= 0) return origin;\r\n    const delta = origin * spread;\r\n    return origin + (Math.random() * 2 - 1) * delta;\r\n}\r\n\r\nexport class RetryDelaySeq {\r\n    readonly min: number;\r\n    readonly max: number;\r\n    readonly spread: number;\r\n    readonly multiplier: number;\r\n\r\n    constructor(\r\n        min: number,\r\n        max: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ) {\r\n        this.min = min;\r\n        this.max = max;\r\n        this.spread = spread;\r\n        this.multiplier = multiplier;\r\n    }\r\n\r\n    static fixed(\r\n        delayMs: number,\r\n        spread: number = DefaultSpread\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(delayMs, delayMs, spread, 1);\r\n    }\r\n\r\n    static exp(\r\n        minMs: number,\r\n        maxMs: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(minMs, maxMs, spread, multiplier);\r\n    }\r\n\r\n    getDelay(failureCount: number): number {\r\n        if (this.min < 0)\r\n            throw new Error('RetryDelaySeq.min must be non-negative.');\r\n        if (failureCount <= 0) return 0;\r\n\r\n        if (this.multiplier <= 1) {\r\n            // Fixed — no exponential component\r\n            return Math.max(\r\n                0,\r\n                this.spread <= 0 ? this.min : applySpread(this.min, this.spread)\r\n            );\r\n        }\r\n\r\n        const multiplier = Math.pow(this.multiplier, failureCount - 1);\r\n        const raw = Math.min(this.max, this.min * multiplier);\r\n        return Math.max(0, applySpread(raw, this.spread));\r\n    }\r\n}\r\n","// .NET counterparts: ActualLab.Net.RetryDelayer, ActualLab.Net.RetryDelay\r\n\r\nimport { EventHandlerSet } from './events.js';\r\nimport { RetryDelaySeq } from './retry-delay-seq.js';\r\n\r\nexport interface RetryDelay {\r\n    readonly promise: Promise<void>;\r\n    readonly endsAt: number; // Date.now()-based timestamp, 0 = no delay\r\n    readonly isLimitExceeded: boolean;\r\n}\r\n\r\nexport const RetryDelayNone: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: false,\r\n};\r\n\r\nexport const RetryDelayLimitExceeded: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: true,\r\n};\r\n\r\nexport class RetryDelayer {\r\n    private _cancelController = new AbortController();\r\n\r\n    delays: RetryDelaySeq = RetryDelaySeq.fixed(1000);\r\n    limit: number | undefined = undefined;\r\n\r\n    readonly cancelDelaysChanged = new EventHandlerSet<void>();\r\n\r\n    getDelay(tryIndex: number, cancellationSignal?: AbortSignal): RetryDelay {\r\n        if (this.limit !== undefined && tryIndex >= this.limit)\r\n            return RetryDelayLimitExceeded;\r\n\r\n        const delayMs = this.delays.getDelay(tryIndex);\r\n        if (tryIndex === 0 || delayMs <= 0) return RetryDelayNone;\r\n\r\n        const actualDelayMs = Math.max(1, delayMs);\r\n        const endsAt = Date.now() + actualDelayMs;\r\n\r\n        const cancelSignal = this._cancelController.signal;\r\n        const promise = new Promise<void>((resolve, reject) => {\r\n            const timer = setTimeout(() => {\r\n                cleanup();\r\n                resolve();\r\n            }, actualDelayMs);\r\n\r\n            const onCancel = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                resolve(); // cancelDelays resolves, does NOT reject\r\n            };\r\n\r\n            const onAbort = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                reject(new Error('Retry delay aborted.'));\r\n            };\r\n\r\n            const cleanup = () => {\r\n                cancelSignal.removeEventListener('abort', onCancel);\r\n                cancellationSignal?.removeEventListener('abort', onAbort);\r\n            };\r\n\r\n            cancelSignal.addEventListener('abort', onCancel, { once: true });\r\n            cancellationSignal?.addEventListener('abort', onAbort, {\r\n                once: true,\r\n            });\r\n        });\r\n\r\n        return { promise, endsAt, isLimitExceeded: false };\r\n    }\r\n\r\n    cancelDelays(): void {\r\n        const old = this._cancelController;\r\n        this._cancelController = new AbortController();\r\n        old.abort();\r\n        this.cancelDelaysChanged.trigger();\r\n    }\r\n}\r\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACGC,OAAe,aAAa,uBAAO,iBAAiB;;;ACA9C,IAAM,kBAAN,MAAyB;AAAA,EACnB;AAAA,EACA;AAAA,EAET,YAAY,MAAc,cAAiB;AACvC,SAAK,KAAK,OAAO,IAAI;AACrB,SAAK,eAAe;AAAA,EACxB;AACJ;AAGO,IAAM,iBAAiB,IAAI;AAAA,EAC9B;AAAA,EACA;AACJ;AAEO,IAAM,eAAN,MAAM,cAAa;AAAA,EACtB,OAAO,UAAoC;AAAA;AAAA,EAG3C,OAAgB,QAAsB,IAAI,cAAa;AAAA,EAEvD,OAAe,YAAY,oBAAI,IAAqB;AAAA,EAE5C;AAAA,EAER,YAAY,QAA+B;AACvC,SAAK,UAAU,UAAU,oBAAI,IAAqB;AAAA,EACtD;AAAA,EAEA,IAAO,KAA4B;AAC/B,QAAI,KAAK,QAAQ,IAAI,IAAI,EAAE,EAAG,QAAO,KAAK,QAAQ,IAAI,IAAI,EAAE;AAC5D,QAAI,cAAa,UAAU,IAAI,IAAI,EAAE;AACjC,aAAO,cAAa,UAAU,IAAI,IAAI,EAAE;AAC5C,WAAO,IAAI;AAAA,EACf;AAAA,EAEA,KAAQ,KAAyB,OAAwB;AACrD,UAAM,OAAO,IAAI,IAAI,KAAK,OAAO;AACjC,SAAK,IAAI,IAAI,IAAI,KAAK;AACtB,WAAO,IAAI,cAAa,IAAI;AAAA,EAChC;AAAA,EAEA,WAAuB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,WAAO;AAAA,MACH,SAAS,MAAM;AACX,sBAAa,UAAU;AAAA,MAC3B;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,IAAO,IAAgB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,QAAI;AACA,aAAO,GAAG;AAAA,IACd,UAAE;AACE,oBAAa,UAAU;AAAA,IAC3B;AAAA,EACJ;AAAA;AAAA,EAGA,cAAc,MAA4B;AACtC,WAAO,KAAK,KAAK,SAAS,CAAC,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI;AAAA,EAChE;AAAA;AAAA,EAGA,OAAO,KAAK,KAAyD;AACjE,WAAO,OAAO,cAAa;AAAA,EAC/B;AAAA;AAAA,EAGA,OAAO,SAAS,MAA2C;AACvD,UAAM,OAAO,KAAK,KAAK,SAAS,CAAC;AACjC,WAAO,gBAAgB,gBAAe,OAAO,cAAa;AAAA,EAC9D;AAAA,EAEA,OAAO,WAAc,KAAyB,OAAgB;AAC1D,kBAAa,UAAU,IAAI,IAAI,IAAI,KAAK;AAAA,EAC5C;AAAA,EAEA,OAAO,cAA4B;AAC/B,WAAO,cAAa,WAAW,cAAa;AAAA,EAChD;AACJ;;;ACxFO,IAAM,YAAN,MAAgB;AAAA,EACX,SAAyB,CAAC;AAAA,EAC1B,UAAU;AAAA,EAElB,IAAI,WAAoB;AACpB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,MAAM,UAAyB;AAC3B,QAAI,CAAC,KAAK,SAAS;AACf,WAAK,UAAU;AACf;AAAA,IACJ;AACA,WAAO,IAAI,QAAc,aAAW;AAChC,WAAK,OAAO,KAAK,OAAO;AAAA,IAC5B,CAAC;AAAA,EACL;AAAA,EAEA,UAAgB;AACZ,QAAI,CAAC,KAAK,QAAS,OAAM,IAAI,MAAM,0BAA0B;AAE7D,UAAM,OAAO,KAAK,OAAO,MAAM;AAC/B,QAAI,SAAS,QAAW;AAEpB,WAAK;AAAA,IACT,OAAO;AACH,WAAK,UAAU;AAAA,IACnB;AAAA,EACJ;AAAA,EAEA,MAAM,IAAO,IAAsC;AAC/C,UAAM,KAAK,QAAQ;AACnB,QAAI;AACA,aAAO,MAAM,GAAG;AAAA,IACpB,UAAE;AACE,WAAK,QAAQ;AAAA,IACjB;AAAA,EACJ;AACJ;;;AC5BO,IAAM,gBAAN,MAA2D;AAAA,EACtD,SAA2C,CAAC;AAAA,EAC5C,YAAY;AAAA,EAEpB,IAAI,aAAsB;AACtB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,MAA0C;AAC1C,QAAI,KAAK;AACL,YAAM,IAAI,MAAM,oCAAoC;AACxD,SAAK,OAAO,KAAK,IAAI;AAAA,EACzB;AAAA,EAEA,UAAgB;AACZ,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AAEf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,aAAa,KAAM,MAAK,QAAQ;AAAA,IACxC;AAAA,EACJ;AAAA,EAEA,MAAM,eAA8B;AAChC,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AACf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,kBAAkB,KAAM,OAAM,KAAK,aAAa;AAAA,eAC3C,aAAa,KAAM,MAAK,QAAQ;AAAA,IAC7C;AAAA,EACJ;AACJ;;;AC/CO,IAAM,gBAAN,MAAuB;AAAA,EACjB;AAAA,EACD;AAAA,EACA;AAAA,EACA,eAAe;AAAA,EAEvB,cAAc;AACV,SAAK,UAAU,IAAI,QAAW,CAAC,SAAS,WAAW;AAC/C,WAAK,WAAW;AAChB,WAAK,UAAU;AAAA,IACnB,CAAC;AAAA,EACL;AAAA,EAEA,IAAI,cAAuB;AACvB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,QAAQ,OAAmB;AACvB,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,SAAS,KAAK;AACnB,WAAO;AAAA,EACX;AAAA,EAEA,OAAO,QAA2B;AAC9B,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,QAAQ,MAAM;AACnB,WAAO;AAAA,EACX;AACJ;AAEO,IAAM,sBAAqC,QAAQ,QAAQ;;;AC9B3D,IAAM,kBAAN,MAAyB;AAAA,EACpB,YAAY,oBAAI,IAAsB;AAAA,EAE9C,IAAI,QAAgB;AAChB,WAAO,KAAK,UAAU;AAAA,EAC1B;AAAA,EAEA,IAAI,SAAiC;AACjC,SAAK,UAAU,IAAI,OAAO;AAAA,EAC9B;AAAA,EAEA,OAAO,SAAiC;AACpC,SAAK,UAAU,OAAO,OAAO;AAAA,EACjC;AAAA,EAEA,QAAQ,KAAc;AAClB,eAAW,WAAW,KAAK,UAAW,SAAQ,GAAG;AAAA,EACrD;AAAA,EAEA,QAAc;AACV,SAAK,UAAU,MAAM;AAAA,EACzB;AAAA,EAEA,WAAuB;AACnB,UAAM,KAAK,IAAI,cAAiB;AAChC,UAAM,UAAU,CAAC,QAAW;AACxB,WAAK,UAAU,OAAO,OAAO;AAC7B,SAAG,QAAQ,GAAG;AAAA,IAClB;AACA,SAAK,UAAU,IAAI,OAAO;AAC1B,WAAO,GAAG;AAAA,EACd;AACJ;;;ACzBO,IAAM,SAAN,MAAM,QAAgC;AAAA,EAChC;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA,EAEV,YAAY,OAAsB,OAAiB;AACtD,SAAK,WAAW,UAAU;AAC1B,SAAK,WAAW,CAAC,KAAK;AACtB,SAAK,SAAS;AACd,SAAK,SAAS;AAAA,EAClB;AAAA,EAEA,IAAI,QAAW;AACX,QAAI,KAAK,SAAU,OAAM,KAAK;AAC9B,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,QAAiB;AACjB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,mBAAkC;AAClC,WAAO,KAAK,WAAW,KAAK,SAAS;AAAA,EACzC;AAAA,EAEA,OAAO,GAAM,OAAqB;AAC9B,WAAO,IAAI,QAAU,KAAK;AAAA,EAC9B;AAAA,EAEA,OAAO,MAAS,OAA2B;AACvC,WAAO,IAAI,QAAU,QAAW,KAAK;AAAA,EACzC;AACJ;AAEO,SAAS,OAAU,OAAU,OAA4B;AAC5D,SAAO,IAAI,OAAU,OAAO,KAAK;AACrC;AAEO,SAAS,YAAe,OAA2B;AACtD,SAAO,OAAO,MAAM,KAAK;AAC7B;AAEO,SAAS,WAAc,IAAwB;AAClD,MAAI;AACA,WAAO,OAAO,GAAG,CAAC;AAAA,EACtB,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;AAEA,eAAsB,gBAClB,IACkB;AAClB,MAAI;AACA,WAAO,OAAO,MAAM,GAAG,CAAC;AAAA,EAC5B,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;;;ACnEA,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAE1B,SAAS,YAAY,QAAgB,QAAwB;AACzD,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,QAAQ,SAAS;AACvB,SAAO,UAAU,KAAK,OAAO,IAAI,IAAI,KAAK;AAC9C;AAEO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACd;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACI,KACA,KACA,SAAiB,eACjB,aAAqB,mBACvB;AACE,SAAK,MAAM;AACX,SAAK,MAAM;AACX,SAAK,SAAS;AACd,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,OAAO,MACH,SACA,SAAiB,eACJ;AACb,WAAO,IAAI,eAAc,SAAS,SAAS,QAAQ,CAAC;AAAA,EACxD;AAAA,EAEA,OAAO,IACH,OACA,OACA,SAAiB,eACjB,aAAqB,mBACR;AACb,WAAO,IAAI,eAAc,OAAO,OAAO,QAAQ,UAAU;AAAA,EAC7D;AAAA,EAEA,SAAS,cAA8B;AACnC,QAAI,KAAK,MAAM;AACX,YAAM,IAAI,MAAM,yCAAyC;AAC7D,QAAI,gBAAgB,EAAG,QAAO;AAE9B,QAAI,KAAK,cAAc,GAAG;AAEtB,aAAO,KAAK;AAAA,QACR;AAAA,QACA,KAAK,UAAU,IAAI,KAAK,MAAM,YAAY,KAAK,KAAK,KAAK,MAAM;AAAA,MACnE;AAAA,IACJ;AAEA,UAAM,aAAa,KAAK,IAAI,KAAK,YAAY,eAAe,CAAC;AAC7D,UAAM,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,UAAU;AACpD,WAAO,KAAK,IAAI,GAAG,YAAY,KAAK,KAAK,MAAM,CAAC;AAAA,EACpD;AACJ;;;ACnDO,IAAM,iBAA6B;AAAA,EACtC,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,0BAAsC;AAAA,EAC/C,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,eAAN,MAAmB;AAAA,EACd,oBAAoB,IAAI,gBAAgB;AAAA,EAEhD,SAAwB,cAAc,MAAM,GAAI;AAAA,EAChD,QAA4B;AAAA,EAEnB,sBAAsB,IAAI,gBAAsB;AAAA,EAEzD,SAAS,UAAkB,oBAA8C;AACrE,QAAI,KAAK,UAAU,UAAa,YAAY,KAAK;AAC7C,aAAO;AAEX,UAAM,UAAU,KAAK,OAAO,SAAS,QAAQ;AAC7C,QAAI,aAAa,KAAK,WAAW,EAAG,QAAO;AAE3C,UAAM,gBAAgB,KAAK,IAAI,GAAG,OAAO;AACzC,UAAM,SAAS,KAAK,IAAI,IAAI;AAE5B,UAAM,eAAe,KAAK,kBAAkB;AAC5C,UAAM,UAAU,IAAI,QAAc,CAAC,SAAS,WAAW;AACnD,YAAM,QAAQ,WAAW,MAAM;AAC3B,gBAAQ;AACR,gBAAQ;AAAA,MACZ,GAAG,aAAa;AAEhB,YAAM,WAAW,MAAM;AACnB,qBAAa,KAAK;AAClB,gBAAQ;AACR,gBAAQ;AAAA,MACZ;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,KAAK;AAClB,gBAAQ;AACR,eAAO,IAAI,MAAM,sBAAsB,CAAC;AAAA,MAC5C;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,oBAAoB,SAAS,QAAQ;AAClD,4BAAoB,oBAAoB,SAAS,OAAO;AAAA,MAC5D;AAEA,mBAAa,iBAAiB,SAAS,UAAU,EAAE,MAAM,KAAK,CAAC;AAC/D,0BAAoB,iBAAiB,SAAS,SAAS;AAAA,QACnD,MAAM;AAAA,MACV,CAAC;AAAA,IACL,CAAC;AAED,WAAO,EAAE,SAAS,QAAQ,iBAAiB,MAAM;AAAA,EACrD;AAAA,EAEA,eAAqB;AACjB,UAAM,MAAM,KAAK;AACjB,SAAK,oBAAoB,IAAI,gBAAgB;AAC7C,QAAI,MAAM;AACV,SAAK,oBAAoB,QAAQ;AAAA,EACrC;AACJ;","names":[]}
+{"version":3,"sources":["../src/index.ts","../src/polyfills.ts","../src/async-context.ts","../src/async-lock.ts","../src/disposable.ts","../src/promise-source.ts","../src/events.ts","../src/ring-buffer.ts","../src/result.ts","../src/retry-delay-seq.ts","../src/retry-delayer.ts"],"sourcesContent":["import './polyfills.js';\r\nexport {\r\n    AsyncContext,\r\n    AsyncContextKey,\r\n    abortSignalKey,\r\n} from './async-context.js';\r\nexport { AsyncLock } from './async-lock.js';\r\nexport type { Disposable, AsyncDisposable } from './disposable.js';\r\nexport { DisposableBag } from './disposable.js';\r\nexport { EventHandlerSet } from './events.js';\r\nexport { PromiseSource, resolvedVoidPromise } from './promise-source.js';\r\nexport { RingBuffer } from './ring-buffer.js';\r\nexport type { IResult } from './result.js';\r\nexport {\r\n    Result,\r\n    result,\r\n    errorResult,\r\n    resultFrom,\r\n    resultFromAsync,\r\n} from './result.js';\r\nexport { RetryDelaySeq } from './retry-delay-seq.js';\r\nexport type { RetryDelay } from './retry-delayer.js';\r\nexport {\r\n    RetryDelayer,\r\n    RetryDelayNone,\r\n    RetryDelayLimitExceeded,\r\n} from './retry-delayer.js';\r\n","// TC39 decorator metadata polyfill — required for Symbol.metadata support\r\n// in runtimes that don't yet implement it natively.\r\n// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\r\n(Symbol as any).metadata ??= Symbol('Symbol.metadata');\r\n","import type { Disposable } from './disposable.js';\r\n\r\n/** Typed key for values stored in AsyncContext — each subsystem defines its own keys. */\r\nexport class AsyncContextKey<T> {\r\n    readonly id: symbol;\r\n    readonly defaultValue: T;\r\n\r\n    constructor(name: string, defaultValue: T) {\r\n        this.id = Symbol(name);\r\n        this.defaultValue = defaultValue;\r\n    }\r\n}\r\n\r\n/** General-purpose typed context container — named for forward-compatibility with TC39 AsyncContext proposal. */\r\nexport const abortSignalKey = new AsyncContextKey<AbortSignal | undefined>(\r\n    'AbortSignal',\r\n    undefined\r\n);\r\n\r\nexport class AsyncContext {\r\n    static current: AsyncContext | undefined = undefined;\r\n\r\n    /** Immutable empty singleton — avoids allocating new AsyncContext(). */\r\n    static readonly empty: AsyncContext = new AsyncContext();\r\n\r\n    private static _defaults = new Map<symbol, unknown>();\r\n\r\n    private _values: Map<symbol, unknown>;\r\n\r\n    constructor(values?: Map<symbol, unknown>) {\r\n        this._values = values ?? new Map<symbol, unknown>();\r\n    }\r\n\r\n    get<T>(key: AsyncContextKey<T>): T {\r\n        if (this._values.has(key.id)) return this._values.get(key.id) as T;\r\n        if (AsyncContext._defaults.has(key.id))\r\n            return AsyncContext._defaults.get(key.id) as T;\r\n        return key.defaultValue;\r\n    }\r\n\r\n    with<T>(key: AsyncContextKey<T>, value: T): AsyncContext {\r\n        const copy = new Map(this._values);\r\n        copy.set(key.id, value);\r\n        return new AsyncContext(copy);\r\n    }\r\n\r\n    activate(): Disposable {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        return {\r\n            dispose: () => {\r\n                AsyncContext.current = prev;\r\n            },\r\n        };\r\n    }\r\n\r\n    run<R>(fn: () => R): R {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        try {\r\n            return fn();\r\n        } finally {\r\n            AsyncContext.current = prev;\r\n        }\r\n    }\r\n\r\n    /** Strip THIS exact instance from args if it's the last element (reference equality). */\r\n    stripFromArgs(args: unknown[]): unknown[] {\r\n        return args[args.length - 1] === this ? args.slice(0, -1) : args;\r\n    }\r\n\r\n    /** Resolve: return ctx if provided, otherwise AsyncContext.current. */\r\n    static from(ctx: AsyncContext | undefined): AsyncContext | undefined {\r\n        return ctx ?? AsyncContext.current;\r\n    }\r\n\r\n    /** Extract AsyncContext from last arg if instanceof AsyncContext, else fall back to .current. */\r\n    static fromArgs(args: unknown[]): AsyncContext | undefined {\r\n        const last = args[args.length - 1];\r\n        return last instanceof AsyncContext ? last : AsyncContext.current;\r\n    }\r\n\r\n    static setDefault<T>(key: AsyncContextKey<T>, value: T): void {\r\n        AsyncContext._defaults.set(key.id, value);\r\n    }\r\n\r\n    static getOrCreate(): AsyncContext {\r\n        return AsyncContext.current ?? AsyncContext.empty;\r\n    }\r\n}\r\n","/** Promise-based mutual exclusion lock for serializing async operations. */\r\nexport class AsyncLock {\r\n    private _queue: (() => void)[] = [];\r\n    private _locked = false;\r\n\r\n    get isLocked(): boolean {\r\n        return this._locked;\r\n    }\r\n\r\n    async acquire(): Promise<void> {\r\n        if (!this._locked) {\r\n            this._locked = true;\r\n            return;\r\n        }\r\n        return new Promise<void>(resolve => {\r\n            this._queue.push(resolve);\r\n        });\r\n    }\r\n\r\n    release(): void {\r\n        if (!this._locked) throw new Error('AsyncLock is not locked.');\r\n\r\n        const next = this._queue.shift();\r\n        if (next !== undefined) {\r\n            // Transfer lock to the next waiter\r\n            next();\r\n        } else {\r\n            this._locked = false;\r\n        }\r\n    }\r\n\r\n    async run<T>(fn: () => T | Promise<T>): Promise<T> {\r\n        await this.acquire();\r\n        try {\r\n            return await fn();\r\n        } finally {\r\n            this.release();\r\n        }\r\n    }\r\n}\r\n","/** Synchronous dispose pattern, similar to .NET's IDisposable. */\r\nexport interface Disposable {\r\n    dispose(): void;\r\n}\r\n\r\n/** Asynchronous dispose pattern, similar to .NET's IAsyncDisposable. */\r\nexport interface AsyncDisposable {\r\n    disposeAsync(): Promise<void>;\r\n}\r\n\r\n/** Aggregates multiple disposables and disposes them together. */\r\nexport class DisposableBag implements Disposable, AsyncDisposable {\r\n    private _items: (Disposable | AsyncDisposable)[] = [];\r\n    private _disposed = false;\r\n\r\n    get isDisposed(): boolean {\r\n        return this._disposed;\r\n    }\r\n\r\n    add(item: Disposable | AsyncDisposable): void {\r\n        if (this._disposed)\r\n            throw new Error('DisposableBag is already disposed.');\r\n        this._items.push(item);\r\n    }\r\n\r\n    dispose(): void {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        // Dispose in reverse order (LIFO)\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n\r\n    async disposeAsync(): Promise<void> {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('disposeAsync' in item) await item.disposeAsync();\r\n            else if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n}\r\n","/** Externally-resolvable promise — similar to .NET's TaskCompletionSource<T>. */\r\nexport class PromiseSource<T> {\r\n    readonly promise: Promise<T>;\r\n    private _resolve!: (value: T | PromiseLike<T>) => void;\r\n    private _reject!: (reason?: unknown) => void;\r\n    private _isCompleted = false;\r\n\r\n    constructor() {\r\n        this.promise = new Promise<T>((resolve, reject) => {\r\n            this._resolve = resolve;\r\n            this._reject = reject;\r\n        });\r\n    }\r\n\r\n    get isCompleted(): boolean {\r\n        return this._isCompleted;\r\n    }\r\n\r\n    resolve(value: T): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._resolve(value);\r\n        return true;\r\n    }\r\n\r\n    reject(reason?: unknown): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._reject(reason);\r\n        return true;\r\n    }\r\n}\r\n\r\nexport const resolvedVoidPromise: Promise<void> = Promise.resolve();\r\n","import { PromiseSource } from './promise-source.js';\r\n\r\n/** Typed pub/sub event handler set — similar to .NET's EventHandler<T> multicast delegate. */\r\nexport class EventHandlerSet<T> {\r\n    private _handlers = new Set<(arg: T) => void>();\r\n\r\n    get count(): number {\r\n        return this._handlers.size;\r\n    }\r\n\r\n    add(handler: (arg: T) => void): void {\r\n        this._handlers.add(handler);\r\n    }\r\n\r\n    remove(handler: (arg: T) => void): void {\r\n        this._handlers.delete(handler);\r\n    }\r\n\r\n    trigger(arg: T): void {\r\n        for (const handler of this._handlers) handler(arg);\r\n    }\r\n\r\n    clear(): void {\r\n        this._handlers.clear();\r\n    }\r\n\r\n    whenNext(): Promise<T> {\r\n        const ps = new PromiseSource<T>();\r\n        const handler = (arg: T) => {\r\n            this._handlers.delete(handler);\r\n            ps.resolve(arg);\r\n        };\r\n        this._handlers.add(handler);\r\n        return ps.promise;\r\n    }\r\n}\r\n","/**\n * A fixed-capacity circular buffer supporting efficient push/pull at both\n * head and tail.\n *\n * Direct port of .NET `ActualLab.Collections.RingBuffer<T>` at\n * src/ActualLab.Core/Collections/RingBuffer.cs (simplified — TS uses plain\n * modulo instead of the power-of-two-minus-one bit-mask trick, since the\n * performance difference is negligible in JavaScript).\n */\nexport class RingBuffer<T> {\n    private _buffer: (T | undefined)[];\n    private _start = 0;\n    private _end = 0;\n    private _count = 0;\n\n    readonly capacity: number;\n\n    get count(): number { return this._count; }\n    get isEmpty(): boolean { return this._count === 0; }\n    get isFull(): boolean { return this._count === this.capacity; }\n    get remainingCapacity(): number { return this.capacity - this._count; }\n    get hasRemainingCapacity(): boolean { return this._count < this.capacity; }\n\n    constructor(capacity: number) {\n        if (capacity < 1)\n            throw new RangeError(`RingBuffer capacity must be >= 1 (was ${capacity}).`);\n        this.capacity = capacity;\n        this._buffer = new Array<T | undefined>(capacity);\n    }\n\n    /** Read the item at `index` (0-indexed, from head). */\n    get(index: number): T {\n        if (index < 0 || index >= this._count)\n            throw new RangeError(`Index ${index} out of range [0, ${this._count}).`);\n        return this._buffer[(this._start + index) % this.capacity] as T;\n    }\n\n    /** Add an item at the tail. Throws if the buffer is full. */\n    pushTail(item: T): void {\n        if (this._count >= this.capacity)\n            throw new Error('RingBuffer is full.');\n        this._buffer[this._end] = item;\n        this._end = (this._end + 1) % this.capacity;\n        this._count++;\n    }\n\n    /** Add an item at the tail, evicting the head item if the buffer is full. */\n    pushTailAndMoveHeadIfFull(item: T): void {\n        if (this._count >= this.capacity) {\n            this._buffer[this._start] = undefined;\n            this._start = (this._start + 1) % this.capacity;\n            this._count--;\n        }\n        this.pushTail(item);\n    }\n\n    /** Remove the head item. Throws if the buffer is empty. */\n    pullHead(): T {\n        if (this._count === 0)\n            throw new Error('RingBuffer is empty.');\n        const head = this._buffer[this._start] as T;\n        this._buffer[this._start] = undefined;\n        this._start = (this._start + 1) % this.capacity;\n        this._count--;\n        return head;\n    }\n\n    /**\n     * Advance the head by `skipCount` slots, releasing references to skipped\n     * items so they can be garbage-collected.\n     */\n    moveHead(skipCount: number): void {\n        if (skipCount === 0) return;\n        if (skipCount < 0 || skipCount > this._count)\n            throw new RangeError(`skipCount ${skipCount} out of range [0, ${this._count}].`);\n        for (let k = 0; k < skipCount; k++) {\n            this._buffer[(this._start + k) % this.capacity] = undefined;\n        }\n        this._start = (this._start + skipCount) % this.capacity;\n        this._count -= skipCount;\n    }\n\n    /** Remove all items. */\n    clear(): void {\n        for (let i = 0; i < this.capacity; i++) this._buffer[i] = undefined;\n        this._start = 0;\n        this._end = 0;\n        this._count = 0;\n    }\n\n    /** Copy the buffer's contents to a new array, head-first. */\n    toArray(): T[] {\n        const out = new Array<T>(this._count);\n        for (let i = 0; i < this._count; i++) {\n            out[i] = this._buffer[(this._start + i) % this.capacity] as T;\n        }\n        return out;\n    }\n}\n","/** Common interface for types that carry a value-or-error outcome. */\r\nexport interface IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    readonly value: T;\r\n    readonly error: unknown;\r\n    readonly valueOrUndefined: T | undefined;\r\n}\r\n\r\n/** Immutable value-or-error container — similar to .NET's Result<T>. */\r\nexport class Result<T> implements IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    private readonly _value: T | undefined;\r\n    private readonly _error: unknown;\r\n\r\n    public constructor(value: T | undefined, error?: unknown) {\r\n        this.hasValue = error === undefined;\r\n        this.hasError = !this.hasValue;\r\n        this._value = value;\r\n        this._error = error;\r\n    }\r\n\r\n    get value(): T {\r\n        if (this.hasError) throw this._error;\r\n        return this._value as T;\r\n    }\r\n\r\n    get error(): unknown {\r\n        return this._error;\r\n    }\r\n\r\n    get valueOrUndefined(): T | undefined {\r\n        return this.hasValue ? this._value : undefined;\r\n    }\r\n\r\n    static ok<T>(value: T): Result<T> {\r\n        return new Result<T>(value);\r\n    }\r\n\r\n    static error<T>(error: unknown): Result<T> {\r\n        return new Result<T>(undefined, error);\r\n    }\r\n}\r\n\r\nexport function result<T>(value: T, error?: unknown): Result<T> {\r\n    return new Result<T>(value, error);\r\n}\r\n\r\nexport function errorResult<T>(error: unknown): Result<T> {\r\n    return Result.error(error);\r\n}\r\n\r\nexport function resultFrom<T>(fn: () => T): Result<T> {\r\n    try {\r\n        return result(fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n\r\nexport async function resultFromAsync<T>(\r\n    fn: () => Promise<T>\r\n): Promise<Result<T>> {\r\n    try {\r\n        return result(await fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n","// .NET counterpart: ActualLab.Time.RetryDelaySeq\r\n\r\nconst DefaultSpread = 0.1;\r\nconst DefaultMultiplier = 1.41421356237; // Math.sqrt(2)\r\n\r\nfunction applySpread(origin: number, spread: number): number {\r\n    if (spread <= 0) return origin;\r\n    const delta = origin * spread;\r\n    return origin + (Math.random() * 2 - 1) * delta;\r\n}\r\n\r\nexport class RetryDelaySeq {\r\n    readonly min: number;\r\n    readonly max: number;\r\n    readonly spread: number;\r\n    readonly multiplier: number;\r\n\r\n    constructor(\r\n        min: number,\r\n        max: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ) {\r\n        this.min = min;\r\n        this.max = max;\r\n        this.spread = spread;\r\n        this.multiplier = multiplier;\r\n    }\r\n\r\n    static fixed(\r\n        delayMs: number,\r\n        spread: number = DefaultSpread\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(delayMs, delayMs, spread, 1);\r\n    }\r\n\r\n    static exp(\r\n        minMs: number,\r\n        maxMs: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(minMs, maxMs, spread, multiplier);\r\n    }\r\n\r\n    getDelay(failureCount: number): number {\r\n        if (this.min < 0)\r\n            throw new Error('RetryDelaySeq.min must be non-negative.');\r\n        if (failureCount <= 0) return 0;\r\n\r\n        if (this.multiplier <= 1) {\r\n            // Fixed — no exponential component\r\n            return Math.max(\r\n                0,\r\n                this.spread <= 0 ? this.min : applySpread(this.min, this.spread)\r\n            );\r\n        }\r\n\r\n        const multiplier = Math.pow(this.multiplier, failureCount - 1);\r\n        const raw = Math.min(this.max, this.min * multiplier);\r\n        return Math.max(0, applySpread(raw, this.spread));\r\n    }\r\n}\r\n","// .NET counterparts: ActualLab.Net.RetryDelayer, ActualLab.Net.RetryDelay\r\n\r\nimport { EventHandlerSet } from './events.js';\r\nimport { RetryDelaySeq } from './retry-delay-seq.js';\r\n\r\nexport interface RetryDelay {\r\n    readonly promise: Promise<void>;\r\n    readonly endsAt: number; // Date.now()-based timestamp, 0 = no delay\r\n    readonly isLimitExceeded: boolean;\r\n}\r\n\r\nexport const RetryDelayNone: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: false,\r\n};\r\n\r\nexport const RetryDelayLimitExceeded: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: true,\r\n};\r\n\r\nexport class RetryDelayer {\r\n    private _cancelController = new AbortController();\r\n\r\n    delays: RetryDelaySeq = RetryDelaySeq.fixed(1000);\r\n    limit: number | undefined = undefined;\r\n\r\n    readonly cancelDelaysChanged = new EventHandlerSet<void>();\r\n\r\n    getDelay(tryIndex: number, cancellationSignal?: AbortSignal): RetryDelay {\r\n        if (this.limit !== undefined && tryIndex >= this.limit)\r\n            return RetryDelayLimitExceeded;\r\n\r\n        const delayMs = this.delays.getDelay(tryIndex);\r\n        if (tryIndex === 0 || delayMs <= 0) return RetryDelayNone;\r\n\r\n        const actualDelayMs = Math.max(1, delayMs);\r\n        const endsAt = Date.now() + actualDelayMs;\r\n\r\n        const cancelSignal = this._cancelController.signal;\r\n        const promise = new Promise<void>((resolve, reject) => {\r\n            const timer = setTimeout(() => {\r\n                cleanup();\r\n                resolve();\r\n            }, actualDelayMs);\r\n\r\n            const onCancel = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                resolve(); // cancelDelays resolves, does NOT reject\r\n            };\r\n\r\n            const onAbort = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                reject(new Error('Retry delay aborted.'));\r\n            };\r\n\r\n            const cleanup = () => {\r\n                cancelSignal.removeEventListener('abort', onCancel);\r\n                cancellationSignal?.removeEventListener('abort', onAbort);\r\n            };\r\n\r\n            cancelSignal.addEventListener('abort', onCancel, { once: true });\r\n            cancellationSignal?.addEventListener('abort', onAbort, {\r\n                once: true,\r\n            });\r\n        });\r\n\r\n        return { promise, endsAt, isLimitExceeded: false };\r\n    }\r\n\r\n    cancelDelays(): void {\r\n        const old = this._cancelController;\r\n        this._cancelController = new AbortController();\r\n        old.abort();\r\n        this.cancelDelaysChanged.trigger();\r\n    }\r\n}\r\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACGC,OAAe,aAAa,uBAAO,iBAAiB;;;ACA9C,IAAM,kBAAN,MAAyB;AAAA,EACnB;AAAA,EACA;AAAA,EAET,YAAY,MAAc,cAAiB;AACvC,SAAK,KAAK,OAAO,IAAI;AACrB,SAAK,eAAe;AAAA,EACxB;AACJ;AAGO,IAAM,iBAAiB,IAAI;AAAA,EAC9B;AAAA,EACA;AACJ;AAEO,IAAM,eAAN,MAAM,cAAa;AAAA,EACtB,OAAO,UAAoC;AAAA;AAAA,EAG3C,OAAgB,QAAsB,IAAI,cAAa;AAAA,EAEvD,OAAe,YAAY,oBAAI,IAAqB;AAAA,EAE5C;AAAA,EAER,YAAY,QAA+B;AACvC,SAAK,UAAU,UAAU,oBAAI,IAAqB;AAAA,EACtD;AAAA,EAEA,IAAO,KAA4B;AAC/B,QAAI,KAAK,QAAQ,IAAI,IAAI,EAAE,EAAG,QAAO,KAAK,QAAQ,IAAI,IAAI,EAAE;AAC5D,QAAI,cAAa,UAAU,IAAI,IAAI,EAAE;AACjC,aAAO,cAAa,UAAU,IAAI,IAAI,EAAE;AAC5C,WAAO,IAAI;AAAA,EACf;AAAA,EAEA,KAAQ,KAAyB,OAAwB;AACrD,UAAM,OAAO,IAAI,IAAI,KAAK,OAAO;AACjC,SAAK,IAAI,IAAI,IAAI,KAAK;AACtB,WAAO,IAAI,cAAa,IAAI;AAAA,EAChC;AAAA,EAEA,WAAuB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,WAAO;AAAA,MACH,SAAS,MAAM;AACX,sBAAa,UAAU;AAAA,MAC3B;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,IAAO,IAAgB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,QAAI;AACA,aAAO,GAAG;AAAA,IACd,UAAE;AACE,oBAAa,UAAU;AAAA,IAC3B;AAAA,EACJ;AAAA;AAAA,EAGA,cAAc,MAA4B;AACtC,WAAO,KAAK,KAAK,SAAS,CAAC,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI;AAAA,EAChE;AAAA;AAAA,EAGA,OAAO,KAAK,KAAyD;AACjE,WAAO,OAAO,cAAa;AAAA,EAC/B;AAAA;AAAA,EAGA,OAAO,SAAS,MAA2C;AACvD,UAAM,OAAO,KAAK,KAAK,SAAS,CAAC;AACjC,WAAO,gBAAgB,gBAAe,OAAO,cAAa;AAAA,EAC9D;AAAA,EAEA,OAAO,WAAc,KAAyB,OAAgB;AAC1D,kBAAa,UAAU,IAAI,IAAI,IAAI,KAAK;AAAA,EAC5C;AAAA,EAEA,OAAO,cAA4B;AAC/B,WAAO,cAAa,WAAW,cAAa;AAAA,EAChD;AACJ;;;ACxFO,IAAM,YAAN,MAAgB;AAAA,EACX,SAAyB,CAAC;AAAA,EAC1B,UAAU;AAAA,EAElB,IAAI,WAAoB;AACpB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,MAAM,UAAyB;AAC3B,QAAI,CAAC,KAAK,SAAS;AACf,WAAK,UAAU;AACf;AAAA,IACJ;AACA,WAAO,IAAI,QAAc,aAAW;AAChC,WAAK,OAAO,KAAK,OAAO;AAAA,IAC5B,CAAC;AAAA,EACL;AAAA,EAEA,UAAgB;AACZ,QAAI,CAAC,KAAK,QAAS,OAAM,IAAI,MAAM,0BAA0B;AAE7D,UAAM,OAAO,KAAK,OAAO,MAAM;AAC/B,QAAI,SAAS,QAAW;AAEpB,WAAK;AAAA,IACT,OAAO;AACH,WAAK,UAAU;AAAA,IACnB;AAAA,EACJ;AAAA,EAEA,MAAM,IAAO,IAAsC;AAC/C,UAAM,KAAK,QAAQ;AACnB,QAAI;AACA,aAAO,MAAM,GAAG;AAAA,IACpB,UAAE;AACE,WAAK,QAAQ;AAAA,IACjB;AAAA,EACJ;AACJ;;;AC5BO,IAAM,gBAAN,MAA2D;AAAA,EACtD,SAA2C,CAAC;AAAA,EAC5C,YAAY;AAAA,EAEpB,IAAI,aAAsB;AACtB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,MAA0C;AAC1C,QAAI,KAAK;AACL,YAAM,IAAI,MAAM,oCAAoC;AACxD,SAAK,OAAO,KAAK,IAAI;AAAA,EACzB;AAAA,EAEA,UAAgB;AACZ,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AAEf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,aAAa,KAAM,MAAK,QAAQ;AAAA,IACxC;AAAA,EACJ;AAAA,EAEA,MAAM,eAA8B;AAChC,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AACf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,kBAAkB,KAAM,OAAM,KAAK,aAAa;AAAA,eAC3C,aAAa,KAAM,MAAK,QAAQ;AAAA,IAC7C;AAAA,EACJ;AACJ;;;AC/CO,IAAM,gBAAN,MAAuB;AAAA,EACjB;AAAA,EACD;AAAA,EACA;AAAA,EACA,eAAe;AAAA,EAEvB,cAAc;AACV,SAAK,UAAU,IAAI,QAAW,CAAC,SAAS,WAAW;AAC/C,WAAK,WAAW;AAChB,WAAK,UAAU;AAAA,IACnB,CAAC;AAAA,EACL;AAAA,EAEA,IAAI,cAAuB;AACvB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,QAAQ,OAAmB;AACvB,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,SAAS,KAAK;AACnB,WAAO;AAAA,EACX;AAAA,EAEA,OAAO,QAA2B;AAC9B,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,QAAQ,MAAM;AACnB,WAAO;AAAA,EACX;AACJ;AAEO,IAAM,sBAAqC,QAAQ,QAAQ;;;AC9B3D,IAAM,kBAAN,MAAyB;AAAA,EACpB,YAAY,oBAAI,IAAsB;AAAA,EAE9C,IAAI,QAAgB;AAChB,WAAO,KAAK,UAAU;AAAA,EAC1B;AAAA,EAEA,IAAI,SAAiC;AACjC,SAAK,UAAU,IAAI,OAAO;AAAA,EAC9B;AAAA,EAEA,OAAO,SAAiC;AACpC,SAAK,UAAU,OAAO,OAAO;AAAA,EACjC;AAAA,EAEA,QAAQ,KAAc;AAClB,eAAW,WAAW,KAAK,UAAW,SAAQ,GAAG;AAAA,EACrD;AAAA,EAEA,QAAc;AACV,SAAK,UAAU,MAAM;AAAA,EACzB;AAAA,EAEA,WAAuB;AACnB,UAAM,KAAK,IAAI,cAAiB;AAChC,UAAM,UAAU,CAAC,QAAW;AACxB,WAAK,UAAU,OAAO,OAAO;AAC7B,SAAG,QAAQ,GAAG;AAAA,IAClB;AACA,SAAK,UAAU,IAAI,OAAO;AAC1B,WAAO,GAAG;AAAA,EACd;AACJ;;;AC1BO,IAAM,aAAN,MAAoB;AAAA,EACf;AAAA,EACA,SAAS;AAAA,EACT,OAAO;AAAA,EACP,SAAS;AAAA,EAER;AAAA,EAET,IAAI,QAAgB;AAAE,WAAO,KAAK;AAAA,EAAQ;AAAA,EAC1C,IAAI,UAAmB;AAAE,WAAO,KAAK,WAAW;AAAA,EAAG;AAAA,EACnD,IAAI,SAAkB;AAAE,WAAO,KAAK,WAAW,KAAK;AAAA,EAAU;AAAA,EAC9D,IAAI,oBAA4B;AAAE,WAAO,KAAK,WAAW,KAAK;AAAA,EAAQ;AAAA,EACtE,IAAI,uBAAgC;AAAE,WAAO,KAAK,SAAS,KAAK;AAAA,EAAU;AAAA,EAE1E,YAAY,UAAkB;AAC1B,QAAI,WAAW;AACX,YAAM,IAAI,WAAW,yCAAyC,QAAQ,IAAI;AAC9E,SAAK,WAAW;AAChB,SAAK,UAAU,IAAI,MAAqB,QAAQ;AAAA,EACpD;AAAA;AAAA,EAGA,IAAI,OAAkB;AAClB,QAAI,QAAQ,KAAK,SAAS,KAAK;AAC3B,YAAM,IAAI,WAAW,SAAS,KAAK,qBAAqB,KAAK,MAAM,IAAI;AAC3E,WAAO,KAAK,SAAS,KAAK,SAAS,SAAS,KAAK,QAAQ;AAAA,EAC7D;AAAA;AAAA,EAGA,SAAS,MAAe;AACpB,QAAI,KAAK,UAAU,KAAK;AACpB,YAAM,IAAI,MAAM,qBAAqB;AACzC,SAAK,QAAQ,KAAK,IAAI,IAAI;AAC1B,SAAK,QAAQ,KAAK,OAAO,KAAK,KAAK;AACnC,SAAK;AAAA,EACT;AAAA;AAAA,EAGA,0BAA0B,MAAe;AACrC,QAAI,KAAK,UAAU,KAAK,UAAU;AAC9B,WAAK,QAAQ,KAAK,MAAM,IAAI;AAC5B,WAAK,UAAU,KAAK,SAAS,KAAK,KAAK;AACvC,WAAK;AAAA,IACT;AACA,SAAK,SAAS,IAAI;AAAA,EACtB;AAAA;AAAA,EAGA,WAAc;AACV,QAAI,KAAK,WAAW;AAChB,YAAM,IAAI,MAAM,sBAAsB;AAC1C,UAAM,OAAO,KAAK,QAAQ,KAAK,MAAM;AACrC,SAAK,QAAQ,KAAK,MAAM,IAAI;AAC5B,SAAK,UAAU,KAAK,SAAS,KAAK,KAAK;AACvC,SAAK;AACL,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,WAAyB;AAC9B,QAAI,cAAc,EAAG;AACrB,QAAI,YAAY,KAAK,YAAY,KAAK;AAClC,YAAM,IAAI,WAAW,aAAa,SAAS,qBAAqB,KAAK,MAAM,IAAI;AACnF,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,WAAK,SAAS,KAAK,SAAS,KAAK,KAAK,QAAQ,IAAI;AAAA,IACtD;AACA,SAAK,UAAU,KAAK,SAAS,aAAa,KAAK;AAC/C,SAAK,UAAU;AAAA,EACnB;AAAA;AAAA,EAGA,QAAc;AACV,aAAS,IAAI,GAAG,IAAI,KAAK,UAAU,IAAK,MAAK,QAAQ,CAAC,IAAI;AAC1D,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA,EAGA,UAAe;AACX,UAAM,MAAM,IAAI,MAAS,KAAK,MAAM;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,UAAI,CAAC,IAAI,KAAK,SAAS,KAAK,SAAS,KAAK,KAAK,QAAQ;AAAA,IAC3D;AACA,WAAO;AAAA,EACX;AACJ;;;ACxFO,IAAM,SAAN,MAAM,QAAgC;AAAA,EAChC;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA,EAEV,YAAY,OAAsB,OAAiB;AACtD,SAAK,WAAW,UAAU;AAC1B,SAAK,WAAW,CAAC,KAAK;AACtB,SAAK,SAAS;AACd,SAAK,SAAS;AAAA,EAClB;AAAA,EAEA,IAAI,QAAW;AACX,QAAI,KAAK,SAAU,OAAM,KAAK;AAC9B,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,QAAiB;AACjB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,mBAAkC;AAClC,WAAO,KAAK,WAAW,KAAK,SAAS;AAAA,EACzC;AAAA,EAEA,OAAO,GAAM,OAAqB;AAC9B,WAAO,IAAI,QAAU,KAAK;AAAA,EAC9B;AAAA,EAEA,OAAO,MAAS,OAA2B;AACvC,WAAO,IAAI,QAAU,QAAW,KAAK;AAAA,EACzC;AACJ;AAEO,SAAS,OAAU,OAAU,OAA4B;AAC5D,SAAO,IAAI,OAAU,OAAO,KAAK;AACrC;AAEO,SAAS,YAAe,OAA2B;AACtD,SAAO,OAAO,MAAM,KAAK;AAC7B;AAEO,SAAS,WAAc,IAAwB;AAClD,MAAI;AACA,WAAO,OAAO,GAAG,CAAC;AAAA,EACtB,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;AAEA,eAAsB,gBAClB,IACkB;AAClB,MAAI;AACA,WAAO,OAAO,MAAM,GAAG,CAAC;AAAA,EAC5B,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;;;ACnEA,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAE1B,SAAS,YAAY,QAAgB,QAAwB;AACzD,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,QAAQ,SAAS;AACvB,SAAO,UAAU,KAAK,OAAO,IAAI,IAAI,KAAK;AAC9C;AAEO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACd;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACI,KACA,KACA,SAAiB,eACjB,aAAqB,mBACvB;AACE,SAAK,MAAM;AACX,SAAK,MAAM;AACX,SAAK,SAAS;AACd,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,OAAO,MACH,SACA,SAAiB,eACJ;AACb,WAAO,IAAI,eAAc,SAAS,SAAS,QAAQ,CAAC;AAAA,EACxD;AAAA,EAEA,OAAO,IACH,OACA,OACA,SAAiB,eACjB,aAAqB,mBACR;AACb,WAAO,IAAI,eAAc,OAAO,OAAO,QAAQ,UAAU;AAAA,EAC7D;AAAA,EAEA,SAAS,cAA8B;AACnC,QAAI,KAAK,MAAM;AACX,YAAM,IAAI,MAAM,yCAAyC;AAC7D,QAAI,gBAAgB,EAAG,QAAO;AAE9B,QAAI,KAAK,cAAc,GAAG;AAEtB,aAAO,KAAK;AAAA,QACR;AAAA,QACA,KAAK,UAAU,IAAI,KAAK,MAAM,YAAY,KAAK,KAAK,KAAK,MAAM;AAAA,MACnE;AAAA,IACJ;AAEA,UAAM,aAAa,KAAK,IAAI,KAAK,YAAY,eAAe,CAAC;AAC7D,UAAM,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,UAAU;AACpD,WAAO,KAAK,IAAI,GAAG,YAAY,KAAK,KAAK,MAAM,CAAC;AAAA,EACpD;AACJ;;;ACnDO,IAAM,iBAA6B;AAAA,EACtC,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,0BAAsC;AAAA,EAC/C,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,eAAN,MAAmB;AAAA,EACd,oBAAoB,IAAI,gBAAgB;AAAA,EAEhD,SAAwB,cAAc,MAAM,GAAI;AAAA,EAChD,QAA4B;AAAA,EAEnB,sBAAsB,IAAI,gBAAsB;AAAA,EAEzD,SAAS,UAAkB,oBAA8C;AACrE,QAAI,KAAK,UAAU,UAAa,YAAY,KAAK;AAC7C,aAAO;AAEX,UAAM,UAAU,KAAK,OAAO,SAAS,QAAQ;AAC7C,QAAI,aAAa,KAAK,WAAW,EAAG,QAAO;AAE3C,UAAM,gBAAgB,KAAK,IAAI,GAAG,OAAO;AACzC,UAAM,SAAS,KAAK,IAAI,IAAI;AAE5B,UAAM,eAAe,KAAK,kBAAkB;AAC5C,UAAM,UAAU,IAAI,QAAc,CAAC,SAAS,WAAW;AACnD,YAAM,QAAQ,WAAW,MAAM;AAC3B,gBAAQ;AACR,gBAAQ;AAAA,MACZ,GAAG,aAAa;AAEhB,YAAM,WAAW,MAAM;AACnB,qBAAa,KAAK;AAClB,gBAAQ;AACR,gBAAQ;AAAA,MACZ;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,KAAK;AAClB,gBAAQ;AACR,eAAO,IAAI,MAAM,sBAAsB,CAAC;AAAA,MAC5C;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,oBAAoB,SAAS,QAAQ;AAClD,4BAAoB,oBAAoB,SAAS,OAAO;AAAA,MAC5D;AAEA,mBAAa,iBAAiB,SAAS,UAAU,EAAE,MAAM,KAAK,CAAC;AAC/D,0BAAoB,iBAAiB,SAAS,SAAS;AAAA,QACnD,MAAM;AAAA,MACV,CAAC;AAAA,IACL,CAAC;AAED,WAAO,EAAE,SAAS,QAAQ,iBAAiB,MAAM;AAAA,EACrD;AAAA,EAEA,eAAqB;AACjB,UAAM,MAAM,KAAK;AACjB,SAAK,oBAAoB,IAAI,gBAAgB;AAC7C,QAAI,MAAM;AACV,SAAK,oBAAoB,QAAQ;AAAA,EACrC;AACJ;","names":[]}

package/dist/index.d.cts

@@ -79,6 +79,46 @@ declare class PromiseSource<T> {
 }
 declare const resolvedVoidPromise: Promise<void>;
 
+/**
+ * A fixed-capacity circular buffer supporting efficient push/pull at both
+ * head and tail.
+ *
+ * Direct port of .NET `ActualLab.Collections.RingBuffer<T>` at
+ * src/ActualLab.Core/Collections/RingBuffer.cs (simplified — TS uses plain
+ * modulo instead of the power-of-two-minus-one bit-mask trick, since the
+ * performance difference is negligible in JavaScript).
+ */
+declare class RingBuffer<T> {
+    private _buffer;
+    private _start;
+    private _end;
+    private _count;
+    readonly capacity: number;
+    get count(): number;
+    get isEmpty(): boolean;
+    get isFull(): boolean;
+    get remainingCapacity(): number;
+    get hasRemainingCapacity(): boolean;
+    constructor(capacity: number);
+    /** Read the item at `index` (0-indexed, from head). */
+    get(index: number): T;
+    /** Add an item at the tail. Throws if the buffer is full. */
+    pushTail(item: T): void;
+    /** Add an item at the tail, evicting the head item if the buffer is full. */
+    pushTailAndMoveHeadIfFull(item: T): void;
+    /** Remove the head item. Throws if the buffer is empty. */
+    pullHead(): T;
+    /**
+     * Advance the head by `skipCount` slots, releasing references to skipped
+     * items so they can be garbage-collected.
+     */
+    moveHead(skipCount: number): void;
+    /** Remove all items. */
+    clear(): void;
+    /** Copy the buffer's contents to a new array, head-first. */
+    toArray(): T[];
+}
+
 /** Common interface for types that carry a value-or-error outcome. */
 interface IResult<T> {
     readonly hasValue: boolean;
@@ -132,4 +172,4 @@ declare class RetryDelayer {
     cancelDelays(): void;
 }
 
-export { AsyncContext, AsyncContextKey, type AsyncDisposable, AsyncLock, type Disposable, DisposableBag, EventHandlerSet, type IResult, PromiseSource, Result, type RetryDelay, RetryDelayLimitExceeded, RetryDelayNone, RetryDelaySeq, RetryDelayer, abortSignalKey, errorResult, resolvedVoidPromise, result, resultFrom, resultFromAsync };
+export { AsyncContext, AsyncContextKey, type AsyncDisposable, AsyncLock, type Disposable, DisposableBag, EventHandlerSet, type IResult, PromiseSource, Result, type RetryDelay, RetryDelayLimitExceeded, RetryDelayNone, RetryDelaySeq, RetryDelayer, RingBuffer, abortSignalKey, errorResult, resolvedVoidPromise, result, resultFrom, resultFromAsync };

package/dist/index.d.ts

@@ -79,6 +79,46 @@ declare class PromiseSource<T> {
 }
 declare const resolvedVoidPromise: Promise<void>;
 
+/**
+ * A fixed-capacity circular buffer supporting efficient push/pull at both
+ * head and tail.
+ *
+ * Direct port of .NET `ActualLab.Collections.RingBuffer<T>` at
+ * src/ActualLab.Core/Collections/RingBuffer.cs (simplified — TS uses plain
+ * modulo instead of the power-of-two-minus-one bit-mask trick, since the
+ * performance difference is negligible in JavaScript).
+ */
+declare class RingBuffer<T> {
+    private _buffer;
+    private _start;
+    private _end;
+    private _count;
+    readonly capacity: number;
+    get count(): number;
+    get isEmpty(): boolean;
+    get isFull(): boolean;
+    get remainingCapacity(): number;
+    get hasRemainingCapacity(): boolean;
+    constructor(capacity: number);
+    /** Read the item at `index` (0-indexed, from head). */
+    get(index: number): T;
+    /** Add an item at the tail. Throws if the buffer is full. */
+    pushTail(item: T): void;
+    /** Add an item at the tail, evicting the head item if the buffer is full. */
+    pushTailAndMoveHeadIfFull(item: T): void;
+    /** Remove the head item. Throws if the buffer is empty. */
+    pullHead(): T;
+    /**
+     * Advance the head by `skipCount` slots, releasing references to skipped
+     * items so they can be garbage-collected.
+     */
+    moveHead(skipCount: number): void;
+    /** Remove all items. */
+    clear(): void;
+    /** Copy the buffer's contents to a new array, head-first. */
+    toArray(): T[];
+}
+
 /** Common interface for types that carry a value-or-error outcome. */
 interface IResult<T> {
     readonly hasValue: boolean;
@@ -132,4 +172,4 @@ declare class RetryDelayer {
     cancelDelays(): void;
 }
 
-export { AsyncContext, AsyncContextKey, type AsyncDisposable, AsyncLock, type Disposable, DisposableBag, EventHandlerSet, type IResult, PromiseSource, Result, type RetryDelay, RetryDelayLimitExceeded, RetryDelayNone, RetryDelaySeq, RetryDelayer, abortSignalKey, errorResult, resolvedVoidPromise, result, resultFrom, resultFromAsync };
+export { AsyncContext, AsyncContextKey, type AsyncDisposable, AsyncLock, type Disposable, DisposableBag, EventHandlerSet, type IResult, PromiseSource, Result, type RetryDelay, RetryDelayLimitExceeded, RetryDelayNone, RetryDelaySeq, RetryDelayer, RingBuffer, abortSignalKey, errorResult, resolvedVoidPromise, result, resultFrom, resultFromAsync };

package/dist/index.js

@@ -202,6 +202,98 @@ var EventHandlerSet = class {
   }
 };
 
+// src/ring-buffer.ts
+var RingBuffer = class {
+  _buffer;
+  _start = 0;
+  _end = 0;
+  _count = 0;
+  capacity;
+  get count() {
+    return this._count;
+  }
+  get isEmpty() {
+    return this._count === 0;
+  }
+  get isFull() {
+    return this._count === this.capacity;
+  }
+  get remainingCapacity() {
+    return this.capacity - this._count;
+  }
+  get hasRemainingCapacity() {
+    return this._count < this.capacity;
+  }
+  constructor(capacity) {
+    if (capacity < 1)
+      throw new RangeError(`RingBuffer capacity must be >= 1 (was ${capacity}).`);
+    this.capacity = capacity;
+    this._buffer = new Array(capacity);
+  }
+  /** Read the item at `index` (0-indexed, from head). */
+  get(index) {
+    if (index < 0 || index >= this._count)
+      throw new RangeError(`Index ${index} out of range [0, ${this._count}).`);
+    return this._buffer[(this._start + index) % this.capacity];
+  }
+  /** Add an item at the tail. Throws if the buffer is full. */
+  pushTail(item) {
+    if (this._count >= this.capacity)
+      throw new Error("RingBuffer is full.");
+    this._buffer[this._end] = item;
+    this._end = (this._end + 1) % this.capacity;
+    this._count++;
+  }
+  /** Add an item at the tail, evicting the head item if the buffer is full. */
+  pushTailAndMoveHeadIfFull(item) {
+    if (this._count >= this.capacity) {
+      this._buffer[this._start] = void 0;
+      this._start = (this._start + 1) % this.capacity;
+      this._count--;
+    }
+    this.pushTail(item);
+  }
+  /** Remove the head item. Throws if the buffer is empty. */
+  pullHead() {
+    if (this._count === 0)
+      throw new Error("RingBuffer is empty.");
+    const head = this._buffer[this._start];
+    this._buffer[this._start] = void 0;
+    this._start = (this._start + 1) % this.capacity;
+    this._count--;
+    return head;
+  }
+  /**
+   * Advance the head by `skipCount` slots, releasing references to skipped
+   * items so they can be garbage-collected.
+   */
+  moveHead(skipCount) {
+    if (skipCount === 0) return;
+    if (skipCount < 0 || skipCount > this._count)
+      throw new RangeError(`skipCount ${skipCount} out of range [0, ${this._count}].`);
+    for (let k = 0; k < skipCount; k++) {
+      this._buffer[(this._start + k) % this.capacity] = void 0;
+    }
+    this._start = (this._start + skipCount) % this.capacity;
+    this._count -= skipCount;
+  }
+  /** Remove all items. */
+  clear() {
+    for (let i = 0; i < this.capacity; i++) this._buffer[i] = void 0;
+    this._start = 0;
+    this._end = 0;
+    this._count = 0;
+  }
+  /** Copy the buffer's contents to a new array, head-first. */
+  toArray() {
+    const out = new Array(this._count);
+    for (let i = 0; i < this._count; i++) {
+      out[i] = this._buffer[(this._start + i) % this.capacity];
+    }
+    return out;
+  }
+};
+
 // src/result.ts
 var Result = class _Result {
   hasValue;
@@ -362,6 +454,7 @@ export {
   RetryDelayNone,
   RetryDelaySeq,
   RetryDelayer,
+  RingBuffer,
   abortSignalKey,
   errorResult,
   resolvedVoidPromise,

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/polyfills.ts","../src/async-context.ts","../src/async-lock.ts","../src/disposable.ts","../src/promise-source.ts","../src/events.ts","../src/result.ts","../src/retry-delay-seq.ts","../src/retry-delayer.ts"],"sourcesContent":["// TC39 decorator metadata polyfill — required for Symbol.metadata support\r\n// in runtimes that don't yet implement it natively.\r\n// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\r\n(Symbol as any).metadata ??= Symbol('Symbol.metadata');\r\n","import type { Disposable } from './disposable.js';\r\n\r\n/** Typed key for values stored in AsyncContext — each subsystem defines its own keys. */\r\nexport class AsyncContextKey<T> {\r\n    readonly id: symbol;\r\n    readonly defaultValue: T;\r\n\r\n    constructor(name: string, defaultValue: T) {\r\n        this.id = Symbol(name);\r\n        this.defaultValue = defaultValue;\r\n    }\r\n}\r\n\r\n/** General-purpose typed context container — named for forward-compatibility with TC39 AsyncContext proposal. */\r\nexport const abortSignalKey = new AsyncContextKey<AbortSignal | undefined>(\r\n    'AbortSignal',\r\n    undefined\r\n);\r\n\r\nexport class AsyncContext {\r\n    static current: AsyncContext | undefined = undefined;\r\n\r\n    /** Immutable empty singleton — avoids allocating new AsyncContext(). */\r\n    static readonly empty: AsyncContext = new AsyncContext();\r\n\r\n    private static _defaults = new Map<symbol, unknown>();\r\n\r\n    private _values: Map<symbol, unknown>;\r\n\r\n    constructor(values?: Map<symbol, unknown>) {\r\n        this._values = values ?? new Map<symbol, unknown>();\r\n    }\r\n\r\n    get<T>(key: AsyncContextKey<T>): T {\r\n        if (this._values.has(key.id)) return this._values.get(key.id) as T;\r\n        if (AsyncContext._defaults.has(key.id))\r\n            return AsyncContext._defaults.get(key.id) as T;\r\n        return key.defaultValue;\r\n    }\r\n\r\n    with<T>(key: AsyncContextKey<T>, value: T): AsyncContext {\r\n        const copy = new Map(this._values);\r\n        copy.set(key.id, value);\r\n        return new AsyncContext(copy);\r\n    }\r\n\r\n    activate(): Disposable {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        return {\r\n            dispose: () => {\r\n                AsyncContext.current = prev;\r\n            },\r\n        };\r\n    }\r\n\r\n    run<R>(fn: () => R): R {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        try {\r\n            return fn();\r\n        } finally {\r\n            AsyncContext.current = prev;\r\n        }\r\n    }\r\n\r\n    /** Strip THIS exact instance from args if it's the last element (reference equality). */\r\n    stripFromArgs(args: unknown[]): unknown[] {\r\n        return args[args.length - 1] === this ? args.slice(0, -1) : args;\r\n    }\r\n\r\n    /** Resolve: return ctx if provided, otherwise AsyncContext.current. */\r\n    static from(ctx: AsyncContext | undefined): AsyncContext | undefined {\r\n        return ctx ?? AsyncContext.current;\r\n    }\r\n\r\n    /** Extract AsyncContext from last arg if instanceof AsyncContext, else fall back to .current. */\r\n    static fromArgs(args: unknown[]): AsyncContext | undefined {\r\n        const last = args[args.length - 1];\r\n        return last instanceof AsyncContext ? last : AsyncContext.current;\r\n    }\r\n\r\n    static setDefault<T>(key: AsyncContextKey<T>, value: T): void {\r\n        AsyncContext._defaults.set(key.id, value);\r\n    }\r\n\r\n    static getOrCreate(): AsyncContext {\r\n        return AsyncContext.current ?? AsyncContext.empty;\r\n    }\r\n}\r\n","/** Promise-based mutual exclusion lock for serializing async operations. */\r\nexport class AsyncLock {\r\n    private _queue: (() => void)[] = [];\r\n    private _locked = false;\r\n\r\n    get isLocked(): boolean {\r\n        return this._locked;\r\n    }\r\n\r\n    async acquire(): Promise<void> {\r\n        if (!this._locked) {\r\n            this._locked = true;\r\n            return;\r\n        }\r\n        return new Promise<void>(resolve => {\r\n            this._queue.push(resolve);\r\n        });\r\n    }\r\n\r\n    release(): void {\r\n        if (!this._locked) throw new Error('AsyncLock is not locked.');\r\n\r\n        const next = this._queue.shift();\r\n        if (next !== undefined) {\r\n            // Transfer lock to the next waiter\r\n            next();\r\n        } else {\r\n            this._locked = false;\r\n        }\r\n    }\r\n\r\n    async run<T>(fn: () => T | Promise<T>): Promise<T> {\r\n        await this.acquire();\r\n        try {\r\n            return await fn();\r\n        } finally {\r\n            this.release();\r\n        }\r\n    }\r\n}\r\n","/** Synchronous dispose pattern, similar to .NET's IDisposable. */\r\nexport interface Disposable {\r\n    dispose(): void;\r\n}\r\n\r\n/** Asynchronous dispose pattern, similar to .NET's IAsyncDisposable. */\r\nexport interface AsyncDisposable {\r\n    disposeAsync(): Promise<void>;\r\n}\r\n\r\n/** Aggregates multiple disposables and disposes them together. */\r\nexport class DisposableBag implements Disposable, AsyncDisposable {\r\n    private _items: (Disposable | AsyncDisposable)[] = [];\r\n    private _disposed = false;\r\n\r\n    get isDisposed(): boolean {\r\n        return this._disposed;\r\n    }\r\n\r\n    add(item: Disposable | AsyncDisposable): void {\r\n        if (this._disposed)\r\n            throw new Error('DisposableBag is already disposed.');\r\n        this._items.push(item);\r\n    }\r\n\r\n    dispose(): void {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        // Dispose in reverse order (LIFO)\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n\r\n    async disposeAsync(): Promise<void> {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('disposeAsync' in item) await item.disposeAsync();\r\n            else if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n}\r\n","/** Externally-resolvable promise — similar to .NET's TaskCompletionSource<T>. */\r\nexport class PromiseSource<T> {\r\n    readonly promise: Promise<T>;\r\n    private _resolve!: (value: T | PromiseLike<T>) => void;\r\n    private _reject!: (reason?: unknown) => void;\r\n    private _isCompleted = false;\r\n\r\n    constructor() {\r\n        this.promise = new Promise<T>((resolve, reject) => {\r\n            this._resolve = resolve;\r\n            this._reject = reject;\r\n        });\r\n    }\r\n\r\n    get isCompleted(): boolean {\r\n        return this._isCompleted;\r\n    }\r\n\r\n    resolve(value: T): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._resolve(value);\r\n        return true;\r\n    }\r\n\r\n    reject(reason?: unknown): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._reject(reason);\r\n        return true;\r\n    }\r\n}\r\n\r\nexport const resolvedVoidPromise: Promise<void> = Promise.resolve();\r\n","import { PromiseSource } from './promise-source.js';\r\n\r\n/** Typed pub/sub event handler set — similar to .NET's EventHandler<T> multicast delegate. */\r\nexport class EventHandlerSet<T> {\r\n    private _handlers = new Set<(arg: T) => void>();\r\n\r\n    get count(): number {\r\n        return this._handlers.size;\r\n    }\r\n\r\n    add(handler: (arg: T) => void): void {\r\n        this._handlers.add(handler);\r\n    }\r\n\r\n    remove(handler: (arg: T) => void): void {\r\n        this._handlers.delete(handler);\r\n    }\r\n\r\n    trigger(arg: T): void {\r\n        for (const handler of this._handlers) handler(arg);\r\n    }\r\n\r\n    clear(): void {\r\n        this._handlers.clear();\r\n    }\r\n\r\n    whenNext(): Promise<T> {\r\n        const ps = new PromiseSource<T>();\r\n        const handler = (arg: T) => {\r\n            this._handlers.delete(handler);\r\n            ps.resolve(arg);\r\n        };\r\n        this._handlers.add(handler);\r\n        return ps.promise;\r\n    }\r\n}\r\n","/** Common interface for types that carry a value-or-error outcome. */\r\nexport interface IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    readonly value: T;\r\n    readonly error: unknown;\r\n    readonly valueOrUndefined: T | undefined;\r\n}\r\n\r\n/** Immutable value-or-error container — similar to .NET's Result<T>. */\r\nexport class Result<T> implements IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    private readonly _value: T | undefined;\r\n    private readonly _error: unknown;\r\n\r\n    public constructor(value: T | undefined, error?: unknown) {\r\n        this.hasValue = error === undefined;\r\n        this.hasError = !this.hasValue;\r\n        this._value = value;\r\n        this._error = error;\r\n    }\r\n\r\n    get value(): T {\r\n        if (this.hasError) throw this._error;\r\n        return this._value as T;\r\n    }\r\n\r\n    get error(): unknown {\r\n        return this._error;\r\n    }\r\n\r\n    get valueOrUndefined(): T | undefined {\r\n        return this.hasValue ? this._value : undefined;\r\n    }\r\n\r\n    static ok<T>(value: T): Result<T> {\r\n        return new Result<T>(value);\r\n    }\r\n\r\n    static error<T>(error: unknown): Result<T> {\r\n        return new Result<T>(undefined, error);\r\n    }\r\n}\r\n\r\nexport function result<T>(value: T, error?: unknown): Result<T> {\r\n    return new Result<T>(value, error);\r\n}\r\n\r\nexport function errorResult<T>(error: unknown): Result<T> {\r\n    return Result.error(error);\r\n}\r\n\r\nexport function resultFrom<T>(fn: () => T): Result<T> {\r\n    try {\r\n        return result(fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n\r\nexport async function resultFromAsync<T>(\r\n    fn: () => Promise<T>\r\n): Promise<Result<T>> {\r\n    try {\r\n        return result(await fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n","// .NET counterpart: ActualLab.Time.RetryDelaySeq\r\n\r\nconst DefaultSpread = 0.1;\r\nconst DefaultMultiplier = 1.41421356237; // Math.sqrt(2)\r\n\r\nfunction applySpread(origin: number, spread: number): number {\r\n    if (spread <= 0) return origin;\r\n    const delta = origin * spread;\r\n    return origin + (Math.random() * 2 - 1) * delta;\r\n}\r\n\r\nexport class RetryDelaySeq {\r\n    readonly min: number;\r\n    readonly max: number;\r\n    readonly spread: number;\r\n    readonly multiplier: number;\r\n\r\n    constructor(\r\n        min: number,\r\n        max: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ) {\r\n        this.min = min;\r\n        this.max = max;\r\n        this.spread = spread;\r\n        this.multiplier = multiplier;\r\n    }\r\n\r\n    static fixed(\r\n        delayMs: number,\r\n        spread: number = DefaultSpread\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(delayMs, delayMs, spread, 1);\r\n    }\r\n\r\n    static exp(\r\n        minMs: number,\r\n        maxMs: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(minMs, maxMs, spread, multiplier);\r\n    }\r\n\r\n    getDelay(failureCount: number): number {\r\n        if (this.min < 0)\r\n            throw new Error('RetryDelaySeq.min must be non-negative.');\r\n        if (failureCount <= 0) return 0;\r\n\r\n        if (this.multiplier <= 1) {\r\n            // Fixed — no exponential component\r\n            return Math.max(\r\n                0,\r\n                this.spread <= 0 ? this.min : applySpread(this.min, this.spread)\r\n            );\r\n        }\r\n\r\n        const multiplier = Math.pow(this.multiplier, failureCount - 1);\r\n        const raw = Math.min(this.max, this.min * multiplier);\r\n        return Math.max(0, applySpread(raw, this.spread));\r\n    }\r\n}\r\n","// .NET counterparts: ActualLab.Net.RetryDelayer, ActualLab.Net.RetryDelay\r\n\r\nimport { EventHandlerSet } from './events.js';\r\nimport { RetryDelaySeq } from './retry-delay-seq.js';\r\n\r\nexport interface RetryDelay {\r\n    readonly promise: Promise<void>;\r\n    readonly endsAt: number; // Date.now()-based timestamp, 0 = no delay\r\n    readonly isLimitExceeded: boolean;\r\n}\r\n\r\nexport const RetryDelayNone: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: false,\r\n};\r\n\r\nexport const RetryDelayLimitExceeded: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: true,\r\n};\r\n\r\nexport class RetryDelayer {\r\n    private _cancelController = new AbortController();\r\n\r\n    delays: RetryDelaySeq = RetryDelaySeq.fixed(1000);\r\n    limit: number | undefined = undefined;\r\n\r\n    readonly cancelDelaysChanged = new EventHandlerSet<void>();\r\n\r\n    getDelay(tryIndex: number, cancellationSignal?: AbortSignal): RetryDelay {\r\n        if (this.limit !== undefined && tryIndex >= this.limit)\r\n            return RetryDelayLimitExceeded;\r\n\r\n        const delayMs = this.delays.getDelay(tryIndex);\r\n        if (tryIndex === 0 || delayMs <= 0) return RetryDelayNone;\r\n\r\n        const actualDelayMs = Math.max(1, delayMs);\r\n        const endsAt = Date.now() + actualDelayMs;\r\n\r\n        const cancelSignal = this._cancelController.signal;\r\n        const promise = new Promise<void>((resolve, reject) => {\r\n            const timer = setTimeout(() => {\r\n                cleanup();\r\n                resolve();\r\n            }, actualDelayMs);\r\n\r\n            const onCancel = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                resolve(); // cancelDelays resolves, does NOT reject\r\n            };\r\n\r\n            const onAbort = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                reject(new Error('Retry delay aborted.'));\r\n            };\r\n\r\n            const cleanup = () => {\r\n                cancelSignal.removeEventListener('abort', onCancel);\r\n                cancellationSignal?.removeEventListener('abort', onAbort);\r\n            };\r\n\r\n            cancelSignal.addEventListener('abort', onCancel, { once: true });\r\n            cancellationSignal?.addEventListener('abort', onAbort, {\r\n                once: true,\r\n            });\r\n        });\r\n\r\n        return { promise, endsAt, isLimitExceeded: false };\r\n    }\r\n\r\n    cancelDelays(): void {\r\n        const old = this._cancelController;\r\n        this._cancelController = new AbortController();\r\n        old.abort();\r\n        this.cancelDelaysChanged.trigger();\r\n    }\r\n}\r\n"],"mappings":";AAGC,OAAe,aAAa,uBAAO,iBAAiB;;;ACA9C,IAAM,kBAAN,MAAyB;AAAA,EACnB;AAAA,EACA;AAAA,EAET,YAAY,MAAc,cAAiB;AACvC,SAAK,KAAK,OAAO,IAAI;AACrB,SAAK,eAAe;AAAA,EACxB;AACJ;AAGO,IAAM,iBAAiB,IAAI;AAAA,EAC9B;AAAA,EACA;AACJ;AAEO,IAAM,eAAN,MAAM,cAAa;AAAA,EACtB,OAAO,UAAoC;AAAA;AAAA,EAG3C,OAAgB,QAAsB,IAAI,cAAa;AAAA,EAEvD,OAAe,YAAY,oBAAI,IAAqB;AAAA,EAE5C;AAAA,EAER,YAAY,QAA+B;AACvC,SAAK,UAAU,UAAU,oBAAI,IAAqB;AAAA,EACtD;AAAA,EAEA,IAAO,KAA4B;AAC/B,QAAI,KAAK,QAAQ,IAAI,IAAI,EAAE,EAAG,QAAO,KAAK,QAAQ,IAAI,IAAI,EAAE;AAC5D,QAAI,cAAa,UAAU,IAAI,IAAI,EAAE;AACjC,aAAO,cAAa,UAAU,IAAI,IAAI,EAAE;AAC5C,WAAO,IAAI;AAAA,EACf;AAAA,EAEA,KAAQ,KAAyB,OAAwB;AACrD,UAAM,OAAO,IAAI,IAAI,KAAK,OAAO;AACjC,SAAK,IAAI,IAAI,IAAI,KAAK;AACtB,WAAO,IAAI,cAAa,IAAI;AAAA,EAChC;AAAA,EAEA,WAAuB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,WAAO;AAAA,MACH,SAAS,MAAM;AACX,sBAAa,UAAU;AAAA,MAC3B;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,IAAO,IAAgB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,QAAI;AACA,aAAO,GAAG;AAAA,IACd,UAAE;AACE,oBAAa,UAAU;AAAA,IAC3B;AAAA,EACJ;AAAA;AAAA,EAGA,cAAc,MAA4B;AACtC,WAAO,KAAK,KAAK,SAAS,CAAC,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI;AAAA,EAChE;AAAA;AAAA,EAGA,OAAO,KAAK,KAAyD;AACjE,WAAO,OAAO,cAAa;AAAA,EAC/B;AAAA;AAAA,EAGA,OAAO,SAAS,MAA2C;AACvD,UAAM,OAAO,KAAK,KAAK,SAAS,CAAC;AACjC,WAAO,gBAAgB,gBAAe,OAAO,cAAa;AAAA,EAC9D;AAAA,EAEA,OAAO,WAAc,KAAyB,OAAgB;AAC1D,kBAAa,UAAU,IAAI,IAAI,IAAI,KAAK;AAAA,EAC5C;AAAA,EAEA,OAAO,cAA4B;AAC/B,WAAO,cAAa,WAAW,cAAa;AAAA,EAChD;AACJ;;;ACxFO,IAAM,YAAN,MAAgB;AAAA,EACX,SAAyB,CAAC;AAAA,EAC1B,UAAU;AAAA,EAElB,IAAI,WAAoB;AACpB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,MAAM,UAAyB;AAC3B,QAAI,CAAC,KAAK,SAAS;AACf,WAAK,UAAU;AACf;AAAA,IACJ;AACA,WAAO,IAAI,QAAc,aAAW;AAChC,WAAK,OAAO,KAAK,OAAO;AAAA,IAC5B,CAAC;AAAA,EACL;AAAA,EAEA,UAAgB;AACZ,QAAI,CAAC,KAAK,QAAS,OAAM,IAAI,MAAM,0BAA0B;AAE7D,UAAM,OAAO,KAAK,OAAO,MAAM;AAC/B,QAAI,SAAS,QAAW;AAEpB,WAAK;AAAA,IACT,OAAO;AACH,WAAK,UAAU;AAAA,IACnB;AAAA,EACJ;AAAA,EAEA,MAAM,IAAO,IAAsC;AAC/C,UAAM,KAAK,QAAQ;AACnB,QAAI;AACA,aAAO,MAAM,GAAG;AAAA,IACpB,UAAE;AACE,WAAK,QAAQ;AAAA,IACjB;AAAA,EACJ;AACJ;;;AC5BO,IAAM,gBAAN,MAA2D;AAAA,EACtD,SAA2C,CAAC;AAAA,EAC5C,YAAY;AAAA,EAEpB,IAAI,aAAsB;AACtB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,MAA0C;AAC1C,QAAI,KAAK;AACL,YAAM,IAAI,MAAM,oCAAoC;AACxD,SAAK,OAAO,KAAK,IAAI;AAAA,EACzB;AAAA,EAEA,UAAgB;AACZ,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AAEf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,aAAa,KAAM,MAAK,QAAQ;AAAA,IACxC;AAAA,EACJ;AAAA,EAEA,MAAM,eAA8B;AAChC,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AACf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,kBAAkB,KAAM,OAAM,KAAK,aAAa;AAAA,eAC3C,aAAa,KAAM,MAAK,QAAQ;AAAA,IAC7C;AAAA,EACJ;AACJ;;;AC/CO,IAAM,gBAAN,MAAuB;AAAA,EACjB;AAAA,EACD;AAAA,EACA;AAAA,EACA,eAAe;AAAA,EAEvB,cAAc;AACV,SAAK,UAAU,IAAI,QAAW,CAAC,SAAS,WAAW;AAC/C,WAAK,WAAW;AAChB,WAAK,UAAU;AAAA,IACnB,CAAC;AAAA,EACL;AAAA,EAEA,IAAI,cAAuB;AACvB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,QAAQ,OAAmB;AACvB,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,SAAS,KAAK;AACnB,WAAO;AAAA,EACX;AAAA,EAEA,OAAO,QAA2B;AAC9B,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,QAAQ,MAAM;AACnB,WAAO;AAAA,EACX;AACJ;AAEO,IAAM,sBAAqC,QAAQ,QAAQ;;;AC9B3D,IAAM,kBAAN,MAAyB;AAAA,EACpB,YAAY,oBAAI,IAAsB;AAAA,EAE9C,IAAI,QAAgB;AAChB,WAAO,KAAK,UAAU;AAAA,EAC1B;AAAA,EAEA,IAAI,SAAiC;AACjC,SAAK,UAAU,IAAI,OAAO;AAAA,EAC9B;AAAA,EAEA,OAAO,SAAiC;AACpC,SAAK,UAAU,OAAO,OAAO;AAAA,EACjC;AAAA,EAEA,QAAQ,KAAc;AAClB,eAAW,WAAW,KAAK,UAAW,SAAQ,GAAG;AAAA,EACrD;AAAA,EAEA,QAAc;AACV,SAAK,UAAU,MAAM;AAAA,EACzB;AAAA,EAEA,WAAuB;AACnB,UAAM,KAAK,IAAI,cAAiB;AAChC,UAAM,UAAU,CAAC,QAAW;AACxB,WAAK,UAAU,OAAO,OAAO;AAC7B,SAAG,QAAQ,GAAG;AAAA,IAClB;AACA,SAAK,UAAU,IAAI,OAAO;AAC1B,WAAO,GAAG;AAAA,EACd;AACJ;;;ACzBO,IAAM,SAAN,MAAM,QAAgC;AAAA,EAChC;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA,EAEV,YAAY,OAAsB,OAAiB;AACtD,SAAK,WAAW,UAAU;AAC1B,SAAK,WAAW,CAAC,KAAK;AACtB,SAAK,SAAS;AACd,SAAK,SAAS;AAAA,EAClB;AAAA,EAEA,IAAI,QAAW;AACX,QAAI,KAAK,SAAU,OAAM,KAAK;AAC9B,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,QAAiB;AACjB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,mBAAkC;AAClC,WAAO,KAAK,WAAW,KAAK,SAAS;AAAA,EACzC;AAAA,EAEA,OAAO,GAAM,OAAqB;AAC9B,WAAO,IAAI,QAAU,KAAK;AAAA,EAC9B;AAAA,EAEA,OAAO,MAAS,OAA2B;AACvC,WAAO,IAAI,QAAU,QAAW,KAAK;AAAA,EACzC;AACJ;AAEO,SAAS,OAAU,OAAU,OAA4B;AAC5D,SAAO,IAAI,OAAU,OAAO,KAAK;AACrC;AAEO,SAAS,YAAe,OAA2B;AACtD,SAAO,OAAO,MAAM,KAAK;AAC7B;AAEO,SAAS,WAAc,IAAwB;AAClD,MAAI;AACA,WAAO,OAAO,GAAG,CAAC;AAAA,EACtB,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;AAEA,eAAsB,gBAClB,IACkB;AAClB,MAAI;AACA,WAAO,OAAO,MAAM,GAAG,CAAC;AAAA,EAC5B,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;;;ACnEA,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAE1B,SAAS,YAAY,QAAgB,QAAwB;AACzD,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,QAAQ,SAAS;AACvB,SAAO,UAAU,KAAK,OAAO,IAAI,IAAI,KAAK;AAC9C;AAEO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACd;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACI,KACA,KACA,SAAiB,eACjB,aAAqB,mBACvB;AACE,SAAK,MAAM;AACX,SAAK,MAAM;AACX,SAAK,SAAS;AACd,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,OAAO,MACH,SACA,SAAiB,eACJ;AACb,WAAO,IAAI,eAAc,SAAS,SAAS,QAAQ,CAAC;AAAA,EACxD;AAAA,EAEA,OAAO,IACH,OACA,OACA,SAAiB,eACjB,aAAqB,mBACR;AACb,WAAO,IAAI,eAAc,OAAO,OAAO,QAAQ,UAAU;AAAA,EAC7D;AAAA,EAEA,SAAS,cAA8B;AACnC,QAAI,KAAK,MAAM;AACX,YAAM,IAAI,MAAM,yCAAyC;AAC7D,QAAI,gBAAgB,EAAG,QAAO;AAE9B,QAAI,KAAK,cAAc,GAAG;AAEtB,aAAO,KAAK;AAAA,QACR;AAAA,QACA,KAAK,UAAU,IAAI,KAAK,MAAM,YAAY,KAAK,KAAK,KAAK,MAAM;AAAA,MACnE;AAAA,IACJ;AAEA,UAAM,aAAa,KAAK,IAAI,KAAK,YAAY,eAAe,CAAC;AAC7D,UAAM,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,UAAU;AACpD,WAAO,KAAK,IAAI,GAAG,YAAY,KAAK,KAAK,MAAM,CAAC;AAAA,EACpD;AACJ;;;ACnDO,IAAM,iBAA6B;AAAA,EACtC,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,0BAAsC;AAAA,EAC/C,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,eAAN,MAAmB;AAAA,EACd,oBAAoB,IAAI,gBAAgB;AAAA,EAEhD,SAAwB,cAAc,MAAM,GAAI;AAAA,EAChD,QAA4B;AAAA,EAEnB,sBAAsB,IAAI,gBAAsB;AAAA,EAEzD,SAAS,UAAkB,oBAA8C;AACrE,QAAI,KAAK,UAAU,UAAa,YAAY,KAAK;AAC7C,aAAO;AAEX,UAAM,UAAU,KAAK,OAAO,SAAS,QAAQ;AAC7C,QAAI,aAAa,KAAK,WAAW,EAAG,QAAO;AAE3C,UAAM,gBAAgB,KAAK,IAAI,GAAG,OAAO;AACzC,UAAM,SAAS,KAAK,IAAI,IAAI;AAE5B,UAAM,eAAe,KAAK,kBAAkB;AAC5C,UAAM,UAAU,IAAI,QAAc,CAAC,SAAS,WAAW;AACnD,YAAM,QAAQ,WAAW,MAAM;AAC3B,gBAAQ;AACR,gBAAQ;AAAA,MACZ,GAAG,aAAa;AAEhB,YAAM,WAAW,MAAM;AACnB,qBAAa,KAAK;AAClB,gBAAQ;AACR,gBAAQ;AAAA,MACZ;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,KAAK;AAClB,gBAAQ;AACR,eAAO,IAAI,MAAM,sBAAsB,CAAC;AAAA,MAC5C;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,oBAAoB,SAAS,QAAQ;AAClD,4BAAoB,oBAAoB,SAAS,OAAO;AAAA,MAC5D;AAEA,mBAAa,iBAAiB,SAAS,UAAU,EAAE,MAAM,KAAK,CAAC;AAC/D,0BAAoB,iBAAiB,SAAS,SAAS;AAAA,QACnD,MAAM;AAAA,MACV,CAAC;AAAA,IACL,CAAC;AAED,WAAO,EAAE,SAAS,QAAQ,iBAAiB,MAAM;AAAA,EACrD;AAAA,EAEA,eAAqB;AACjB,UAAM,MAAM,KAAK;AACjB,SAAK,oBAAoB,IAAI,gBAAgB;AAC7C,QAAI,MAAM;AACV,SAAK,oBAAoB,QAAQ;AAAA,EACrC;AACJ;","names":[]}
+{"version":3,"sources":["../src/polyfills.ts","../src/async-context.ts","../src/async-lock.ts","../src/disposable.ts","../src/promise-source.ts","../src/events.ts","../src/ring-buffer.ts","../src/result.ts","../src/retry-delay-seq.ts","../src/retry-delayer.ts"],"sourcesContent":["// TC39 decorator metadata polyfill — required for Symbol.metadata support\r\n// in runtimes that don't yet implement it natively.\r\n// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/no-unsafe-member-access\r\n(Symbol as any).metadata ??= Symbol('Symbol.metadata');\r\n","import type { Disposable } from './disposable.js';\r\n\r\n/** Typed key for values stored in AsyncContext — each subsystem defines its own keys. */\r\nexport class AsyncContextKey<T> {\r\n    readonly id: symbol;\r\n    readonly defaultValue: T;\r\n\r\n    constructor(name: string, defaultValue: T) {\r\n        this.id = Symbol(name);\r\n        this.defaultValue = defaultValue;\r\n    }\r\n}\r\n\r\n/** General-purpose typed context container — named for forward-compatibility with TC39 AsyncContext proposal. */\r\nexport const abortSignalKey = new AsyncContextKey<AbortSignal | undefined>(\r\n    'AbortSignal',\r\n    undefined\r\n);\r\n\r\nexport class AsyncContext {\r\n    static current: AsyncContext | undefined = undefined;\r\n\r\n    /** Immutable empty singleton — avoids allocating new AsyncContext(). */\r\n    static readonly empty: AsyncContext = new AsyncContext();\r\n\r\n    private static _defaults = new Map<symbol, unknown>();\r\n\r\n    private _values: Map<symbol, unknown>;\r\n\r\n    constructor(values?: Map<symbol, unknown>) {\r\n        this._values = values ?? new Map<symbol, unknown>();\r\n    }\r\n\r\n    get<T>(key: AsyncContextKey<T>): T {\r\n        if (this._values.has(key.id)) return this._values.get(key.id) as T;\r\n        if (AsyncContext._defaults.has(key.id))\r\n            return AsyncContext._defaults.get(key.id) as T;\r\n        return key.defaultValue;\r\n    }\r\n\r\n    with<T>(key: AsyncContextKey<T>, value: T): AsyncContext {\r\n        const copy = new Map(this._values);\r\n        copy.set(key.id, value);\r\n        return new AsyncContext(copy);\r\n    }\r\n\r\n    activate(): Disposable {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        return {\r\n            dispose: () => {\r\n                AsyncContext.current = prev;\r\n            },\r\n        };\r\n    }\r\n\r\n    run<R>(fn: () => R): R {\r\n        const prev = AsyncContext.current;\r\n        AsyncContext.current = this;\r\n        try {\r\n            return fn();\r\n        } finally {\r\n            AsyncContext.current = prev;\r\n        }\r\n    }\r\n\r\n    /** Strip THIS exact instance from args if it's the last element (reference equality). */\r\n    stripFromArgs(args: unknown[]): unknown[] {\r\n        return args[args.length - 1] === this ? args.slice(0, -1) : args;\r\n    }\r\n\r\n    /** Resolve: return ctx if provided, otherwise AsyncContext.current. */\r\n    static from(ctx: AsyncContext | undefined): AsyncContext | undefined {\r\n        return ctx ?? AsyncContext.current;\r\n    }\r\n\r\n    /** Extract AsyncContext from last arg if instanceof AsyncContext, else fall back to .current. */\r\n    static fromArgs(args: unknown[]): AsyncContext | undefined {\r\n        const last = args[args.length - 1];\r\n        return last instanceof AsyncContext ? last : AsyncContext.current;\r\n    }\r\n\r\n    static setDefault<T>(key: AsyncContextKey<T>, value: T): void {\r\n        AsyncContext._defaults.set(key.id, value);\r\n    }\r\n\r\n    static getOrCreate(): AsyncContext {\r\n        return AsyncContext.current ?? AsyncContext.empty;\r\n    }\r\n}\r\n","/** Promise-based mutual exclusion lock for serializing async operations. */\r\nexport class AsyncLock {\r\n    private _queue: (() => void)[] = [];\r\n    private _locked = false;\r\n\r\n    get isLocked(): boolean {\r\n        return this._locked;\r\n    }\r\n\r\n    async acquire(): Promise<void> {\r\n        if (!this._locked) {\r\n            this._locked = true;\r\n            return;\r\n        }\r\n        return new Promise<void>(resolve => {\r\n            this._queue.push(resolve);\r\n        });\r\n    }\r\n\r\n    release(): void {\r\n        if (!this._locked) throw new Error('AsyncLock is not locked.');\r\n\r\n        const next = this._queue.shift();\r\n        if (next !== undefined) {\r\n            // Transfer lock to the next waiter\r\n            next();\r\n        } else {\r\n            this._locked = false;\r\n        }\r\n    }\r\n\r\n    async run<T>(fn: () => T | Promise<T>): Promise<T> {\r\n        await this.acquire();\r\n        try {\r\n            return await fn();\r\n        } finally {\r\n            this.release();\r\n        }\r\n    }\r\n}\r\n","/** Synchronous dispose pattern, similar to .NET's IDisposable. */\r\nexport interface Disposable {\r\n    dispose(): void;\r\n}\r\n\r\n/** Asynchronous dispose pattern, similar to .NET's IAsyncDisposable. */\r\nexport interface AsyncDisposable {\r\n    disposeAsync(): Promise<void>;\r\n}\r\n\r\n/** Aggregates multiple disposables and disposes them together. */\r\nexport class DisposableBag implements Disposable, AsyncDisposable {\r\n    private _items: (Disposable | AsyncDisposable)[] = [];\r\n    private _disposed = false;\r\n\r\n    get isDisposed(): boolean {\r\n        return this._disposed;\r\n    }\r\n\r\n    add(item: Disposable | AsyncDisposable): void {\r\n        if (this._disposed)\r\n            throw new Error('DisposableBag is already disposed.');\r\n        this._items.push(item);\r\n    }\r\n\r\n    dispose(): void {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        // Dispose in reverse order (LIFO)\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n\r\n    async disposeAsync(): Promise<void> {\r\n        if (this._disposed) return;\r\n        this._disposed = true;\r\n        const items = this._items;\r\n        this._items = [];\r\n        for (let i = items.length - 1; i >= 0; i--) {\r\n            const item = items[i];\r\n            if ('disposeAsync' in item) await item.disposeAsync();\r\n            else if ('dispose' in item) item.dispose();\r\n        }\r\n    }\r\n}\r\n","/** Externally-resolvable promise — similar to .NET's TaskCompletionSource<T>. */\r\nexport class PromiseSource<T> {\r\n    readonly promise: Promise<T>;\r\n    private _resolve!: (value: T | PromiseLike<T>) => void;\r\n    private _reject!: (reason?: unknown) => void;\r\n    private _isCompleted = false;\r\n\r\n    constructor() {\r\n        this.promise = new Promise<T>((resolve, reject) => {\r\n            this._resolve = resolve;\r\n            this._reject = reject;\r\n        });\r\n    }\r\n\r\n    get isCompleted(): boolean {\r\n        return this._isCompleted;\r\n    }\r\n\r\n    resolve(value: T): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._resolve(value);\r\n        return true;\r\n    }\r\n\r\n    reject(reason?: unknown): boolean {\r\n        if (this._isCompleted) return false;\r\n        this._isCompleted = true;\r\n        this._reject(reason);\r\n        return true;\r\n    }\r\n}\r\n\r\nexport const resolvedVoidPromise: Promise<void> = Promise.resolve();\r\n","import { PromiseSource } from './promise-source.js';\r\n\r\n/** Typed pub/sub event handler set — similar to .NET's EventHandler<T> multicast delegate. */\r\nexport class EventHandlerSet<T> {\r\n    private _handlers = new Set<(arg: T) => void>();\r\n\r\n    get count(): number {\r\n        return this._handlers.size;\r\n    }\r\n\r\n    add(handler: (arg: T) => void): void {\r\n        this._handlers.add(handler);\r\n    }\r\n\r\n    remove(handler: (arg: T) => void): void {\r\n        this._handlers.delete(handler);\r\n    }\r\n\r\n    trigger(arg: T): void {\r\n        for (const handler of this._handlers) handler(arg);\r\n    }\r\n\r\n    clear(): void {\r\n        this._handlers.clear();\r\n    }\r\n\r\n    whenNext(): Promise<T> {\r\n        const ps = new PromiseSource<T>();\r\n        const handler = (arg: T) => {\r\n            this._handlers.delete(handler);\r\n            ps.resolve(arg);\r\n        };\r\n        this._handlers.add(handler);\r\n        return ps.promise;\r\n    }\r\n}\r\n","/**\n * A fixed-capacity circular buffer supporting efficient push/pull at both\n * head and tail.\n *\n * Direct port of .NET `ActualLab.Collections.RingBuffer<T>` at\n * src/ActualLab.Core/Collections/RingBuffer.cs (simplified — TS uses plain\n * modulo instead of the power-of-two-minus-one bit-mask trick, since the\n * performance difference is negligible in JavaScript).\n */\nexport class RingBuffer<T> {\n    private _buffer: (T | undefined)[];\n    private _start = 0;\n    private _end = 0;\n    private _count = 0;\n\n    readonly capacity: number;\n\n    get count(): number { return this._count; }\n    get isEmpty(): boolean { return this._count === 0; }\n    get isFull(): boolean { return this._count === this.capacity; }\n    get remainingCapacity(): number { return this.capacity - this._count; }\n    get hasRemainingCapacity(): boolean { return this._count < this.capacity; }\n\n    constructor(capacity: number) {\n        if (capacity < 1)\n            throw new RangeError(`RingBuffer capacity must be >= 1 (was ${capacity}).`);\n        this.capacity = capacity;\n        this._buffer = new Array<T | undefined>(capacity);\n    }\n\n    /** Read the item at `index` (0-indexed, from head). */\n    get(index: number): T {\n        if (index < 0 || index >= this._count)\n            throw new RangeError(`Index ${index} out of range [0, ${this._count}).`);\n        return this._buffer[(this._start + index) % this.capacity] as T;\n    }\n\n    /** Add an item at the tail. Throws if the buffer is full. */\n    pushTail(item: T): void {\n        if (this._count >= this.capacity)\n            throw new Error('RingBuffer is full.');\n        this._buffer[this._end] = item;\n        this._end = (this._end + 1) % this.capacity;\n        this._count++;\n    }\n\n    /** Add an item at the tail, evicting the head item if the buffer is full. */\n    pushTailAndMoveHeadIfFull(item: T): void {\n        if (this._count >= this.capacity) {\n            this._buffer[this._start] = undefined;\n            this._start = (this._start + 1) % this.capacity;\n            this._count--;\n        }\n        this.pushTail(item);\n    }\n\n    /** Remove the head item. Throws if the buffer is empty. */\n    pullHead(): T {\n        if (this._count === 0)\n            throw new Error('RingBuffer is empty.');\n        const head = this._buffer[this._start] as T;\n        this._buffer[this._start] = undefined;\n        this._start = (this._start + 1) % this.capacity;\n        this._count--;\n        return head;\n    }\n\n    /**\n     * Advance the head by `skipCount` slots, releasing references to skipped\n     * items so they can be garbage-collected.\n     */\n    moveHead(skipCount: number): void {\n        if (skipCount === 0) return;\n        if (skipCount < 0 || skipCount > this._count)\n            throw new RangeError(`skipCount ${skipCount} out of range [0, ${this._count}].`);\n        for (let k = 0; k < skipCount; k++) {\n            this._buffer[(this._start + k) % this.capacity] = undefined;\n        }\n        this._start = (this._start + skipCount) % this.capacity;\n        this._count -= skipCount;\n    }\n\n    /** Remove all items. */\n    clear(): void {\n        for (let i = 0; i < this.capacity; i++) this._buffer[i] = undefined;\n        this._start = 0;\n        this._end = 0;\n        this._count = 0;\n    }\n\n    /** Copy the buffer's contents to a new array, head-first. */\n    toArray(): T[] {\n        const out = new Array<T>(this._count);\n        for (let i = 0; i < this._count; i++) {\n            out[i] = this._buffer[(this._start + i) % this.capacity] as T;\n        }\n        return out;\n    }\n}\n","/** Common interface for types that carry a value-or-error outcome. */\r\nexport interface IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    readonly value: T;\r\n    readonly error: unknown;\r\n    readonly valueOrUndefined: T | undefined;\r\n}\r\n\r\n/** Immutable value-or-error container — similar to .NET's Result<T>. */\r\nexport class Result<T> implements IResult<T> {\r\n    readonly hasValue: boolean;\r\n    readonly hasError: boolean;\r\n    private readonly _value: T | undefined;\r\n    private readonly _error: unknown;\r\n\r\n    public constructor(value: T | undefined, error?: unknown) {\r\n        this.hasValue = error === undefined;\r\n        this.hasError = !this.hasValue;\r\n        this._value = value;\r\n        this._error = error;\r\n    }\r\n\r\n    get value(): T {\r\n        if (this.hasError) throw this._error;\r\n        return this._value as T;\r\n    }\r\n\r\n    get error(): unknown {\r\n        return this._error;\r\n    }\r\n\r\n    get valueOrUndefined(): T | undefined {\r\n        return this.hasValue ? this._value : undefined;\r\n    }\r\n\r\n    static ok<T>(value: T): Result<T> {\r\n        return new Result<T>(value);\r\n    }\r\n\r\n    static error<T>(error: unknown): Result<T> {\r\n        return new Result<T>(undefined, error);\r\n    }\r\n}\r\n\r\nexport function result<T>(value: T, error?: unknown): Result<T> {\r\n    return new Result<T>(value, error);\r\n}\r\n\r\nexport function errorResult<T>(error: unknown): Result<T> {\r\n    return Result.error(error);\r\n}\r\n\r\nexport function resultFrom<T>(fn: () => T): Result<T> {\r\n    try {\r\n        return result(fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n\r\nexport async function resultFromAsync<T>(\r\n    fn: () => Promise<T>\r\n): Promise<Result<T>> {\r\n    try {\r\n        return result(await fn());\r\n    } catch (e) {\r\n        return errorResult(e);\r\n    }\r\n}\r\n","// .NET counterpart: ActualLab.Time.RetryDelaySeq\r\n\r\nconst DefaultSpread = 0.1;\r\nconst DefaultMultiplier = 1.41421356237; // Math.sqrt(2)\r\n\r\nfunction applySpread(origin: number, spread: number): number {\r\n    if (spread <= 0) return origin;\r\n    const delta = origin * spread;\r\n    return origin + (Math.random() * 2 - 1) * delta;\r\n}\r\n\r\nexport class RetryDelaySeq {\r\n    readonly min: number;\r\n    readonly max: number;\r\n    readonly spread: number;\r\n    readonly multiplier: number;\r\n\r\n    constructor(\r\n        min: number,\r\n        max: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ) {\r\n        this.min = min;\r\n        this.max = max;\r\n        this.spread = spread;\r\n        this.multiplier = multiplier;\r\n    }\r\n\r\n    static fixed(\r\n        delayMs: number,\r\n        spread: number = DefaultSpread\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(delayMs, delayMs, spread, 1);\r\n    }\r\n\r\n    static exp(\r\n        minMs: number,\r\n        maxMs: number,\r\n        spread: number = DefaultSpread,\r\n        multiplier: number = DefaultMultiplier\r\n    ): RetryDelaySeq {\r\n        return new RetryDelaySeq(minMs, maxMs, spread, multiplier);\r\n    }\r\n\r\n    getDelay(failureCount: number): number {\r\n        if (this.min < 0)\r\n            throw new Error('RetryDelaySeq.min must be non-negative.');\r\n        if (failureCount <= 0) return 0;\r\n\r\n        if (this.multiplier <= 1) {\r\n            // Fixed — no exponential component\r\n            return Math.max(\r\n                0,\r\n                this.spread <= 0 ? this.min : applySpread(this.min, this.spread)\r\n            );\r\n        }\r\n\r\n        const multiplier = Math.pow(this.multiplier, failureCount - 1);\r\n        const raw = Math.min(this.max, this.min * multiplier);\r\n        return Math.max(0, applySpread(raw, this.spread));\r\n    }\r\n}\r\n","// .NET counterparts: ActualLab.Net.RetryDelayer, ActualLab.Net.RetryDelay\r\n\r\nimport { EventHandlerSet } from './events.js';\r\nimport { RetryDelaySeq } from './retry-delay-seq.js';\r\n\r\nexport interface RetryDelay {\r\n    readonly promise: Promise<void>;\r\n    readonly endsAt: number; // Date.now()-based timestamp, 0 = no delay\r\n    readonly isLimitExceeded: boolean;\r\n}\r\n\r\nexport const RetryDelayNone: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: false,\r\n};\r\n\r\nexport const RetryDelayLimitExceeded: RetryDelay = {\r\n    promise: Promise.resolve(),\r\n    endsAt: 0,\r\n    isLimitExceeded: true,\r\n};\r\n\r\nexport class RetryDelayer {\r\n    private _cancelController = new AbortController();\r\n\r\n    delays: RetryDelaySeq = RetryDelaySeq.fixed(1000);\r\n    limit: number | undefined = undefined;\r\n\r\n    readonly cancelDelaysChanged = new EventHandlerSet<void>();\r\n\r\n    getDelay(tryIndex: number, cancellationSignal?: AbortSignal): RetryDelay {\r\n        if (this.limit !== undefined && tryIndex >= this.limit)\r\n            return RetryDelayLimitExceeded;\r\n\r\n        const delayMs = this.delays.getDelay(tryIndex);\r\n        if (tryIndex === 0 || delayMs <= 0) return RetryDelayNone;\r\n\r\n        const actualDelayMs = Math.max(1, delayMs);\r\n        const endsAt = Date.now() + actualDelayMs;\r\n\r\n        const cancelSignal = this._cancelController.signal;\r\n        const promise = new Promise<void>((resolve, reject) => {\r\n            const timer = setTimeout(() => {\r\n                cleanup();\r\n                resolve();\r\n            }, actualDelayMs);\r\n\r\n            const onCancel = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                resolve(); // cancelDelays resolves, does NOT reject\r\n            };\r\n\r\n            const onAbort = () => {\r\n                clearTimeout(timer);\r\n                cleanup();\r\n                reject(new Error('Retry delay aborted.'));\r\n            };\r\n\r\n            const cleanup = () => {\r\n                cancelSignal.removeEventListener('abort', onCancel);\r\n                cancellationSignal?.removeEventListener('abort', onAbort);\r\n            };\r\n\r\n            cancelSignal.addEventListener('abort', onCancel, { once: true });\r\n            cancellationSignal?.addEventListener('abort', onAbort, {\r\n                once: true,\r\n            });\r\n        });\r\n\r\n        return { promise, endsAt, isLimitExceeded: false };\r\n    }\r\n\r\n    cancelDelays(): void {\r\n        const old = this._cancelController;\r\n        this._cancelController = new AbortController();\r\n        old.abort();\r\n        this.cancelDelaysChanged.trigger();\r\n    }\r\n}\r\n"],"mappings":";AAGC,OAAe,aAAa,uBAAO,iBAAiB;;;ACA9C,IAAM,kBAAN,MAAyB;AAAA,EACnB;AAAA,EACA;AAAA,EAET,YAAY,MAAc,cAAiB;AACvC,SAAK,KAAK,OAAO,IAAI;AACrB,SAAK,eAAe;AAAA,EACxB;AACJ;AAGO,IAAM,iBAAiB,IAAI;AAAA,EAC9B;AAAA,EACA;AACJ;AAEO,IAAM,eAAN,MAAM,cAAa;AAAA,EACtB,OAAO,UAAoC;AAAA;AAAA,EAG3C,OAAgB,QAAsB,IAAI,cAAa;AAAA,EAEvD,OAAe,YAAY,oBAAI,IAAqB;AAAA,EAE5C;AAAA,EAER,YAAY,QAA+B;AACvC,SAAK,UAAU,UAAU,oBAAI,IAAqB;AAAA,EACtD;AAAA,EAEA,IAAO,KAA4B;AAC/B,QAAI,KAAK,QAAQ,IAAI,IAAI,EAAE,EAAG,QAAO,KAAK,QAAQ,IAAI,IAAI,EAAE;AAC5D,QAAI,cAAa,UAAU,IAAI,IAAI,EAAE;AACjC,aAAO,cAAa,UAAU,IAAI,IAAI,EAAE;AAC5C,WAAO,IAAI;AAAA,EACf;AAAA,EAEA,KAAQ,KAAyB,OAAwB;AACrD,UAAM,OAAO,IAAI,IAAI,KAAK,OAAO;AACjC,SAAK,IAAI,IAAI,IAAI,KAAK;AACtB,WAAO,IAAI,cAAa,IAAI;AAAA,EAChC;AAAA,EAEA,WAAuB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,WAAO;AAAA,MACH,SAAS,MAAM;AACX,sBAAa,UAAU;AAAA,MAC3B;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,IAAO,IAAgB;AACnB,UAAM,OAAO,cAAa;AAC1B,kBAAa,UAAU;AACvB,QAAI;AACA,aAAO,GAAG;AAAA,IACd,UAAE;AACE,oBAAa,UAAU;AAAA,IAC3B;AAAA,EACJ;AAAA;AAAA,EAGA,cAAc,MAA4B;AACtC,WAAO,KAAK,KAAK,SAAS,CAAC,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI;AAAA,EAChE;AAAA;AAAA,EAGA,OAAO,KAAK,KAAyD;AACjE,WAAO,OAAO,cAAa;AAAA,EAC/B;AAAA;AAAA,EAGA,OAAO,SAAS,MAA2C;AACvD,UAAM,OAAO,KAAK,KAAK,SAAS,CAAC;AACjC,WAAO,gBAAgB,gBAAe,OAAO,cAAa;AAAA,EAC9D;AAAA,EAEA,OAAO,WAAc,KAAyB,OAAgB;AAC1D,kBAAa,UAAU,IAAI,IAAI,IAAI,KAAK;AAAA,EAC5C;AAAA,EAEA,OAAO,cAA4B;AAC/B,WAAO,cAAa,WAAW,cAAa;AAAA,EAChD;AACJ;;;ACxFO,IAAM,YAAN,MAAgB;AAAA,EACX,SAAyB,CAAC;AAAA,EAC1B,UAAU;AAAA,EAElB,IAAI,WAAoB;AACpB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,MAAM,UAAyB;AAC3B,QAAI,CAAC,KAAK,SAAS;AACf,WAAK,UAAU;AACf;AAAA,IACJ;AACA,WAAO,IAAI,QAAc,aAAW;AAChC,WAAK,OAAO,KAAK,OAAO;AAAA,IAC5B,CAAC;AAAA,EACL;AAAA,EAEA,UAAgB;AACZ,QAAI,CAAC,KAAK,QAAS,OAAM,IAAI,MAAM,0BAA0B;AAE7D,UAAM,OAAO,KAAK,OAAO,MAAM;AAC/B,QAAI,SAAS,QAAW;AAEpB,WAAK;AAAA,IACT,OAAO;AACH,WAAK,UAAU;AAAA,IACnB;AAAA,EACJ;AAAA,EAEA,MAAM,IAAO,IAAsC;AAC/C,UAAM,KAAK,QAAQ;AACnB,QAAI;AACA,aAAO,MAAM,GAAG;AAAA,IACpB,UAAE;AACE,WAAK,QAAQ;AAAA,IACjB;AAAA,EACJ;AACJ;;;AC5BO,IAAM,gBAAN,MAA2D;AAAA,EACtD,SAA2C,CAAC;AAAA,EAC5C,YAAY;AAAA,EAEpB,IAAI,aAAsB;AACtB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,MAA0C;AAC1C,QAAI,KAAK;AACL,YAAM,IAAI,MAAM,oCAAoC;AACxD,SAAK,OAAO,KAAK,IAAI;AAAA,EACzB;AAAA,EAEA,UAAgB;AACZ,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AAEf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,aAAa,KAAM,MAAK,QAAQ;AAAA,IACxC;AAAA,EACJ;AAAA,EAEA,MAAM,eAA8B;AAChC,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,UAAM,QAAQ,KAAK;AACnB,SAAK,SAAS,CAAC;AACf,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,kBAAkB,KAAM,OAAM,KAAK,aAAa;AAAA,eAC3C,aAAa,KAAM,MAAK,QAAQ;AAAA,IAC7C;AAAA,EACJ;AACJ;;;AC/CO,IAAM,gBAAN,MAAuB;AAAA,EACjB;AAAA,EACD;AAAA,EACA;AAAA,EACA,eAAe;AAAA,EAEvB,cAAc;AACV,SAAK,UAAU,IAAI,QAAW,CAAC,SAAS,WAAW;AAC/C,WAAK,WAAW;AAChB,WAAK,UAAU;AAAA,IACnB,CAAC;AAAA,EACL;AAAA,EAEA,IAAI,cAAuB;AACvB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,QAAQ,OAAmB;AACvB,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,SAAS,KAAK;AACnB,WAAO;AAAA,EACX;AAAA,EAEA,OAAO,QAA2B;AAC9B,QAAI,KAAK,aAAc,QAAO;AAC9B,SAAK,eAAe;AACpB,SAAK,QAAQ,MAAM;AACnB,WAAO;AAAA,EACX;AACJ;AAEO,IAAM,sBAAqC,QAAQ,QAAQ;;;AC9B3D,IAAM,kBAAN,MAAyB;AAAA,EACpB,YAAY,oBAAI,IAAsB;AAAA,EAE9C,IAAI,QAAgB;AAChB,WAAO,KAAK,UAAU;AAAA,EAC1B;AAAA,EAEA,IAAI,SAAiC;AACjC,SAAK,UAAU,IAAI,OAAO;AAAA,EAC9B;AAAA,EAEA,OAAO,SAAiC;AACpC,SAAK,UAAU,OAAO,OAAO;AAAA,EACjC;AAAA,EAEA,QAAQ,KAAc;AAClB,eAAW,WAAW,KAAK,UAAW,SAAQ,GAAG;AAAA,EACrD;AAAA,EAEA,QAAc;AACV,SAAK,UAAU,MAAM;AAAA,EACzB;AAAA,EAEA,WAAuB;AACnB,UAAM,KAAK,IAAI,cAAiB;AAChC,UAAM,UAAU,CAAC,QAAW;AACxB,WAAK,UAAU,OAAO,OAAO;AAC7B,SAAG,QAAQ,GAAG;AAAA,IAClB;AACA,SAAK,UAAU,IAAI,OAAO;AAC1B,WAAO,GAAG;AAAA,EACd;AACJ;;;AC1BO,IAAM,aAAN,MAAoB;AAAA,EACf;AAAA,EACA,SAAS;AAAA,EACT,OAAO;AAAA,EACP,SAAS;AAAA,EAER;AAAA,EAET,IAAI,QAAgB;AAAE,WAAO,KAAK;AAAA,EAAQ;AAAA,EAC1C,IAAI,UAAmB;AAAE,WAAO,KAAK,WAAW;AAAA,EAAG;AAAA,EACnD,IAAI,SAAkB;AAAE,WAAO,KAAK,WAAW,KAAK;AAAA,EAAU;AAAA,EAC9D,IAAI,oBAA4B;AAAE,WAAO,KAAK,WAAW,KAAK;AAAA,EAAQ;AAAA,EACtE,IAAI,uBAAgC;AAAE,WAAO,KAAK,SAAS,KAAK;AAAA,EAAU;AAAA,EAE1E,YAAY,UAAkB;AAC1B,QAAI,WAAW;AACX,YAAM,IAAI,WAAW,yCAAyC,QAAQ,IAAI;AAC9E,SAAK,WAAW;AAChB,SAAK,UAAU,IAAI,MAAqB,QAAQ;AAAA,EACpD;AAAA;AAAA,EAGA,IAAI,OAAkB;AAClB,QAAI,QAAQ,KAAK,SAAS,KAAK;AAC3B,YAAM,IAAI,WAAW,SAAS,KAAK,qBAAqB,KAAK,MAAM,IAAI;AAC3E,WAAO,KAAK,SAAS,KAAK,SAAS,SAAS,KAAK,QAAQ;AAAA,EAC7D;AAAA;AAAA,EAGA,SAAS,MAAe;AACpB,QAAI,KAAK,UAAU,KAAK;AACpB,YAAM,IAAI,MAAM,qBAAqB;AACzC,SAAK,QAAQ,KAAK,IAAI,IAAI;AAC1B,SAAK,QAAQ,KAAK,OAAO,KAAK,KAAK;AACnC,SAAK;AAAA,EACT;AAAA;AAAA,EAGA,0BAA0B,MAAe;AACrC,QAAI,KAAK,UAAU,KAAK,UAAU;AAC9B,WAAK,QAAQ,KAAK,MAAM,IAAI;AAC5B,WAAK,UAAU,KAAK,SAAS,KAAK,KAAK;AACvC,WAAK;AAAA,IACT;AACA,SAAK,SAAS,IAAI;AAAA,EACtB;AAAA;AAAA,EAGA,WAAc;AACV,QAAI,KAAK,WAAW;AAChB,YAAM,IAAI,MAAM,sBAAsB;AAC1C,UAAM,OAAO,KAAK,QAAQ,KAAK,MAAM;AACrC,SAAK,QAAQ,KAAK,MAAM,IAAI;AAC5B,SAAK,UAAU,KAAK,SAAS,KAAK,KAAK;AACvC,SAAK;AACL,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,WAAyB;AAC9B,QAAI,cAAc,EAAG;AACrB,QAAI,YAAY,KAAK,YAAY,KAAK;AAClC,YAAM,IAAI,WAAW,aAAa,SAAS,qBAAqB,KAAK,MAAM,IAAI;AACnF,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,WAAK,SAAS,KAAK,SAAS,KAAK,KAAK,QAAQ,IAAI;AAAA,IACtD;AACA,SAAK,UAAU,KAAK,SAAS,aAAa,KAAK;AAC/C,SAAK,UAAU;AAAA,EACnB;AAAA;AAAA,EAGA,QAAc;AACV,aAAS,IAAI,GAAG,IAAI,KAAK,UAAU,IAAK,MAAK,QAAQ,CAAC,IAAI;AAC1D,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA,EAGA,UAAe;AACX,UAAM,MAAM,IAAI,MAAS,KAAK,MAAM;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,UAAI,CAAC,IAAI,KAAK,SAAS,KAAK,SAAS,KAAK,KAAK,QAAQ;AAAA,IAC3D;AACA,WAAO;AAAA,EACX;AACJ;;;ACxFO,IAAM,SAAN,MAAM,QAAgC;AAAA,EAChC;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA,EAEV,YAAY,OAAsB,OAAiB;AACtD,SAAK,WAAW,UAAU;AAC1B,SAAK,WAAW,CAAC,KAAK;AACtB,SAAK,SAAS;AACd,SAAK,SAAS;AAAA,EAClB;AAAA,EAEA,IAAI,QAAW;AACX,QAAI,KAAK,SAAU,OAAM,KAAK;AAC9B,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,QAAiB;AACjB,WAAO,KAAK;AAAA,EAChB;AAAA,EAEA,IAAI,mBAAkC;AAClC,WAAO,KAAK,WAAW,KAAK,SAAS;AAAA,EACzC;AAAA,EAEA,OAAO,GAAM,OAAqB;AAC9B,WAAO,IAAI,QAAU,KAAK;AAAA,EAC9B;AAAA,EAEA,OAAO,MAAS,OAA2B;AACvC,WAAO,IAAI,QAAU,QAAW,KAAK;AAAA,EACzC;AACJ;AAEO,SAAS,OAAU,OAAU,OAA4B;AAC5D,SAAO,IAAI,OAAU,OAAO,KAAK;AACrC;AAEO,SAAS,YAAe,OAA2B;AACtD,SAAO,OAAO,MAAM,KAAK;AAC7B;AAEO,SAAS,WAAc,IAAwB;AAClD,MAAI;AACA,WAAO,OAAO,GAAG,CAAC;AAAA,EACtB,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;AAEA,eAAsB,gBAClB,IACkB;AAClB,MAAI;AACA,WAAO,OAAO,MAAM,GAAG,CAAC;AAAA,EAC5B,SAAS,GAAG;AACR,WAAO,YAAY,CAAC;AAAA,EACxB;AACJ;;;ACnEA,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAE1B,SAAS,YAAY,QAAgB,QAAwB;AACzD,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,QAAQ,SAAS;AACvB,SAAO,UAAU,KAAK,OAAO,IAAI,IAAI,KAAK;AAC9C;AAEO,IAAM,gBAAN,MAAM,eAAc;AAAA,EACd;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACI,KACA,KACA,SAAiB,eACjB,aAAqB,mBACvB;AACE,SAAK,MAAM;AACX,SAAK,MAAM;AACX,SAAK,SAAS;AACd,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,OAAO,MACH,SACA,SAAiB,eACJ;AACb,WAAO,IAAI,eAAc,SAAS,SAAS,QAAQ,CAAC;AAAA,EACxD;AAAA,EAEA,OAAO,IACH,OACA,OACA,SAAiB,eACjB,aAAqB,mBACR;AACb,WAAO,IAAI,eAAc,OAAO,OAAO,QAAQ,UAAU;AAAA,EAC7D;AAAA,EAEA,SAAS,cAA8B;AACnC,QAAI,KAAK,MAAM;AACX,YAAM,IAAI,MAAM,yCAAyC;AAC7D,QAAI,gBAAgB,EAAG,QAAO;AAE9B,QAAI,KAAK,cAAc,GAAG;AAEtB,aAAO,KAAK;AAAA,QACR;AAAA,QACA,KAAK,UAAU,IAAI,KAAK,MAAM,YAAY,KAAK,KAAK,KAAK,MAAM;AAAA,MACnE;AAAA,IACJ;AAEA,UAAM,aAAa,KAAK,IAAI,KAAK,YAAY,eAAe,CAAC;AAC7D,UAAM,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,UAAU;AACpD,WAAO,KAAK,IAAI,GAAG,YAAY,KAAK,KAAK,MAAM,CAAC;AAAA,EACpD;AACJ;;;ACnDO,IAAM,iBAA6B;AAAA,EACtC,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,0BAAsC;AAAA,EAC/C,SAAS,QAAQ,QAAQ;AAAA,EACzB,QAAQ;AAAA,EACR,iBAAiB;AACrB;AAEO,IAAM,eAAN,MAAmB;AAAA,EACd,oBAAoB,IAAI,gBAAgB;AAAA,EAEhD,SAAwB,cAAc,MAAM,GAAI;AAAA,EAChD,QAA4B;AAAA,EAEnB,sBAAsB,IAAI,gBAAsB;AAAA,EAEzD,SAAS,UAAkB,oBAA8C;AACrE,QAAI,KAAK,UAAU,UAAa,YAAY,KAAK;AAC7C,aAAO;AAEX,UAAM,UAAU,KAAK,OAAO,SAAS,QAAQ;AAC7C,QAAI,aAAa,KAAK,WAAW,EAAG,QAAO;AAE3C,UAAM,gBAAgB,KAAK,IAAI,GAAG,OAAO;AACzC,UAAM,SAAS,KAAK,IAAI,IAAI;AAE5B,UAAM,eAAe,KAAK,kBAAkB;AAC5C,UAAM,UAAU,IAAI,QAAc,CAAC,SAAS,WAAW;AACnD,YAAM,QAAQ,WAAW,MAAM;AAC3B,gBAAQ;AACR,gBAAQ;AAAA,MACZ,GAAG,aAAa;AAEhB,YAAM,WAAW,MAAM;AACnB,qBAAa,KAAK;AAClB,gBAAQ;AACR,gBAAQ;AAAA,MACZ;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,KAAK;AAClB,gBAAQ;AACR,eAAO,IAAI,MAAM,sBAAsB,CAAC;AAAA,MAC5C;AAEA,YAAM,UAAU,MAAM;AAClB,qBAAa,oBAAoB,SAAS,QAAQ;AAClD,4BAAoB,oBAAoB,SAAS,OAAO;AAAA,MAC5D;AAEA,mBAAa,iBAAiB,SAAS,UAAU,EAAE,MAAM,KAAK,CAAC;AAC/D,0BAAoB,iBAAiB,SAAS,SAAS;AAAA,QACnD,MAAM;AAAA,MACV,CAAC;AAAA,IACL,CAAC;AAED,WAAO,EAAE,SAAS,QAAQ,iBAAiB,MAAM;AAAA,EACrD;AAAA,EAEA,eAAqB;AACjB,UAAM,MAAM,KAAK;AACjB,SAAK,oBAAoB,IAAI,gBAAgB;AAC7C,QAAI,MAAM;AACV,SAAK,oBAAoB,QAAQ;AAAA,EACrC;AACJ;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@actuallab/core",
-  "version": "12.3.14",
+  "version": "12.3.29",
   "description": "Core primitives for ActualLab TypeScript libraries",
   "type": "module",
   "main": "./dist/index.cjs",