inray 0.0.7 → 0.0.9

package/dist/semver/try_parse_range.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+import type { Range } from './types.ts';
+/**
+ * Parses the given range string and returns a Range object. If the range string
+ * is invalid, `undefined` is returned.
+ *
+ * @example Usage
+ * ```ts
+ * import { tryParseRange } from "inray/semver";
+ *
+ * tryParseRange(">=1.2.3 <1.2.4");
+ * // [
+ * //  [
+ * //    { operator: ">=", major: 1, minor: 2, patch: 3, prerelease: [], build: [] },
+ * //    { operator: "<", major: 1, minor: 2, patch: 4, prerelease: [], build: [] }
+ * //  ]
+ * // ]
+ * ```
+ *
+ * @param value The range string
+ * @returns A Range object if valid otherwise `undefined`
+ */
+export declare function tryParseRange(value: string): Range | undefined;
+//# sourceMappingURL=try_parse_range.d.ts.map

package/dist/semver/try_parse_range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"try_parse_range.d.ts","sourceRoot":"","sources":["../../src/semver/try_parse_range.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAIL,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAGxC;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,GAAG,SAAS,CAQ9D"}

package/dist/semver/try_parse_range.js

@@ -0,0 +1,40 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+import { parseRange } from "./parse_range.js";
+/**
+ * Parses the given range string and returns a Range object. If the range string
+ * is invalid, `undefined` is returned.
+ *
+ * @example Usage
+ * ```ts
+ * import { tryParseRange } from "inray/semver";
+ *
+ * tryParseRange(">=1.2.3 <1.2.4");
+ * // [
+ * //  [
+ * //    { operator: ">=", major: 1, minor: 2, patch: 3, prerelease: [], build: [] },
+ * //    { operator: "<", major: 1, minor: 2, patch: 4, prerelease: [], build: [] }
+ * //  ]
+ * // ]
+ * ```
+ *
+ * @param value The range string
+ * @returns A Range object if valid otherwise `undefined`
+ */
+export function tryParseRange(value) {
+    try {
+        // Return '*' instead of '' so that truthiness works.
+        // This will throw if it's invalid anyway
+        return parseRange(value);
+    }
+    catch {
+        return undefined;
+    }
+}
+//# sourceMappingURL=try_parse_range.js.map

package/dist/semver/try_parse_range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"try_parse_range.js","sourceRoot":"","sources":["../../src/semver/try_parse_range.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAKL,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,IAAI,CAAC;QACH,qDAAqD;QACrD,yCAAyC;QACzC,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC"}

package/dist/semver/types.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * The possible release types are used as an operator for the
+ * increment function and as a result of the difference function.
+ */
+export type ReleaseType = 'pre' | 'major' | 'premajor' | 'minor' | 'preminor' | 'patch' | 'prepatch' | 'prerelease';
+/**
+ * SemVer comparison operators.
+ */
+export type Operator = undefined | '=' | '!=' | '>' | '>=' | '<' | '<=';
+/**
+ * The shape of a valid SemVer comparator.
+ *
+ * @example Usage
+ * ```ts
+ * import type { Comparator } from "inray/semver";
+ *
+ * const comparator: Comparator = {
+ *   operator: ">",
+ *   major: 1,
+ *   minor: 2,
+ *   patch: 3,
+ * }
+ * ```
+ */
+export interface Comparator extends SemVer {
+    /** The operator */
+    operator?: Operator;
+}
+/**
+ * A SemVer object parsed into its constituent parts.
+ */
+export interface SemVer {
+    /** The major version */
+    major: number;
+    /** The minor version */
+    minor: number;
+    /** The patch version */
+    patch: number;
+    /**
+     * The prerelease version
+     *
+     * @default {[]}
+     */
+    prerelease?: (string | number)[];
+    /**
+     * The build metadata
+     *
+     * @default {[]}
+     */
+    build?: string[];
+}
+/**
+ * A type representing a semantic version range. The ranges consist of
+ * a nested array, which represents a set of OR comparisons while the
+ * inner array represents AND comparisons.
+ */
+export type Range = Comparator[][];
+//# sourceMappingURL=types.d.ts.map

package/dist/semver/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/semver/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAIL;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG,KAAK,GAAG,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,UAAU,GAAG,YAAY,CAAC;AAEpH;;GAEG;AACH,MAAM,MAAM,QAAQ,GAChB,SAAS,GACT,GAAG,GAEH,IAAI,GACJ,GAAG,GACH,IAAI,GACJ,GAAG,GACH,IAAI,CAAC;AAET;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,UAAW,SAAQ,MAAM;IACxC,mBAAmB;IACnB,QAAQ,CAAC,EAAE,QAAQ,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,MAAM;IACrB,wBAAwB;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,wBAAwB;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,wBAAwB;IACxB,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,UAAU,CAAC,EAAE,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC;IACjC;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;;GAIG;AACH,MAAM,MAAM,KAAK,GAAG,UAAU,EAAE,EAAE,CAAC"}

package/dist/semver/types.js

@@ -0,0 +1,10 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+export {};
+//# sourceMappingURL=types.js.map

package/dist/semver/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/semver/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK"}

package/dist/text/_util.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+export declare function splitToWords(input: string): [] | RegExpMatchArray;
+export declare function capitalizeWord(word: string): string;
+//# sourceMappingURL=_util.d.ts.map

package/dist/text/_util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_util.d.ts","sourceRoot":"","sources":["../../src/text/_util.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAaL,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,yBAEzC;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEnD"}

package/dist/text/_util.js

@@ -0,0 +1,21 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+const CAPITALIZED_WORD_REGEXP = /\p{Lu}\p{Ll}+/u; // e.g. Apple
+const ACRONYM_REGEXP = /\p{Lu}+(?=(\p{Lu}\p{Ll})|\P{L}|\b)/u; // e.g. ID, URL, handles an acronym followed by a capitalized word e.g. HTMLElement
+const LOWERCASED_WORD_REGEXP = /(\p{Ll}+)/u; // e.g. apple
+const ANY_LETTERS_REGEXP = /\p{L}+/u; // will match any sequence of letters, including in languages without a concept of upper/lower case
+const DIGITS_REGEXP = /\p{N}+/u; // e.g. 123
+const WORD_OR_NUMBER_REGEXP = new RegExp(`${CAPITALIZED_WORD_REGEXP.source}|${ACRONYM_REGEXP.source}|${LOWERCASED_WORD_REGEXP.source}|${ANY_LETTERS_REGEXP.source}|${DIGITS_REGEXP.source}`, 'gu');
+export function splitToWords(input) {
+    return input.match(WORD_OR_NUMBER_REGEXP) ?? [];
+}
+export function capitalizeWord(word) {
+    return word ? word[0].toUpperCase() + word.slice(1).toLowerCase() : word;
+}
+//# sourceMappingURL=_util.js.map

package/dist/text/_util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_util.js","sourceRoot":"","sources":["../../src/text/_util.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,MAAM,uBAAuB,GAAG,gBAAgB,CAAC,CAAC,aAAa;AAC/D,MAAM,cAAc,GAAG,qCAAqC,CAAC,CAAC,mFAAmF;AACjJ,MAAM,sBAAsB,GAAG,YAAY,CAAC,CAAC,aAAa;AAC1D,MAAM,kBAAkB,GAAG,SAAS,CAAC,CAAC,mGAAmG;AACzI,MAAM,aAAa,GAAG,SAAS,CAAC,CAAC,WAAW;AAE5C,MAAM,qBAAqB,GAAG,IAAI,MAAM,CACtC,GAAG,uBAAuB,CAAC,MAAM,IAAI,cAAc,CAAC,MAAM,IAAI,sBAAsB,CAAC,MAAM,IAAI,kBAAkB,CAAC,MAAM,IAAI,aAAa,CAAC,MAAM,EAAE,EAClJ,IAAI,CACL,CAAC;AAEF,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,OAAO,KAAK,CAAC,KAAK,CAAC,qBAAqB,CAAC,IAAI,EAAE,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5E,CAAC"}

package/dist/text/closest_string.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/** Options for {@linkcode closestString}. */
+export interface ClosestStringOptions {
+    /**
+     * Whether the distance should include case.
+     *
+     * @default {false}
+     */
+    caseSensitive?: boolean;
+    /**
+     * A custom comparison function to use for comparing strings.
+     *
+     * @param a The first string for comparison.
+     * @param b The second string for comparison.
+     * @returns The distance between the two strings.
+     * @default {levenshteinDistance}
+     */
+    compareFn?: (a: string, b: string) => number;
+}
+/**
+ * Finds the most similar string from an array of strings.
+ *
+ * By default, calculates the distance between words using the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}.
+ *
+ * @example Usage
+ * ```ts
+ * import { closestString } from "inray/text";
+ *
+ * const possibleWords = ["length", "size", "blah", "help"];
+ * const suggestion = closestString("hep", possibleWords);
+ *
+ * console.log(suggestion); // "help"
+ * ```
+ *
+ * @param givenWord The string to measure distance against
+ * @param possibleWords The string-array to pick the closest string from
+ * @param options The options for the comparison.
+ * @returns The closest string
+ */
+export declare function closestString(givenWord: string, possibleWords: ReadonlyArray<string>, options?: ClosestStringOptions): string;
+//# sourceMappingURL=closest_string.d.ts.map

package/dist/text/closest_string.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"closest_string.d.ts","sourceRoot":"","sources":["../../src/text/closest_string.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAKL,6CAA6C;AAC7C,MAAM,WAAW,oBAAoB;IACnC;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;CAC9C;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EACjB,aAAa,EAAE,aAAa,CAAC,MAAM,CAAC,EACpC,OAAO,CAAC,EAAE,oBAAoB,GAC7B,MAAM,CAoBR"}

package/dist/text/closest_string.js

@@ -0,0 +1,51 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+// This module is browser compatible.
+import { levenshteinDistance } from "./levenshtein_distance.js";
+/**
+ * Finds the most similar string from an array of strings.
+ *
+ * By default, calculates the distance between words using the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}.
+ *
+ * @example Usage
+ * ```ts
+ * import { closestString } from "inray/text";
+ *
+ * const possibleWords = ["length", "size", "blah", "help"];
+ * const suggestion = closestString("hep", possibleWords);
+ *
+ * console.log(suggestion); // "help"
+ * ```
+ *
+ * @param givenWord The string to measure distance against
+ * @param possibleWords The string-array to pick the closest string from
+ * @param options The options for the comparison.
+ * @returns The closest string
+ */
+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, compareFn = levenshteinDistance } = { ...options };
+    if (!caseSensitive) {
+        givenWord = givenWord.toLowerCase();
+    }
+    let nearestWord = possibleWords[0];
+    let closestStringDistance = Infinity;
+    for (const each of possibleWords) {
+        const distance = caseSensitive ? compareFn(givenWord, each) : compareFn(givenWord, each.toLowerCase());
+        if (distance < closestStringDistance) {
+            nearestWord = each;
+            closestStringDistance = distance;
+        }
+    }
+    return nearestWord;
+}
+//# sourceMappingURL=closest_string.js.map

package/dist/text/closest_string.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"closest_string.js","sourceRoot":"","sources":["../../src/text/closest_string.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AACrC,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAqBhE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,aAAa,CAC3B,SAAiB,EACjB,aAAoC,EACpC,OAA8B;IAE9B,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,SAAS,CAAC,oFAAoF,CAAC,CAAC;IAC5G,CAAC;IACD,MAAM,EAAE,aAAa,EAAE,SAAS,GAAG,mBAAmB,EAAE,GAAG,EAAE,GAAG,OAAO,EAAE,CAAC;IAE1E,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,SAAS,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACtC,CAAC;IAED,IAAI,WAAW,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC;IACpC,IAAI,qBAAqB,GAAG,QAAQ,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACvG,IAAI,QAAQ,GAAG,qBAAqB,EAAE,CAAC;YACrC,WAAW,GAAG,IAAI,CAAC;YACnB,qBAAqB,GAAG,QAAQ,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC"}

package/dist/text/compare_similarity.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/** Options for {@linkcode compareSimilarity}. */
+export interface CompareSimilarityOptions {
+    /**
+     * Whether the distance should include case.
+     *
+     * @default {false}
+     */
+    caseSensitive?: boolean;
+    /**
+     * A custom comparison function to use for comparing strings.
+     *
+     * @param a The first string for comparison.
+     * @param b The second string for comparison.
+     * @returns The distance between the two strings.
+     * @default {levenshteinDistance}
+     */
+    compareFn?: (a: string, b: string) => number;
+}
+/**
+ * Takes a string and generates a comparator function to determine which of two
+ * strings is more similar to the given one.
+ *
+ * By default, calculates the distance between words using the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}.
+ *
+ * @param givenWord The string to measure distance against.
+ * @param options Options for the sort.
+ * @returns The difference in distance. This will be a negative number if `a`
+ * is more similar to `givenWord` than `b`, a positive number if `b` is more
+ * similar, or `0` if they are equally similar.
+ *
+ * @example Usage
+ *
+ * Most-similar words will be at the start of the array.
+ *
+ * ```ts
+ * import { compareSimilarity } from "inray/text";
+ *
+ * const words = ["hi", "hello", "help"];
+ * const sortedWords = words.toSorted(compareSimilarity("hep"));
+ *
+ * console.log(sortedWords); // ["help", "hi", "hello"]
+ * ```
+ */
+export declare function compareSimilarity(givenWord: string, options?: CompareSimilarityOptions): (a: string, b: string) => number;
+//# sourceMappingURL=compare_similarity.d.ts.map

package/dist/text/compare_similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare_similarity.d.ts","sourceRoot":"","sources":["../../src/text/compare_similarity.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAKL,iDAAiD;AACjD,MAAM,WAAW,wBAAwB;IACvC;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;CAC9C;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE,wBAAwB,GACjC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAOlC"}

package/dist/text/compare_similarity.js

@@ -0,0 +1,45 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+// This module is browser compatible.
+import { levenshteinDistance } from "./levenshtein_distance.js";
+/**
+ * Takes a string and generates a comparator function to determine which of two
+ * strings is more similar to the given one.
+ *
+ * By default, calculates the distance between words using the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}.
+ *
+ * @param givenWord The string to measure distance against.
+ * @param options Options for the sort.
+ * @returns The difference in distance. This will be a negative number if `a`
+ * is more similar to `givenWord` than `b`, a positive number if `b` is more
+ * similar, or `0` if they are equally similar.
+ *
+ * @example Usage
+ *
+ * Most-similar words will be at the start of the array.
+ *
+ * ```ts
+ * import { compareSimilarity } from "inray/text";
+ *
+ * const words = ["hi", "hello", "help"];
+ * const sortedWords = words.toSorted(compareSimilarity("hep"));
+ *
+ * console.log(sortedWords); // ["help", "hi", "hello"]
+ * ```
+ */
+export function compareSimilarity(givenWord, options) {
+    const { compareFn = levenshteinDistance } = { ...options };
+    if (options?.caseSensitive) {
+        return (a, b) => compareFn(givenWord, a) - compareFn(givenWord, b);
+    }
+    givenWord = givenWord.toLowerCase();
+    return (a, b) => compareFn(givenWord, a.toLowerCase()) - compareFn(givenWord, b.toLowerCase());
+}
+//# sourceMappingURL=compare_similarity.js.map

package/dist/text/compare_similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare_similarity.js","sourceRoot":"","sources":["../../src/text/compare_similarity.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AACrC,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAqBhE;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAiB,EACjB,OAAkC;IAElC,MAAM,EAAE,SAAS,GAAG,mBAAmB,EAAE,GAAG,EAAE,GAAG,OAAO,EAAE,CAAC;IAC3D,IAAI,OAAO,EAAE,aAAa,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACrF,CAAC;IACD,SAAS,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACpC,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AACjH,CAAC"}

package/dist/text/levenshtein_distance.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * Calculates the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}
+ * between two strings.
+ *
+ * > [!NOTE]
+ * > The complexity of this function is O(m * n), where m and n are the lengths
+ * > of the two strings. It's recommended to limit the length and validate input
+ * > if arbitrarily accepting input.
+ *
+ * @example Usage
+ * ```ts
+ * import { levenshteinDistance } from "inray/text";
+ *
+ * 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/dist/text/levenshtein_distance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"levenshtein_distance.d.ts","sourceRoot":"","sources":["../../src/text/levenshtein_distance.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAoGL;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAWtE"}

package/dist/text/levenshtein_distance.js

@@ -0,0 +1,134 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+// This module is browser compatible.
+const { ceil } = Math;
+// This implements Myers' bit-vector algorithm as described here:
+// https://dl.acm.org/doi/pdf/10.1145/316542.316550
+const peq = new Uint32Array(0x110000);
+function myers32(t, p) {
+    const n = t.length;
+    const m = p.length;
+    for (let i = 0; i < m; i++) {
+        peq[p[i].codePointAt(0)] |= 1 << i;
+    }
+    const last = m - 1;
+    let pv = -1;
+    let mv = 0;
+    let score = m;
+    for (let j = 0; j < n; j++) {
+        const eq = peq[t[j].codePointAt(0)];
+        const xv = eq | mv;
+        const xh = (((eq & pv) + pv) ^ pv) | eq;
+        let ph = mv | ~(xh | pv);
+        let mh = pv & xh;
+        score += ((ph >>> last) & 1) - ((mh >>> last) & 1);
+        // Set the horizontal delta in the first row to +1
+        // because we are computing the distance between two full strings.
+        ph = (ph << 1) | 1;
+        mh = mh << 1;
+        pv = mh | ~(xv | ph);
+        mv = ph & xv;
+    }
+    for (let i = 0; i < m; i++) {
+        peq[p[i].codePointAt(0)] = 0;
+    }
+    return score;
+}
+function myersX(t, p) {
+    const n = t.length;
+    const m = p.length;
+    // Initialize the horizontal deltas to +1.
+    const h = new Int8Array(n).fill(1);
+    const bmax = ceil(m / 32) - 1;
+    // Process the blocks row by row so that we can use the fixed-size peq array.
+    for (let b = 0; b < bmax; b++) {
+        const start = b * 32;
+        const end = (b + 1) * 32;
+        for (let i = start; i < end; i++) {
+            peq[p[i].codePointAt(0)] |= 1 << i;
+        }
+        let pv = -1;
+        let mv = 0;
+        for (let j = 0; j < n; j++) {
+            const hin = h[j];
+            let eq = peq[t[j].codePointAt(0)];
+            const xv = eq | mv;
+            eq |= hin >>> 31;
+            const xh = (((eq & pv) + pv) ^ pv) | eq;
+            let ph = mv | ~(xh | pv);
+            let mh = pv & xh;
+            h[j] = (ph >>> 31) - (mh >>> 31);
+            ph = (ph << 1) | (-hin >>> 31);
+            mh = (mh << 1) | (hin >>> 31);
+            pv = mh | ~(xv | ph);
+            mv = ph & xv;
+        }
+        for (let i = start; i < end; i++) {
+            peq[p[i].codePointAt(0)] = 0;
+        }
+    }
+    const start = bmax * 32;
+    for (let i = start; i < m; i++) {
+        peq[p[i].codePointAt(0)] |= 1 << i;
+    }
+    const last = m - 1;
+    let pv = -1;
+    let mv = 0;
+    let score = m;
+    for (let j = 0; j < n; j++) {
+        const hin = h[j];
+        let eq = peq[t[j].codePointAt(0)];
+        const xv = eq | mv;
+        eq |= hin >>> 31;
+        const xh = (((eq & pv) + pv) ^ pv) | eq;
+        let ph = mv | ~(xh | pv);
+        let mh = pv & xh;
+        score += ((ph >>> last) & 1) - ((mh >>> last) & 1);
+        ph = (ph << 1) | (-hin >>> 31);
+        mh = (mh << 1) | (hin >>> 31);
+        pv = mh | ~(xv | ph);
+        mv = ph & xv;
+    }
+    for (let i = start; i < m; i++) {
+        peq[p[i].codePointAt(0)] = 0;
+    }
+    return score;
+}
+/**
+ * Calculates the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}
+ * between two strings.
+ *
+ * > [!NOTE]
+ * > The complexity of this function is O(m * n), where m and n are the lengths
+ * > of the two strings. It's recommended to limit the length and validate input
+ * > if arbitrarily accepting input.
+ *
+ * @example Usage
+ * ```ts
+ * import { levenshteinDistance } from "inray/text";
+ *
+ * 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) {
+    let t = [...str1];
+    let p = [...str2];
+    if (t.length < p.length) {
+        [p, t] = [t, p];
+    }
+    if (p.length === 0) {
+        return t.length;
+    }
+    return p.length <= 32 ? myers32(t, p) : myersX(t, p);
+}
+//# sourceMappingURL=levenshtein_distance.js.map

package/dist/text/levenshtein_distance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"levenshtein_distance.js","sourceRoot":"","sources":["../../src/text/levenshtein_distance.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AACrC,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAEtB,iEAAiE;AACjE,mDAAmD;AACnD,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;AAEtC,SAAS,OAAO,CAAC,CAAW,EAAE,CAAW;IACvC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACZ,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAE,CAAC;QACvC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QACxC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACzB,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,kDAAkD;QAClD,kEAAkE;QAClE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnB,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACb,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACrB,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,MAAM,CAAC,CAAW,EAAE,CAAW;IACtC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,0CAA0C;IAC1C,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC9B,6EAA6E;IAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAE,CAAC;YACrC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YACnB,EAAE,IAAI,GAAG,KAAK,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;YACxC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACzB,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YACjB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YACjC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAC/B,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAC9B,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACrB,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACf,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACZ,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAE,CAAC;QACrC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,EAAE,IAAI,GAAG,KAAK,EAAE,CAAC;QACjB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QACxC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACzB,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QAC/B,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QAC9B,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACrB,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY,EAAE,IAAY;IAC5D,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAElB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACxB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC,MAAM,CAAC;IAClB,CAAC;IACD,OAAO,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,CAAC"}

package/dist/text/mod.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * Utility functions for working with text.
+ *
+ * ```ts
+ * import { toCamelCase, compareSimilarity } from "inray/text";
+ *
+ * toCamelCase("snake_case"); // "snakeCase"
+ *
+ * const words = ["hi", "help", "hello"];
+ *
+ * // Words most similar to "hep" will be at the front
+ * words.sort(compareSimilarity("hep")); // ["help", "hi", "hello"]
+ * ```
+ *
+ * @module
+ */
+export * from './levenshtein_distance.ts';
+export * from './closest_string.ts';
+export * from './compare_similarity.ts';
+export * from './word_similarity_sort.ts';
+export * from './to_camel_case.ts';
+export * from './to_kebab_case.ts';
+export * from './to_pascal_case.ts';
+export * from './to_snake_case.ts';
+export * from './truncate.ts';
+//# sourceMappingURL=mod.d.ts.map

package/dist/text/mod.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../../src/text/mod.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAIL;;;;;;;;;;;;;;;GAeG;AAEH,cAAc,2BAA2B,CAAC;AAC1C,cAAc,qBAAqB,CAAC;AACpC,cAAc,yBAAyB,CAAC;AACxC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AACnC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,eAAe,CAAC"}