UMT Main Package

UMT Main Package is written in TypeScript and is a collection of useful functions for various tasks.

Install

``bash npm install umt

`or`

yarn add umt

`or`

pnpm add umt

`or`

bun add umt`

`Function List`

`$3`

| name | type | description | example | |------|------|-------------|---------| | rangeAdvance |(start: number, end?: number, conditionalExpression?: (n: number) => boolean) => number[] | Returns an array of numbers that satisfy the conditional expression | rangeAdvance(1, 10, (n) => n % 2 === 0); // [2, 4, 6, 8] |

`$3`

| name | type | description | example | |------|------|-------------|---------| | arraysJoin |(array: unknown[], ...arrays: unknown[]) => A | Join arrays without duplicates | arraysJoin([1, 2, 3], [2, 3, 4]); // [1, 2, 3, 4]| | binarySearch |(array: number[], target: number) => number | Binary search implementation | binarySearch([1, 2, 3, 4, 5], 3); // 2| | checkFlagAlignment |(matrix: T[][]) => boolean | Check if flags are aligned in any direction (horizontal, vertical, or diagonal) | checkFlagAlignment([[{flag: true}, {flag: true}]]); // true| | chunk |(array: T, n: N) => ChunkArrayType | Split an array into smaller chunks of specified size | chunk([1, 2, 3, 4, 5, 6, 7, 8, 9], 3); // [[1, 2, 3], [4, 5, 6], [7, 8, 9]]| | compact |(array: T[]) => T[] | Creates an array with all falsey values removed | compact([0, 1, false, 2, '', 3]); // [1, 2, 3]| | drop |(array: T[], n?: number, direction?: "left" \| "right" \| "between") => T[] | Returns a new array with n elements removed from the specified direction | drop([1, 2, 3, 4, 5], 2); // [3, 4, 5]| | dualPivotQuickSort |(array: T[], compareFunction?: CompareFunction, startIndex?: number, endIndex?: number, insertionSortThreshold?: number) => T[] | Sort array using dual-pivot quicksort algorithm | dualPivotQuickSort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3]); // [1, 1, 2, 3, 3, 4, 5, 5, 6, 9]| | first |(array: T) => First | Returns the first element of an array | first([1, 2, 3]); // 1| | generateNumberArray |(length: number, min?: number, max?: number, random?: boolean) => number[] | Generates an array of numbers with the specified length | generateNumberArray(5); // [0, 1, 2, 3, 4]| | getArraysCommon |(array: T, ...arrays: T[]) => O | Extract common elements from multiple arrays | getArraysCommon([1, 2, 3], [2, 3, 4], [2, 5, 3]); // [2, 3]| | getArraysDiff |(array: T, ...arrays: T[]) => O | Extract elements that are not common between arrays | getArraysDiff([1, 2, 3], [2, 3, 4]); // [1, 4]| | groupBy |(array: T[], iteratee: (value: T, index: number, array: T[]) => K) => Record | Groups elements of an array based on a given iteratee function | groupBy([6.1, 4.2, 6.3], Math.floor); // { '4': [4.2], '6': [6.1, 6.3] }| | insertionSort |(array: T[], compareFunction?: CompareFunction, start?: number, end?: number) => T[] | Sort an array using insertion sort algorithm | insertionSort([4, 2, 7, 1, 3]); // [1, 2, 3, 4, 7]| | mergeSort |(array: T[], compareFunction?: CompareFunction) => T[] | Merge sort implementation | mergeSort([1, 3, 2, 4, 5], (a, b) => a - b); // [1, 2, 3, 4, 5]| | pop |(array: T[]) => T \| undefined | Removes the last element from an array and returns it | pop([1, 2, 3]); // 3| | quickSort |(array: T[], compareFunction?: CompareFunction, startIndex?: number, endIndex?: number, insertionSortThreshold?: number) => T[] | Sorts an array using a hybrid algorithm combining QuickSort and InsertionSort | quickSort([1, 3, 2, 4, 5]); // [1, 2, 3, 4, 5]| | randomSelect |(array: T[], count: number, allowDuplicates?: boolean) => T[] | Randomly selects a specified number of elements from an array | randomSelect([1, 2, 3, 4, 5], 2); // [3, 1]| | range |(start: number, end?: number, step?: number) => number[] | Generates an array of sequential numbers | range(5); // [0, 1, 2, 3, 4]| | shuffle |(array: T[]) => T[] | Randomly shuffles the elements of an array | shuffle([1, 2, 3, 4, 5]); // [3, 5, 2, 4, 1]| | shuffle2DArray |(array: T[][]) => T[][] | Shuffles all elements in a 2D array while maintaining the row lengths | shuffle2DArray([[1, 2], [3, 4], [5, 6]]); // [[1, 3], [6, 4], [2, 5]]| | sum |(x: number[]) => number | Returns the sum of an array of numbers | sum([1, 2, 3]); // 6| | timSort |(array: T[], compareFunction?: CompareFunction, start?: number, end?: number) => T[] | Implementation of the TimSort algorithm | timSort([3, 1, 4, 1, 5]); // [1, 1, 3, 4, 5]| | ultraNumberSort |(array: number[], ascending?: boolean) => number[] | Ultra-fast sorting specifically optimized for number arrays | ultraNumberSort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3]); // [1, 1, 2, 3, 3, 4, 5, 5, 6, 9]| | uniqBy |(array: T[], selector: (item: T) => K) => T[] | Removes duplicate values from an array based on a selector function | uniqBy([{id: 1}, {id: 2}, {id: 1}], item => item.id); // [{id: 1}, {id: 2}]| | unique |(array: T[]) => T[] | Removes duplicate values from an array | unique([1, 2, 2, 3, 3]); // [1, 2, 3]| | zip |(...arrays: T) => ZipArrayType | Creates a new array by combining elements from multiple arrays at corresponding positions | zip([1, 2], ['a', 'b']); // [[1, 'a'], [2, 'b']]| | zipLongest |(...arrays: T) => ZipArrayType | Combines arrays of different lengths by padding shorter arrays with undefined values | zipLongest([1, 2], ['a']); // [[1, 'a'], [2, undefined]] |