@mtkruto/node 0.68.0 → 0.70.0

package/script/deps/jsr.io/@std/cache/0.2.0/lru_cache.js

@@ -0,0 +1,144 @@
+"use strict";
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LruCache = void 0;
+/**
+ * Least-recently-used cache.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ *
+ * @see {@link https://en.wikipedia.org/wiki/Cache_replacement_policies#LRU | Least-recently-used cache}
+ *
+ * Automatically removes entries above the max size based on when they were
+ * last accessed with `get`, `set`, or `has`.
+ *
+ * @typeParam K The type of the cache keys.
+ * @typeParam V The type of the cache values.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { LruCache } from "@std/cache";
+ * import { assert, assertEquals } from "@std/assert";
+ *
+ * const MAX_SIZE = 3;
+ * const cache = new LruCache<string, number>(MAX_SIZE);
+ *
+ * cache.set("a", 1);
+ * cache.set("b", 2);
+ * cache.set("c", 3);
+ * cache.set("d", 4);
+ *
+ * // most recent values are stored up to `MAX_SIZE`
+ * assertEquals(cache.get("b"), 2);
+ * assertEquals(cache.get("c"), 3);
+ * assertEquals(cache.get("d"), 4);
+ *
+ * // less recent values are removed
+ * assert(!cache.has("a"));
+ * ```
+ */
+class LruCache extends Map {
+    /**
+     * The maximum number of entries to store in the cache.
+     *
+     * @example Max size
+     * ```ts no-assert
+     * import { LruCache } from "@std/cache";
+     * import { assertEquals } from "@std/assert";
+     *
+     * const cache = new LruCache<string, number>(100);
+     * assertEquals(cache.maxSize, 100);
+     * ```
+     */
+    maxSize;
+    /**
+     * Constructs a new `LruCache`.
+     *
+     * @param maxSize The maximum number of entries to store in the cache.
+     */
+    constructor(maxSize) {
+        super();
+        this.maxSize = maxSize;
+    }
+    #setMostRecentlyUsed(key, value) {
+        // delete then re-add to ensure most recently accessed elements are last
+        super.delete(key);
+        super.set(key, value);
+    }
+    #pruneToMaxSize() {
+        if (this.size > this.maxSize) {
+            this.delete(this.keys().next().value);
+        }
+    }
+    /**
+     * Checks whether an element with the specified key exists or not.
+     *
+     * @param key The key to check.
+     * @returns `true` if the cache contains the specified key, otherwise `false`.
+     *
+     * @example Checking for the existence of a key
+     * ```ts
+     * import { LruCache } from "@std/cache";
+     * import { assert } from "@std/assert";
+     *
+     * const cache = new LruCache<string, number>(100);
+     *
+     * cache.set("a", 1);
+     * assert(cache.has("a"));
+     * ```
+     */
+    has(key) {
+        const exists = super.has(key);
+        if (exists) {
+            this.#setMostRecentlyUsed(key, super.get(key));
+        }
+        return exists;
+    }
+    /**
+     * Gets the element with the specified key.
+     *
+     * @param key The key to get the value for.
+     * @returns The value associated with the specified key, or `undefined` if the key is not present in the cache.
+     *
+     * @example Getting a value from the cache
+     * ```ts
+     * import { LruCache } from "@std/cache";
+     * import { assertEquals } from "@std/assert";
+     *
+     * const cache = new LruCache<string, number>(100);
+     *
+     * cache.set("a", 1);
+     * assertEquals(cache.get("a"), 1);
+     * ```
+     */
+    get(key) {
+        if (super.has(key)) {
+            const value = super.get(key);
+            this.#setMostRecentlyUsed(key, value);
+            return value;
+        }
+        return undefined;
+    }
+    /**
+     * Sets the specified key to the specified value.
+     *
+     * @param key The key to set the value for.
+     * @param value The value to set.
+     * @returns `this` for chaining.
+     *
+     * @example Setting a value in the cache
+     * ```ts no-assert
+     * import { LruCache } from "@std/cache";
+     *
+     * const cache = new LruCache<string, number>(100);
+     * cache.set("a", 1);
+     * ```
+     */
+    set(key, value) {
+        this.#setMostRecentlyUsed(key, value);
+        this.#pruneToMaxSize();
+        return this;
+    }
+}
+exports.LruCache = LruCache;

package/script/deps/jsr.io/@std/cache/0.2.0/memoize.d.ts

@@ -0,0 +1,111 @@
+/**
+ * A cache suitable for use with {@linkcode memoize}.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ */
+export type MemoizationCache<K, V> = {
+    has: (key: K) => boolean;
+    get: (key: K) => V | undefined;
+    set: (key: K, val: V) => unknown;
+    delete: (key: K) => unknown;
+};
+/**
+ * The result of a memoized function, as stored in its cache.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ */
+export type MemoizationCacheResult<T> = {
+    kind: "ok";
+    value: T;
+} | {
+    kind: "error";
+    error: unknown;
+} | (T extends Promise<unknown> ? {
+    kind: "promise";
+    value: T;
+} : never);
+/**
+ * Options for {@linkcode memoize}.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ *
+ * @typeParam Fn The type of the function to memoize.
+ * @typeParam Key The type of the cache key.
+ * @typeParam Cache The type of the cache.
+ */
+export type MemoizeOptions<Fn extends (...args: never[]) => unknown, Key, Cache extends MemoizationCache<Key, MemoizationCacheResult<ReturnType<Fn>>>> = {
+    /**
+     * Provide a custom cache for getting previous results. By default, a new
+     * {@linkcode Map} object is instantiated upon memoization and used as a cache, with no
+     * limit on the number of results to be cached.
+     *
+     * Alternatively, you can supply a {@linkcode LruCache} with a specified max
+     * size to limit memory usage.
+     */
+    cache?: Cache;
+    /**
+     * Function to get a unique cache key from the function's arguments. By
+     * default, a composite key is created from all the arguments plus the `this`
+     * value, using reference equality to check for equivalence.
+     *
+     * @example
+     * ```ts
+     * import { memoize } from "@std/cache";
+     * import { assertEquals } from "@std/assert";
+     *
+     * const fn = memoize(({ value }: { cacheKey: number; value: number }) => {
+     *   return value;
+     * }, { getKey: ({ cacheKey }) => cacheKey });
+     *
+     * assertEquals(fn({ cacheKey: 1, value: 2 }), 2);
+     * assertEquals(fn({ cacheKey: 1, value: 99 }), 2);
+     * assertEquals(fn({ cacheKey: 2, value: 99 }), 99);
+     * ```
+     */
+    getKey?: (this: ThisParameterType<Fn>, ...args: Parameters<Fn>) => Key;
+    /**
+     * Callback to determine if an error or other thrown value is cacheable.
+     *
+     * @default {() => false}
+     *
+     * @param err The thrown error or other value.
+     * @returns `true` if the error is cacheable, `false` otherwise.
+     */
+    errorIsCacheable?: (err: unknown) => boolean;
+};
+/**
+ * Cache the results of a function based on its arguments.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ *
+ * @typeParam Fn The type of the function to memoize.
+ * @typeParam Key The type of the cache key.
+ * @typeParam Cache The type of the cache.
+ * @param fn The function to memoize
+ * @param options Options for memoization
+ *
+ * @returns The memoized function.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { memoize } from "@std/cache";
+ * import { assertEquals } from "@std/assert";
+ *
+ * // fibonacci function, which is very slow for n > ~30 if not memoized
+ * const fib = memoize((n: bigint): bigint => {
+ *   return n <= 2n ? 1n : fib(n - 1n) + fib(n - 2n);
+ * });
+ *
+ * assertEquals(fib(100n), 354224848179261915075n);
+ * ```
+ *
+ * > [!NOTE]
+ * > * By default, memoization is on the basis of all arguments passed to the
+ * >   function, with equality determined by reference. This means that, for
+ * >   example, passing a memoized function as `arr.map(func)` will not use the
+ * >   cached results, as the index is implicitly passed as an argument. To
+ * >   avoid this, you can pass a custom `getKey` option or use the memoized
+ * >   function inside an anonymous callback like `arr.map((x) => func(x))`.
+ */
+export declare function memoize<Fn extends (...args: never[]) => unknown, Key = string, Cache extends MemoizationCache<Key, MemoizationCacheResult<ReturnType<Fn>>> = Map<Key, MemoizationCacheResult<ReturnType<Fn>>>>(fn: Fn, options?: MemoizeOptions<Fn, Key, Cache>): Fn;
+//# sourceMappingURL=memoize.d.ts.map

package/script/deps/jsr.io/@std/cache/0.2.0/memoize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoize.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/cache/0.2.0/memoize.ts"],"names":[],"mappings":"AAOA;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI;IACnC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;IACzB,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;IAC/B,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;IACjC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;CAC7B,CAAC;AAEF;;;;GAIG;AACH,MAAM,MAAM,sBAAsB,CAAC,CAAC,IAChC;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,CAAC,CAAA;CAAE,GACxB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACjC,CAAC,CAAC,SAAS,OAAO,CAAC,OAAO,CAAC,GAAG;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,CAAC,CAAA;CAAE,GAAG,KAAK,CAAC,CAAC;AAEzE;;;;;;;;GAQG;AACH,MAAM,MAAM,cAAc,CACxB,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,OAAO,EACxC,GAAG,EACH,KAAK,SAAS,gBAAgB,CAAC,GAAG,EAAE,sBAAsB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,IACzE;IACF;;;;;;;OAOG;IACH,KAAK,CAAC,EAAE,KAAK,CAAC;IACd;;;;;;;;;;;;;;;;;;OAkBG;IACH,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,iBAAiB,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC;IACvE;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,OAAO,CAAC;CAC9C,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,wBAAgB,OAAO,CACrB,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,OAAO,EACxC,GAAG,GAAG,MAAM,EACZ,KAAK,SAAS,gBAAgB,CAAC,GAAG,EAAE,sBAAsB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,GACzE,GAAG,CACD,GAAG,EACH,sBAAsB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CACvC,EAEH,EAAE,EAAE,EAAE,EACN,OAAO,CAAC,EAAE,cAAc,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,GACvC,EAAE,CA+DJ"}

package/script/deps/jsr.io/@std/cache/0.2.0/memoize.js

@@ -0,0 +1,85 @@
+"use strict";
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.memoize = memoize;
+const _serialize_arg_list_js_1 = require("./_serialize_arg_list.js");
+/**
+ * Cache the results of a function based on its arguments.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ *
+ * @typeParam Fn The type of the function to memoize.
+ * @typeParam Key The type of the cache key.
+ * @typeParam Cache The type of the cache.
+ * @param fn The function to memoize
+ * @param options Options for memoization
+ *
+ * @returns The memoized function.
+ *
+ * @example Basic usage
+ * ```ts
+ * import { memoize } from "@std/cache";
+ * import { assertEquals } from "@std/assert";
+ *
+ * // fibonacci function, which is very slow for n > ~30 if not memoized
+ * const fib = memoize((n: bigint): bigint => {
+ *   return n <= 2n ? 1n : fib(n - 1n) + fib(n - 2n);
+ * });
+ *
+ * assertEquals(fib(100n), 354224848179261915075n);
+ * ```
+ *
+ * > [!NOTE]
+ * > * By default, memoization is on the basis of all arguments passed to the
+ * >   function, with equality determined by reference. This means that, for
+ * >   example, passing a memoized function as `arr.map(func)` will not use the
+ * >   cached results, as the index is implicitly passed as an argument. To
+ * >   avoid this, you can pass a custom `getKey` option or use the memoized
+ * >   function inside an anonymous callback like `arr.map((x) => func(x))`.
+ */
+function memoize(fn, options) {
+    const cache = options?.cache ?? new Map();
+    const getKey = options?.getKey ??
+        (0, _serialize_arg_list_js_1._serializeArgList)(cache);
+    const errorIsCacheable = options?.errorIsCacheable ?? (() => false);
+    const memoized = function (...args) {
+        const key = getKey.apply(this, args);
+        if (cache.has(key)) {
+            const result = cache.get(key);
+            switch (result.kind) {
+                case "ok":
+                case "promise":
+                    return result.value;
+                case "error":
+                    throw result.error;
+            }
+        }
+        try {
+            let value = fn.apply(this, args);
+            if (value instanceof Promise) {
+                value = value.catch((reason) => {
+                    if (!errorIsCacheable(reason)) {
+                        cache.delete(key);
+                    }
+                    throw reason;
+                });
+                cache.set(key, { kind: "promise", value });
+            }
+            else {
+                cache.set(key, { kind: "ok", value });
+            }
+            return value;
+        }
+        catch (e) {
+            if (errorIsCacheable(e)) {
+                cache.set(key, { kind: "error", error: e });
+            }
+            throw e;
+        }
+    };
+    return Object.defineProperties(memoized, {
+        length: { value: fn.length },
+        name: { value: fn.name },
+    });
+}

package/script/deps/jsr.io/@std/encoding/1.0.7/hex.d.ts

@@ -0,0 +1,39 @@
+import type { Uint8Array_ } from "./_types.js";
+export type { Uint8Array_ };
+/**
+ * Converts data into a hex-encoded string.
+ *
+ * @param src The data to encode.
+ *
+ * @returns The hex-encoded string.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeHex } from "@std/encoding/hex";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeHex("abc"), "616263");
+ * ```
+ */
+export declare function encodeHex(src: string | Uint8Array | ArrayBuffer): string;
+/**
+ * Decodes the given hex-encoded string. If the input is malformed, an error is
+ * thrown.
+ *
+ * @param src The hex-encoded string to decode.
+ *
+ * @returns The decoded data.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeHex } from "@std/encoding/hex";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(
+ *   decodeHex("616263"),
+ *   new TextEncoder().encode("abc"),
+ * );
+ * ```
+ */
+export declare function decodeHex(src: string): Uint8Array_;
+//# sourceMappingURL=hex.d.ts.map

package/script/deps/jsr.io/@std/encoding/1.0.7/hex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hex.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.7/hex.ts"],"names":[],"mappings":"AA6BA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,YAAY,EAAE,WAAW,EAAE,CAAC;AA4B5B;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,GAAG,WAAW,GAAG,MAAM,CAUxE;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,WAAW,CAiBlD"}

package/script/deps/jsr.io/@std/encoding/1.0.7/hex.js

@@ -0,0 +1,113 @@
+"use strict";
+// Copyright 2009 The Go Authors. All rights reserved.
+// https://github.com/golang/go/blob/master/LICENSE
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.encodeHex = encodeHex;
+exports.decodeHex = decodeHex;
+/**
+ * Port of the Go
+ * {@link https://github.com/golang/go/blob/go1.12.5/src/encoding/hex/hex.go | encoding/hex}
+ * library.
+ *
+ * ```ts
+ * import {
+ *   decodeHex,
+ *   encodeHex,
+ * } from "@std/encoding/hex";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeHex("abc"), "616263");
+ *
+ * assertEquals(
+ *   decodeHex("616263"),
+ *   new TextEncoder().encode("abc"),
+ * );
+ * ```
+ *
+ * @module
+ */
+const _validate_binary_like_js_1 = require("./_validate_binary_like.js");
+const hexTable = new TextEncoder().encode("0123456789abcdef");
+const textEncoder = new TextEncoder();
+const textDecoder = new TextDecoder();
+function errInvalidByte(byte) {
+    return new TypeError(`Invalid byte '${String.fromCharCode(byte)}'`);
+}
+function errLength(len) {
+    return new RangeError(`Cannot decode the hex string as the input length should be even: length is ${len}`);
+}
+/** Converts a hex character into its value. */
+function fromHexChar(byte) {
+    // '0' <= byte && byte <= '9'
+    if (48 <= byte && byte <= 57)
+        return byte - 48;
+    // 'a' <= byte && byte <= 'f'
+    if (97 <= byte && byte <= 102)
+        return byte - 97 + 10;
+    // 'A' <= byte && byte <= 'F'
+    if (65 <= byte && byte <= 70)
+        return byte - 65 + 10;
+    throw errInvalidByte(byte);
+}
+/**
+ * Converts data into a hex-encoded string.
+ *
+ * @param src The data to encode.
+ *
+ * @returns The hex-encoded string.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeHex } from "@std/encoding/hex";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeHex("abc"), "616263");
+ * ```
+ */
+function encodeHex(src) {
+    const u8 = (0, _validate_binary_like_js_1.validateBinaryLike)(src);
+    const dst = new Uint8Array(u8.length * 2);
+    for (let i = 0; i < u8.length; i++) {
+        const v = u8[i];
+        dst[i * 2] = hexTable[v >> 4];
+        dst[i * 2 + 1] = hexTable[v & 0x0f];
+    }
+    return textDecoder.decode(dst);
+}
+/**
+ * Decodes the given hex-encoded string. If the input is malformed, an error is
+ * thrown.
+ *
+ * @param src The hex-encoded string to decode.
+ *
+ * @returns The decoded data.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeHex } from "@std/encoding/hex";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(
+ *   decodeHex("616263"),
+ *   new TextEncoder().encode("abc"),
+ * );
+ * ```
+ */
+function decodeHex(src) {
+    const u8 = textEncoder.encode(src);
+    const dst = new Uint8Array(u8.length / 2);
+    for (let i = 0; i < dst.length; i++) {
+        const a = fromHexChar(u8[i * 2]);
+        const b = fromHexChar(u8[i * 2 + 1]);
+        dst[i] = (a << 4) | b;
+    }
+    if (u8.length % 2 === 1) {
+        // Check for invalid char before reporting bad length,
+        // since the invalid char (if present) is an earlier problem.
+        fromHexChar(u8[dst.length * 2]);
+        throw errLength(u8.length);
+    }
+    return dst;
+}

package/script/deps/jsr.io/@std/internal/1.0.10/_os.d.ts

@@ -0,0 +1,2 @@
+export declare function checkWindows(): boolean;
+//# sourceMappingURL=_os.d.ts.map

package/script/deps/jsr.io/@std/internal/1.0.10/_os.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_os.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/internal/1.0.10/_os.ts"],"names":[],"mappings":"AAIA,wBAAgB,YAAY,IAAI,OAAO,CAUtC"}

package/script/deps/jsr.io/@std/internal/1.0.10/_os.js

@@ -0,0 +1,48 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.checkWindows = checkWindows;
+// Copyright 2018-2025 the Deno authors. MIT license.
+const dntShim = __importStar(require("../../../../../_dnt.shims.js"));
+function checkWindows() {
+    // deno-lint-ignore no-explicit-any
+    const global = dntShim.dntGlobalThis;
+    const os = global.Deno?.build?.os;
+    // Check Deno, then the remaining runtimes (e.g. Node, Bun and the browser)
+    return typeof os === "string"
+        ? os === "windows"
+        : global.navigator?.platform?.startsWith("Win") ??
+            global.process?.platform?.startsWith("win") ?? false;
+}

package/script/deps/jsr.io/@std/internal/1.0.10/os.d.ts

@@ -0,0 +1,3 @@
+/** Whether the current platform is Windows */
+export declare const isWindows: boolean;
+//# sourceMappingURL=os.d.ts.map

package/script/deps/jsr.io/@std/internal/1.0.10/os.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"os.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/internal/1.0.10/os.ts"],"names":[],"mappings":"AAKA,8CAA8C;AAC9C,eAAO,MAAM,SAAS,EAAE,OAAwB,CAAC"}

package/script/deps/jsr.io/@std/internal/1.0.10/os.js

@@ -0,0 +1,8 @@
+"use strict";
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isWindows = void 0;
+const _os_js_1 = require("./_os.js");
+/** Whether the current platform is Windows */
+exports.isWindows = (0, _os_js_1.checkWindows)();

package/script/deps/jsr.io/@std/path/1.1.2/_common/assert_path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"assert_path.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/assert_path.ts"],"names":[],"mappings":"AAGA,wBAAgB,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,QAMvC"}

package/script/deps/jsr.io/@std/path/1.1.2/_common/basename.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"basename.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/basename.ts"],"names":[],"mappings":"AAKA,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAchE;AAED,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,EAChC,KAAK,SAAI,GACR,MAAM,CAiBR;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,sBAQtD"}

package/script/deps/jsr.io/@std/path/1.1.2/_common/constants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/constants.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,eAAO,MAAM,gBAAgB,MAAM,CAAC;AAGpC,eAAO,MAAM,QAAQ,KAAK,CAAC;AAC3B,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,mBAAmB,KAAK,CAAC;AACtC,eAAO,MAAM,kBAAkB,MAAM,CAAC;AACtC,eAAO,MAAM,UAAU,KAAK,CAAC;AAC7B,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,eAAe,KAAK,CAAC;AAClC,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC,eAAO,MAAM,oBAAoB,KAAK,CAAC;AACvC,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC,eAAO,MAAM,qBAAqB,KAAK,CAAC;AACxC,eAAO,MAAM,SAAS,KAAK,CAAC;AAC5B,eAAO,MAAM,UAAU,KAAK,CAAC;AAC7B,eAAO,MAAM,mBAAmB,MAAM,CAAC;AACvC,eAAO,MAAM,6BAA6B,QAAQ,CAAC;AACnD,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAC3C,eAAO,MAAM,yBAAyB,KAAK,CAAC;AAC5C,eAAO,MAAM,uBAAuB,KAAK,CAAC;AAC1C,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAC3C,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAC3C,eAAO,MAAM,wBAAwB,MAAM,CAAC;AAC5C,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,eAAO,MAAM,SAAS,KAAK,CAAC;AAC5B,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,eAAO,MAAM,YAAY,KAAK,CAAC;AAC/B,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC,eAAO,MAAM,sBAAsB,KAAK,CAAC;AACzC,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,eAAO,MAAM,OAAO,KAAK,CAAC;AAC1B,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC,eAAO,MAAM,UAAU,KAAK,CAAC;AAG7B,eAAO,MAAM,MAAM,KAAK,CAAC;AACzB,eAAO,MAAM,MAAM,KAAK,CAAC"}

package/script/deps/jsr.io/@std/path/1.1.2/_common/from_file_url.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"from_file_url.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/from_file_url.ts"],"names":[],"mappings":"AAGA,wBAAgB,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,MAAM,OAQ1C"}

package/script/deps/jsr.io/@std/path/1.1.2/_common/normalize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/normalize.ts"],"names":[],"mappings":"AAKA,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,mBAGrC"}

package/script/deps/jsr.io/@std/path/1.1.2/_common/normalize_string.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize_string.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/normalize_string.ts"],"names":[],"mappings":"AAQA,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,EACZ,cAAc,EAAE,OAAO,EACvB,SAAS,EAAE,MAAM,EACjB,eAAe,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,GACzC,MAAM,CA4DR"}

package/script/deps/jsr.io/@std/path/1.1.2/_common/strip_trailing_separators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strip_trailing_separators.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/strip_trailing_separators.ts"],"names":[],"mappings":"AAKA,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,GAC/B,MAAM,CAgBR"}

package/script/deps/jsr.io/@std/path/1.1.2/_common/to_file_url.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"to_file_url.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.1.2/_common/to_file_url.ts"],"names":[],"mappings":"AAYA,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAIvD"}

package/script/deps/jsr.io/@std/path/1.1.2/basename.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"basename.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/path/1.1.2/basename.ts"],"names":[],"mappings":"AAOA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,EAAE,MAAM,SAAK,GAAG,MAAM,CAIhE"}

package/script/deps/jsr.io/@std/path/1.1.2/basename.js

@@ -0,0 +1,38 @@
+"use strict";
+// Copyright 2018-2025 the Deno authors. MIT license.
+// This module is browser compatible.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.basename = basename;
+const os_js_1 = require("../../internal/1.0.10/os.js");
+const basename_js_1 = require("./posix/basename.js");
+const basename_js_2 = require("./windows/basename.js");
+/**
+ * Return the last portion of a path.
+ *
+ * The trailing directory separators are ignored, and optional suffix is
+ * removed.
+ *
+ * @example Usage
+ * ```ts
+ * import { basename } from "@std/path/basename";
+ * import { assertEquals } from "@std/assert";
+ *
+ * if (Deno.build.os === "windows") {
+ *   assertEquals(basename("C:\\user\\Documents\\image.png"), "image.png");
+ *   assertEquals(basename(new URL("file:///C:/user/Documents/image.png")), "image.png");
+ * } else {
+ *   assertEquals(basename("/home/user/Documents/image.png"), "image.png");
+ *   assertEquals(basename(new URL("file:///home/user/Documents/image.png")), "image.png");
+ * }
+ * ```
+ *
+ * @param path Path to extract the name from.
+ * @param suffix Suffix to remove from extracted name.
+ *
+ * @returns The basename of the path.
+ */
+function basename(path, suffix = "") {
+    return os_js_1.isWindows
+        ? (0, basename_js_2.basename)(path, suffix)
+        : (0, basename_js_1.basename)(path, suffix);
+}

package/script/deps/jsr.io/@std/path/1.1.2/extname.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extname.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/path/1.1.2/extname.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,GAAG,MAAM,CAElD"}