umt 2.6.0 → 2.8.0

package/module/DataStructure/priorityQueue.js

@@ -0,0 +1,327 @@
+/**
+ * A priority queue implementation using a binary heap.
+ * Higher priority values are dequeued first.
+ *
+ * ## Features
+ * - **enqueue(value, priority)**: Add element with priority
+ * - **enqueueBack(value)**: Add element to the back with lowest priority
+ * - **dequeue()**: Remove and return highest priority element
+ * - **peek()**: View highest priority element without removing
+ * - **peekPriority()**: View highest priority value
+ * - **size**: Get number of elements
+ * - **isEmpty**: Check if queue is empty
+ * - **clear()**: Remove all elements
+ * - **toArray()**: Get all elements as array
+ * - **toArrayWithPriorities()**: Get all elements with priorities
+ *
+ * ## Time Complexity
+ * - enqueue: O(log n)
+ * - enqueueBack: O(log n)
+ * - dequeue: O(log n)
+ * - peek: O(1)
+ * - peekPriority: O(1)
+ *
+ * @example
+ * ```typescript
+ * const queue = new PriorityQueue<string>();
+ * queue.enqueue("low", 1);
+ * queue.enqueue("high", 3);
+ * queue.enqueue("medium", 2);
+ *
+ * console.log(queue.dequeue()); // "high"
+ * console.log(queue.dequeue()); // "medium"
+ * console.log(queue.dequeue()); // "low"
+ * ```
+ *
+ * @example
+ * ```typescript
+ * // Initialize with elements
+ * const queue = new PriorityQueue([
+ *   { value: "task1", priority: 1 },
+ *   { value: "task2", priority: 3 },
+ *   { value: "task3", priority: 2 }
+ * ]);
+ *
+ * console.log(queue.peek()); // "task2"
+ * console.log(queue.peekPriority()); // 3
+ * ```
+ *
+ * @template T - The type of elements stored in the queue
+ */
+export class PriorityQueue {
+    heap = [];
+    minPriority = 0;
+    /**
+     * Creates a new PriorityQueue instance.
+     * @param initialElements - Optional array of initial elements with priorities
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * // or
+     * const queue = new PriorityQueue([
+     *   { value: "item1", priority: 10 },
+     *   { value: "item2", priority: 5 }
+     * ]);
+     * ```
+     */
+    constructor(initialElements) {
+        if (initialElements) {
+            this.heap = [...initialElements];
+            this.updateMinPriority();
+            this.buildHeap();
+        }
+    }
+    /**
+     * Returns the number of elements in the queue.
+     * @returns The number of elements in the queue
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("item", 1);
+     * console.log(queue.size); // 1
+     * ```
+     */
+    get size() {
+        return this.heap.length;
+    }
+    /**
+     * Checks if the queue is empty.
+     * @returns True if the queue is empty, false otherwise
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * console.log(queue.isEmpty); // true
+     * queue.enqueue("item", 1);
+     * console.log(queue.isEmpty); // false
+     * ```
+     */
+    get isEmpty() {
+        return this.heap.length === 0;
+    }
+    /**
+     * Adds an element to the queue with a specified priority.
+     * Higher priority values are dequeued first.
+     * @param value - The value to add
+     * @param priority - The priority value (higher values have higher priority)
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("low", 1);
+     * queue.enqueue("high", 10);
+     * queue.enqueue("medium", 5);
+     * console.log(queue.dequeue()); // "high"
+     * ```
+     */
+    enqueue(value, priority) {
+        this.heap.push({ value, priority });
+        this.updateMinPriorityOnAdd(priority);
+        this.heapifyUp(this.heap.length - 1);
+    }
+    /**
+     * Adds an element to the end of the queue with lowest priority.
+     * This element will be dequeued last (FIFO for equal lowest priority).
+     *
+     * @param value - The value to add
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("high", 10);
+     * queue.enqueue("medium", 5);
+     * queue.enqueueBack("back1");
+     * queue.enqueueBack("back2");
+     * console.log(queue.dequeue()); // "high"
+     * console.log(queue.dequeue()); // "medium"
+     * console.log(queue.dequeue()); // "back1"
+     * console.log(queue.dequeue()); // "back2"
+     * ```
+     */
+    enqueueBack(value) {
+        const newPriority = this.minPriority - 1;
+        this.heap.push({ value, priority: newPriority });
+        this.minPriority = newPriority;
+        this.heapifyUp(this.heap.length - 1);
+    }
+    /**
+     * Removes and returns the element with the highest priority.
+     * @returns The element with highest priority, or undefined if queue is empty
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("low", 1);
+     * queue.enqueue("high", 10);
+     * console.log(queue.dequeue()); // "high"
+     * console.log(queue.dequeue()); // "low"
+     * console.log(queue.dequeue()); // undefined
+     * ```
+     */
+    dequeue() {
+        if (this.heap.length === 0) {
+            return;
+        }
+        if (this.heap.length === 1) {
+            return this.heap.pop()?.value;
+        }
+        const result = this.heap[0].value;
+        // biome-ignore lint/style/noNonNullAssertion: pop() cannot return undefined when heap.length > 1
+        this.heap[0] = this.heap.pop();
+        this.heapifyDown(0);
+        return result;
+    }
+    /**
+     * Returns the element with the highest priority without removing it.
+     * @returns The element with highest priority, or undefined if queue is empty
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("low", 1);
+     * queue.enqueue("high", 10);
+     * console.log(queue.peek()); // "high"
+     * console.log(queue.size); // 2 (element not removed)
+     * ```
+     */
+    peek() {
+        return this.heap[0]?.value;
+    }
+    /**
+     * Returns the priority of the element with the highest priority.
+     * @returns The highest priority value, or undefined if queue is empty
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("low", 1);
+     * queue.enqueue("high", 10);
+     * console.log(queue.peekPriority()); // 10
+     * ```
+     */
+    peekPriority() {
+        return this.heap[0]?.priority;
+    }
+    /**
+     * Removes all elements from the queue.
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("item1", 1);
+     * queue.enqueue("item2", 2);
+     * console.log(queue.size); // 2
+     * queue.clear();
+     * console.log(queue.size); // 0
+     * console.log(queue.isEmpty); // true
+     * ```
+     */
+    clear() {
+        this.heap = [];
+        this.minPriority = 0;
+    }
+    /**
+     * Returns an array of all elements in the queue (without removing them).
+     * The order is not guaranteed to be sorted by priority.
+     * @returns Array of all elements in the queue
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("low", 1);
+     * queue.enqueue("high", 10);
+     * queue.enqueue("medium", 5);
+     * console.log(queue.toArray()); // ["high", "medium", "low"] (order may vary)
+     * ```
+     */
+    toArray() {
+        return this.heap.map((item) => item.value);
+    }
+    /**
+     * Returns an array of all elements with their priorities.
+     * The order is not guaranteed to be sorted by priority.
+     * @returns Array of all elements with their priorities
+     * @example
+     * ```typescript
+     * const queue = new PriorityQueue<string>();
+     * queue.enqueue("low", 1);
+     * queue.enqueue("high", 10);
+     * console.log(queue.toArrayWithPriorities());
+     * // [{ value: "high", priority: 10 }, { value: "low", priority: 1 }] (order may vary)
+     * ```
+     */
+    toArrayWithPriorities() {
+        return [...this.heap];
+    }
+    /**
+     * Updates the minimum priority when adding elements.
+     * @param priority - The priority being added
+     */
+    updateMinPriorityOnAdd(priority) {
+        if (this.heap.length === 1 || priority < this.minPriority) {
+            this.minPriority = priority;
+        }
+    }
+    /**
+     * Updates the minimum priority from all elements (used in constructor).
+     */
+    updateMinPriority() {
+        if (this.heap.length === 0) {
+            this.minPriority = 0;
+            return;
+        }
+        this.minPriority = Math.min(...this.heap.map((item) => item.priority));
+    }
+    /**
+     * Builds a max heap from the current heap array.
+     */
+    buildHeap() {
+        for (let index = Math.floor(this.heap.length / 2) - 1; index >= 0; index--) {
+            this.heapifyDown(index);
+        }
+    }
+    /**
+     * Moves an element up the heap to maintain heap property.
+     * @param index - The index of the element to move up
+     */
+    heapifyUp(index) {
+        let currentIndex = index;
+        while (currentIndex > 0) {
+            const parentIndex = Math.floor((currentIndex - 1) / 2);
+            if (this.heap[currentIndex].priority <= this.heap[parentIndex].priority) {
+                break;
+            }
+            this.swap(currentIndex, parentIndex);
+            currentIndex = parentIndex;
+        }
+    }
+    /**
+     * Moves an element down the heap to maintain heap property.
+     * @param index - The index of the element to move down
+     */
+    heapifyDown(index) {
+        let currentIndex = index;
+        while (true) {
+            const leftChild = 2 * currentIndex + 1;
+            const rightChild = 2 * currentIndex + 2;
+            let largest = currentIndex;
+            if (leftChild < this.heap.length &&
+                this.heap[leftChild].priority > this.heap[largest].priority) {
+                largest = leftChild;
+            }
+            if (rightChild < this.heap.length &&
+                this.heap[rightChild].priority > this.heap[largest].priority) {
+                largest = rightChild;
+            }
+            if (largest === currentIndex) {
+                break;
+            }
+            this.swap(currentIndex, largest);
+            currentIndex = largest;
+        }
+    }
+    /**
+     * Swaps two elements in the heap.
+     * @param i - First index
+     * @param j - Second index
+     */
+    swap(index, index_) {
+        [this.heap[index], this.heap[index_]] = [
+            this.heap[index_],
+            this.heap[index],
+        ];
+    }
+}
+//# sourceMappingURL=priorityQueue.js.map

package/module/DataStructure/priorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priorityQueue.js","sourceRoot":"","sources":["../../src/DataStructure/priorityQueue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiDG;AACH,MAAM,OAAO,aAAa;IAChB,IAAI,GAA0C,EAAE,CAAC;IACjD,WAAW,GAAG,CAAC,CAAC;IAExB;;;;;;;;;;;;OAYG;IACH,YAAY,eAAuD;QACjE,IAAI,eAAe,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;YACjC,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACzB,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;;;;;;;;;OAUG;IACH,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,KAAQ,EAAE,QAAgB;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,WAAW,CAAC,KAAQ;QAClB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC;QAChC,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAClC,iGAAiG;QACjG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAChC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACpB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;OAUG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;IAChC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,qBAAqB;QACnB,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED;;;OAGG;IACK,sBAAsB,CAAC,QAAgB;QAC7C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC1D,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC;QAC9B,CAAC;IACH,CAAC;IAED;;OAEG;IACK,iBAAiB;QACvB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;YACrB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzE,CAAC;IAED;;OAEG;IACK,SAAS;QACf,KACE,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,EAChD,KAAK,IAAI,CAAC,EACV,KAAK,EAAE,EACP,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,KAAa;QAC7B,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,OAAO,YAAY,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvD,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACxE,MAAM;YACR,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;YACrC,YAAY,GAAG,WAAW,CAAC;QAC7B,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,WAAW,CAAC,KAAa;QAC/B,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,SAAS,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YACvC,MAAM,UAAU,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YACxC,IAAI,OAAO,GAAG,YAAY,CAAC;YAE3B,IACE,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBAC5B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAC3D,CAAC;gBACD,OAAO,GAAG,SAAS,CAAC;YACtB,CAAC;YAED,IACE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBAC7B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAC5D,CAAC;gBACD,OAAO,GAAG,UAAU,CAAC;YACvB,CAAC;YAED,IAAI,OAAO,KAAK,YAAY,EAAE,CAAC;gBAC7B,MAAM;YACR,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YACjC,YAAY,GAAG,OAAO,CAAC;QACzB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,IAAI,CAAC,KAAa,EAAE,MAAc;QACxC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG;YACtC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACjB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;SACjB,CAAC;IACJ,CAAC;CACF"}

package/module/Math/correlationCoefficient.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Calculate the Pearson correlation coefficient between two arrays
+ * @param x - First array of numbers
+ * @param y - Second array of numbers
+ * @returns Correlation coefficient (-1 to 1)
+ * @example
+ * correlationCoefficient([1, 2, 3, 4, 5], [2, 4, 6, 8, 10]); // 1 (perfect positive correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [5, 4, 3, 2, 1]); // -1 (perfect negative correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [1, 1, 1, 1, 1]); // 0 (no correlation)
+ */
+export declare const correlationCoefficient: (x: number[], y: number[]) => number;

package/module/Math/correlationCoefficient.js

@@ -0,0 +1,40 @@
+import { average } from "./average";
+/**
+ * Calculate the Pearson correlation coefficient between two arrays
+ * @param x - First array of numbers
+ * @param y - Second array of numbers
+ * @returns Correlation coefficient (-1 to 1)
+ * @example
+ * correlationCoefficient([1, 2, 3, 4, 5], [2, 4, 6, 8, 10]); // 1 (perfect positive correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [5, 4, 3, 2, 1]); // -1 (perfect negative correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [1, 1, 1, 1, 1]); // 0 (no correlation)
+ */
+export const correlationCoefficient = (x, y) => {
+    if (x.length !== y.length) {
+        throw new Error("Arrays must have the same length");
+    }
+    if (x.length === 0) {
+        return Number.NaN;
+    }
+    if (x.length === 1) {
+        return Number.NaN;
+    }
+    const meanX = average(x);
+    const meanY = average(y);
+    let numerator = 0;
+    let sumSquaredX = 0;
+    let sumSquaredY = 0;
+    for (const [index, element] of x.entries()) {
+        const deltaX = element - meanX;
+        const deltaY = y[index] - meanY;
+        numerator += deltaX * deltaY;
+        sumSquaredX += deltaX * deltaX;
+        sumSquaredY += deltaY * deltaY;
+    }
+    const denominator = Math.sqrt(sumSquaredX * sumSquaredY);
+    if (denominator === 0) {
+        return Number.NaN;
+    }
+    return numerator / denominator;
+};
+//# sourceMappingURL=correlationCoefficient.js.map

package/module/Math/correlationCoefficient.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"correlationCoefficient.js","sourceRoot":"","sources":["../../src/Math/correlationCoefficient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAW,EAAE,CAAW,EAAU,EAAE;IACzE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,CAAC;IAED,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAEzB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,OAAO,GAAG,KAAK,CAAC;QAC/B,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAEhC,SAAS,IAAI,MAAM,GAAG,MAAM,CAAC;QAC7B,WAAW,IAAI,MAAM,GAAG,MAAM,CAAC;QAC/B,WAAW,IAAI,MAAM,GAAG,MAAM,CAAC;IACjC,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;IAEzD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,OAAO,SAAS,GAAG,WAAW,CAAC;AACjC,CAAC,CAAC"}

package/module/Math/index.d.ts

@@ -2,6 +2,7 @@ export * from "./addition";
 export * from "./average";
 export * from "./bitwise";
 export * from "./calculator";
+export * from "./correlationCoefficient";
 export * from "./degToRad";
 export * from "./deviationValue";
 export * from "./division";
@@ -17,11 +18,13 @@ export * from "./mathSeparator";
 export * from "./max";
 export * from "./median";
 export * from "./min";
+export * from "./mode";
 export * from "./multiples";
 export * from "./multiplication";
 export * from "./nCr";
 export * from "./nHr";
 export * from "./nPr";
+export * from "./percentile";
 export * from "./primeFactorization";
 export * from "./quotient";
 export * from "./radToDeg";

package/module/Math/index.js

@@ -2,6 +2,7 @@ export * from "./addition";
 export * from "./average";
 export * from "./bitwise";
 export * from "./calculator";
+export * from "./correlationCoefficient";
 export * from "./degToRad";
 export * from "./deviationValue";
 export * from "./division";
@@ -17,11 +18,13 @@ export * from "./mathSeparator";
 export * from "./max";
 export * from "./median";
 export * from "./min";
+export * from "./mode";
 export * from "./multiples";
 export * from "./multiplication";
 export * from "./nCr";
 export * from "./nHr";
 export * from "./nPr";
+export * from "./percentile";
 export * from "./primeFactorization";
 export * from "./quotient";
 export * from "./radToDeg";

package/module/Math/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/Math/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,cAAc,CAAC;AAC7B,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,4BAA4B,CAAC;AAC3C,cAAc,OAAO,CAAC;AACtB,cAAc,oBAAoB,CAAC;AACnC,cAAc,OAAO,CAAC;AACtB,cAAc,+BAA+B,CAAC;AAC9C,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,OAAO,CAAC;AACtB,cAAc,UAAU,CAAC;AACzB,cAAc,OAAO,CAAC;AACtB,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,OAAO,CAAC;AACtB,cAAc,OAAO,CAAC;AACtB,cAAc,OAAO,CAAC;AACtB,cAAc,sBAAsB,CAAC;AACrC,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,iBAAiB,CAAC;AAChC,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,qBAAqB,CAAC;AACpC,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/Math/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,cAAc,CAAC;AAC7B,cAAc,0BAA0B,CAAC;AACzC,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,4BAA4B,CAAC;AAC3C,cAAc,OAAO,CAAC;AACtB,cAAc,oBAAoB,CAAC;AACnC,cAAc,OAAO,CAAC;AACtB,cAAc,+BAA+B,CAAC;AAC9C,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,OAAO,CAAC;AACtB,cAAc,UAAU,CAAC;AACzB,cAAc,OAAO,CAAC;AACtB,cAAc,QAAQ,CAAC;AACvB,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,OAAO,CAAC;AACtB,cAAc,OAAO,CAAC;AACtB,cAAc,OAAO,CAAC;AACtB,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC;AACrC,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,iBAAiB,CAAC;AAChC,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,qBAAqB,CAAC;AACpC,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC"}

package/module/Math/mode.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Finds the most frequently occurring value(s) in an array
+ * @param array - Array of numbers to find mode for
+ * @returns Array of mode values (can be multiple values if there are ties)
+ * @example
+ * mode([1, 2, 2, 3, 3, 3]); // [3]
+ * mode([1, 2, 2, 3, 3]); // [2, 3]
+ * mode([1, 2, 3]); // [1, 2, 3]
+ */
+export declare const mode: (array: number[]) => number[];

package/module/Math/mode.js

@@ -0,0 +1,31 @@
+/**
+ * Finds the most frequently occurring value(s) in an array
+ * @param array - Array of numbers to find mode for
+ * @returns Array of mode values (can be multiple values if there are ties)
+ * @example
+ * mode([1, 2, 2, 3, 3, 3]); // [3]
+ * mode([1, 2, 2, 3, 3]); // [2, 3]
+ * mode([1, 2, 3]); // [1, 2, 3]
+ */
+export const mode = (array) => {
+    if (array.length === 0) {
+        return [];
+    }
+    const frequency = new Map();
+    let maxFrequency = 0;
+    // Count frequencies
+    for (const value of array) {
+        const count = (frequency.get(value) || 0) + 1;
+        frequency.set(value, count);
+        maxFrequency = Math.max(maxFrequency, count);
+    }
+    // Find all values with maximum frequency
+    const modes = [];
+    for (const [value, count] of frequency) {
+        if (count === maxFrequency) {
+            modes.push(value);
+        }
+    }
+    return modes.sort((a, b) => a - b);
+};
+//# sourceMappingURL=mode.js.map

package/module/Math/mode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mode.js","sourceRoot":"","sources":["../../src/Math/mode.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,KAAe,EAAY,EAAE;IAChD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,oBAAoB;IACpB,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9C,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC5B,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,yCAAyC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;QACvC,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACrC,CAAC,CAAC"}

package/module/Math/percentile.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Calculate the nth percentile of values in an array
+ * @param array - Array of numbers
+ * @param percentile - Percentile value (0-100)
+ * @returns The percentile value
+ * @example
+ * percentile([1, 2, 3, 4, 5], 50); // 3 (50th percentile - median)
+ * percentile([1, 2, 3, 4, 5], 25); // 2 (25th percentile)
+ * percentile([1, 2, 3, 4, 5], 75); // 4 (75th percentile)
+ */
+export declare const percentile: (array: number[], percentile: number) => number;

package/module/Math/percentile.js

@@ -0,0 +1,31 @@
+import { quickSort } from "../Array/quickSort";
+/**
+ * Calculate the nth percentile of values in an array
+ * @param array - Array of numbers
+ * @param percentile - Percentile value (0-100)
+ * @returns The percentile value
+ * @example
+ * percentile([1, 2, 3, 4, 5], 50); // 3 (50th percentile - median)
+ * percentile([1, 2, 3, 4, 5], 25); // 2 (25th percentile)
+ * percentile([1, 2, 3, 4, 5], 75); // 4 (75th percentile)
+ */
+export const percentile = (array, percentile) => {
+    if (array.length === 0) {
+        return Number.NaN;
+    }
+    if (percentile < 0 || percentile > 100) {
+        throw new Error("Percentile must be between 0 and 100");
+    }
+    const sortedArray = quickSort([...array]);
+    const index = (percentile / 100) * (sortedArray.length - 1);
+    const lowerIndex = Math.floor(index);
+    const upperIndex = Math.ceil(index);
+    if (lowerIndex === upperIndex) {
+        return sortedArray[lowerIndex];
+    }
+    const lowerValue = sortedArray[lowerIndex];
+    const upperValue = sortedArray[upperIndex];
+    const weight = index - lowerIndex;
+    return lowerValue + (upperValue - lowerValue) * weight;
+};
+//# sourceMappingURL=percentile.js.map

package/module/Math/percentile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"percentile.js","sourceRoot":"","sources":["../../src/Math/percentile.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAe,EAAE,UAAkB,EAAU,EAAE;IACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEpC,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;QAC9B,OAAO,WAAW,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,KAAK,GAAG,UAAU,CAAC;IAElC,OAAO,UAAU,GAAG,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC;AACzD,CAAC,CAAC"}

package/module/Math/solveEquation.js

@@ -60,6 +60,6 @@ export const solveEquation = (coefficients, constants) => {
         solution.push(division(subtract(constants[row], sum), coefficients[row][row]));
     }
     // Return the solution vector with values rounded to 1 decimal place
-    return solution.reverse().map((value) => roundOf(value, 1));
+    return solution.toReversed().map((value) => roundOf(value, 1));
 };
 //# sourceMappingURL=solveEquation.js.map

package/module/Math/solveEquation.js.map

@@ -1 +1 @@
-{"version":3,"file":"solveEquation.js","sourceRoot":"","sources":["../../src/Math/solveEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,YAAwB,EACxB,SAAmB,EACT,EAAE;IACZ,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAC3B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACvC,wDAAwD;QACxD,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACtD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,EAAE,CAAC;gBACpD,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBAChD,MAAM,GAAG,GAAG,CAAC;YACf,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5C,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;QACvC,CAAC;QAED,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QACpC,SAAS,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QACrC,SAAS,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QAE7B,wCAAwC;QACxC,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CACrB,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EACxB,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAC3B,CAAC;YAEF,SAAS,CAAC,GAAG,CAAC,GAAG,QAAQ,CACvB,SAAS,CAAC,GAAG,CAAC,EACd,cAAc,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CACzC,CAAC;YAEF,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;gBACrC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAC/B,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EACtB,cAAc,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CACjD,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,uCAAuC;IACvC,KAAK,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACtC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACvC,GAAG,GAAG,QAAQ,CACZ,GAAG,EACH,cAAc,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAC9D,CAAC;QACJ,CAAC;QAED,QAAQ,CAAC,IAAI,CACX,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAChE,CAAC;IACJ,CAAC;IAED,oEAAoE;IACpE,OAAO,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC,CAAC"}
+{"version":3,"file":"solveEquation.js","sourceRoot":"","sources":["../../src/Math/solveEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,YAAwB,EACxB,SAAmB,EACT,EAAE;IACZ,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAC3B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACvC,wDAAwD;QACxD,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACtD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,EAAE,CAAC;gBACpD,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBAChD,MAAM,GAAG,GAAG,CAAC;YACf,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5C,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;QACvC,CAAC;QAED,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QACpC,SAAS,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QACrC,SAAS,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QAE7B,wCAAwC;QACxC,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CACrB,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EACxB,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAC3B,CAAC;YAEF,SAAS,CAAC,GAAG,CAAC,GAAG,QAAQ,CACvB,SAAS,CAAC,GAAG,CAAC,EACd,cAAc,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CACzC,CAAC;YAEF,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;gBACrC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAC/B,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EACtB,cAAc,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CACjD,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,uCAAuC;IACvC,KAAK,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACtC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACvC,GAAG,GAAG,QAAQ,CACZ,GAAG,EACH,cAAc,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAC9D,CAAC;QACJ,CAAC;QAED,QAAQ,CAAC,IAAI,CACX,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAChE,CAAC;IACJ,CAAC;IAED,oEAAoE;IACpE,OAAO,QAAQ,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC"}

package/module/String/fuzzySearch.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Perform fuzzy string matching on an array of strings
+ * @param query - The search query
+ * @param items - Array of strings to search in
+ * @param threshold - Similarity threshold (0-1) for matching (default: 0.6)
+ * @returns Array of matching items with their similarity scores, sorted by best match
+ * @example
+ * fuzzySearch("hello", ["hello", "world", "helo", "help"]);
+ * // [{ item: "hello", score: 1 }, { item: "helo", score: 0.8 }, { item: "help", score: 0.6 }]
+ */
+export declare const fuzzySearch: (query: string, items: string[], threshold?: number) => Array<{
+    item: string;
+    score: number;
+}>;

package/module/String/fuzzySearch.js

@@ -0,0 +1,27 @@
+import { levenshteinDistance } from "./levenshteinDistance";
+/**
+ * Perform fuzzy string matching on an array of strings
+ * @param query - The search query
+ * @param items - Array of strings to search in
+ * @param threshold - Similarity threshold (0-1) for matching (default: 0.6)
+ * @returns Array of matching items with their similarity scores, sorted by best match
+ * @example
+ * fuzzySearch("hello", ["hello", "world", "helo", "help"]);
+ * // [{ item: "hello", score: 1 }, { item: "helo", score: 0.8 }, { item: "help", score: 0.6 }]
+ */
+export const fuzzySearch = (query, items, threshold = 0.6) => {
+    if (query.length === 0) {
+        return [];
+    }
+    const results = [];
+    for (const item of items) {
+        const distance = levenshteinDistance(query.toLowerCase(), item.toLowerCase());
+        const maxLength = Math.max(query.length, item.length);
+        const score = 1 - distance / maxLength;
+        if (score >= threshold) {
+            results.push({ item, score });
+        }
+    }
+    return results.sort((a, b) => b.score - a.score);
+};
+//# sourceMappingURL=fuzzySearch.js.map

package/module/String/fuzzySearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fuzzySearch.js","sourceRoot":"","sources":["../../src/String/fuzzySearch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAE5D;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CACzB,KAAa,EACb,KAAe,EACf,SAAS,GAAG,GAAG,EACyB,EAAE;IAC1C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,OAAO,GAA2C,EAAE,CAAC;IAE3D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,mBAAmB,CAClC,KAAK,CAAC,WAAW,EAAE,EACnB,IAAI,CAAC,WAAW,EAAE,CACnB,CAAC;QACF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC;QAEvC,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACnD,CAAC,CAAC"}

package/module/String/index.d.ts

@@ -3,6 +3,7 @@ export * from "./deleteSpaces";
 export * from "./escapeHtml";
 export * from "./formatString";
 export * from "./fromBase64";
+export * from "./fuzzySearch";
 export * from "./hasNoLetters";
 export * from "./kebabCase";
 export * from "./levenshteinDistance";
@@ -11,9 +12,12 @@ export * from "./padStart";
 export * from "./randomString";
 export * from "./randomStringInitialization";
 export * from "./reverseString";
+export * from "./slugify";
 export * from "./stringSimilarity";
 export * from "./toBase64";
 export * from "./toHalfWidth";
 export * from "./trimCharacters";
 export * from "./trimEndCharacters";
 export * from "./trimStartCharacters";
+export * from "./truncate";
+export * from "./unescapeHtml";

package/module/String/index.js

@@ -3,6 +3,7 @@ export * from "./deleteSpaces";
 export * from "./escapeHtml";
 export * from "./formatString";
 export * from "./fromBase64";
+export * from "./fuzzySearch";
 export * from "./hasNoLetters";
 export * from "./kebabCase";
 export * from "./levenshteinDistance";
@@ -11,10 +12,13 @@ export * from "./padStart";
 export * from "./randomString";
 export * from "./randomStringInitialization";
 export * from "./reverseString";
+export * from "./slugify";
 export * from "./stringSimilarity";
 export * from "./toBase64";
 export * from "./toHalfWidth";
 export * from "./trimCharacters";
 export * from "./trimEndCharacters";
 export * from "./trimStartCharacters";
+export * from "./truncate";
+export * from "./unescapeHtml";
 //# sourceMappingURL=index.js.map