string-extn 1.0.0

package/dist/core.js

@@ -0,0 +1,94 @@
+/**
+ * Removes leading and trailing whitespace from a string.
+ *
+ * @param str - The string to trim.
+ * @returns A new string with whitespace removed from both ends.
+ *
+ * @example
+ * trim('  hello world  ') // => 'hello world'
+ */
+export function trim(str) {
+    return str.trim();
+}
+/**
+ * Pads a string to a specified length by appending characters to the end.
+ *
+ * @param str - The string to pad.
+ * @param length - The target length for the padded string.
+ * @param char - The character to pad with. Defaults to a space (' ').
+ * @returns A new string padded to the specified length, or the original string if already longer.
+ *
+ * @example
+ * pad('hello', 10, '-') // => 'hello-----'
+ * pad('hello', 8) // => 'hello   '
+ */
+export function pad(str, length, char = ' ') {
+    return str.padEnd(length, char);
+}
+/**
+ * Extracts a section of a string.
+ *
+ * @param str - The string to slice.
+ * @param start - The starting index (inclusive). Negative indices count from the end.
+ * @param end - The ending index (exclusive). Negative indices count from the end. Optional.
+ * @returns A new string containing the extracted section.
+ *
+ * @example
+ * slice('hello', 1, 4) // => 'ell'
+ * slice('hello', 2) // => 'llo'
+ * slice('hello', -3) // => 'llo'
+ */
+export function slice(str, start, end) {
+    return str.slice(start, end);
+}
+/**
+ * Repeats a string a specified number of times.
+ *
+ * @param str - The string to repeat.
+ * @param times - The number of times to repeat the string. Must be a non-negative integer.
+ * @returns A new string with the original string repeated.
+ *
+ * @example
+ * repeat('ab', 3) // => 'ababab'
+ * repeat('x', 5) // => 'xxxxx'
+ */
+export function repeat(str, times) {
+    return str.repeat(times);
+}
+/**
+ * Truncates a string to a maximum length and appends a suffix if truncated.
+ *
+ * @param input - The string to truncate.
+ * @param maxLength - The maximum length of the string (not including the suffix).
+ * @param suffix - The suffix to append if truncated. Defaults to '…'.
+ * @returns The original string if its length is <= maxLength, or the truncated string with suffix appended.
+ *
+ * @example
+ * truncate('hello world', 5) // => 'hello…'
+ * truncate('hi', 10) // => 'hi'
+ * truncate('hello world', 5, '...') // => 'he...'
+ */
+export function truncate(input, maxLength, suffix = "...") {
+    if (input.length <= maxLength)
+        return input;
+    // slice first maxLength chars, then append suffix (tests expect suffix appended)
+    return input.slice(0, Math.max(0, maxLength)) + suffix;
+}
+/**
+ * Reverses the order of characters in a string.
+ *
+ * @param str - The string to reverse.
+ * @returns A new string with characters in reverse order.
+ *
+ * @note This function splits the string into individual characters and reverses them.
+ * For Unicode-aware reversal that handles complex grapheme clusters (like emojis with modifiers),
+ * use {@link reverseUnicode} from the unicode module instead.
+ *
+ * @example
+ * reverse('hello') // => 'olleh'
+ * reverse('12345') // => '54321'
+ */
+export function reverse(str) {
+    return str.split('').reverse().join('');
+}
+//# sourceMappingURL=core.js.map

package/dist/core.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"core.js","sourceRoot":"","sources":["../src/core.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,UAAU,IAAI,CAAC,GAAW;IAC9B,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,MAAc,EAAE,IAAI,GAAG,GAAG;IACzD,OAAO,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAClC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,KAAK,CAAC,GAAW,EAAE,KAAa,EAAE,GAAY;IAC5D,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,MAAM,CAAC,GAAW,EAAE,KAAa;IAC/C,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,QAAQ,CACtB,KAAa,EACb,SAAiB,EACjB,MAAM,GAAG,KAAK;IAEd,IAAI,KAAK,CAAC,MAAM,IAAI,SAAS;QAAE,OAAO,KAAK,CAAC;IAC5C,iFAAiF;IACjF,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC;AACzD,CAAC;AAGD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,OAAO,CAAC,GAAW;IACjC,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC1C,CAAC"}

package/dist/diff.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Compares two strings and returns the character differences between them.
+ *
+ * @param a - The first string to compare
+ * @param b - The second string to compare
+ * @returns An array of character differences, where characters prefixed with '-' are in string a but not in b,
+ *          and characters prefixed with '+' are in string b but not in a
+ *
+ * @example
+ * diff("abc", "bcd") // returns ["-a", "+d"]
+ * diff("hello", "hallo") // returns ["-e", "+a"]
+ *
+ * @note Duplicates are removed as the comparison uses sets of unique characters
+ */
+export declare function diff(a: string, b: string): string[];
+//# sourceMappingURL=diff.d.ts.map

package/dist/diff.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../src/diff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAQnD"}

package/dist/diff.js

@@ -0,0 +1,23 @@
+/**
+ * Compares two strings and returns the character differences between them.
+ *
+ * @param a - The first string to compare
+ * @param b - The second string to compare
+ * @returns An array of character differences, where characters prefixed with '-' are in string a but not in b,
+ *          and characters prefixed with '+' are in string b but not in a
+ *
+ * @example
+ * diff("abc", "bcd") // returns ["-a", "+d"]
+ * diff("hello", "hallo") // returns ["-e", "+a"]
+ *
+ * @note Duplicates are removed as the comparison uses sets of unique characters
+ */
+export function diff(a, b) {
+    const aSet = new Set(a.split(""));
+    const bSet = new Set(b.split(""));
+    return [
+        ...[...aSet].filter(x => !bSet.has(x)).map(x => `-${x}`),
+        ...[...bSet].filter(x => !aSet.has(x)).map(x => `+${x}`)
+    ];
+}
+//# sourceMappingURL=diff.js.map

package/dist/diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","sourceRoot":"","sources":["../src/diff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,IAAI,CAAC,CAAS,EAAE,CAAS;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAElC,OAAO;QACL,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxD,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;KACzD,CAAC;AACJ,CAAC"}

package/dist/fp.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Applies a transformation function to each character in a string.
+ *
+ * @param str - The string to map over.
+ * @param fn - A function that takes a character and returns a transformed character.
+ * @returns A new string with the transformation applied to each character.
+ *
+ * @example
+ * map('hello', c => c.toUpperCase()) // => 'HELLO'
+ * map('abc', c => c + c) // => 'aabbcc'
+ */
+export declare function map(str: string, fn: (c: string) => string): string;
+/**
+ * Filters characters in a string based on a predicate function.
+ *
+ * @param str - The string to filter.
+ * @param fn - A predicate function that returns true for characters to keep, false to remove.
+ * @returns A new string containing only the characters that satisfy the predicate.
+ *
+ * @example
+ * filter('hello', c => 'aeiou'.includes(c)) // => 'eo'
+ * filter('a1b2c3', c => /\d/.test(c)) // => '123'
+ */
+export declare function filter(str: string, fn: (c: string) => boolean): string;
+/**
+ * Reduces a string to a single value by applying an accumulator function to each character.
+ *
+ * @typeParam T - The type of the accumulated value.
+ * @param str - The string to reduce.
+ * @param fn - A reducer function that takes the accumulated value and a character, and returns the new accumulated value.
+ * @param initial - The initial value for the accumulator.
+ * @returns The final accumulated value after processing all characters.
+ *
+ * @example
+ * reduce('hello', (acc, c) => acc + 1, 0) // => 5 (character count)
+ * reduce('abc', (acc, c) => acc + c, '') // => 'abc' (concatenation)
+ * reduce('aabbcc', (acc, c) => ({ ...acc, [c]: (acc[c] || 0) + 1 }), {}) // => { a: 2, b: 2, c: 2 }
+ */
+export declare function reduce<T>(str: string, fn: (acc: T, c: string) => T, initial: T): T;
+/**
+ * Composes multiple functions into a single function that applies them right-to-left.
+ *
+ * @param fns - Variable number of functions to compose.
+ * @returns A new function that applies the composed functions to its argument.
+ *          Functions are applied right-to-left (the rightmost function is applied first).
+ *
+ * @example
+ * const upper = (s: string) => s.toUpperCase();
+ * const exclaim = (s: string) => s + '!';
+ * const composed = compose(exclaim, upper);
+ * composed('hello') // => 'HELLO!' (upper applied first, then exclaim)
+ *
+ * @example
+ * const add5 = (x: number) => x + 5;
+ * const mult2 = (x: number) => x * 2;
+ * const composed = compose(mult2, add5);
+ * composed(3) // => 16 (add5(3) = 8, then mult2(8) = 16)
+ */
+export declare function compose(...fns: Function[]): (value: any) => any;
+//# sourceMappingURL=fp.d.ts.map

package/dist/fp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fp.d.ts","sourceRoot":"","sources":["../src/fp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,MAAM,CAElE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,GAAG,MAAM,CAEtE;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,MAAM,CAAC,CAAC,EACtB,GAAG,EAAE,MAAM,EACX,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC,EAC5B,OAAO,EAAE,CAAC,GACT,CAAC,CAEH;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,OAAO,CAAC,GAAG,GAAG,EAAE,QAAQ,EAAE,IAChC,OAAO,GAAG,SACnB"}

package/dist/fp.js

@@ -0,0 +1,68 @@
+/**
+ * Applies a transformation function to each character in a string.
+ *
+ * @param str - The string to map over.
+ * @param fn - A function that takes a character and returns a transformed character.
+ * @returns A new string with the transformation applied to each character.
+ *
+ * @example
+ * map('hello', c => c.toUpperCase()) // => 'HELLO'
+ * map('abc', c => c + c) // => 'aabbcc'
+ */
+export function map(str, fn) {
+    return str.split('').map(fn).join('');
+}
+/**
+ * Filters characters in a string based on a predicate function.
+ *
+ * @param str - The string to filter.
+ * @param fn - A predicate function that returns true for characters to keep, false to remove.
+ * @returns A new string containing only the characters that satisfy the predicate.
+ *
+ * @example
+ * filter('hello', c => 'aeiou'.includes(c)) // => 'eo'
+ * filter('a1b2c3', c => /\d/.test(c)) // => '123'
+ */
+export function filter(str, fn) {
+    return str.split('').filter(fn).join('');
+}
+/**
+ * Reduces a string to a single value by applying an accumulator function to each character.
+ *
+ * @typeParam T - The type of the accumulated value.
+ * @param str - The string to reduce.
+ * @param fn - A reducer function that takes the accumulated value and a character, and returns the new accumulated value.
+ * @param initial - The initial value for the accumulator.
+ * @returns The final accumulated value after processing all characters.
+ *
+ * @example
+ * reduce('hello', (acc, c) => acc + 1, 0) // => 5 (character count)
+ * reduce('abc', (acc, c) => acc + c, '') // => 'abc' (concatenation)
+ * reduce('aabbcc', (acc, c) => ({ ...acc, [c]: (acc[c] || 0) + 1 }), {}) // => { a: 2, b: 2, c: 2 }
+ */
+export function reduce(str, fn, initial) {
+    return str.split('').reduce(fn, initial);
+}
+/**
+ * Composes multiple functions into a single function that applies them right-to-left.
+ *
+ * @param fns - Variable number of functions to compose.
+ * @returns A new function that applies the composed functions to its argument.
+ *          Functions are applied right-to-left (the rightmost function is applied first).
+ *
+ * @example
+ * const upper = (s: string) => s.toUpperCase();
+ * const exclaim = (s: string) => s + '!';
+ * const composed = compose(exclaim, upper);
+ * composed('hello') // => 'HELLO!' (upper applied first, then exclaim)
+ *
+ * @example
+ * const add5 = (x: number) => x + 5;
+ * const mult2 = (x: number) => x * 2;
+ * const composed = compose(mult2, add5);
+ * composed(3) // => 16 (add5(3) = 8, then mult2(8) = 16)
+ */
+export function compose(...fns) {
+    return (value) => fns.reduceRight((acc, fn) => fn(acc), value);
+}
+//# sourceMappingURL=fp.js.map

package/dist/fp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fp.js","sourceRoot":"","sources":["../src/fp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,EAAyB;IACxD,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,MAAM,CAAC,GAAW,EAAE,EAA0B;IAC5D,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,MAAM,CACpB,GAAW,EACX,EAA4B,EAC5B,OAAU;IAEV,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,OAAO,CAAC,GAAG,GAAe;IACxC,OAAO,CAAC,KAAU,EAAE,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;AACtE,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,10 @@
+export * from './core.js';
+export * from './fp.js';
+export * from './unicode.js';
+export * from './case.js';
+export * from './slug.js';
+export * from './mask.js';
+export * from './similarity.js';
+export * from './diff.js';
+export * from './validate.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,SAAS,CAAC;AACxB,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC"}

package/dist/index.js

@@ -0,0 +1,10 @@
+export * from './core.js';
+export * from './fp.js';
+export * from './unicode.js';
+export * from './case.js';
+export * from './slug.js';
+export * from './mask.js';
+export * from './similarity.js';
+export * from './diff.js';
+export * from './validate.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,SAAS,CAAC;AACxB,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC"}

package/dist/mask.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Masks a string by replacing characters with a mask character, keeping only the last visible characters.
+ *
+ * @param input - The string to mask
+ * @param visible - The number of characters to keep visible at the end (default: 4)
+ * @param maskChar - The character used for masking (default: '*')
+ * @returns The masked string with the last 'visible' characters shown and the rest replaced with maskChar
+ *
+ * @example
+ * mask("1234567890") // returns "******7890"
+ * mask("1234567890", 6) // returns "****567890"
+ * mask("password", 2, '#') // returns "######rd"
+ * mask("abc", 4) // returns "***" (if input is shorter than visible, all chars are masked)
+ *
+ * @note Commonly used for masking sensitive information like credit card numbers, phone numbers, and passwords
+ */
+export declare function mask(input: string, visible?: number, maskChar?: string): string;
+/**
+ * Redacts portions of a string that match the provided patterns.
+ *
+ * @param input - The string to redact
+ * @param patterns - An array of regular expressions to match against the input string
+ * @returns The string with matched patterns replaced with '[REDACTED]'
+ *
+ * @example
+ * redact("Email: john@example.com", [/@\w+\.\w+/]) // returns "Email: john[REDACTED]"
+ * redact("Phone: 123-456-7890", [/\d{3}-\d{3}-\d{4}/]) // returns "Phone: [REDACTED]"
+ * redact("Name: Alice, ID: 12345", [/\d+/, /[A-Z][a-z]+/]) // returns "Name: [REDACTED], ID: [REDACTED]"
+ *
+ * @note All matches are replaced sequentially; patterns are applied in order
+ */
+export declare function redact(input: string, patterns: RegExp[]): string;
+//# sourceMappingURL=mask.d.ts.map

package/dist/mask.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mask.d.ts","sourceRoot":"","sources":["../src/mask.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,IAAI,CAClB,KAAK,EAAE,MAAM,EACb,OAAO,SAAI,EACX,QAAQ,SAAM,GACb,MAAM,CAaR;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,MAAM,CACpB,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAAE,GACjB,MAAM,CASR"}

package/dist/mask.js

@@ -0,0 +1,57 @@
+/**
+ * Masks a string by replacing characters with a mask character, keeping only the last visible characters.
+ *
+ * @param input - The string to mask
+ * @param visible - The number of characters to keep visible at the end (default: 4)
+ * @param maskChar - The character used for masking (default: '*')
+ * @returns The masked string with the last 'visible' characters shown and the rest replaced with maskChar
+ *
+ * @example
+ * mask("1234567890") // returns "******7890"
+ * mask("1234567890", 6) // returns "****567890"
+ * mask("password", 2, '#') // returns "######rd"
+ * mask("abc", 4) // returns "***" (if input is shorter than visible, all chars are masked)
+ *
+ * @note Commonly used for masking sensitive information like credit card numbers, phone numbers, and passwords
+ */
+export function mask(input, visible = 4, maskChar = "*") {
+    const ch = maskChar ? maskChar.charAt(0) : "*";
+    if (visible <= 0)
+        return ch.repeat(input.length);
+    if (input.length === 0)
+        return "";
+    // If visible is greater than or equal to the string length, decide behavior:
+    // - For very short inputs (length < 4) we mask entirely
+    // - Otherwise we show the whole input
+    if (visible >= input.length) {
+        if (input.length < 4)
+            return ch.repeat(input.length);
+        return input;
+    }
+    return ch.repeat(input.length - visible) + input.slice(-visible);
+}
+/**
+ * Redacts portions of a string that match the provided patterns.
+ *
+ * @param input - The string to redact
+ * @param patterns - An array of regular expressions to match against the input string
+ * @returns The string with matched patterns replaced with '[REDACTED]'
+ *
+ * @example
+ * redact("Email: john@example.com", [/@\w+\.\w+/]) // returns "Email: john[REDACTED]"
+ * redact("Phone: 123-456-7890", [/\d{3}-\d{3}-\d{4}/]) // returns "Phone: [REDACTED]"
+ * redact("Name: Alice, ID: 12345", [/\d+/, /[A-Z][a-z]+/]) // returns "Name: [REDACTED], ID: [REDACTED]"
+ *
+ * @note All matches are replaced sequentially; patterns are applied in order
+ */
+export function redact(input, patterns) {
+    let result = input;
+    for (const pattern of patterns) {
+        // ensure global replacement unless the pattern already has 'g'
+        const flags = pattern.flags.includes("g") ? pattern.flags : pattern.flags + "g";
+        const re = new RegExp(pattern.source, flags);
+        result = result.replace(re, "[REDACTED]");
+    }
+    return result;
+}
+//# sourceMappingURL=mask.js.map

package/dist/mask.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mask.js","sourceRoot":"","sources":["../src/mask.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,IAAI,CAClB,KAAa,EACb,OAAO,GAAG,CAAC,EACX,QAAQ,GAAG,GAAG;IAEd,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/C,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,6EAA6E;IAC7E,wDAAwD;IACxD,sCAAsC;IACtC,IAAI,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,MAAM,CACpB,KAAa,EACb,QAAkB;IAElB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,+DAA+D;QAC/D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC;QAChF,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC7C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/similarity.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Calculates the similarity between two strings using the Levenshtein distance algorithm.
+ *
+ * @param a - The first string to compare
+ * @param b - The second string to compare
+ * @returns A similarity score between 0 and 1, where 1 means the strings are identical and 0 means completely different
+ *
+ * @example
+ * similarity("hello", "hello") // returns 1 (identical)
+ * similarity("hello", "hallo") // returns 0.8 (one character different)
+ * similarity("abc", "def") // returns 0 (completely different)
+ * similarity("", "") // returns 0 (one or both strings empty)
+ *
+ * @note Uses dynamic programming to compute the Levenshtein distance (edit distance) and converts it to a similarity score.
+ *       The algorithm accounts for three operations: insertion, deletion, and substitution.
+ */
+export declare function similarity(a: string, b: string): number;
+//# sourceMappingURL=similarity.d.ts.map

package/dist/similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../src/similarity.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAsCvD"}

package/dist/similarity.js

@@ -0,0 +1,50 @@
+/**
+ * Calculates the similarity between two strings using the Levenshtein distance algorithm.
+ *
+ * @param a - The first string to compare
+ * @param b - The second string to compare
+ * @returns A similarity score between 0 and 1, where 1 means the strings are identical and 0 means completely different
+ *
+ * @example
+ * similarity("hello", "hello") // returns 1 (identical)
+ * similarity("hello", "hallo") // returns 0.8 (one character different)
+ * similarity("abc", "def") // returns 0 (completely different)
+ * similarity("", "") // returns 0 (one or both strings empty)
+ *
+ * @note Uses dynamic programming to compute the Levenshtein distance (edit distance) and converts it to a similarity score.
+ *       The algorithm accounts for three operations: insertion, deletion, and substitution.
+ */
+export function similarity(a, b) {
+    if (a === b)
+        return 1;
+    if (!a.length || !b.length)
+        return 0;
+    const rows = b.length + 1;
+    const cols = a.length + 1;
+    const matrix = [];
+    for (let i = 0; i < rows; i++) {
+        matrix.push(Array(cols).fill(0));
+    }
+    // Initialize matrix
+    for (let i = 0; i < rows; i++) {
+        matrix[i][0] = i;
+    }
+    for (let j = 0; j < cols; j++) {
+        matrix[0][j] = j;
+    }
+    // Compute distances
+    for (let i = 1; i < rows; i++) {
+        for (let j = 1; j < cols; j++) {
+            const cost = b[i - 1] === a[j - 1] ? 0 : 1;
+            const currentRow = matrix[i];
+            const prevRow = matrix[i - 1];
+            currentRow[j] = Math.min(prevRow[j] + 1, // deletion
+            currentRow[j - 1] + 1, // insertion
+            prevRow[j - 1] + cost // substitution
+            );
+        }
+    }
+    const distance = matrix[b.length][a.length];
+    return 1 - distance / Math.max(a.length, b.length);
+}
+//# sourceMappingURL=similarity.js.map

package/dist/similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.js","sourceRoot":"","sources":["../src/similarity.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC7C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IAErC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAE1B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAa,CAAC,CAAC;IAC/C,CAAC;IAED,oBAAoB;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,oBAAoB;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAa,CAAC;YACzC,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAa,CAAC;YAE1C,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACtB,OAAO,CAAC,CAAC,CAAE,GAAG,CAAC,EAAM,WAAW;YAChC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,EAAM,YAAY;YACxC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,eAAe;aACvC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAc,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;IAC3D,OAAO,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;AACrD,CAAC"}

package/dist/slug.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Converts a string to a URL-friendly slug format.
+ *
+ * @param input - The string to convert to a slug
+ * @returns A slug-formatted string (lowercase, hyphen-separated, no special characters or accents)
+ *
+ * @example
+ * slugify("Hello World") // returns "hello-world"
+ * slugify("Café au Lait") // returns "cafe-au-lait" (accents removed)
+ * slugify("Hello---World") // returns "hello-world" (multiple hyphens normalized)
+ * slugify("---Hello World---") // returns "hello-world" (leading/trailing hyphens removed)
+ *
+ * @note Removes diacritical marks and special characters, suitable for URLs and routing
+ */
+export declare function slugify(input: string): string;
+/**
+ * Removes invalid filesystem characters from a string to make it a safe filename.
+ *
+ * @param input - The string to make filesystem-safe
+ * @returns A filename-safe string with invalid characters removed and whitespace trimmed
+ *
+ * @example
+ * filenameSafe("My File.txt") // returns "My File.txt"
+ * filenameSafe("Document<>?.txt") // returns "Document.txt"
+ * filenameSafe("File:Name|Invalid.doc") // returns "FileNameInvalid.doc"
+ * filenameSafe("  spaces.txt  ") // returns "spaces.txt" (trimmed)
+ *
+ * @note Removes characters: < > : " / \ | ? * and control characters (ASCII 0-31).
+ *       Compatible with Windows, Mac, and Linux filesystems.
+ */
+export declare function filenameSafe(input: string): string;
+//# sourceMappingURL=slug.d.ts.map

package/dist/slug.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"slug.d.ts","sourceRoot":"","sources":["../src/slug.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAU7C;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAElD"}

package/dist/slug.js

@@ -0,0 +1,44 @@
+/**
+ * Converts a string to a URL-friendly slug format.
+ *
+ * @param input - The string to convert to a slug
+ * @returns A slug-formatted string (lowercase, hyphen-separated, no special characters or accents)
+ *
+ * @example
+ * slugify("Hello World") // returns "hello-world"
+ * slugify("Café au Lait") // returns "cafe-au-lait" (accents removed)
+ * slugify("Hello---World") // returns "hello-world" (multiple hyphens normalized)
+ * slugify("---Hello World---") // returns "hello-world" (leading/trailing hyphens removed)
+ *
+ * @note Removes diacritical marks and special characters, suitable for URLs and routing
+ */
+export function slugify(input) {
+    return input
+        .normalize("NFKD")
+        .replace(/[\u0300-\u036f]/g, "")
+        .toLowerCase()
+        // Remove punctuation except common separators (space, hyphen, underscore)
+        .replace(/[^a-z0-9\s_-]+/g, "")
+        // Normalize separators to single hyphen
+        .replace(/[\s_-]+/g, "-")
+        .replace(/(^-|-$)+/g, "");
+}
+/**
+ * Removes invalid filesystem characters from a string to make it a safe filename.
+ *
+ * @param input - The string to make filesystem-safe
+ * @returns A filename-safe string with invalid characters removed and whitespace trimmed
+ *
+ * @example
+ * filenameSafe("My File.txt") // returns "My File.txt"
+ * filenameSafe("Document<>?.txt") // returns "Document.txt"
+ * filenameSafe("File:Name|Invalid.doc") // returns "FileNameInvalid.doc"
+ * filenameSafe("  spaces.txt  ") // returns "spaces.txt" (trimmed)
+ *
+ * @note Removes characters: < > : " / \ | ? * and control characters (ASCII 0-31).
+ *       Compatible with Windows, Mac, and Linux filesystems.
+ */
+export function filenameSafe(input) {
+    return input.replace(/[<>:"/\\|?*\x00-\x1F]/g, "").trim();
+}
+//# sourceMappingURL=slug.js.map

package/dist/slug.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"slug.js","sourceRoot":"","sources":["../src/slug.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa;IACnC,OAAO,KAAK;SACT,SAAS,CAAC,MAAM,CAAC;SACjB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;SAC/B,WAAW,EAAE;QACd,0EAA0E;SACzE,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC;QAC/B,wCAAwC;SACvC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;SACxB,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,OAAO,KAAK,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AAC5D,CAAC"}

package/dist/unicode.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Counts the number of grapheme clusters (user-perceived characters) in a Unicode string.
+ *
+ * This function properly handles complex Unicode characters including:
+ * - Emoji with skin tone modifiers (e.g., 👍🏽)
+ * - Multi-codepoint emoji sequences (e.g., family emoji 👨‍👩‍👧‍👦)
+ * - Flag emoji (e.g., 🇺🇸)
+ * - Accented characters and combining marks
+ *
+ * @param str - The Unicode string to count.
+ * @returns The number of grapheme clusters in the string.
+ *
+ * @example
+ * lengthUnicode('hello') // => 5
+ * lengthUnicode('👍🏽👍') // => 2 (skin tone modifier counted as part of first emoji)
+ * lengthUnicode('👨‍👩‍👧‍👦') // => 1 (complex emoji sequence counted as single grapheme)
+ */
+export declare function lengthUnicode(str: string): number;
+/**
+ * Extracts a section of a Unicode string by grapheme cluster indices.
+ *
+ * This function correctly slices strings containing complex Unicode characters where
+ * multiple codepoints form a single user-perceived character. Use this instead of
+ * {@link slice} for proper Unicode-aware slicing.
+ *
+ * @param str - The Unicode string to slice.
+ * @param start - The starting grapheme cluster index (inclusive). Negative indices count from the end.
+ * @param end - The ending grapheme cluster index (exclusive). Negative indices count from the end. Optional.
+ * @returns A new string containing the extracted grapheme clusters.
+ *
+ * @example
+ * unicodeSlice('hello', 1, 4) // => 'ell'
+ * unicodeSlice('👍🏽👍😀', 0, 2) // => '👍🏽👍' (correctly handles skin tone modifier)
+ * unicodeSlice('😀😁😂', 1) // => '😁😂'
+ */
+export declare function unicodeSlice(str: string, start: number, end?: number): string;
+/**
+ * Reverses the order of grapheme clusters in a Unicode string.
+ *
+ * This function properly reverses strings containing complex Unicode characters where
+ * multiple codepoints form a single user-perceived character. It maintains the integrity
+ * of multi-codepoint emoji and other complex grapheme clusters. Use this instead of
+ * {@link reverse} for Unicode-aware reversal.
+ *
+ * @param str - The Unicode string to reverse.
+ * @returns A new string with grapheme clusters in reverse order.
+ *
+ * @example
+ * reverseUnicode('hello') // => 'olleh'
+ * reverseUnicode('👍🏽👍') // => '👍👍🏽' (preserves emoji integrity)
+ * reverseUnicode('👨‍👩‍👧‍👦😀') // => '😀👨‍👩‍👧‍👦' (maintains complex emoji as single unit)
+ */
+export declare function reverseUnicode(str: string): string;
+//# sourceMappingURL=unicode.d.ts.map

package/dist/unicode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unicode.d.ts","sourceRoot":"","sources":["../src/unicode.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEjD;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAG7E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAElD"}