windmill-cli 0.0.1

package/esm/deps/jsr.io/@std/path/1.0.4/windows/relative.js

@@ -0,0 +1,131 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import { CHAR_BACKWARD_SLASH } from "../_common/constants.js";
+import { resolve } from "./resolve.js";
+import { assertArgs } from "../_common/relative.js";
+/**
+ * Return the relative path from `from` to `to` based on current working directory.
+ *
+ * An example in windws, for instance:
+ *  from = 'C:\\orandea\\test\\aaa'
+ *  to = 'C:\\orandea\\impl\\bbb'
+ * The output of the function should be: '..\\..\\impl\\bbb'
+ *
+ * @example Usage
+ * ```ts
+ * import { relative } from "@std/path/windows/relative";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const relativePath = relative("C:\\foobar\\test\\aaa", "C:\\foobar\\impl\\bbb");
+ * assertEquals(relativePath, "..\\..\\impl\\bbb");
+ * ```
+ *
+ * @param from The path from which to calculate the relative path
+ * @param to The path to which to calculate the relative path
+ * @returns The relative path from `from` to `to`
+ */
+export function relative(from, to) {
+    assertArgs(from, to);
+    const fromOrig = resolve(from);
+    const toOrig = resolve(to);
+    if (fromOrig === toOrig)
+        return "";
+    from = fromOrig.toLowerCase();
+    to = toOrig.toLowerCase();
+    if (from === to)
+        return "";
+    // Trim any leading backslashes
+    let fromStart = 0;
+    let fromEnd = from.length;
+    for (; fromStart < fromEnd; ++fromStart) {
+        if (from.charCodeAt(fromStart) !== CHAR_BACKWARD_SLASH)
+            break;
+    }
+    // Trim trailing backslashes (applicable to UNC paths only)
+    for (; fromEnd - 1 > fromStart; --fromEnd) {
+        if (from.charCodeAt(fromEnd - 1) !== CHAR_BACKWARD_SLASH)
+            break;
+    }
+    const fromLen = fromEnd - fromStart;
+    // Trim any leading backslashes
+    let toStart = 0;
+    let toEnd = to.length;
+    for (; toStart < toEnd; ++toStart) {
+        if (to.charCodeAt(toStart) !== CHAR_BACKWARD_SLASH)
+            break;
+    }
+    // Trim trailing backslashes (applicable to UNC paths only)
+    for (; toEnd - 1 > toStart; --toEnd) {
+        if (to.charCodeAt(toEnd - 1) !== CHAR_BACKWARD_SLASH)
+            break;
+    }
+    const toLen = toEnd - toStart;
+    // Compare paths to find the longest common path from root
+    const length = fromLen < toLen ? fromLen : toLen;
+    let lastCommonSep = -1;
+    let i = 0;
+    for (; i <= length; ++i) {
+        if (i === length) {
+            if (toLen > length) {
+                if (to.charCodeAt(toStart + i) === CHAR_BACKWARD_SLASH) {
+                    // We get here if `from` is the exact base path for `to`.
+                    // For example: from='C:\\foo\\bar'; to='C:\\foo\\bar\\baz'
+                    return toOrig.slice(toStart + i + 1);
+                }
+                else if (i === 2) {
+                    // We get here if `from` is the device root.
+                    // For example: from='C:\\'; to='C:\\foo'
+                    return toOrig.slice(toStart + i);
+                }
+            }
+            if (fromLen > length) {
+                if (from.charCodeAt(fromStart + i) === CHAR_BACKWARD_SLASH) {
+                    // We get here if `to` is the exact base path for `from`.
+                    // For example: from='C:\\foo\\bar'; to='C:\\foo'
+                    lastCommonSep = i;
+                }
+                else if (i === 2) {
+                    // We get here if `to` is the device root.
+                    // For example: from='C:\\foo\\bar'; to='C:\\'
+                    lastCommonSep = 3;
+                }
+            }
+            break;
+        }
+        const fromCode = from.charCodeAt(fromStart + i);
+        const toCode = to.charCodeAt(toStart + i);
+        if (fromCode !== toCode)
+            break;
+        else if (fromCode === CHAR_BACKWARD_SLASH)
+            lastCommonSep = i;
+    }
+    // We found a mismatch before the first common path separator was seen, so
+    // return the original `to`.
+    if (i !== length && lastCommonSep === -1) {
+        return toOrig;
+    }
+    let out = "";
+    if (lastCommonSep === -1)
+        lastCommonSep = 0;
+    // Generate the relative path based on the path difference between `to` and
+    // `from`
+    for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {
+        if (i === fromEnd || from.charCodeAt(i) === CHAR_BACKWARD_SLASH) {
+            if (out.length === 0)
+                out += "..";
+            else
+                out += "\\..";
+        }
+    }
+    // Lastly, append the rest of the destination (`to`) path that comes after
+    // the common path parts
+    if (out.length > 0) {
+        return out + toOrig.slice(toStart + lastCommonSep, toEnd);
+    }
+    else {
+        toStart += lastCommonSep;
+        if (toOrig.charCodeAt(toStart) === CHAR_BACKWARD_SLASH)
+            ++toStart;
+        return toOrig.slice(toStart, toEnd);
+    }
+}

package/esm/deps/jsr.io/@std/path/1.0.4/windows/resolve.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Resolves path segments into a `path`.
+ *
+ * @example Usage
+ * ```ts
+ * import { resolve } from "@std/path/windows/resolve";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const resolved = resolve("C:\\foo\\bar", "..\\baz");
+ * assertEquals(resolved, "C:\\foo\\baz");
+ * ```
+ *
+ * @param pathSegments The path segments to process to path
+ * @returns The resolved path
+ */
+export declare function resolve(...pathSegments: string[]): string;
+//# sourceMappingURL=resolve.d.ts.map

package/esm/deps/jsr.io/@std/path/1.0.4/windows/resolve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.0.4/windows/resolve.ts"],"names":[],"mappings":"AAUA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,OAAO,CAAC,GAAG,YAAY,EAAE,MAAM,EAAE,GAAG,MAAM,CAwJzD"}

package/esm/deps/jsr.io/@std/path/1.0.4/windows/resolve.js

@@ -0,0 +1,154 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import * as dntShim from "../../../../../../_dnt.shims.js";
+import { CHAR_COLON } from "../_common/constants.js";
+import { normalizeString } from "../_common/normalize_string.js";
+import { assertPath } from "../_common/assert_path.js";
+import { isPathSeparator, isWindowsDeviceRoot } from "./_util.js";
+/**
+ * Resolves path segments into a `path`.
+ *
+ * @example Usage
+ * ```ts
+ * import { resolve } from "@std/path/windows/resolve";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const resolved = resolve("C:\\foo\\bar", "..\\baz");
+ * assertEquals(resolved, "C:\\foo\\baz");
+ * ```
+ *
+ * @param pathSegments The path segments to process to path
+ * @returns The resolved path
+ */
+export function resolve(...pathSegments) {
+    let resolvedDevice = "";
+    let resolvedTail = "";
+    let resolvedAbsolute = false;
+    for (let i = pathSegments.length - 1; i >= -1; i--) {
+        let path;
+        // deno-lint-ignore no-explicit-any
+        const { Deno } = dntShim.dntGlobalThis;
+        if (i >= 0) {
+            path = pathSegments[i];
+        }
+        else if (!resolvedDevice) {
+            if (typeof Deno?.cwd !== "function") {
+                throw new TypeError("Resolved a drive-letter-less path without a current working directory (CWD)");
+            }
+            path = Deno.cwd();
+        }
+        else {
+            if (typeof Deno?.env?.get !== "function" || typeof Deno?.cwd !== "function") {
+                throw new TypeError("Resolved a relative path without a current working directory (CWD)");
+            }
+            path = Deno.cwd();
+            // Verify that a cwd was found and that it actually points
+            // to our drive. If not, default to the drive's root.
+            if (path === undefined ||
+                path.slice(0, 3).toLowerCase() !== `${resolvedDevice.toLowerCase()}\\`) {
+                path = `${resolvedDevice}\\`;
+            }
+        }
+        assertPath(path);
+        const len = path.length;
+        // Skip empty entries
+        if (len === 0)
+            continue;
+        let rootEnd = 0;
+        let device = "";
+        let isAbsolute = false;
+        const code = path.charCodeAt(0);
+        // Try to match a root
+        if (len > 1) {
+            if (isPathSeparator(code)) {
+                // Possible UNC root
+                // If we started with a separator, we know we at least have an
+                // absolute path of some kind (UNC or otherwise)
+                isAbsolute = true;
+                if (isPathSeparator(path.charCodeAt(1))) {
+                    // Matched double path separator at beginning
+                    let j = 2;
+                    let last = j;
+                    // Match 1 or more non-path separators
+                    for (; j < len; ++j) {
+                        if (isPathSeparator(path.charCodeAt(j)))
+                            break;
+                    }
+                    if (j < len && j !== last) {
+                        const firstPart = path.slice(last, j);
+                        // Matched!
+                        last = j;
+                        // Match 1 or more path separators
+                        for (; j < len; ++j) {
+                            if (!isPathSeparator(path.charCodeAt(j)))
+                                break;
+                        }
+                        if (j < len && j !== last) {
+                            // Matched!
+                            last = j;
+                            // Match 1 or more non-path separators
+                            for (; j < len; ++j) {
+                                if (isPathSeparator(path.charCodeAt(j)))
+                                    break;
+                            }
+                            if (j === len) {
+                                // We matched a UNC root only
+                                device = `\\\\${firstPart}\\${path.slice(last)}`;
+                                rootEnd = j;
+                            }
+                            else if (j !== last) {
+                                // We matched a UNC root with leftovers
+                                device = `\\\\${firstPart}\\${path.slice(last, j)}`;
+                                rootEnd = j;
+                            }
+                        }
+                    }
+                }
+                else {
+                    rootEnd = 1;
+                }
+            }
+            else if (isWindowsDeviceRoot(code)) {
+                // Possible device root
+                if (path.charCodeAt(1) === CHAR_COLON) {
+                    device = path.slice(0, 2);
+                    rootEnd = 2;
+                    if (len > 2) {
+                        if (isPathSeparator(path.charCodeAt(2))) {
+                            // Treat separator following drive name as an absolute path
+                            // indicator
+                            isAbsolute = true;
+                            rootEnd = 3;
+                        }
+                    }
+                }
+            }
+        }
+        else if (isPathSeparator(code)) {
+            // `path` contains just a path separator
+            rootEnd = 1;
+            isAbsolute = true;
+        }
+        if (device.length > 0 &&
+            resolvedDevice.length > 0 &&
+            device.toLowerCase() !== resolvedDevice.toLowerCase()) {
+            // This path points to another device so it is not applicable
+            continue;
+        }
+        if (resolvedDevice.length === 0 && device.length > 0) {
+            resolvedDevice = device;
+        }
+        if (!resolvedAbsolute) {
+            resolvedTail = `${path.slice(rootEnd)}\\${resolvedTail}`;
+            resolvedAbsolute = isAbsolute;
+        }
+        if (resolvedAbsolute && resolvedDevice.length > 0)
+            break;
+    }
+    // At this point the path should be resolved to a full absolute path,
+    // but handle relative paths to be safe (might happen when Deno.cwd()
+    // fails)
+    // Normalize the tail path
+    resolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, "\\", isPathSeparator);
+    return resolvedDevice + (resolvedAbsolute ? "\\" : "") + resolvedTail || ".";
+}

package/esm/deps/jsr.io/@std/path/1.0.4/windows/to_file_url.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Converts a path string to a file URL.
+ *
+ * @example Usage
+ * ```ts
+ * import { toFileUrl } from "@std/path/windows/to-file-url";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(toFileUrl("\\home\\foo"), new URL("file:///home/foo"));
+ * assertEquals(toFileUrl("C:\\Users\\foo"), new URL("file:///C:/Users/foo"));
+ * assertEquals(toFileUrl("\\\\127.0.0.1\\home\\foo"), new URL("file://127.0.0.1/home/foo"));
+ * ```
+ * @param path The path to convert.
+ * @returns The file URL.
+ */
+export declare function toFileUrl(path: string): URL;
+//# sourceMappingURL=to_file_url.d.ts.map

package/esm/deps/jsr.io/@std/path/1.0.4/windows/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.0.4/windows/to_file_url.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAgB3C"}

package/esm/deps/jsr.io/@std/path/1.0.4/windows/to_file_url.js

@@ -0,0 +1,34 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import { encodeWhitespace } from "../_common/to_file_url.js";
+import { isAbsolute } from "./is_absolute.js";
+/**
+ * Converts a path string to a file URL.
+ *
+ * @example Usage
+ * ```ts
+ * import { toFileUrl } from "@std/path/windows/to-file-url";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(toFileUrl("\\home\\foo"), new URL("file:///home/foo"));
+ * assertEquals(toFileUrl("C:\\Users\\foo"), new URL("file:///C:/Users/foo"));
+ * assertEquals(toFileUrl("\\\\127.0.0.1\\home\\foo"), new URL("file://127.0.0.1/home/foo"));
+ * ```
+ * @param path The path to convert.
+ * @returns The file URL.
+ */
+export function toFileUrl(path) {
+    if (!isAbsolute(path)) {
+        throw new TypeError(`Path must be absolute: received "${path}"`);
+    }
+    const [, hostname, pathname] = path.match(/^(?:[/\\]{2}([^/\\]+)(?=[/\\](?:[^/\\]|$)))?(.*)/);
+    const url = new URL("file:///");
+    url.pathname = encodeWhitespace(pathname.replace(/%/g, "%25"));
+    if (hostname !== undefined && hostname !== "localhost") {
+        url.hostname = hostname;
+        if (!url.hostname) {
+            throw new TypeError(`Invalid hostname: "${url.hostname}"`);
+        }
+    }
+    return url;
+}

package/esm/deps/jsr.io/@std/path/1.0.4/windows/to_namespaced_path.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Resolves path to a namespace path
+ *
+ * @example Usage
+ * ```ts
+ * import { toNamespacedPath } from "@std/path/windows/to-namespaced-path";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const namespaced = toNamespacedPath("C:\\foo\\bar");
+ * assertEquals(namespaced, "\\\\?\\C:\\foo\\bar");
+ * ```
+ *
+ * @param path The path to resolve to namespaced path
+ * @returns The resolved namespaced path
+ */
+export declare function toNamespacedPath(path: string): string;
+//# sourceMappingURL=to_namespaced_path.d.ts.map

package/esm/deps/jsr.io/@std/path/1.0.4/windows/to_namespaced_path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"to_namespaced_path.d.ts","sourceRoot":"","sources":["../../../../../../../src/deps/jsr.io/@std/path/1.0.4/windows/to_namespaced_path.ts"],"names":[],"mappings":"AAYA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAgCrD"}

package/esm/deps/jsr.io/@std/path/1.0.4/windows/to_namespaced_path.js

@@ -0,0 +1,49 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import { CHAR_BACKWARD_SLASH, CHAR_COLON, CHAR_DOT, CHAR_QUESTION_MARK, } from "../_common/constants.js";
+import { isWindowsDeviceRoot } from "./_util.js";
+import { resolve } from "./resolve.js";
+/**
+ * Resolves path to a namespace path
+ *
+ * @example Usage
+ * ```ts
+ * import { toNamespacedPath } from "@std/path/windows/to-namespaced-path";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const namespaced = toNamespacedPath("C:\\foo\\bar");
+ * assertEquals(namespaced, "\\\\?\\C:\\foo\\bar");
+ * ```
+ *
+ * @param path The path to resolve to namespaced path
+ * @returns The resolved namespaced path
+ */
+export function toNamespacedPath(path) {
+    // Note: this will *probably* throw somewhere.
+    if (typeof path !== "string")
+        return path;
+    if (path.length === 0)
+        return "";
+    const resolvedPath = resolve(path);
+    if (resolvedPath.length >= 3) {
+        if (resolvedPath.charCodeAt(0) === CHAR_BACKWARD_SLASH) {
+            // Possible UNC root
+            if (resolvedPath.charCodeAt(1) === CHAR_BACKWARD_SLASH) {
+                const code = resolvedPath.charCodeAt(2);
+                if (code !== CHAR_QUESTION_MARK && code !== CHAR_DOT) {
+                    // Matched non-long UNC root, convert the path to a long UNC path
+                    return `\\\\?\\UNC\\${resolvedPath.slice(2)}`;
+                }
+            }
+        }
+        else if (isWindowsDeviceRoot(resolvedPath.charCodeAt(0))) {
+            // Possible device root
+            if (resolvedPath.charCodeAt(1) === CHAR_COLON &&
+                resolvedPath.charCodeAt(2) === CHAR_BACKWARD_SLASH) {
+                // Matched device root, convert the path to a long UNC path
+                return `\\\\?\\${resolvedPath}`;
+            }
+        }
+    }
+    return path;
+}

package/esm/deps/jsr.io/@std/text/1.0.0-rc.1/closest_string.d.ts

@@ -0,0 +1,29 @@
+/**
+ * The the most similar string from an array of strings.
+ *
+ * @example Usage
+ * ```ts
+ * import { closestString } from "@std/text/closest-string";
+ * import { assertEquals } from "@std/assert/assert-equals";
+ *
+ * const possibleWords = ["length", "size", "blah", "help"];
+ * const suggestion = closestString("hep", possibleWords);
+ *
+ * assertEquals(suggestion, "help");
+ * ```
+ *
+ * @param givenWord The string to measure distance against
+ * @param possibleWords The string-array that will be sorted
+ * @param options An options bag containing a `caseSensitive` flag indicating
+ * whether the distance should include case. Default is false.
+ * @returns A sorted copy of possibleWords
+ * @note
+ * the ordering of words may change with version-updates
+ * e.g. word-distance metric may change (improve)
+ * use a named-distance (e.g. levenshteinDistance) to
+ * guarantee a particular ordering
+ */
+export declare function closestString(givenWord: string, possibleWords: string[], options?: {
+    caseSensitive?: boolean;
+}): string;
+//# sourceMappingURL=closest_string.d.ts.map

package/esm/deps/jsr.io/@std/text/1.0.0-rc.1/closest_string.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"closest_string.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/text/1.0.0-rc.1/closest_string.ts"],"names":[],"mappings":"AAOA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EACjB,aAAa,EAAE,MAAM,EAAE,EACvB,OAAO,CAAC,EAAE;IACR,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB,GACA,MAAM,CAyBR"}

package/esm/deps/jsr.io/@std/text/1.0.0-rc.1/closest_string.js

@@ -0,0 +1,52 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+import { levenshteinDistance } from "./levenshtein_distance.js";
+// NOTE: this metric may change in future versions (e.g. better than levenshteinDistance)
+const getWordDistance = levenshteinDistance;
+/**
+ * The the most similar string from an array of strings.
+ *
+ * @example Usage
+ * ```ts
+ * import { closestString } from "@std/text/closest-string";
+ * import { assertEquals } from "@std/assert/assert-equals";
+ *
+ * const possibleWords = ["length", "size", "blah", "help"];
+ * const suggestion = closestString("hep", possibleWords);
+ *
+ * assertEquals(suggestion, "help");
+ * ```
+ *
+ * @param givenWord The string to measure distance against
+ * @param possibleWords The string-array that will be sorted
+ * @param options An options bag containing a `caseSensitive` flag indicating
+ * whether the distance should include case. Default is false.
+ * @returns A sorted copy of possibleWords
+ * @note
+ * the ordering of words may change with version-updates
+ * e.g. word-distance metric may change (improve)
+ * use a named-distance (e.g. levenshteinDistance) to
+ * guarantee a particular ordering
+ */
+export function closestString(givenWord, possibleWords, options) {
+    if (possibleWords.length === 0) {
+        throw new TypeError("When using closestString(), the possibleWords array must contain at least one word");
+    }
+    const { caseSensitive } = { ...options };
+    if (!caseSensitive) {
+        givenWord = givenWord.toLowerCase();
+    }
+    let nearestWord = possibleWords[0];
+    let closestStringDistance = Infinity;
+    for (const each of possibleWords) {
+        const distance = caseSensitive
+            ? getWordDistance(givenWord, each)
+            : getWordDistance(givenWord, each.toLowerCase());
+        if (distance < closestStringDistance) {
+            nearestWord = each;
+            closestStringDistance = distance;
+        }
+    }
+    // this distance metric could be swapped/improved in the future
+    return nearestWord;
+}

package/esm/deps/jsr.io/@std/text/1.0.0-rc.1/levenshtein_distance.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Calculates the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}
+ * between two strings.
+ *
+ * @example Usage
+ * ```ts
+ * import { levenshteinDistance } from "@std/text/levenshtein-distance";
+ * import { assertEquals } from "@std/assert/assert-equals";
+ *
+ * assertEquals(levenshteinDistance("aa", "bb"), 2);
+ * ```
+ * @param str1 The first string.
+ * @param str2 The second string.
+ * @returns The Levenshtein distance between the two strings.
+ */
+export declare function levenshteinDistance(str1: string, str2: string): number;
+//# sourceMappingURL=levenshtein_distance.d.ts.map

package/esm/deps/jsr.io/@std/text/1.0.0-rc.1/levenshtein_distance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"levenshtein_distance.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/text/1.0.0-rc.1/levenshtein_distance.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CA8BtE"}

package/esm/deps/jsr.io/@std/text/1.0.0-rc.1/levenshtein_distance.js

@@ -0,0 +1,40 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+/**
+ * Calculates the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}
+ * between two strings.
+ *
+ * @example Usage
+ * ```ts
+ * import { levenshteinDistance } from "@std/text/levenshtein-distance";
+ * import { assertEquals } from "@std/assert/assert-equals";
+ *
+ * assertEquals(levenshteinDistance("aa", "bb"), 2);
+ * ```
+ * @param str1 The first string.
+ * @param str2 The second string.
+ * @returns The Levenshtein distance between the two strings.
+ */
+export function levenshteinDistance(str1, str2) {
+    if (str1.length > str2.length) {
+        [str1, str2] = [str2, str1];
+    }
+    let distances = Array.from({ length: str1.length + 1 }, (_, i) => +i);
+    for (let str2Index = 0; str2Index < str2.length; str2Index++) {
+        const tempDistances = [str2Index + 1];
+        for (let str1Index = 0; str1Index < str1.length; str1Index++) {
+            const char1 = str1[str1Index];
+            const char2 = str2[str2Index];
+            if (char1 === char2) {
+                tempDistances.push(distances[str1Index]);
+            }
+            else {
+                tempDistances.push(1 +
+                    Math.min(distances[str1Index], distances[str1Index + 1], tempDistances.at(-1)));
+            }
+        }
+        distances = tempDistances;
+    }
+    return distances.at(-1);
+}

package/esm/deps/jsr.io/@std/yaml/1.0.5/_chars.d.ts

@@ -0,0 +1,33 @@
+export declare const BOM = 65279;
+export declare const TAB = 9;
+export declare const LINE_FEED = 10;
+export declare const CARRIAGE_RETURN = 13;
+export declare const SPACE = 32;
+export declare const EXCLAMATION = 33;
+export declare const DOUBLE_QUOTE = 34;
+export declare const SHARP = 35;
+export declare const PERCENT = 37;
+export declare const AMPERSAND = 38;
+export declare const SINGLE_QUOTE = 39;
+export declare const ASTERISK = 42;
+export declare const PLUS = 43;
+export declare const COMMA = 44;
+export declare const MINUS = 45;
+export declare const DOT = 46;
+export declare const COLON = 58;
+export declare const SMALLER_THAN = 60;
+export declare const GREATER_THAN = 62;
+export declare const QUESTION = 63;
+export declare const COMMERCIAL_AT = 64;
+export declare const LEFT_SQUARE_BRACKET = 91;
+export declare const BACKSLASH = 92;
+export declare const RIGHT_SQUARE_BRACKET = 93;
+export declare const GRAVE_ACCENT = 96;
+export declare const LEFT_CURLY_BRACKET = 123;
+export declare const VERTICAL_LINE = 124;
+export declare const RIGHT_CURLY_BRACKET = 125;
+export declare function isEOL(c: number): boolean;
+export declare function isWhiteSpace(c: number): boolean;
+export declare function isWhiteSpaceOrEOL(c: number): boolean;
+export declare function isFlowIndicator(c: number): boolean;
+//# sourceMappingURL=_chars.d.ts.map

package/esm/deps/jsr.io/@std/yaml/1.0.5/_chars.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_chars.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/yaml/1.0.5/_chars.ts"],"names":[],"mappings":"AAKA,eAAO,MAAM,GAAG,QAAS,CAAC;AAC1B,eAAO,MAAM,GAAG,IAAO,CAAC;AACxB,eAAO,MAAM,SAAS,KAAO,CAAC;AAC9B,eAAO,MAAM,eAAe,KAAO,CAAC;AACpC,eAAO,MAAM,KAAK,KAAO,CAAC;AAC1B,eAAO,MAAM,WAAW,KAAO,CAAC;AAChC,eAAO,MAAM,YAAY,KAAO,CAAC;AACjC,eAAO,MAAM,KAAK,KAAO,CAAC;AAC1B,eAAO,MAAM,OAAO,KAAO,CAAC;AAC5B,eAAO,MAAM,SAAS,KAAO,CAAC;AAC9B,eAAO,MAAM,YAAY,KAAO,CAAC;AACjC,eAAO,MAAM,QAAQ,KAAO,CAAC;AAC7B,eAAO,MAAM,IAAI,KAAO,CAAC;AACzB,eAAO,MAAM,KAAK,KAAO,CAAC;AAC1B,eAAO,MAAM,KAAK,KAAO,CAAC;AAC1B,eAAO,MAAM,GAAG,KAAO,CAAC;AACxB,eAAO,MAAM,KAAK,KAAO,CAAC;AAC1B,eAAO,MAAM,YAAY,KAAO,CAAC;AACjC,eAAO,MAAM,YAAY,KAAO,CAAC;AACjC,eAAO,MAAM,QAAQ,KAAO,CAAC;AAC7B,eAAO,MAAM,aAAa,KAAO,CAAC;AAClC,eAAO,MAAM,mBAAmB,KAAO,CAAC;AACxC,eAAO,MAAM,SAAS,KAAO,CAAC;AAC9B,eAAO,MAAM,oBAAoB,KAAO,CAAC;AACzC,eAAO,MAAM,YAAY,KAAO,CAAC;AACjC,eAAO,MAAM,kBAAkB,MAAO,CAAC;AACvC,eAAO,MAAM,aAAa,MAAO,CAAC;AAClC,eAAO,MAAM,mBAAmB,MAAO,CAAC;AAExC,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAExC;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAE/C;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAEpD;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAQlD"}