@mtkruto/browser 0.6.1 → 0.119.0

package/esm/deps/jsr.io/@std/async/1.2.0/retry.d.ts

@@ -0,0 +1,155 @@
+/**
+ * Error thrown in {@linkcode retry} once the maximum number of failed attempts
+ * has been reached.
+ *
+ * @example Usage
+ * ```ts no-assert ignore
+ * import { RetryError } from "@std/async/retry";
+ *
+ * throw new RetryError({ foo: "bar" }, 3);
+ * ```
+ */
+export declare class RetryError extends Error {
+    /**
+     * Constructs a new {@linkcode RetryError} instance.
+     *
+     * @param cause the cause for this error.
+     * @param attempts the number of retry attempts made.
+     */
+    constructor(cause: unknown, attempts: number);
+}
+/** Options for {@linkcode retry}. */
+export interface RetryOptions {
+    /**
+     * How much to backoff after each retry.
+     *
+     * @default {2}
+     */
+    multiplier?: number;
+    /**
+     * The maximum milliseconds between attempts.
+     *
+     * @default {60000}
+     */
+    maxTimeout?: number;
+    /**
+     * The maximum amount of attempts until failure.
+     *
+     * @default {5}
+     */
+    maxAttempts?: number;
+    /**
+     * The initial and minimum amount of milliseconds between attempts.
+     *
+     * @default {1000}
+     */
+    minTimeout?: number;
+    /**
+     * Amount of jitter to introduce to the time between attempts. This is `1`
+     * for full jitter by default.
+     *
+     * @default {1}
+     */
+    jitter?: number;
+    /**
+     * Callback to determine if an error or other thrown value is retriable.
+     *
+     * @default {() => true}
+     *
+     * @param err The thrown error or other value.
+     * @returns `true` if the error is retriable, `false` otherwise.
+     */
+    isRetriable?: (err: unknown) => boolean;
+    /**
+     * An AbortSignal to cancel the retry operation.
+     *
+     * If the signal is aborted, the retry will stop and reject with the signal's
+     * reason. The signal is checked before each attempt and during the delay
+     * between attempts.
+     *
+     * @default {undefined}
+     */
+    signal?: AbortSignal;
+}
+/**
+ * Calls the given (possibly asynchronous) function up to `maxAttempts` times.
+ * Retries as long as the given function throws. If the attempts are exhausted,
+ * throws a {@linkcode RetryError} with `cause` set to the inner exception.
+ *
+ * The backoff is calculated by multiplying `minTimeout` with `multiplier` to the power of the current attempt counter (starting at 0 up to `maxAttempts - 1`). It is capped at `maxTimeout` however.
+ * How long the actual delay is, depends on `jitter`.
+ *
+ * When `jitter` is the default value of `1`, waits between two attempts for a
+ * randomized amount between 0 and the backoff time. With the default options
+ * the maximal delay will be `15s = 1s + 2s + 4s + 8s`. If all five attempts
+ * are exhausted the mean delay will be `9.5s = ½(4s + 15s)`.
+ *
+ * When `jitter` is `0`, waits the full backoff time.
+ *
+ * @example Example configuration 1
+ * ```ts no-assert
+ * import { retry } from "@std/async/retry";
+ * const req = async () => {
+ *  // some function that throws sometimes
+ * };
+ *
+ * // Below resolves to the first non-error result of `req`
+ * const retryPromise = await retry(req, {
+ *  multiplier: 2,
+ *  maxTimeout: 60000,
+ *  maxAttempts: 5,
+ *  minTimeout: 100,
+ *  jitter: 1,
+ * });
+ * ```
+ *
+ * @example Example configuration 2
+ * ```ts no-assert
+ * import { retry } from "@std/async/retry";
+ * const req = async () => {
+ *  // some function that throws sometimes
+ * };
+ *
+ * // Make sure we wait at least 1 minute, but at most 2 minutes
+ * const retryPromise = await retry(req, {
+ *  multiplier: 2.34,
+ *  maxTimeout: 80000,
+ *  maxAttempts: 7,
+ *  minTimeout: 1000,
+ *  jitter: 0.5,
+ * });
+ * ```
+ *
+ * @example Only retry on specific error types
+ * ```ts no-assert
+ * import { retry } from "@std/async/retry";
+ *
+ * class HttpError extends Error {
+ *   status: number;
+ *   constructor(status: number) {
+ *     super(`HTTP ${status}`);
+ *     this.status = status;
+ *   }
+ * }
+ *
+ * const req = async () => {
+ *   // some function that throws HttpError
+ * };
+ *
+ * // Only retry on 429 (rate limit) or 5xx (server) errors
+ * const retryPromise = await retry(req, {
+ *   isRetriable: (err) =>
+ *     err instanceof HttpError && (err.status === 429 || err.status >= 500),
+ * });
+ * ```
+ *
+ * @typeParam T The return type of the function to retry and returned promise.
+ * @param fn The function to retry.
+ * @param options Additional options.
+ * @returns The promise that resolves with the value returned by the function to retry.
+ * @throws {RetryError} If the function fails after `maxAttempts` attempts.
+ * @throws If the `signal` is aborted, throws the signal's reason.
+ * @throws If `isRetriable` returns `false` for an error, throws that error immediately.
+ */
+export declare function retry<T>(fn: (() => Promise<T>) | (() => T), options?: RetryOptions): Promise<T>;
+//# sourceMappingURL=retry.d.ts.map

package/esm/deps/jsr.io/@std/async/1.2.0/retry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retry.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/async/1.2.0/retry.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;GAUG;AACH,qBAAa,UAAW,SAAQ,KAAK;IACnC;;;;;OAKG;gBACS,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM;CAK7C;AAED,qCAAqC;AACrC,MAAM,WAAW,YAAY;IAC3B;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;;OAOG;IACH,WAAW,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,OAAO,CAAC;IACxC;;;;;;;;OAQG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+EG;AACH,wBAAsB,KAAK,CAAC,CAAC,EAC3B,EAAE,EAAE,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAClC,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,CAAC,CAAC,CAoEZ"}

package/esm/deps/jsr.io/@std/async/1.2.0/retry.js

@@ -0,0 +1,147 @@
+// Copyright 2018-2026 the Deno authors. MIT license.
+// This module is browser compatible.
+import { delay } from "./delay.js";
+import { exponentialBackoffWithJitter } from "./_util.js";
+/**
+ * Error thrown in {@linkcode retry} once the maximum number of failed attempts
+ * has been reached.
+ *
+ * @example Usage
+ * ```ts no-assert ignore
+ * import { RetryError } from "@std/async/retry";
+ *
+ * throw new RetryError({ foo: "bar" }, 3);
+ * ```
+ */
+export class RetryError extends Error {
+    /**
+     * Constructs a new {@linkcode RetryError} instance.
+     *
+     * @param cause the cause for this error.
+     * @param attempts the number of retry attempts made.
+     */
+    constructor(cause, attempts) {
+        super(`Retrying exceeded the maxAttempts (${attempts}).`);
+        this.name = "RetryError";
+        this.cause = cause;
+    }
+}
+/**
+ * Calls the given (possibly asynchronous) function up to `maxAttempts` times.
+ * Retries as long as the given function throws. If the attempts are exhausted,
+ * throws a {@linkcode RetryError} with `cause` set to the inner exception.
+ *
+ * The backoff is calculated by multiplying `minTimeout` with `multiplier` to the power of the current attempt counter (starting at 0 up to `maxAttempts - 1`). It is capped at `maxTimeout` however.
+ * How long the actual delay is, depends on `jitter`.
+ *
+ * When `jitter` is the default value of `1`, waits between two attempts for a
+ * randomized amount between 0 and the backoff time. With the default options
+ * the maximal delay will be `15s = 1s + 2s + 4s + 8s`. If all five attempts
+ * are exhausted the mean delay will be `9.5s = ½(4s + 15s)`.
+ *
+ * When `jitter` is `0`, waits the full backoff time.
+ *
+ * @example Example configuration 1
+ * ```ts no-assert
+ * import { retry } from "@std/async/retry";
+ * const req = async () => {
+ *  // some function that throws sometimes
+ * };
+ *
+ * // Below resolves to the first non-error result of `req`
+ * const retryPromise = await retry(req, {
+ *  multiplier: 2,
+ *  maxTimeout: 60000,
+ *  maxAttempts: 5,
+ *  minTimeout: 100,
+ *  jitter: 1,
+ * });
+ * ```
+ *
+ * @example Example configuration 2
+ * ```ts no-assert
+ * import { retry } from "@std/async/retry";
+ * const req = async () => {
+ *  // some function that throws sometimes
+ * };
+ *
+ * // Make sure we wait at least 1 minute, but at most 2 minutes
+ * const retryPromise = await retry(req, {
+ *  multiplier: 2.34,
+ *  maxTimeout: 80000,
+ *  maxAttempts: 7,
+ *  minTimeout: 1000,
+ *  jitter: 0.5,
+ * });
+ * ```
+ *
+ * @example Only retry on specific error types
+ * ```ts no-assert
+ * import { retry } from "@std/async/retry";
+ *
+ * class HttpError extends Error {
+ *   status: number;
+ *   constructor(status: number) {
+ *     super(`HTTP ${status}`);
+ *     this.status = status;
+ *   }
+ * }
+ *
+ * const req = async () => {
+ *   // some function that throws HttpError
+ * };
+ *
+ * // Only retry on 429 (rate limit) or 5xx (server) errors
+ * const retryPromise = await retry(req, {
+ *   isRetriable: (err) =>
+ *     err instanceof HttpError && (err.status === 429 || err.status >= 500),
+ * });
+ * ```
+ *
+ * @typeParam T The return type of the function to retry and returned promise.
+ * @param fn The function to retry.
+ * @param options Additional options.
+ * @returns The promise that resolves with the value returned by the function to retry.
+ * @throws {RetryError} If the function fails after `maxAttempts` attempts.
+ * @throws If the `signal` is aborted, throws the signal's reason.
+ * @throws If `isRetriable` returns `false` for an error, throws that error immediately.
+ */
+export async function retry(fn, options) {
+    const { multiplier = 2, maxTimeout = 60000, maxAttempts = 5, minTimeout = 1000, jitter = 1, isRetriable = () => true, signal, } = options ?? {};
+    if (!Number.isInteger(maxAttempts) || maxAttempts < 1) {
+        throw new RangeError(`Cannot retry as 'maxAttempts' must be a positive integer: current value is ${maxAttempts}`);
+    }
+    if (!Number.isFinite(multiplier) || multiplier < 1) {
+        throw new RangeError(`Cannot retry as 'multiplier' must be a finite number >= 1: current value is ${multiplier}`);
+    }
+    if (Number.isNaN(maxTimeout) || maxTimeout <= 0) {
+        throw new RangeError(`Cannot retry as 'maxTimeout' must be a positive number: current value is ${maxTimeout}`);
+    }
+    if (Number.isNaN(minTimeout) || minTimeout < 0) {
+        throw new RangeError(`Cannot retry as 'minTimeout' must be >= 0: current value is ${minTimeout}`);
+    }
+    if (minTimeout > maxTimeout) {
+        throw new RangeError(`Cannot retry as 'minTimeout' must be <= 'maxTimeout': current values 'minTimeout=${minTimeout}', 'maxTimeout=${maxTimeout}'`);
+    }
+    if (Number.isNaN(jitter) || jitter < 0 || jitter > 1) {
+        throw new RangeError(`Cannot retry as 'jitter' must be between 0 and 1: current value is ${jitter}`);
+    }
+    let attempt = 0;
+    while (true) {
+        signal?.throwIfAborted();
+        try {
+            return await fn();
+        }
+        catch (error) {
+            if (!isRetriable(error)) {
+                throw error;
+            }
+            if (attempt + 1 >= maxAttempts) {
+                throw new RetryError(error, maxAttempts);
+            }
+            const timeout = exponentialBackoffWithJitter(maxTimeout, minTimeout, attempt, multiplier, jitter);
+            await delay(timeout, signal ? { signal } : undefined);
+        }
+        attempt++;
+    }
+}

package/esm/deps/jsr.io/@std/async/1.2.0/tee.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Utility for representing n-tuple. Used in {@linkcode tee}.
+ *
+ * @internal
+ */
+export type Tuple<T, N extends number> = N extends N ? number extends N ? T[] : TupleOf<T, N, []> : never;
+/**
+ * Utility for representing n-tuple of. Used in {@linkcode Tuple}.
+ *
+ * @internal
+ */
+export type TupleOf<T, N extends number, R extends unknown[]> = R["length"] extends N ? R : TupleOf<T, N, [T, ...R]>;
+/**
+ * Branches the given async iterable into the `n` branches.
+ *
+ * @example Usage
+ * ```ts
+ * import { tee } from "@std/async/tee";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const gen = async function* gen() {
+ *   yield 1;
+ *   yield 2;
+ *   yield 3;
+ * };
+ *
+ * const [branch1, branch2] = tee(gen());
+ *
+ * const result1 = await Array.fromAsync(branch1);
+ * assertEquals(result1, [1, 2, 3]);
+ *
+ * const result2 = await Array.fromAsync(branch2);
+ * assertEquals(result2, [1, 2, 3]);
+ * ```
+ *
+ * @typeParam T The type of the provided async iterable and the returned async iterables.
+ * @typeParam N The amount of branches to tee into.
+ * @param iterable The iterable to tee.
+ * @param n The amount of branches to tee into.
+ * @returns The tuple where each element is an async iterable.
+ */
+export declare function tee<T, N extends number = 2>(iterable: AsyncIterable<T>, n?: N): Tuple<AsyncIterable<T>, N>;
+//# sourceMappingURL=tee.d.ts.map

package/esm/deps/jsr.io/@std/async/1.2.0/tee.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tee.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/async/1.2.0/tee.ts"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,IAAI,CAAC,SAAS,CAAC,GAChD,MAAM,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAC1C,KAAK,CAAC;AAEV;;;;GAIG;AACH,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,OAAO,EAAE,IAC1D,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,GACrB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AAuC/B;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,GAAG,CAAC,EACzC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,CAAC,GAAE,CAAU,GACZ,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAuB5B"}

package/esm/deps/jsr.io/@std/async/1.2.0/tee.js

@@ -0,0 +1,102 @@
+// Copyright 2018-2026 the Deno authors. MIT license.
+// This module is browser compatible.
+var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
+    if (kind === "m") throw new TypeError("Private method is not writable");
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+};
+var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+};
+var _Queue_source, _Queue_queue;
+class Queue {
+    constructor(iterable) {
+        _Queue_source.set(this, void 0);
+        _Queue_queue.set(this, void 0);
+        Object.defineProperty(this, "head", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        Object.defineProperty(this, "done", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
+        __classPrivateFieldSet(this, _Queue_source, iterable[Symbol.asyncIterator](), "f");
+        __classPrivateFieldSet(this, _Queue_queue, {
+            value: undefined,
+            next: undefined,
+        }, "f");
+        this.head = __classPrivateFieldGet(this, _Queue_queue, "f");
+        this.done = false;
+    }
+    async next() {
+        const result = await __classPrivateFieldGet(this, _Queue_source, "f").next();
+        if (!result.done) {
+            const nextNode = {
+                value: result.value,
+                next: undefined,
+            };
+            __classPrivateFieldGet(this, _Queue_queue, "f").next = nextNode;
+            __classPrivateFieldSet(this, _Queue_queue, nextNode, "f");
+        }
+        else {
+            this.done = true;
+        }
+    }
+}
+_Queue_source = new WeakMap(), _Queue_queue = new WeakMap();
+/**
+ * Branches the given async iterable into the `n` branches.
+ *
+ * @example Usage
+ * ```ts
+ * import { tee } from "@std/async/tee";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const gen = async function* gen() {
+ *   yield 1;
+ *   yield 2;
+ *   yield 3;
+ * };
+ *
+ * const [branch1, branch2] = tee(gen());
+ *
+ * const result1 = await Array.fromAsync(branch1);
+ * assertEquals(result1, [1, 2, 3]);
+ *
+ * const result2 = await Array.fromAsync(branch2);
+ * assertEquals(result2, [1, 2, 3]);
+ * ```
+ *
+ * @typeParam T The type of the provided async iterable and the returned async iterables.
+ * @typeParam N The amount of branches to tee into.
+ * @param iterable The iterable to tee.
+ * @param n The amount of branches to tee into.
+ * @returns The tuple where each element is an async iterable.
+ */
+export function tee(iterable, n = 2) {
+    const queue = new Queue(iterable);
+    async function* generator() {
+        let buffer = queue.head;
+        while (true) {
+            if (buffer.next) {
+                buffer = buffer.next;
+                yield buffer.value;
+            }
+            else if (queue.done) {
+                return;
+            }
+            else {
+                await queue.next();
+            }
+        }
+    }
+    return Array.from({ length: n }).map(() => generator());
+}

package/esm/deps/jsr.io/@std/bytes/1.0.6/_types.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Proxy type of {@code Uint8Array<ArrayBuffer} or {@code Uint8Array} in TypeScript 5.7 or below respectively.
+ *
+ * This type is internal utility type and should not be used directly.
+ *
+ * @internal @private
+ */
+export type Uint8Array_ = ReturnType<Uint8Array["slice"]>;
+//# sourceMappingURL=_types.d.ts.map

package/esm/deps/jsr.io/@std/bytes/1.0.6/_types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_types.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/bytes/1.0.6/_types.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,MAAM,MAAM,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC"}

package/esm/deps/jsr.io/@std/bytes/1.0.6/_types.js

@@ -0,0 +1,2 @@
+// Copyright 2018-2025 the Deno authors. MIT license.
+export {};

package/esm/deps/jsr.io/@std/bytes/1.0.6/concat.d.ts

@@ -0,0 +1,21 @@
+import type { Uint8Array_ } from "./_types.js";
+export type { Uint8Array_ };
+/**
+ * Concatenate an array of byte slices into a single slice.
+ *
+ * @param buffers Array of byte slices to concatenate.
+ * @returns A new byte slice containing all the input slices concatenated.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { concat } from "@std/bytes/concat";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const a = new Uint8Array([0, 1, 2]);
+ * const b = new Uint8Array([3, 4, 5]);
+ *
+ * assertEquals(concat([a, b]), new Uint8Array([0, 1, 2, 3, 4, 5]));
+ * ```
+ */
+export declare function concat(buffers: readonly Uint8Array[]): Uint8Array_;
+//# sourceMappingURL=concat.d.ts.map

package/esm/deps/jsr.io/@std/bytes/1.0.6/concat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"concat.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/bytes/1.0.6/concat.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,CAalE"}

package/esm/deps/jsr.io/@std/bytes/1.0.6/concat.js

@@ -0,0 +1,32 @@
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+/**
+ * Concatenate an array of byte slices into a single slice.
+ *
+ * @param buffers Array of byte slices to concatenate.
+ * @returns A new byte slice containing all the input slices concatenated.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { concat } from "@std/bytes/concat";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const a = new Uint8Array([0, 1, 2]);
+ * const b = new Uint8Array([3, 4, 5]);
+ *
+ * assertEquals(concat([a, b]), new Uint8Array([0, 1, 2, 3, 4, 5]));
+ * ```
+ */
+export function concat(buffers) {
+    let length = 0;
+    for (const buffer of buffers) {
+        length += buffer.length;
+    }
+    const output = new Uint8Array(length);
+    let index = 0;
+    for (const buffer of buffers) {
+        output.set(buffer, index);
+        index += buffer.length;
+    }
+    return output;
+}

package/esm/deps/jsr.io/@std/bytes/1.0.6/equals.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Check whether byte slices are equal to each other.
+ *
+ * @param a First array to check equality.
+ * @param b Second array to check equality.
+ * @returns `true` if the arrays are equal, `false` otherwise.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { equals } from "@std/bytes/equals";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const a = new Uint8Array([1, 2, 3]);
+ * const b = new Uint8Array([1, 2, 3]);
+ * const c = new Uint8Array([4, 5, 6]);
+ *
+ * assertEquals(equals(a, b), true);
+ * assertEquals(equals(a, c), false);
+ * ```
+ */
+export declare function equals(a: Uint8Array, b: Uint8Array): boolean;
+//# sourceMappingURL=equals.d.ts.map

package/esm/deps/jsr.io/@std/bytes/1.0.6/equals.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equals.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/bytes/1.0.6/equals.ts"],"names":[],"mappings":"AA6DA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,OAAO,CAQ5D"}

package/esm/deps/jsr.io/@std/bytes/1.0.6/equals.js

@@ -0,0 +1,82 @@
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+/**
+ * Check whether byte slices are equal to each other using 8-bit comparisons.
+ *
+ * @param a First array to check equality
+ * @param b Second array to check equality
+ * @returns `true` if the arrays are equal, `false` otherwise
+ *
+ * @private
+ */
+function equalsNaive(a, b) {
+    for (let i = 0; i < b.length; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+/** Check whether byte slices are equal to each other using 32-bit comparisons.
+ *
+ * @param a First array to check equality.
+ * @param b Second array to check equality.
+ * @returns `true` if the arrays are equal, `false` otherwise.
+ *
+ * @private
+ */
+function equals32Bit(a, b) {
+    const len = a.length;
+    const compactOffset = 3 - ((a.byteOffset + 3) % 4);
+    const compactLen = Math.floor((len - compactOffset) / 4);
+    const compactA = new Uint32Array(a.buffer, a.byteOffset + compactOffset, compactLen);
+    const compactB = new Uint32Array(b.buffer, b.byteOffset + compactOffset, compactLen);
+    for (let i = 0; i < compactOffset; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    for (let i = 0; i < compactA.length; i++) {
+        if (compactA[i] !== compactB[i])
+            return false;
+    }
+    for (let i = compactOffset + compactLen * 4; i < len; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+/**
+ * Byte length threshold for when to use 32-bit comparisons, based on
+ * benchmarks.
+ *
+ * @see {@link https://github.com/denoland/std/pull/4635}
+ */
+const THRESHOLD_32_BIT = 160;
+/**
+ * Check whether byte slices are equal to each other.
+ *
+ * @param a First array to check equality.
+ * @param b Second array to check equality.
+ * @returns `true` if the arrays are equal, `false` otherwise.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { equals } from "@std/bytes/equals";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const a = new Uint8Array([1, 2, 3]);
+ * const b = new Uint8Array([1, 2, 3]);
+ * const c = new Uint8Array([4, 5, 6]);
+ *
+ * assertEquals(equals(a, b), true);
+ * assertEquals(equals(a, c), false);
+ * ```
+ */
+export function equals(a, b) {
+    if (a.length !== b.length) {
+        return false;
+    }
+    return a.length >= THRESHOLD_32_BIT &&
+        (a.byteOffset % 4) === (b.byteOffset % 4)
+        ? equals32Bit(a, b)
+        : equalsNaive(a, b);
+}

package/esm/deps/jsr.io/@std/bytes/1.0.6/starts_with.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Returns `true` if the prefix array appears at the start of the source array,
+ * `false` otherwise.
+ *
+ * The complexity of this function is `O(prefix.length)`.
+ *
+ * @param source Source array to check.
+ * @param prefix Prefix array to check for.
+ * @returns `true` if the prefix array appears at the start of the source array,
+ * `false` otherwise.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { startsWith } from "@std/bytes/starts-with";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
+ * const prefix = new Uint8Array([0, 1, 2]);
+ *
+ * assertEquals(startsWith(source, prefix), true);
+ * ```
+ */
+export declare function startsWith(source: Uint8Array, prefix: Uint8Array): boolean;
+//# sourceMappingURL=starts_with.d.ts.map

package/esm/deps/jsr.io/@std/bytes/1.0.6/starts_with.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"starts_with.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/bytes/1.0.6/starts_with.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,GAAG,OAAO,CAS1E"}