inray 0.0.7 → 0.0.8

package/dist/text/mod.js

@@ -0,0 +1,35 @@
+/**
+ * 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.
+/**
+ * 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.js";
+export * from "./closest_string.js";
+export * from "./compare_similarity.js";
+export * from "./word_similarity_sort.js";
+export * from "./to_camel_case.js";
+export * from "./to_kebab_case.js";
+export * from "./to_pascal_case.js";
+export * from "./to_snake_case.js";
+export * from "./truncate.js";
+//# sourceMappingURL=mod.js.map

package/dist/text/mod.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.js","sourceRoot":"","sources":["../../src/text/mod.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AAErC;;;;;;;;;;;;;;;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"}

package/dist/text/to_camel_case.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * Converts a string into camelCase.
+ *
+ * @example Usage
+ * ```ts
+ * import { toCamelCase } from "inray/text";
+ *
+ * toCamelCase("deno is awesome"); // "denoIsAwesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into camelCase
+ * @returns The string as camelCase
+ */
+export declare function toCamelCase(input: string): string;
+//# sourceMappingURL=to_camel_case.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"to_camel_case.d.ts","sourceRoot":"","sources":["../../src/text/to_camel_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAML;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAIjD"}

package/dist/text/to_camel_case.js

@@ -0,0 +1,29 @@
+/**
+ * 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 { capitalizeWord, splitToWords } from "./_util.js";
+/**
+ * Converts a string into camelCase.
+ *
+ * @example Usage
+ * ```ts
+ * import { toCamelCase } from "inray/text";
+ *
+ * toCamelCase("deno is awesome"); // "denoIsAwesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into camelCase
+ * @returns The string as camelCase
+ */
+export function toCamelCase(input) {
+    input = input.trim();
+    const [first = '', ...rest] = splitToWords(input);
+    return [first.toLowerCase(), ...rest.map(capitalizeWord)].join('');
+}
+//# sourceMappingURL=to_camel_case.js.map

package/dist/text/to_camel_case.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to_camel_case.js","sourceRoot":"","sources":["../../src/text/to_camel_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AAErC,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1D;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa;IACvC,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACrB,MAAM,CAAC,KAAK,GAAG,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IAClD,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACrE,CAAC"}

package/dist/text/to_kebab_case.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * Converts a string into kebab-case.
+ *
+ * @example Usage
+ * ```ts
+ * import { toKebabCase } from "inray/text";
+ *
+ * toKebabCase("deno is awesome"); // "deno-is-awesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into kebab-case
+ * @returns The string as kebab-case
+ */
+export declare function toKebabCase(input: string): string;
+//# sourceMappingURL=to_kebab_case.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"to_kebab_case.d.ts","sourceRoot":"","sources":["../../src/text/to_kebab_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAML;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGjD"}

package/dist/text/to_kebab_case.js

@@ -0,0 +1,28 @@
+/**
+ * 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 { splitToWords } from "./_util.js";
+/**
+ * Converts a string into kebab-case.
+ *
+ * @example Usage
+ * ```ts
+ * import { toKebabCase } from "inray/text";
+ *
+ * toKebabCase("deno is awesome"); // "deno-is-awesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into kebab-case
+ * @returns The string as kebab-case
+ */
+export function toKebabCase(input) {
+    input = input.trim();
+    return splitToWords(input).join('-').toLowerCase();
+}
+//# sourceMappingURL=to_kebab_case.js.map

package/dist/text/to_kebab_case.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to_kebab_case.js","sourceRoot":"","sources":["../../src/text/to_kebab_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AAErC,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1C;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa;IACvC,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACrB,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;AACrD,CAAC"}

package/dist/text/to_pascal_case.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * Converts a string into PascalCase.
+ *
+ * @example Usage
+ * ```ts
+ * import { toPascalCase } from "inray/text";
+ *
+ * toPascalCase("deno is awesome"); // "DenoIsAwesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into PascalCase
+ * @returns The string as PascalCase
+ */
+export declare function toPascalCase(input: string): string;
+//# sourceMappingURL=to_pascal_case.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"to_pascal_case.d.ts","sourceRoot":"","sources":["../../src/text/to_pascal_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAML;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGlD"}

package/dist/text/to_pascal_case.js

@@ -0,0 +1,28 @@
+/**
+ * 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 { capitalizeWord, splitToWords } from "./_util.js";
+/**
+ * Converts a string into PascalCase.
+ *
+ * @example Usage
+ * ```ts
+ * import { toPascalCase } from "inray/text";
+ *
+ * toPascalCase("deno is awesome"); // "DenoIsAwesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into PascalCase
+ * @returns The string as PascalCase
+ */
+export function toPascalCase(input) {
+    input = input.trim();
+    return splitToWords(input).map(capitalizeWord).join('');
+}
+//# sourceMappingURL=to_pascal_case.js.map

package/dist/text/to_pascal_case.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to_pascal_case.js","sourceRoot":"","sources":["../../src/text/to_pascal_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AAErC,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1D;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACrB,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC1D,CAAC"}

package/dist/text/to_snake_case.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * Converts a string into snake_case.
+ *
+ * @example Usage
+ * ```ts
+ * import { toSnakeCase } from "inray/text";
+ *
+ * toSnakeCase("deno is awesome"); // "deno_is_awesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into snake_case
+ * @returns The string as snake_case
+ */
+export declare function toSnakeCase(input: string): string;
+//# sourceMappingURL=to_snake_case.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"to_snake_case.d.ts","sourceRoot":"","sources":["../../src/text/to_snake_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAML;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGjD"}

package/dist/text/to_snake_case.js

@@ -0,0 +1,28 @@
+/**
+ * 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 { splitToWords } from "./_util.js";
+/**
+ * Converts a string into snake_case.
+ *
+ * @example Usage
+ * ```ts
+ * import { toSnakeCase } from "inray/text";
+ *
+ * toSnakeCase("deno is awesome"); // "deno_is_awesome"
+ * ```
+ *
+ * @param input The string that is going to be converted into snake_case
+ * @returns The string as snake_case
+ */
+export function toSnakeCase(input) {
+    input = input.trim();
+    return splitToWords(input).join('_').toLowerCase();
+}
+//# sourceMappingURL=to_snake_case.js.map

package/dist/text/to_snake_case.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to_snake_case.js","sourceRoot":"","sources":["../../src/text/to_snake_case.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AAErC,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE1C;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa;IACvC,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACrB,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;AACrD,CAAC"}

package/dist/text/truncate.d.ts

@@ -0,0 +1,81 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/** Options for {@linkcode truncate}. */
+export interface TruncateOptions {
+    /**
+     * The string used to indicate where truncation occurred.
+     *
+     * @default {"…"}
+     */
+    suffix?: string;
+    /**
+     * Where to truncate.
+     *
+     * - `"end"`:    `"very long te…"`
+     * - `"middle"`: `"very l…g text"` (useful for file paths)
+     * - `"start"`:  `"…ery long text"`
+     *
+     * @default {"end"}
+     */
+    position?: 'end' | 'middle' | 'start';
+}
+/**
+ * Truncates a string to at most `maxLength` UTF-16 code units. When truncation
+ * occurs the suffix is included within the `maxLength` budget. Surrogate pairs
+ * are never split, so the result may be shorter than `maxLength` when a cut
+ * would land inside a pair. When the suffix itself contains surrogate pairs and
+ * `maxLength` is very small, the result can even be empty.
+ *
+ * Note: this function is not grapheme-cluster-aware. Combining characters, flag
+ * emoji, and ZWJ sequences may still be visually split.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ *
+ * @param str The string to truncate.
+ * @param maxLength The maximum length of the returned string (must be a
+ * non-negative integer).
+ * @param options The truncation options.
+ * @returns The truncated string.
+ * @throws {RangeError} If `maxLength` is not a non-negative integer.
+ * @throws {TypeError} If `position` is not a valid position.
+ *
+ * @example End truncation (default)
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("Hello, world!", 8); // "Hello, …");
+ * truncate("Short", 10); // "Short"
+ * ```
+ *
+ * @example Middle truncation
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("src/components/Button.tsx", 18, { position: "middle" });
+ * // "src/comp…utton.tsx"
+ *  * ```
+ *
+ * @example Start truncation
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("Hello, world!", 8, { position: "start" });
+ * // "… world!"
+ * ```
+ *
+ * @example Custom suffix
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("Hello, world!", 10, { suffix: "→" });
+ * // "Hello, wo→"
+ * ```
+ */
+export declare function truncate(str: string, maxLength: number, options?: TruncateOptions): string;
+//# sourceMappingURL=truncate.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"truncate.d.ts","sourceRoot":"","sources":["../../src/text/truncate.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAIL,wCAAwC;AACxC,MAAM,WAAW,eAAe;IAC9B;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,KAAK,GAAG,QAAQ,GAAG,OAAO,CAAC;CACvC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,MAAM,CAgC1F"}

package/dist/text/truncate.js

@@ -0,0 +1,116 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+/**
+ * Truncates a string to at most `maxLength` UTF-16 code units. When truncation
+ * occurs the suffix is included within the `maxLength` budget. Surrogate pairs
+ * are never split, so the result may be shorter than `maxLength` when a cut
+ * would land inside a pair. When the suffix itself contains surrogate pairs and
+ * `maxLength` is very small, the result can even be empty.
+ *
+ * Note: this function is not grapheme-cluster-aware. Combining characters, flag
+ * emoji, and ZWJ sequences may still be visually split.
+ *
+ * @experimental **UNSTABLE**: New API, yet to be vetted.
+ *
+ * @param str The string to truncate.
+ * @param maxLength The maximum length of the returned string (must be a
+ * non-negative integer).
+ * @param options The truncation options.
+ * @returns The truncated string.
+ * @throws {RangeError} If `maxLength` is not a non-negative integer.
+ * @throws {TypeError} If `position` is not a valid position.
+ *
+ * @example End truncation (default)
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("Hello, world!", 8); // "Hello, …");
+ * truncate("Short", 10); // "Short"
+ * ```
+ *
+ * @example Middle truncation
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("src/components/Button.tsx", 18, { position: "middle" });
+ * // "src/comp…utton.tsx"
+ *  * ```
+ *
+ * @example Start truncation
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("Hello, world!", 8, { position: "start" });
+ * // "… world!"
+ * ```
+ *
+ * @example Custom suffix
+ * ```ts
+ * import { truncate } from "inray/text";
+ *
+ * truncate("Hello, world!", 10, { suffix: "→" });
+ * // "Hello, wo→"
+ * ```
+ */
+export function truncate(str, maxLength, options) {
+    if (!Number.isInteger(maxLength) || maxLength < 0) {
+        throw new RangeError(`Cannot truncate: maxLength must be a non-negative integer, received ${maxLength}`);
+    }
+    if (maxLength === 0)
+        return '';
+    if (str.length <= maxLength)
+        return str;
+    const suffix = options?.suffix ?? '\u2026';
+    const position = options?.position ?? 'end';
+    if (maxLength <= suffix.length) {
+        return suffix.slice(0, adjustSplitBack(suffix, maxLength));
+    }
+    const budget = maxLength - suffix.length;
+    switch (position) {
+        case 'start': {
+            const start = str.length - budget;
+            return suffix + str.slice(adjustSplitForward(str, start));
+        }
+        case 'middle': {
+            const leftLen = Math.floor(budget / 2);
+            const rightLen = budget - leftLen;
+            const rightStart = str.length - rightLen;
+            return str.slice(0, adjustSplitBack(str, leftLen)) + suffix + str.slice(adjustSplitForward(str, rightStart));
+        }
+        case 'end':
+            return str.slice(0, adjustSplitBack(str, budget)) + suffix;
+        default:
+            throw new TypeError(`Cannot truncate: position must be "end", "middle", or "start", received "${position}"`);
+    }
+}
+/**
+ * If `index` lands on a low surrogate, back up one position so we don't split
+ * a surrogate pair.
+ */
+function adjustSplitBack(str, index) {
+    if (index > 0 && index < str.length) {
+        const code = str.charCodeAt(index);
+        if (code >= 0xdc00 && code <= 0xdfff)
+            return index - 1;
+    }
+    return index;
+}
+/**
+ * If `index` lands on a low surrogate, advance one position so we don't split
+ * a surrogate pair.
+ */
+function adjustSplitForward(str, index) {
+    if (index > 0 && index < str.length) {
+        const code = str.charCodeAt(index);
+        if (code >= 0xdc00 && code <= 0xdfff)
+            return index + 1;
+    }
+    return index;
+}
+//# sourceMappingURL=truncate.js.map

package/dist/text/truncate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"truncate.js","sourceRoot":"","sources":["../../src/text/truncate.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAwBL;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAW,EAAE,SAAiB,EAAE,OAAyB;IAChF,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,UAAU,CAAC,uEAAuE,SAAS,EAAE,CAAC,CAAC;IAC3G,CAAC;IACD,IAAI,SAAS,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC/B,IAAI,GAAG,CAAC,MAAM,IAAI,SAAS;QAAE,OAAO,GAAG,CAAC;IAExC,MAAM,MAAM,GAAG,OAAO,EAAE,MAAM,IAAI,QAAQ,CAAC;IAC3C,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,KAAK,CAAC;IAE5C,IAAI,SAAS,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,MAAM,GAAG,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;IAEzC,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;YAClC,OAAO,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvC,MAAM,QAAQ,GAAG,MAAM,GAAG,OAAO,CAAC;YAClC,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC;YACzC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;QAC/G,CAAC;QACD,KAAK,KAAK;YACR,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;QAC7D;YACE,MAAM,IAAI,SAAS,CAAC,4EAA4E,QAAQ,GAAG,CAAC,CAAC;IACjH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,GAAW,EAAE,KAAa;IACjD,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM;YAAE,OAAO,KAAK,GAAG,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,GAAW,EAAE,KAAa;IACpD,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM;YAAE,OAAO,KAAK,GAAG,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/text/word_similarity_sort.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Original library: denoland/@std
+ * - Copyright (c) 2018-2026 the Deno authors. MIT license.
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+import { type CompareSimilarityOptions } from './compare_similarity.ts';
+/** Options for {@linkcode wordSimilaritySort}. */
+export interface WordSimilaritySortOptions extends CompareSimilarityOptions {
+}
+/**
+ * Sorts a string-array by similarity to a given string.
+ *
+ * By default, calculates the distance between words using the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}.
+ *
+ * @example Basic usage
+ *
+ * ```ts
+ * import { wordSimilaritySort } from "inray/text";
+ *
+ * const possibleWords = ["length", "size", "blah", "help"];
+ * const suggestions = wordSimilaritySort("hep", possibleWords);
+ * // ["help", "size", "blah", "length"]
+ * ```
+ *
+ * @example Case-sensitive sorting
+ *
+ * ```ts
+ * import { wordSimilaritySort } from "inray/text";
+ *
+ * const possibleWords = ["length", "Size", "blah", "HELP"];
+ * const suggestions = wordSimilaritySort("hep", possibleWords, { caseSensitive: true });
+ * // ["Size", "blah", "HELP", "length"]
+ * ```
+ *
+ * @param givenWord The string to measure distance against.
+ * @param possibleWords The string-array that will be sorted. This array will
+ * not be mutated, but the sorted copy will be returned.
+ * @param options Options for the sort.
+ * @returns A sorted copy of `possibleWords`.
+ */
+export declare function wordSimilaritySort(givenWord: string, possibleWords: ReadonlyArray<string>, options?: WordSimilaritySortOptions): string[];
+//# sourceMappingURL=word_similarity_sort.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"word_similarity_sort.d.ts","sourceRoot":"","sources":["../../src/text/word_similarity_sort.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAGL,OAAO,EAAqB,KAAK,wBAAwB,EAAE,MAAM,yBAAyB,CAAC;AAE3F,kDAAkD;AAClD,MAAM,WAAW,yBAA0B,SAAQ,wBAAwB;CAAG;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,MAAM,EACjB,aAAa,EAAE,aAAa,CAAC,MAAM,CAAC,EACpC,OAAO,CAAC,EAAE,yBAAyB,GAClC,MAAM,EAAE,CAGV"}

package/dist/text/word_similarity_sort.js

@@ -0,0 +1,47 @@
+/**
+ * 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 { compareSimilarity } from "./compare_similarity.js";
+/**
+ * Sorts a string-array by similarity to a given string.
+ *
+ * By default, calculates the distance between words using the
+ * {@link https://en.wikipedia.org/wiki/Levenshtein_distance | Levenshtein distance}.
+ *
+ * @example Basic usage
+ *
+ * ```ts
+ * import { wordSimilaritySort } from "inray/text";
+ *
+ * const possibleWords = ["length", "size", "blah", "help"];
+ * const suggestions = wordSimilaritySort("hep", possibleWords);
+ * // ["help", "size", "blah", "length"]
+ * ```
+ *
+ * @example Case-sensitive sorting
+ *
+ * ```ts
+ * import { wordSimilaritySort } from "inray/text";
+ *
+ * const possibleWords = ["length", "Size", "blah", "HELP"];
+ * const suggestions = wordSimilaritySort("hep", possibleWords, { caseSensitive: true });
+ * // ["Size", "blah", "HELP", "length"]
+ * ```
+ *
+ * @param givenWord The string to measure distance against.
+ * @param possibleWords The string-array that will be sorted. This array will
+ * not be mutated, but the sorted copy will be returned.
+ * @param options Options for the sort.
+ * @returns A sorted copy of `possibleWords`.
+ */
+export function wordSimilaritySort(givenWord, possibleWords, options) {
+    // This distance metric could be swapped/improved in the future
+    return possibleWords.toSorted(compareSimilarity(givenWord, options));
+}
+//# sourceMappingURL=word_similarity_sort.js.map

package/dist/text/word_similarity_sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"word_similarity_sort.js","sourceRoot":"","sources":["../../src/text/word_similarity_sort.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,qCAAqC;AACrC,OAAO,EAAE,iBAAiB,EAAiC,MAAM,yBAAyB,CAAC;AAK3F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,UAAU,kBAAkB,CAChC,SAAiB,EACjB,aAAoC,EACpC,OAAmC;IAEnC,+DAA+D;IAC/D,OAAO,aAAa,CAAC,QAAQ,CAAC,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;AACvE,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "inray",
-  "version": "0.0.7",
+  "version": "0.0.8",
   "description": "Inray SDK",
   "private": false,
   "type": "module",
@@ -41,7 +41,10 @@
     "test:media-types": "vitest run --project media-types",
     "test:node-cron": "vitest run --project node-cron",
     "test:phonenumbers": "vitest run --project phonenumbers",
+    "test:random": "vitest run --project random",
+    "test:semver": "vitest run --project semver",
     "test:streams": "vitest run --project streams",
+    "test:text": "vitest run --project text",
     "test:unidecode": "vitest run --project unidecode",
     "test:valibot": "vitest run --project valibot",
     "test:yaml": "vitest run --project yaml",
@@ -468,10 +471,22 @@
       "types": "./dist/phonenumbers/mod.d.ts",
       "import": "./dist/phonenumbers/mod.js"
     },
+    "./random": {
+      "types": "./dist/random/mod.d.ts",
+      "import": "./dist/random/mod.js"
+    },
+    "./semver": {
+      "types": "./dist/semver/mod.d.ts",
+      "import": "./dist/semver/mod.js"
+    },
     "./streams": {
       "types": "./dist/streams/mod.d.ts",
       "import": "./dist/streams/mod.js"
     },
+    "./text": {
+      "types": "./dist/text/mod.d.ts",
+      "import": "./dist/text/mod.js"
+    },
     "./unidecode": {
       "types": "./dist/unidecode/mod.d.ts",
       "import": "./dist/unidecode/mod.js"