umt 2.12.3 → 2.13.0

package/README.md

@@ -60,11 +60,22 @@ bun add umt
 | zip | `<T extends unknown[][]>(...arrays: T) => ZipArrayType<T>` | Creates a new array by combining elements from multiple arrays at corresponding positions | `zip([1, 2], ['a', 'b']); // [[1, 'a'], [2, 'b']]` |
 | zipLongest | `<T extends unknown[][]>(...arrays: T) => ZipArrayType<T>` | Combines arrays of different lengths by padding shorter arrays with undefined values | `zipLongest([1, 2], ['a']); // [[1, 'a'], [2, undefined]]` |
 
+### Async
+
+| name | type | description | example |
+|------|------|-------------|---------|
+| defer | `<T>() => Deferred<T>` | Creates a deferred promise with externally accessible resolve and reject | `const d = defer<number>(); d.resolve(42); await d.promise; // 42` |
+| parallel | `<T, U>(limit: number, items: T[], function_: (item: T, index: number) => Promise<U>) => Promise<U[]>` | Executes async functions in parallel with a concurrency limit | `await parallel(2, [1, 2, 3], async (n) => n * 2); // [2, 4, 6]` |
+| sleep | `(ms: number) => Promise<void>` | Returns a promise that resolves after the specified milliseconds | `await sleep(1000);` |
+| timeout | `<T>(promise: Promise<T>, ms: number) => Promise<T>` | Wraps a promise with a timeout, rejecting if it does not resolve in time | `await timeout(fetch("/api"), 5000);` |
+
 ### DataStructure
 
 | name | type | description | example |
 |------|------|-------------|---------|
+| LRUCache | `class LRUCache<K, V>` | Least Recently Used cache with O(1) get/set using Map and doubly linked list | `const cache = new LRUCache<string, number>(3); cache.set("a", 1); cache.get("a"); // 1` |
 | PriorityQueue | `class PriorityQueue<T>` | A priority queue implementation using a binary heap. Higher priority values are dequeued first. | `const queue = new PriorityQueue<string>(); queue.enqueue("low", 1); queue.enqueue("high", 3); queue.enqueueBack("back"); queue.dequeue(); // "high"` |
+| TTLCache | `class TTLCache<K, V>` | Time-to-live cache with lazy expiration and optional max size | `const cache = new TTLCache<string, number>({ defaultTTL: 5000 }); cache.set("a", 1); cache.get("a"); // 1` |
 
 ### Color
 
@@ -107,6 +118,9 @@ bun add umt
 
 | name | type | description | example |
 |------|------|-------------|---------|
+| flatMapResult | `<V, E, U, F>(result: Result<V, E>, function_: (value: V) => Result<U, F>) => Result<U, E \| F>` | Transforms a success Result's value using a function that returns a Result | `flatMapResult({type: "success", value: 5}, (n) => ({type: "success", value: n * 2})); // {type: "success", value: 10}` |
+| mapResult | `<V, E, U>(result: Result<V, E>, function_: (value: V) => U) => Result<U, E>` | Transforms a success Result's value using the provided function | `mapResult({type: "success", value: 5}, (n) => n * 2); // {type: "success", value: 10}` |
+| matchResult | `<V, E, S, F>(result: Result<V, E>, handlers: {onSuccess: (value: V) => S; onError: (error: E) => F}) => S \| F` | Pattern matches on a Result, applying the appropriate handler | `matchResult({type: "success", value: 42}, {onSuccess: (v) => "Got " + v, onError: (e) => "Failed"}); // "Got 42"` |
 | safeExecute | `<V, E = Error>(callback: () => V) => Result<V, E>` | Safely executes a callback function and returns a Result type | `safeExecute(() => JSON.parse('{"a": 1}')); // {type: "success", value: {a: 1}}` |
 
 ### Function
@@ -114,6 +128,18 @@ bun add umt
 | name | type | description | example |
 |------|------|-------------|---------|
 | curry | `(func: (...args: unknown[]) => unknown) => Function` | Curries a function | `const add = (a, b, c) => a + b + c; curry(add)(1)(2)(3); // 6` |
+| debounce | `<T>(function_: T, wait: number, options?: DebounceOptions) => DebouncedFunction<T>` | Creates a debounced version of the provided function with leading/trailing options | `const debounced = debounce(() => console.log("called"), 300); debounced(); debounced.cancel();` |
+| memoize | `<A extends unknown[], R, K>(function_: (...args: A) => R, options?: MemoizeOptions<K>) => MemoizedFunction<A, R, K>` | Creates a memoized version of the provided function with optional maxSize | `const m = memoize((n: number) => n * 2); m(5); // 10 (computed); m(5); // 10 (cached)` |
+| once | `<A extends unknown[], R>(function_: (...args: A) => R) => (...args: A) => R` | Creates a function that is restricted to be called only once | `const init = once(() => 42); init(); // 42; init(); // 42 (cached)` |
+| throttle | `<T>(function_: T, wait: number) => ThrottledFunction<T>` | Creates a throttled version of the provided function | `const throttled = throttle(() => console.log("called"), 300); throttled(); throttled.cancel();` |
+
+### Iterator
+
+| name | type | description | example |
+|------|------|-------------|---------|
+| lazyFilter | `function*<T>(iterable: Iterable<T>, predicate: (value: T, index: number) => boolean) => Generator<T>` | Lazily filters values from an iterable using a generator | `[...lazyFilter([1, 2, 3, 4], (n) => n % 2 === 0)]; // [2, 4]` |
+| lazyMap | `function*<T, U>(iterable: Iterable<T>, function_: (value: T, index: number) => U) => Generator<U>` | Lazily maps values from an iterable using a generator | `[...lazyMap([1, 2, 3], (n) => n * 2)]; // [2, 4, 6]` |
+| lazyTake | `function*<T>(iterable: Iterable<T>, n: number) => Generator<T>` | Lazily takes the first n values from an iterable | `[...lazyTake([1, 2, 3, 4, 5], 3)]; // [1, 2, 3]` |
 
 ### IP
 
@@ -136,6 +162,7 @@ bun add umt
 |------|------|-------------|---------|
 | addition | `(...numbers: number[]) => number` | Addition without floating point errors | `addition(0.1, 0.2); // 0.3` |
 | average | `(numbers: number[]) => number` | Calculates the arithmetic mean of an array of numbers | `average([1, 2, 3]); // 2` |
+| clamp | `(value: number, min: number, max: number) => number` | Clamps a number between a minimum and maximum value | `clamp(-3, 0, 10); // 0` |
 | correlationCoefficient | `(x: number[], y: number[]) => number` | Calculate the Pearson correlation coefficient between two arrays | `correlationCoefficient([1, 2, 3, 4, 5], [2, 4, 6, 8, 10]); // 1` |
 | bitwise | `(x: number, k: number, direction?: "left" \| "right") => number` | Performs bit rotation on a number | `bitwise(0x12345678, 8); // 0x34567812` |
 | calculator | `<T extends Record<string, string \| number>>(expression: string, exchange?: T) => string` | Calculator function that handles mathematical expressions and simple equations | `calculator("1+2"); // "3"` |
@@ -149,6 +176,7 @@ bun add umt
 | flexibleNumberConversion | `(value: unknown) => number` | Flexible function to convert various inputs to numbers whenever possible | `flexibleNumberConversion("456"); // 456` |
 | gcd | `(x: number, y: number, ...z: number[]) => number` | Greatest Common Divisor (GCD) | `gcd(12, 18); // 6` |
 | getDecimalLength | `(value: number) => number` | Gets the number of decimal places in a number | `getDecimalLength(1.23); // 2` |
+| inRange | `(value: number, start: number, end?: number) => boolean` | Checks if a number is within a specified range | `inRange(3, 5); // true (range: [0, 5))` |
 | lcm | `(x: number, y: number) => number` | Least Common Multiple (LCM) | `lcm(2, 3); // 6` |
 | linearCongruentialGenerator | `(seed: number, max?: number, multiplier?: number, increment?: number) => number` | Linear Congruential Generator for random number generation | `linearCongruentialGenerator(12345);` |
 | literalExpression | `(x: string) => string` | Solves literal equations with variables | `literalExpression("x+1=2"); // "1"` |
@@ -174,6 +202,7 @@ bun add umt
 | solveEquation | `(coefficients: number[][], constants: number[]) => number[]` | Solves a system of linear equations using Gaussian elimination | `solveEquation([[1, 1], [1, 2]], [4, 10]); // [-2, 6]` |
 | standardDeviation | `(values: number[]) => number` | Calculates the standard deviation of a set of values | `standardDeviation([1, 2, 3]); // 0.816496580927726` |
 | subtract | `(...numbers: number[]) => number` | Performs subtraction with arbitrary number of arguments without floating point errors | `subtract(0.1, 0.2); // -0.1` |
+| sumPrecise | `(numbers: number[]) => number` | Calculates the sum using Neumaier summation for improved floating-point precision | `sumPrecise([1e20, 1, -1e20]); // 1` |
 | toBaseN | `(value: number, radix?: number) => string` | Converts a number to a string representation in the specified base | `toBaseN(10); // "1010" (binary)` |
 | toCelsius | `(kelvin: number) => number` | Converts temperature from Kelvin to Celsius | `toCelsius(300); // 26.85` |
 | toKelvin | `(celsius: number) => number` | Converts temperature from Celsius to Kelvin | `toKelvin(26.85); // 300` |
@@ -181,19 +210,41 @@ bun add umt
 | valueSwap | `(x: number, y: number) => [number, number]` | Swaps two numbers to ensure x < y | `valueSwap(2, 1); // [1, 2]` |
 | xoshiro256 | `(state: [number, number, number, number], min?: number, max?: number) => number` | Generates random numbers using the Xoshiro256** algorithm | `xoshiro256([1, 2, 3, 4]); // random number between 0 and 1` |
 
+### Number
+
+| name | type | description | example |
+|------|------|-------------|---------|
+| formatNumber | `(value: number, options?: FormatNumberOptions) => string` | Formats a number using Intl.NumberFormat | `formatNumber(1234567.89); // "1,234,567.89"` |
+| toOrdinal | `(value: number) => string` | Converts a number to its English ordinal string representation | `toOrdinal(1); // "1st"` |
+| toPercentage | `(value: number, total: number, decimals?: number) => number` | Calculates the percentage of a value relative to a total | `toPercentage(1, 3); // 33.33` |
+
 ### Object
 
 | name | type | description | example |
 |------|------|-------------|---------|
+| deepClone | `<T>(value: T) => T` | Creates a deep clone of the given value using structuredClone | `const cloned = deepClone({a: {b: 1}}); cloned.a.b = 99; // original unchanged` |
 | has | `<T extends { [key: string]: unknown }>(object: T, path: string \| string[]) => boolean` | Determines if an object has a specified path | `has({ a: { b: 1 } }, "a.b"); // true` |
+| isPlainObject | `(value: unknown) => value is Record<string, unknown>` | Checks if a value is a plain object | `isPlainObject({}); // true; isPlainObject(new Map()); // false` |
 | isEmpty | `(object: Record<string, unknown>) => boolean` | Checks if an object is empty (has no own properties) | `isEmpty({}); // true` |
 | keyBy | `<T>(collection: T[] \| Record<PropertyName, T>, iteratee?: Iteratee<T>) => Record<PropertyName, T>` | Creates an object composed of keys generated from the results of running each element of collection through iteratee | `keyBy([{id: 1, name: 'a'}, {id: 2, name: 'b'}], 'id'); // {1: {id: 1, name: 'a'}, 2: {id: 2, name: 'b'}}` |
+| mapKeys | `<T extends Record<string, unknown>>(object: T, function_: (value: T[keyof T], key: string) => string) => Record<string, T[keyof T]>` | Creates an object with the same values but keys transformed by the provided function | `mapKeys({a: 1, b: 2}, (_v, k) => k.toUpperCase()); // {A: 1, B: 2}` |
+| mapValues | `<T extends Record<string, unknown>, R>(object: T, function_: (value: T[keyof T], key: string) => R) => Record<keyof T, R>` | Creates an object with the same keys but values transformed by the provided function | `mapValues({a: 1, b: 2}, (v) => v * 2); // {a: 2, b: 4}` |
 | merge | `<T extends Record<string, unknown>>(target: T, ...sources: Partial<T>[]) => T` | Merges multiple objects into a single object (shallow merge) | `merge({a: 1}, {b: 2}); // {a: 1, b: 2}` |
 | mergeDeep | `<T extends Record<string, unknown>>(target: T, ...sources: Partial<T>[]) => T` | Deeply merges multiple objects into a single object | `mergeDeep({a: {b: 1}}, {a: {c: 2}}); // {a: {b: 1, c: 2}}` |
 | omit | `<T extends Record<string, unknown>, K extends keyof T>(object: T, ...keys: K[]) => Omit<T, K>` | Creates an object without the specified keys | `omit({a: 1, b: 2, c: 3}, 'b'); // {a: 1, c: 3}` |
 | pick | `<T extends object, K extends keyof T>(object: T, ...keys: K[]) => Pick<T, K>` | Creates a new object with only the specified properties from the source object | `pick({ id: 1, name: 'Alice', age: 30 }, 'id', 'name'); // { id: 1, name: 'Alice' }` |
 | pickDeep | `<T extends object, K extends PickDeepKey<T>>(object: T, ...keys: K[]) => PickDeep<T>` | Creates a new object by deeply selecting properties from the source object based on specified keys | `pickDeep({ a: { b: { c: 1, d: 2 }, e: 3 }, f: 4 }, 'a.b.c', 'f'); // { a: { b: { c: 1 } }, f: 4 }` |
 
+### Predicate
+
+| name | type | description | example |
+|------|------|-------------|---------|
+| every | `<T extends unknown[]>(...predicates: ((...args: T) => boolean)[]) => (...args: T) => boolean` | Creates a predicate that returns true only when all given predicates return true | `every((n: number) => n > 0, (n) => n % 2 === 0)(4); // true` |
+| isNullish | `(value: unknown) => value is null \| undefined` | Checks if a value is null or undefined | `isNullish(null); // true; isNullish(0); // false` |
+| matches | `(pattern: Record<string, unknown>) => (object: Record<string, unknown>) => boolean` | Creates a predicate that checks if an object matches a given pattern | `matches({role: "admin"})({name: "Alice", role: "admin"}); // true` |
+| not | `<T extends unknown[]>(function_: (...args: T) => boolean) => (...args: T) => boolean` | Creates a predicate that negates the given predicate | `const isOdd = not((n: number) => n % 2 === 0); isOdd(3); // true` |
+| some | `<T extends unknown[]>(...predicates: ((...args: T) => boolean)[]) => (...args: T) => boolean` | Creates a predicate that returns true when at least one predicate returns true | `some((n: number) => n === 0, (n) => n < 0)(0); // true` |
+
 ### Simple
 
 | name | type | description | example |
@@ -256,6 +307,15 @@ bun add umt
 | extractOsFromUserAgent | `(ua: string) => SimplifiedUserAgentInfoOs` | Extracts operating system information from a User-Agent string | `extractOsFromUserAgent(navigator.userAgent); // "macos"` |
 | parseUserAgent | `(userAgent: string) => SimplifiedUserAgentInfo` | Parse a User-Agent string to extract browser, device, and OS information | `parseUserAgent(navigator.userAgent); // {browser: "chrome", device: "desktop", os: "macos"}` |
 
+### URL
+
+| name | type | description | example |
+|------|------|-------------|---------|
+| buildUrl | `(base: string, parameters?: Record<string, string>) => string` | Builds a URL with query parameters appended | `buildUrl("https://example.com", {page: "1", q: "search"}); // "https://example.com/?page=1&q=search"` |
+| isAbsoluteUrl | `(url: string) => boolean` | Checks if a URL is absolute (RFC 3986) | `isAbsoluteUrl("https://example.com"); // true; isAbsoluteUrl("/path"); // false` |
+| joinPath | `(...segments: string[]) => string` | Joins multiple path segments into one path, normalizing slashes | `joinPath("https://example.com/", "/api/", "/users"); // "https://example.com/api/users"` |
+| parseQueryString | `(query: string) => Record<string, string>` | Parses a query string into a key-value record | `parseQueryString("?page=1&q=search"); // {page: "1", q: "search"}` |
+
 ### Unit
 
 | name | type | description | example |

package/module/Array/arraysJoin.js

@@ -6,6 +6,6 @@
  * @example arraysJoin([1, 2, 3], [2, 3, 4]); // [1, 2, 3, 4]
  */
 export const arraysJoin = (array, ...arrays) => {
-    return [...new Set(array.concat(...arrays))];
+    return [...new Set([...array, ...arrays.flat()])];
 };
 //# sourceMappingURL=arraysJoin.js.map

package/module/Array/arraysJoin.js.map

@@ -1 +1 @@
-{"version":3,"file":"arraysJoin.js","sourceRoot":"","sources":["../../src/Array/arraysJoin.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,KAAgB,EAChB,GAAG,MAAiB,EACpB,EAAE;IACF,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAM,CAAC;AACpD,CAAC,CAAC"}
+{"version":3,"file":"arraysJoin.js","sourceRoot":"","sources":["../../src/Array/arraysJoin.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,KAAgB,EAChB,GAAG,MAAiB,EACpB,EAAE;IACF,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAM,CAAC;AACzD,CAAC,CAAC"}

package/module/Array/chunk.js

@@ -1,7 +1,6 @@
 export const chunk = (array, n) => {
     const length = array.length;
-    // eslint-disable-next-line unicorn/no-new-array
-    const result = new Array(Math.ceil(length / n));
+    const result = Array.from({ length: Math.ceil(length / n) });
     for (let index = 0, k = 0; index < length; index += n, k++) {
         result[k] = array.slice(index, index + n);
     }

package/module/Array/chunk.js.map

@@ -1 +1 @@
-{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../../src/Array/chunk.ts"],"names":[],"mappings":"AAOA,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,KAAQ,EACR,CAAI,EACkB,EAAE;IACxB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,gDAAgD;IAChD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3D,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAmB,CAAC;IAC9D,CAAC;IAED,OAAO,MAA8B,CAAC;AACxC,CAAC,CAAC"}
+{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../../src/Array/chunk.ts"],"names":[],"mappings":"AAOA,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,KAAQ,EACR,CAAI,EACkB,EAAE;IACxB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAE7D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3D,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAmB,CAAC;IAC9D,CAAC;IAED,OAAO,MAA8B,CAAC;AACxC,CAAC,CAAC"}

package/module/Array/generateNumberArray.js

@@ -18,15 +18,25 @@ export const generateNumberArray = (length, min = 0, max, random = false) => {
     if (actualLength <= 0) {
         return [];
     }
-    if (min > actualMax) {
-        throw new Error("min should be less than or equal to max");
-    }
     if (actualLength === 1) {
         return [min];
     }
+    const isIntegerInputs = Number.isSafeInteger(min) && Number.isSafeInteger(actualMax);
     if (random) {
+        if (isIntegerInputs) {
+            const range = actualMax - min + 1;
+            return Array.from({ length: actualLength }, () => Math.floor(Math.random() * range) + min);
+        }
         return Array.from({ length: actualLength }, () => addition(Math.floor(multiplication(Math.random(), addition(subtract(actualMax, min), 1))), min));
     }
+    if (isIntegerInputs) {
+        const range = actualMax - min;
+        const steps = actualLength - 1;
+        if (range % steps === 0) {
+            const step = range / steps;
+            return Array.from({ length: actualLength }, (_, index) => min + index * step);
+        }
+    }
     const step = division(subtract(actualMax, min), subtract(actualLength, 1));
     return Array.from({ length: actualLength }, (_, index) => addition(min, multiplication(index, step)));
 };

package/module/Array/generateNumberArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"generateNumberArray.js","sourceRoot":"","sources":["../../src/Array/generateNumberArray.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAE3C;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,MAAc,EACd,GAAG,GAAG,CAAC,EACP,GAAY,EACZ,MAAM,GAAG,KAAK,EACJ,EAAE;IACZ,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,GAAG,IAAI,YAAY,GAAG,CAAC,CAAC;IAC1C,IAAI,YAAY,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,GAAG,GAAG,SAAS,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,CAC/C,QAAQ,CACN,IAAI,CAAC,KAAK,CACR,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CACrE,EACD,GAAG,CACJ,CACF,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3E,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CACvD,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAC3C,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"generateNumberArray.js","sourceRoot":"","sources":["../../src/Array/generateNumberArray.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAE3C;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,MAAc,EACd,GAAG,GAAG,CAAC,EACP,GAAY,EACZ,MAAM,GAAG,KAAK,EACJ,EAAE;IACZ,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,GAAG,IAAI,YAAY,GAAG,CAAC,CAAC;IAC1C,IAAI,YAAY,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,MAAM,eAAe,GACnB,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;IAE/D,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC;YAClC,OAAO,KAAK,CAAC,IAAI,CACf,EAAE,MAAM,EAAE,YAAY,EAAE,EACxB,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,GAAG,CAC9C,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,CAC/C,QAAQ,CACN,IAAI,CAAC,KAAK,CACR,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CACrE,EACD,GAAG,CACJ,CACF,CAAC;IACJ,CAAC;IAED,IAAI,eAAe,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,SAAS,GAAG,GAAG,CAAC;QAC9B,MAAM,KAAK,GAAG,YAAY,GAAG,CAAC,CAAC;QAC/B,IAAI,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC,IAAI,CACf,EAAE,MAAM,EAAE,YAAY,EAAE,EACxB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,GAAG,IAAI,CACjC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3E,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CACvD,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAC3C,CAAC;AACJ,CAAC,CAAC"}

package/module/Array/getArraysDiff.js

@@ -10,7 +10,11 @@ export const getArraysDiff = (array, ...arrays) => {
     const duplicates = new Set();
     for (const array_ of arrays) {
         for (const value of array_) {
+            if (duplicates.has(value)) {
+                continue;
+            }
             if (allValues.has(value)) {
+                allValues.delete(value);
                 duplicates.add(value);
             }
             else {
@@ -18,6 +22,6 @@ export const getArraysDiff = (array, ...arrays) => {
             }
         }
     }
-    return [...allValues].filter((value) => !duplicates.has(value));
+    return [...allValues];
 };
 //# sourceMappingURL=getArraysDiff.js.map

package/module/Array/getArraysDiff.js.map

@@ -1 +1 @@
-{"version":3,"file":"getArraysDiff.js","sourceRoot":"","sources":["../../src/Array/getArraysDiff.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAQ,EACR,GAAG,MAAW,EACX,EAAE;IACL,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAK,CAAC;IAEhC,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,KAAU,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,CAC1B,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,KAAU,CAAC,CACvB,CAAC;AACpB,CAAC,CAAC"}
+{"version":3,"file":"getArraysDiff.js","sourceRoot":"","sources":["../../src/Array/getArraysDiff.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAQ,EACR,GAAG,MAAW,EACX,EAAE;IACL,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAK,CAAC;IAEhC,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,UAAU,CAAC,GAAG,CAAC,KAAU,CAAC,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YACD,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACxB,UAAU,CAAC,GAAG,CAAC,KAAU,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,SAAS,CAAiB,CAAC;AACxC,CAAC,CAAC"}

package/module/Array/mergeSort.js

@@ -10,30 +10,57 @@ export const mergeSort = (array, compareFunction = compareFunctionDefault) => {
     if (array.length <= 1) {
         return array;
     }
-    const middle = Math.floor(array.length / 2);
-    const left = array.slice(0, middle);
-    const right = array.slice(middle);
-    return merge(mergeSort(left, compareFunction), mergeSort(right, compareFunction), compareFunction);
+    const length = array.length;
+    const result = [...array];
+    const aux = [...array];
+    mergeSortRecursive(result, aux, 0, length, compareFunction);
+    return result;
 };
 /**
- * Helper function to merge two sorted arrays
- * @param left Left array to merge
- * @param right Right array to merge
- * @param compareFunction Comparison function to determine order
- * @returns New merged array in sorted order
+ * Recursive merge sort implementation
+ * @param array Array to sort
+ * @param aux Auxiliary array
+ * @param start Start index
+ * @param end End index
+ * @param compareFunction Comparison function
  */
-function merge(left, right, compareFunction) {
-    const array = [];
-    let lIndex = 0;
-    let rIndex = 0;
-    while (lIndex < left.length && rIndex < right.length) {
-        if (compareFunction(left[lIndex], right[rIndex]) <= 0) {
-            array.push(left[lIndex++]);
+function mergeSortRecursive(array, aux, start, end, compareFunction) {
+    if (end - start <= 1) {
+        return;
+    }
+    const mid = (start + end) >>> 1;
+    mergeSortRecursive(array, aux, start, mid, compareFunction);
+    mergeSortRecursive(array, aux, mid, end, compareFunction);
+    merge(array, aux, start, mid, end, compareFunction);
+}
+/**
+ * Merges two sorted subarrays
+ * @param array Array containing the subarrays
+ * @param aux Auxiliary array
+ * @param start Start index
+ * @param mid Middle index
+ * @param end End index
+ * @param compareFunction Comparison function
+ */
+function merge(array, aux, start, mid, end, compareFunction) {
+    for (let index = start; index < end; index++) {
+        aux[index] = array[index];
+    }
+    let leftIndex = start;
+    let rightIndex = mid;
+    for (let k = start; k < end; k++) {
+        if (leftIndex >= mid) {
+            array[k] = aux[rightIndex++];
+        }
+        else if (rightIndex >= end) {
+            array[k] = aux[leftIndex++];
+        }
+        else if (compareFunction(aux[leftIndex], aux[rightIndex]) <= 0) {
+            array[k] = aux[leftIndex++];
         }
         else {
-            array.push(right[rIndex++]);
+            array[k] = aux[rightIndex++];
         }
     }
-    return array.concat(left.slice(lIndex)).concat(right.slice(rIndex));
 }
 //# sourceMappingURL=mergeSort.js.map

package/module/Array/mergeSort.js.map

@@ -1 +1 @@
-{"version":3,"file":"mergeSort.js","sourceRoot":"","sources":["../../src/Array/mergeSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAU,EACV,kBAAsC,sBAAsB,EACvD,EAAE;IACP,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAElC,OAAO,KAAK,CACV,SAAS,CAAC,IAAI,EAAE,eAAe,CAAC,EAChC,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,EACjC,eAAe,CAChB,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,KAAK,CACZ,IAAS,EACT,KAAU,EACV,eAAuC;IAEvC,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACrD,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACtE,CAAC"}
+{"version":3,"file":"mergeSort.js","sourceRoot":"","sources":["../../src/Array/mergeSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAU,EACV,kBAAsC,sBAAsB,EACvD,EAAE;IACP,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC1B,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAEvB,kBAAkB,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IAE5D,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,SAAS,kBAAkB,CACzB,KAAU,EACV,GAAQ,EACR,KAAa,EACb,GAAW,EACX,eAAuC;IAEvC,IAAI,GAAG,GAAG,KAAK,IAAI,CAAC,EAAE,CAAC;QACrB,OAAO;IACT,CAAC;IAED,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAEhC,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;IAC5D,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;IAE1D,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,KAAK,CACZ,KAAU,EACV,GAAQ,EACR,KAAa,EACb,GAAW,EACX,GAAW,EACX,eAAuC;IAEvC,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;QAC7C,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,UAAU,GAAG,GAAG,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,SAAS,IAAI,GAAG,EAAE,CAAC;YACrB,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;QAC/B,CAAC;aAAM,IAAI,UAAU,IAAI,GAAG,EAAE,CAAC;YAC7B,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9B,CAAC;aAAM,IAAI,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACjE,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;AACH,CAAC"}

package/module/Array/pop.js

@@ -4,6 +4,7 @@
  * @returns {T | undefined} - The last element of the array, or undefined if the array is empty.
  */
 export const pop = (array) => {
-    return [...array].pop();
+    // O(1) performance instead of O(N) from [...array].pop()
+    return array.at(-1);
 };
 //# sourceMappingURL=pop.js.map

package/module/Array/pop.js.map

@@ -1 +1 @@
-{"version":3,"file":"pop.js","sourceRoot":"","sources":["../../src/Array/pop.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAI,KAAU,EAAE,EAAE;IACnC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;AAC1B,CAAC,CAAC"}
+{"version":3,"file":"pop.js","sourceRoot":"","sources":["../../src/Array/pop.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAI,KAAU,EAAiB,EAAE;IAClD,yDAAyD;IACzD,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC,CAAC"}

package/module/Array/randomSelect.js

@@ -1,3 +1,4 @@
+import { shuffle } from "./shuffle";
 /**
  * Randomly selects a specified number of elements from an array
  * @param array Source array
@@ -7,6 +8,13 @@
  * @example randomSelect([1, 2, 3, 4, 5], 2); // [3, 1]
  */
 export const randomSelect = (array, count, allowDuplicates = false) => {
+    if (!allowDuplicates && count > array.length * 0.8) {
+        const shuffled = shuffle(array);
+        if (count < shuffled.length) {
+            shuffled.length = count;
+        }
+        return shuffled;
+    }
     const result = [];
     const usedIndices = new Set();
     while (result.length < count &&

package/module/Array/randomSelect.js.map

@@ -1 +1 @@
-{"version":3,"file":"randomSelect.js","sourceRoot":"","sources":["../../src/Array/randomSelect.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAU,EACV,KAAa,EACb,eAAe,GAAG,KAAK,EAClB,EAAE;IACP,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,OACE,MAAM,CAAC,MAAM,GAAG,KAAK;QACrB,CAAC,eAAe,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,EACjD,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7D,IAAI,eAAe,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACrD,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}
+{"version":3,"file":"randomSelect.js","sourceRoot":"","sources":["../../src/Array/randomSelect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAU,EACV,KAAa,EACb,eAAe,GAAG,KAAK,EAClB,EAAE;IACP,IAAI,CAAC,eAAe,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC5B,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC;QAC1B,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,OACE,MAAM,CAAC,MAAM,GAAG,KAAK;QACrB,CAAC,eAAe,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,EACjD,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7D,IAAI,eAAe,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACrD,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/module/Array/sortingHelpers/rangeValidator.js

@@ -1,3 +1,4 @@
+import { clamp } from "../../Math/clamp";
 /**
  * Validates and adjusts the start and end indices for an operation on an array.
  * Ensures indices are within the bounds of the array.
@@ -15,8 +16,8 @@ export const validateRange = (array, startIndex, endIndex) => {
     if (length === 0) {
         return { startIndex: 0, endIndex: -1, shouldSort: false };
     }
-    const validatedStartIndex = Math.max(0, Math.min(startIndex, length - 1));
-    const validatedEndIndex = Math.max(validatedStartIndex, Math.min(endIndex, length - 1));
+    const validatedStartIndex = clamp(startIndex, 0, length - 1);
+    const validatedEndIndex = Math.max(validatedStartIndex, clamp(endIndex, 0, length - 1));
     return {
         startIndex: validatedStartIndex,
         endIndex: validatedEndIndex,

package/module/Array/sortingHelpers/rangeValidator.js.map

@@ -1 +1 @@
-{"version":3,"file":"rangeValidator.js","sourceRoot":"","sources":["../../../src/Array/sortingHelpers/rangeValidator.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAU,EACV,UAAkB,EAClB,QAAgB,EACI,EAAE;IACtB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,4BAA4B;IAC5B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC5D,CAAC;IAED,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAChC,mBAAmB,EACnB,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;IAEF,OAAO;QACL,UAAU,EAAE,mBAAmB;QAC/B,QAAQ,EAAE,iBAAiB;QAC3B,UAAU,EAAE,iBAAiB,IAAI,mBAAmB;KACrD,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"rangeValidator.js","sourceRoot":"","sources":["../../../src/Array/sortingHelpers/rangeValidator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AAQrC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAU,EACV,UAAkB,EAClB,QAAgB,EACI,EAAE;IACtB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,4BAA4B;IAC5B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC5D,CAAC;IAED,MAAM,mBAAmB,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7D,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAChC,mBAAmB,EACnB,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;IAEF,OAAO;QACL,UAAU,EAAE,mBAAmB;QAC/B,QAAQ,EAAE,iBAAiB;QAC3B,UAAU,EAAE,iBAAiB,IAAI,mBAAmB;KACrD,CAAC;AACJ,CAAC,CAAC"}

package/module/Array/timSort.js

@@ -8,33 +8,34 @@ const MIN_RUN = 32;
  * @param mid Middle index separating the two portions
  * @param end Ending index of the second portion
  * @param compareFunction Function to compare elements
+ * @param temporary Temporary array for merging
  */
-const merge = (array, start, mid, end, compareFunction) => {
-    const left = array.slice(start, mid + 1);
-    const right = array.slice(mid + 1, end + 1);
-    let leftIndex = 0;
-    let rightIndex = 0;
-    let arrayIndex = start;
-    while (leftIndex < left.length && rightIndex < right.length) {
-        if (compareFunction(left[leftIndex], right[rightIndex]) <= 0) {
-            array[arrayIndex] = left[leftIndex];
-            leftIndex++;
+const merge = (array, start, mid, end, compareFunction, temporary) => {
+    const length1 = mid - start + 1;
+    if (compareFunction(array[mid], array[mid + 1]) <= 0) {
+        return;
+    }
+    for (let index = 0; index < length1; index++) {
+        temporary[index] = array[start + index];
+    }
+    let index = 0;
+    let index_ = mid + 1;
+    let k = start;
+    while (index < length1 && index_ <= end) {
+        if (compareFunction(temporary[index], array[index_]) <= 0) {
+            array[k] = temporary[index];
+            index++;
         }
         else {
-            array[arrayIndex] = right[rightIndex];
-            rightIndex++;
+            array[k] = array[index_];
+            index_++;
         }
-        arrayIndex++;
-    }
-    while (leftIndex < left.length) {
-        array[arrayIndex] = left[leftIndex];
-        leftIndex++;
-        arrayIndex++;
+        k++;
     }
-    while (rightIndex < right.length) {
-        array[arrayIndex] = right[rightIndex];
-        rightIndex++;
-        arrayIndex++;
+    while (index < length1) {
+        array[k] = temporary[index];
+        k++;
+        index++;
     }
 };
 /**
@@ -75,12 +76,13 @@ export const timSort = (array, compareFunction = (compareFunctionDefault), start
         const runEnd = Math.min(runStart + minRun - 1, end);
         insertionSortRange(result, compareFunction, runStart, runEnd);
     }
+    const temporary = [];
     for (let size = minRun; size < n; size *= 2) {
         for (let left = start; left <= end; left += 2 * size) {
             const mid = left + size - 1;
             const right = Math.min(left + 2 * size - 1, end);
             if (mid < right) {
-                merge(result, left, mid, right, compareFunction);
+                merge(result, left, mid, right, compareFunction, temporary);
             }
         }
     }

package/module/Array/timSort.js.map

@@ -1 +1 @@
-{"version":3,"file":"timSort.js","sourceRoot":"","sources":["../../src/Array/timSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qCAAqC,CAAC;AAIzE,MAAM,OAAO,GAAG,EAAE,CAAC;AAEnB;;;;;;;GAOG;AACH,MAAM,KAAK,GAAG,CACZ,KAAU,EACV,KAAa,EACb,GAAW,EACX,GAAW,EACX,eAAmC,EAC7B,EAAE;IACR,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,KAAK,CAAC;IAEvB,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5D,IAAI,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7D,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;YACpC,SAAS,EAAE,CAAC;QACd,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;YACtC,UAAU,EAAE,CAAC;QACf,CAAC;QACD,UAAU,EAAE,CAAC;IACf,CAAC;IAED,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,SAAS,EAAE,CAAC;QACZ,UAAU,EAAE,CAAC;IACf,CAAC;IAED,OAAO,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;QACtC,UAAU,EAAE,CAAC;QACb,UAAU,EAAE,CAAC;IACf,CAAC;AACH,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,KAAa,EAAU,EAAE;IAChD,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;QACpB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,KAAK,CAAC,CAAC;IACV,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAU,EACV,kBAAsC,CAAA,sBAAyB,CAAA,EAC/D,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAElC,KAAK,IAAI,QAAQ,GAAG,KAAK,EAAE,QAAQ,IAAI,GAAG,EAAE,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACpD,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAChE,CAAC;IAED,KAAK,IAAI,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC5C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;YACrD,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAEjD,IAAI,GAAG,GAAG,KAAK,EAAE,CAAC;gBAChB,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}
+{"version":3,"file":"timSort.js","sourceRoot":"","sources":["../../src/Array/timSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qCAAqC,CAAC;AAIzE,MAAM,OAAO,GAAG,EAAE,CAAC;AAEnB;;;;;;;;GAQG;AACH,MAAM,KAAK,GAAG,CACZ,KAAU,EACV,KAAa,EACb,GAAW,EACX,GAAW,EACX,eAAmC,EACnC,SAAc,EACR,EAAE;IACR,MAAM,OAAO,GAAG,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;IAEhC,IAAI,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACrD,OAAO;IACT,CAAC;IAED,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC7C,SAAS,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,KAAK,CAAC;IAEd,OAAO,KAAK,GAAG,OAAO,IAAI,MAAM,IAAI,GAAG,EAAE,CAAC;QACxC,IAAI,eAAe,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1D,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;YAC5B,KAAK,EAAE,CAAC;QACV,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YACzB,MAAM,EAAE,CAAC;QACX,CAAC;QACD,CAAC,EAAE,CAAC;IACN,CAAC;IAED,OAAO,KAAK,GAAG,OAAO,EAAE,CAAC;QACvB,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC,EAAE,CAAC;QACJ,KAAK,EAAE,CAAC;IACV,CAAC;AACH,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,KAAa,EAAU,EAAE;IAChD,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;QACpB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,KAAK,CAAC,CAAC;IACV,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAU,EACV,kBAAsC,CAAA,sBAAyB,CAAA,EAC/D,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAElC,KAAK,IAAI,QAAQ,GAAG,KAAK,EAAE,QAAQ,IAAI,GAAG,EAAE,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACpD,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,SAAS,GAAQ,EAAE,CAAC;IAE1B,KAAK,IAAI,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC5C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;YACrD,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAEjD,IAAI,GAAG,GAAG,KAAK,EAAE,CAAC;gBAChB,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}