@skmtc/core 0.0.29 → 0.0.218

package/esm/deps/jsr.io/@std/encoding/1.0.1/varint.d.ts

@@ -0,0 +1,118 @@
+/**
+ * Utilities for {@link https://protobuf.dev/programming-guides/encoding/#varints Varint} encoding
+ * of typed integers. Varint encoding represents integers using a variable number of bytes, with
+ * smaller values requiring fewer bytes.
+ *
+ * ```ts
+ * import { encodeVarint, decodeVarint } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array(10);
+ * assertEquals(
+ *   encodeVarint(42n, buf),
+ *   [new Uint8Array([42]), 1]
+ * );
+ *
+ * assertEquals(
+ *   decodeVarint(new Uint8Array([42])),
+ *   [ 42n, 1 ]
+ * );
+ * ```
+ *
+ * @module
+ */
+/**
+ * The maximum value of an unsigned 64-bit integer.
+ * Equivalent to `2n**64n - 1n`
+ */
+export declare const MaxUint64 = 18446744073709551615n;
+/**
+ * The maximum length, in bytes, of a Varint encoded 64-bit integer.
+ */
+export declare const MaxVarintLen64 = 10;
+/**
+ * The maximum length, in bytes, of a Varint encoded 32-bit integer.
+ */
+export declare const MaxVarintLen32 = 5;
+/**
+ * Given a non empty `buf`, starting at `offset` (default: 0), begin decoding bytes as
+ * Varint encoded bytes, for a maximum of 10 bytes (offset + 10). The returned
+ * tuple is of the decoded varint 32-bit number, and the new offset with which
+ * to continue decoding other data.
+ *
+ * If a `bigint` in return is undesired, the `decode32` function will return a
+ * `number`, but this should only be used in cases where the varint is
+ * _assured_ to be 32-bits. If in doubt, use `decode()`.
+ *
+ * To know how many bytes the Varint took to encode, simply negate `offset`
+ * from the returned new `offset`.
+ *
+ * @param buf The buffer to decode from.
+ * @param offset The offset to start decoding from.
+ * @returns A tuple of the decoded varint 64-bit number, and the new offset.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeVarint } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array([0x8E, 0x02]);
+ * assertEquals(decodeVarint(buf), [270n, 2]);
+ * ```
+ */
+export declare function decodeVarint(buf: Uint8Array, offset?: number): [bigint, number];
+/**
+ * Given a `buf`, starting at `offset` (default: 0), begin decoding bytes as
+ * Varint encoded bytes, for a maximum of 5 bytes (offset + 5). The returned
+ * tuple is of the decoded varint 32-bit number, and the new offset with which
+ * to continue decoding other data.
+ *
+ * Varints are _not 32-bit by default_ so this should only be used in cases
+ * where the varint is _assured_ to be 32-bits. If in doubt, use `decode()`.
+ *
+ * To know how many bytes the Varint took to encode, simply negate `offset`
+ * from the returned new `offset`.
+ *
+ * @param buf The buffer to decode from.
+ * @param offset The offset to start decoding from.
+ * @returns A tuple of the decoded varint 32-bit number, and the new offset.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeVarint32 } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array([0x8E, 0x02]);
+ * assertEquals(decodeVarint32(buf), [270, 2]);
+ * ```
+ */
+export declare function decodeVarint32(buf: Uint8Array, offset?: number): [number, number];
+/**
+ * Takes unsigned number `num` and converts it into a Varint encoded
+ * `Uint8Array`, returning a tuple consisting of a `Uint8Array` slice of the
+ * encoded Varint, and an offset where the Varint encoded bytes end within the
+ * `Uint8Array`.
+ *
+ * If `buf` is not given then a Uint8Array will be created.
+ * `offset` defaults to `0`.
+ *
+ * If passed `buf` then that will be written into, starting at `offset`. The
+ * resulting returned `Uint8Array` will be a slice of `buf`. The resulting
+ * returned number is effectively `offset + bytesWritten`.
+ *
+ * @param num The number to encode.
+ * @param buf The buffer to write into.
+ * @param offset The offset to start writing at.
+ * @returns A tuple of the encoded Varint `Uint8Array` and the new offset.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeVarint } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array(10);
+ * assertEquals(encodeVarint(42n, buf), [new Uint8Array([42]), 1]);
+ * ```
+ */
+export declare function encodeVarint(num: bigint | number, buf?: Uint8Array, offset?: number): [Uint8Array, number];
+//# sourceMappingURL=varint.d.ts.map

package/esm/deps/jsr.io/@std/encoding/1.0.1/varint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"varint.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/encoding/1.0.1/varint.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAKH;;;GAGG;AACH,eAAO,MAAM,SAAS,wBAAwB,CAAC;AAE/C;;GAEG;AACH,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC;;GAEG;AACH,eAAO,MAAM,cAAc,IAAI,CAAC;AAahC;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,MAAM,SAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA2D1E;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,UAAU,EAAE,MAAM,SAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAa5E;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,YAAY,CAC1B,GAAG,EAAE,MAAM,GAAG,MAAM,EACpB,GAAG,GAAE,UAA2C,EAChD,MAAM,SAAI,GACT,CAAC,UAAU,EAAE,MAAM,CAAC,CAiBtB"}

package/esm/deps/jsr.io/@std/encoding/1.0.1/varint.js

@@ -0,0 +1,206 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright 2020 Keith Cirkel. All rights reserved. MIT license.
+// Copyright 2023 Skye "MierenManz". All rights reserved. MIT license.
+/**
+ * Utilities for {@link https://protobuf.dev/programming-guides/encoding/#varints Varint} encoding
+ * of typed integers. Varint encoding represents integers using a variable number of bytes, with
+ * smaller values requiring fewer bytes.
+ *
+ * ```ts
+ * import { encodeVarint, decodeVarint } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array(10);
+ * assertEquals(
+ *   encodeVarint(42n, buf),
+ *   [new Uint8Array([42]), 1]
+ * );
+ *
+ * assertEquals(
+ *   decodeVarint(new Uint8Array([42])),
+ *   [ 42n, 1 ]
+ * );
+ * ```
+ *
+ * @module
+ */
+// This implementation is a port of https://deno.land/x/varint@v2.0.0 by @keithamus
+// This module is browser compatible.
+/**
+ * The maximum value of an unsigned 64-bit integer.
+ * Equivalent to `2n**64n - 1n`
+ */
+export const MaxUint64 = 18446744073709551615n;
+/**
+ * The maximum length, in bytes, of a Varint encoded 64-bit integer.
+ */
+export const MaxVarintLen64 = 10;
+/**
+ * The maximum length, in bytes, of a Varint encoded 32-bit integer.
+ */
+export const MaxVarintLen32 = 5;
+const MSB = 0x80;
+const REST = 0x7f;
+const SHIFT = 7;
+const MSBN = 0x80n;
+const SHIFTN = 7n;
+// ArrayBuffer and TypedArray's for "pointer casting"
+const AB = new ArrayBuffer(8);
+const U32_VIEW = new Uint32Array(AB);
+const U64_VIEW = new BigUint64Array(AB);
+/**
+ * Given a non empty `buf`, starting at `offset` (default: 0), begin decoding bytes as
+ * Varint encoded bytes, for a maximum of 10 bytes (offset + 10). The returned
+ * tuple is of the decoded varint 32-bit number, and the new offset with which
+ * to continue decoding other data.
+ *
+ * If a `bigint` in return is undesired, the `decode32` function will return a
+ * `number`, but this should only be used in cases where the varint is
+ * _assured_ to be 32-bits. If in doubt, use `decode()`.
+ *
+ * To know how many bytes the Varint took to encode, simply negate `offset`
+ * from the returned new `offset`.
+ *
+ * @param buf The buffer to decode from.
+ * @param offset The offset to start decoding from.
+ * @returns A tuple of the decoded varint 64-bit number, and the new offset.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeVarint } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array([0x8E, 0x02]);
+ * assertEquals(decodeVarint(buf), [270n, 2]);
+ * ```
+ */
+export function decodeVarint(buf, offset = 0) {
+    // Clear the last result from the Two's complement view
+    U64_VIEW[0] = 0n;
+    // Setup the initiat state of the function
+    let intermediate = 0;
+    let position = 0;
+    let i = offset;
+    // If the buffer is empty Throw
+    if (buf.length === 0)
+        throw new RangeError("Cannot read empty buffer");
+    let byte;
+    do {
+        // Get a single byte from the buffer
+        byte = buf[i];
+        // 1. Take the lower 7 bits of the byte.
+        // 2. Shift the bits into the correct position.
+        // 3. Bitwise OR it with the intermediate value
+        // QUIRK: in the 5th (and 10th) iteration of this loop it will overflow on the shift.
+        // This causes only the lower 4 bits to be shifted into place and removing the upper 3 bits
+        intermediate |= (byte & 0b01111111) << position;
+        // If position is 28
+        // it means that this iteration needs to be written the the two's complement view
+        // This only happens once due to the `-4` in this branch
+        if (position === 28) {
+            // Write to the view
+            U32_VIEW[0] = intermediate;
+            // set `intermediate` to the remaining 3 bits
+            // We only want the remaining three bits because the other 4 have been "consumed" on line 21
+            intermediate = (byte & 0b01110000) >>> 4;
+            // set `position` to -4 because later 7 will be added, making it 3
+            position = -4;
+        }
+        // Increment the shift position by 7
+        position += 7;
+        // Increment the iterator by 1
+        i++;
+        // Keep going while there is a continuation bit
+    } while ((byte & 0b10000000) === 0b10000000);
+    // subtract the initial offset from `i` to get the bytes read
+    const nRead = i - offset;
+    // If 10 bytes have been read and intermediate has overflown
+    // it means that the varint is malformed
+    // If 11 bytes have been read it means that the varint is malformed
+    // If `i` is bigger than the buffer it means we overread the buffer and the varint is malformed
+    if ((nRead === 10 && intermediate > -1) || nRead === 11 || i > buf.length) {
+        throw new RangeError("malformed or overflow varint");
+    }
+    // Write the intermediate value to the "empty" slot
+    // if the first slot is taken. Take the second slot
+    U32_VIEW[Number(nRead > 4)] = intermediate;
+    return [U64_VIEW[0], i];
+}
+/**
+ * Given a `buf`, starting at `offset` (default: 0), begin decoding bytes as
+ * Varint encoded bytes, for a maximum of 5 bytes (offset + 5). The returned
+ * tuple is of the decoded varint 32-bit number, and the new offset with which
+ * to continue decoding other data.
+ *
+ * Varints are _not 32-bit by default_ so this should only be used in cases
+ * where the varint is _assured_ to be 32-bits. If in doubt, use `decode()`.
+ *
+ * To know how many bytes the Varint took to encode, simply negate `offset`
+ * from the returned new `offset`.
+ *
+ * @param buf The buffer to decode from.
+ * @param offset The offset to start decoding from.
+ * @returns A tuple of the decoded varint 32-bit number, and the new offset.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeVarint32 } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array([0x8E, 0x02]);
+ * assertEquals(decodeVarint32(buf), [270, 2]);
+ * ```
+ */
+export function decodeVarint32(buf, offset = 0) {
+    let shift = 0;
+    let decoded = 0;
+    for (let i = offset; i <= Math.min(buf.length, offset + MaxVarintLen32); i += 1, shift += SHIFT) {
+        const byte = buf[i];
+        decoded += (byte & REST) * Math.pow(2, shift);
+        if (!(byte & MSB))
+            return [decoded, i + 1];
+    }
+    throw new RangeError("malformed or overflow varint");
+}
+/**
+ * Takes unsigned number `num` and converts it into a Varint encoded
+ * `Uint8Array`, returning a tuple consisting of a `Uint8Array` slice of the
+ * encoded Varint, and an offset where the Varint encoded bytes end within the
+ * `Uint8Array`.
+ *
+ * If `buf` is not given then a Uint8Array will be created.
+ * `offset` defaults to `0`.
+ *
+ * If passed `buf` then that will be written into, starting at `offset`. The
+ * resulting returned `Uint8Array` will be a slice of `buf`. The resulting
+ * returned number is effectively `offset + bytesWritten`.
+ *
+ * @param num The number to encode.
+ * @param buf The buffer to write into.
+ * @param offset The offset to start writing at.
+ * @returns A tuple of the encoded Varint `Uint8Array` and the new offset.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeVarint } from "@std/encoding/varint";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const buf = new Uint8Array(10);
+ * assertEquals(encodeVarint(42n, buf), [new Uint8Array([42]), 1]);
+ * ```
+ */
+export function encodeVarint(num, buf = new Uint8Array(MaxVarintLen64), offset = 0) {
+    num = BigInt(num);
+    if (num < 0n)
+        throw new RangeError("signed input given");
+    for (let i = offset; i <= Math.min(buf.length, MaxVarintLen64); i += 1) {
+        if (num < MSBN) {
+            buf[i] = Number(num);
+            i += 1;
+            return [buf.slice(offset, i), i];
+        }
+        buf[i] = Number((num & 0xffn) | MSBN);
+        num >>= SHIFTN;
+    }
+    throw new RangeError(`${num} overflows uint64`);
+}

package/esm/deps/jsr.io/@std/path/1.0.0/_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.0.0/_common/assert_path.ts"],"names":[],"mappings":"AAGA,wBAAgB,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,QAMvC"}

package/esm/deps/jsr.io/@std/path/1.0.0/_common/basename.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"basename.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.0.0/_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/esm/deps/jsr.io/@std/path/1.0.0/_common/common.d.ts

@@ -0,0 +1,2 @@
+export declare function common(paths: string[], sep: string): string;
+//# sourceMappingURL=common.d.ts.map

package/esm/deps/jsr.io/@std/path/1.0.0/_common/common.d.ts.map

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

package/esm/deps/jsr.io/@std/path/1.0.0/_common/common.js

@@ -0,0 +1,23 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+export function common(paths, sep) {
+    const [first = "", ...remaining] = paths;
+    const parts = first.split(sep);
+    let endOfPrefix = parts.length;
+    let append = "";
+    for (const path of remaining) {
+        const compare = path.split(sep);
+        if (compare.length <= endOfPrefix) {
+            endOfPrefix = compare.length;
+            append = "";
+        }
+        for (let i = 0; i < endOfPrefix; i++) {
+            if (compare[i] !== parts[i]) {
+                endOfPrefix = i;
+                append = i === 0 ? "" : sep;
+                break;
+            }
+        }
+    }
+    return parts.slice(0, endOfPrefix).join(sep) + append;
+}

package/esm/deps/jsr.io/@std/path/1.0.0/_common/constants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.0.0/_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/esm/deps/jsr.io/@std/path/1.0.0/_common/dirname.d.ts.map

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

package/esm/deps/jsr.io/@std/path/1.0.0/_common/format.d.ts

@@ -0,0 +1,4 @@
+import type { ParsedPath } from "../types.js";
+export declare function _format(sep: string, pathObject: Partial<ParsedPath>): string;
+export declare function assertArg(pathObject: Partial<ParsedPath>): void;
+//# sourceMappingURL=format.d.ts.map

package/esm/deps/jsr.io/@std/path/1.0.0/_common/format.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.0.0/_common/format.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAE9C,wBAAgB,OAAO,CACrB,GAAG,EAAE,MAAM,EACX,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,GAC9B,MAAM,CAQR;AAED,wBAAgB,SAAS,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,QAMxD"}

package/esm/deps/jsr.io/@std/path/1.0.0/_common/from_file_url.d.ts

@@ -0,0 +1,2 @@
+export declare function assertArg(url: URL | string): URL;
+//# sourceMappingURL=from_file_url.d.ts.map

package/esm/deps/jsr.io/@std/path/1.0.0/_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.0.0/_common/from_file_url.ts"],"names":[],"mappings":"AAGA,wBAAgB,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,MAAM,OAM1C"}

package/esm/deps/jsr.io/@std/path/1.0.0/_common/glob_to_reg_exp.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Options for {@linkcode globToRegExp}, {@linkcode joinGlobs},
+ * {@linkcode normalizeGlob} and {@linkcode expandGlob}.
+ */
+export interface GlobOptions {
+    /** Extended glob syntax.
+     * See https://www.linuxjournal.com/content/bash-extended-globbing.
+     *
+     * @default {true}
+     */
+    extended?: boolean;
+    /** Globstar syntax.
+     * See https://www.linuxjournal.com/content/globstar-new-bash-globbing-option.
+     * If false, `**` is treated like `*`.
+     *
+     * @default {true}
+     */
+    globstar?: boolean;
+    /**
+     * Whether globstar should be case-insensitive.
+     *
+     * @default {false}
+     */
+    caseInsensitive?: boolean;
+}
+export interface GlobConstants {
+    sep: string;
+    sepMaybe: string;
+    seps: string[];
+    globstar: string;
+    wildcard: string;
+    escapePrefix: string;
+}
+export declare function _globToRegExp(c: GlobConstants, glob: string, { extended, globstar: globstarOption, caseInsensitive, }?: GlobOptions): RegExp;
+//# sourceMappingURL=glob_to_reg_exp.d.ts.map

package/esm/deps/jsr.io/@std/path/1.0.0/_common/glob_to_reg_exp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"glob_to_reg_exp.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.0.0/_common/glob_to_reg_exp.ts"],"names":[],"mappings":"AAGA;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;;OAIG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAwBD,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,wBAAgB,aAAa,CAC3B,CAAC,EAAE,aAAa,EAChB,IAAI,EAAE,MAAM,EACZ,EACE,QAAe,EACf,QAAQ,EAAE,cAAqB,EAE/B,eAAuB,GACxB,GAAE,WAAgB,GAClB,MAAM,CA4NR"}

package/esm/deps/jsr.io/@std/path/1.0.0/_common/glob_to_reg_exp.js

@@ -0,0 +1,234 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+const REG_EXP_ESCAPE_CHARS = [
+    "!",
+    "$",
+    "(",
+    ")",
+    "*",
+    "+",
+    ".",
+    "=",
+    "?",
+    "[",
+    "\\",
+    "^",
+    "{",
+    "|",
+];
+const RANGE_ESCAPE_CHARS = ["-", "\\", "]"];
+export function _globToRegExp(c, glob, { extended = true, globstar: globstarOption = true, 
+// os = osType,
+caseInsensitive = false, } = {}) {
+    if (glob === "") {
+        return /(?!)/;
+    }
+    // Remove trailing separators.
+    let newLength = glob.length;
+    for (; newLength > 1 && c.seps.includes(glob[newLength - 1]); newLength--)
+        ;
+    glob = glob.slice(0, newLength);
+    let regExpString = "";
+    // Terminates correctly. Trust that `j` is incremented every iteration.
+    for (let j = 0; j < glob.length;) {
+        let segment = "";
+        const groupStack = [];
+        let inRange = false;
+        let inEscape = false;
+        let endsWithSep = false;
+        let i = j;
+        // Terminates with `i` at the non-inclusive end of the current segment.
+        for (; i < glob.length && !c.seps.includes(glob[i]); i++) {
+            if (inEscape) {
+                inEscape = false;
+                const escapeChars = (inRange
+                    ? RANGE_ESCAPE_CHARS
+                    : REG_EXP_ESCAPE_CHARS);
+                segment += escapeChars.includes(glob[i])
+                    ? `\\${glob[i]}`
+                    : glob[i];
+                continue;
+            }
+            if (glob[i] === c.escapePrefix) {
+                inEscape = true;
+                continue;
+            }
+            if (glob[i] === "[") {
+                if (!inRange) {
+                    inRange = true;
+                    segment += "[";
+                    if (glob[i + 1] === "!") {
+                        i++;
+                        segment += "^";
+                    }
+                    else if (glob[i + 1] === "^") {
+                        i++;
+                        segment += "\\^";
+                    }
+                    continue;
+                }
+                else if (glob[i + 1] === ":") {
+                    let k = i + 1;
+                    let value = "";
+                    while (glob[k + 1] !== undefined && glob[k + 1] !== ":") {
+                        value += glob[k + 1];
+                        k++;
+                    }
+                    if (glob[k + 1] === ":" && glob[k + 2] === "]") {
+                        i = k + 2;
+                        if (value === "alnum")
+                            segment += "\\dA-Za-z";
+                        else if (value === "alpha")
+                            segment += "A-Za-z";
+                        else if (value === "ascii")
+                            segment += "\x00-\x7F";
+                        else if (value === "blank")
+                            segment += "\t ";
+                        else if (value === "cntrl")
+                            segment += "\x00-\x1F\x7F";
+                        else if (value === "digit")
+                            segment += "\\d";
+                        else if (value === "graph")
+                            segment += "\x21-\x7E";
+                        else if (value === "lower")
+                            segment += "a-z";
+                        else if (value === "print")
+                            segment += "\x20-\x7E";
+                        else if (value === "punct") {
+                            segment += "!\"#$%&'()*+,\\-./:;<=>?@[\\\\\\]^_‘{|}~";
+                        }
+                        else if (value === "space")
+                            segment += "\\s\v";
+                        else if (value === "upper")
+                            segment += "A-Z";
+                        else if (value === "word")
+                            segment += "\\w";
+                        else if (value === "xdigit")
+                            segment += "\\dA-Fa-f";
+                        continue;
+                    }
+                }
+            }
+            if (glob[i] === "]" && inRange) {
+                inRange = false;
+                segment += "]";
+                continue;
+            }
+            if (inRange) {
+                segment += glob[i];
+                continue;
+            }
+            if (glob[i] === ")" && groupStack.length > 0 &&
+                groupStack[groupStack.length - 1] !== "BRACE") {
+                segment += ")";
+                const type = groupStack.pop();
+                if (type === "!") {
+                    segment += c.wildcard;
+                }
+                else if (type !== "@") {
+                    segment += type;
+                }
+                continue;
+            }
+            if (glob[i] === "|" && groupStack.length > 0 &&
+                groupStack[groupStack.length - 1] !== "BRACE") {
+                segment += "|";
+                continue;
+            }
+            if (glob[i] === "+" && extended && glob[i + 1] === "(") {
+                i++;
+                groupStack.push("+");
+                segment += "(?:";
+                continue;
+            }
+            if (glob[i] === "@" && extended && glob[i + 1] === "(") {
+                i++;
+                groupStack.push("@");
+                segment += "(?:";
+                continue;
+            }
+            if (glob[i] === "?") {
+                if (extended && glob[i + 1] === "(") {
+                    i++;
+                    groupStack.push("?");
+                    segment += "(?:";
+                }
+                else {
+                    segment += ".";
+                }
+                continue;
+            }
+            if (glob[i] === "!" && extended && glob[i + 1] === "(") {
+                i++;
+                groupStack.push("!");
+                segment += "(?!";
+                continue;
+            }
+            if (glob[i] === "{") {
+                groupStack.push("BRACE");
+                segment += "(?:";
+                continue;
+            }
+            if (glob[i] === "}" && groupStack[groupStack.length - 1] === "BRACE") {
+                groupStack.pop();
+                segment += ")";
+                continue;
+            }
+            if (glob[i] === "," && groupStack[groupStack.length - 1] === "BRACE") {
+                segment += "|";
+                continue;
+            }
+            if (glob[i] === "*") {
+                if (extended && glob[i + 1] === "(") {
+                    i++;
+                    groupStack.push("*");
+                    segment += "(?:";
+                }
+                else {
+                    const prevChar = glob[i - 1];
+                    let numStars = 1;
+                    while (glob[i + 1] === "*") {
+                        i++;
+                        numStars++;
+                    }
+                    const nextChar = glob[i + 1];
+                    if (globstarOption && numStars === 2 &&
+                        [...c.seps, undefined].includes(prevChar) &&
+                        [...c.seps, undefined].includes(nextChar)) {
+                        segment += c.globstar;
+                        endsWithSep = true;
+                    }
+                    else {
+                        segment += c.wildcard;
+                    }
+                }
+                continue;
+            }
+            segment += REG_EXP_ESCAPE_CHARS.includes(glob[i])
+                ? `\\${glob[i]}`
+                : glob[i];
+        }
+        // Check for unclosed groups or a dangling backslash.
+        if (groupStack.length > 0 || inRange || inEscape) {
+            // Parse failure. Take all characters from this segment literally.
+            segment = "";
+            for (const c of glob.slice(j, i)) {
+                segment += REG_EXP_ESCAPE_CHARS.includes(c)
+                    ? `\\${c}`
+                    : c;
+                endsWithSep = false;
+            }
+        }
+        regExpString += segment;
+        if (!endsWithSep) {
+            regExpString += i < glob.length ? c.sep : c.sepMaybe;
+            endsWithSep = true;
+        }
+        // Terminates with `i` at the start of the next segment.
+        while (c.seps.includes(glob[i]))
+            i++;
+        j = i;
+    }
+    regExpString = `^${regExpString}$`;
+    return new RegExp(regExpString, caseInsensitive ? "i" : "");
+}

package/esm/deps/jsr.io/@std/path/1.0.0/_common/normalize.d.ts.map

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

package/esm/deps/jsr.io/@std/path/1.0.0/_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.0.0/_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"}