umt 2.6.0 → 2.8.0

package/module/es5/DataStructure/priorityQueue.js

@@ -0,0 +1,405 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.PriorityQueue = void 0;
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }
+function _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }
+function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", { writable: !1 }), e; }
+function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
+function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+/**
+ * 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
+ */
+var PriorityQueue = exports.PriorityQueue = /*#__PURE__*/function () {
+  /**
+   * 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 }
+   * ]);
+   * ```
+   */
+  function PriorityQueue(initialElements) {
+    _classCallCheck(this, PriorityQueue);
+    _defineProperty(this, "heap", []);
+    _defineProperty(this, "minPriority", 0);
+    if (initialElements) {
+      this.heap = _toConsumableArray(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
+   * ```
+   */
+  return _createClass(PriorityQueue, [{
+    key: "size",
+    get: function get() {
+      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
+     * ```
+     */
+  }, {
+    key: "isEmpty",
+    get: function get() {
+      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"
+     * ```
+     */
+  }, {
+    key: "enqueue",
+    value: function enqueue(value, priority) {
+      this.heap.push({
+        value: value,
+        priority: 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"
+     * ```
+     */
+  }, {
+    key: "enqueueBack",
+    value: function enqueueBack(value) {
+      var newPriority = this.minPriority - 1;
+      this.heap.push({
+        value: 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
+     * ```
+     */
+  }, {
+    key: "dequeue",
+    value: function dequeue() {
+      if (this.heap.length === 0) {
+        return;
+      }
+      if (this.heap.length === 1) {
+        var _this$heap$pop;
+        return (_this$heap$pop = this.heap.pop()) === null || _this$heap$pop === void 0 ? void 0 : _this$heap$pop.value;
+      }
+      var 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)
+     * ```
+     */
+  }, {
+    key: "peek",
+    value: function peek() {
+      var _this$heap$;
+      return (_this$heap$ = this.heap[0]) === null || _this$heap$ === void 0 ? void 0 : _this$heap$.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
+     * ```
+     */
+  }, {
+    key: "peekPriority",
+    value: function peekPriority() {
+      var _this$heap$2;
+      return (_this$heap$2 = this.heap[0]) === null || _this$heap$2 === void 0 ? void 0 : _this$heap$2.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
+     * ```
+     */
+  }, {
+    key: "clear",
+    value: function 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)
+     * ```
+     */
+  }, {
+    key: "toArray",
+    value: function toArray() {
+      return this.heap.map(function (item) {
+        return 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)
+     * ```
+     */
+  }, {
+    key: "toArrayWithPriorities",
+    value: function toArrayWithPriorities() {
+      return _toConsumableArray(this.heap);
+    }
+
+    /**
+     * Updates the minimum priority when adding elements.
+     * @param priority - The priority being added
+     */
+  }, {
+    key: "updateMinPriorityOnAdd",
+    value: function updateMinPriorityOnAdd(priority) {
+      if (this.heap.length === 1 || priority < this.minPriority) {
+        this.minPriority = priority;
+      }
+    }
+
+    /**
+     * Updates the minimum priority from all elements (used in constructor).
+     */
+  }, {
+    key: "updateMinPriority",
+    value: function updateMinPriority() {
+      if (this.heap.length === 0) {
+        this.minPriority = 0;
+        return;
+      }
+      this.minPriority = Math.min.apply(Math, _toConsumableArray(this.heap.map(function (item) {
+        return item.priority;
+      })));
+    }
+
+    /**
+     * Builds a max heap from the current heap array.
+     */
+  }, {
+    key: "buildHeap",
+    value: function buildHeap() {
+      for (var 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
+     */
+  }, {
+    key: "heapifyUp",
+    value: function heapifyUp(index) {
+      var currentIndex = index;
+      while (currentIndex > 0) {
+        var 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
+     */
+  }, {
+    key: "heapifyDown",
+    value: function heapifyDown(index) {
+      var currentIndex = index;
+      while (true) {
+        var leftChild = 2 * currentIndex + 1;
+        var rightChild = 2 * currentIndex + 2;
+        var 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
+     */
+  }, {
+    key: "swap",
+    value: function swap(index, index_) {
+      var _ref = [this.heap[index_], this.heap[index]];
+      this.heap[index] = _ref[0];
+      this.heap[index_] = _ref[1];
+    }
+  }]);
+}();

package/module/es5/Error/retry.js

@@ -5,7 +5,7 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.retry = void 0;
 function _regenerator() { /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */ var e, t, r = "function" == typeof Symbol ? Symbol : {}, n = r.iterator || "@@iterator", o = r.toStringTag || "@@toStringTag"; function i(r, n, o, i) { var c = n && n.prototype instanceof Generator ? n : Generator, u = Object.create(c.prototype); return _regeneratorDefine2(u, "_invoke", function (r, n, o) { var i, c, u, f = 0, p = o || [], y = !1, G = { p: 0, n: 0, v: e, a: d, f: d.bind(e, 4), d: function d(t, r) { return i = t, c = 0, u = e, G.n = r, a; } }; function d(r, n) { for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) { var o, i = p[t], d = G.p, l = i[2]; r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0)); } if (o || r > 1) return a; throw y = !0, n; } return function (o, p, l) { if (f > 1) throw TypeError("Generator is already running"); for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) { i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u); try { if (f = 2, i) { if (c || (o = "next"), t = i[o]) { if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object"); if (!t.done) return t; u = t.value, c < 2 && (c = 0); } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1); i = e; } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break; } catch (t) { i = e, c = 1, u = t; } finally { f = 1; } } return { value: t, done: y }; }; }(r, o, i), !0), u; } var a = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} t = Object.getPrototypeOf; var c = [][n] ? t(t([][n]())) : (_regeneratorDefine2(t = {}, n, function () { return this; }), t), u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c); function f(e) { return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine2(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e; } return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine2(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine2(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine2(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine2(u), _regeneratorDefine2(u, o, "Generator"), _regeneratorDefine2(u, n, function () { return this; }), _regeneratorDefine2(u, "toString", function () { return "[object Generator]"; }), (_regenerator = function _regenerator() { return { w: i, m: f }; })(); }
-function _regeneratorDefine2(e, r, n, t) { var i = Object.defineProperty; try { i({}, "", {}); } catch (e) { i = 0; } _regeneratorDefine2 = function _regeneratorDefine(e, r, n, t) { if (r) i ? i(e, r, { value: n, enumerable: !t, configurable: !t, writable: !t }) : e[r] = n;else { var o = function o(r, n) { _regeneratorDefine2(e, r, function (e) { return this._invoke(r, n, e); }); }; o("next", 0), o("throw", 1), o("return", 2); } }, _regeneratorDefine2(e, r, n, t); }
+function _regeneratorDefine2(e, r, n, t) { var i = Object.defineProperty; try { i({}, "", {}); } catch (e) { i = 0; } _regeneratorDefine2 = function _regeneratorDefine(e, r, n, t) { function o(r, n) { _regeneratorDefine2(e, r, function (e) { return this._invoke(r, n, e); }); } r ? i ? i(e, r, { value: n, enumerable: !t, configurable: !t, writable: !t }) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2)); }, _regeneratorDefine2(e, r, n, t); }
 function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
 function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
 /**
@@ -53,7 +53,7 @@ var retry = exports.retry = function retry(function_) {
     var _ref = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee(remainingAttempts) {
       var _t;
       return _regenerator().w(function (_context) {
-        while (1) switch (_context.n) {
+        while (1) switch (_context.p = _context.n) {
           case 0:
             _context.p = 0;
             _context.n = 1;

package/module/es5/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/es5/Math/correlationCoefficient.js

@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.correlationCoefficient = void 0;
+var _average = require("./average");
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+/**
+ * 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)
+ */
+var correlationCoefficient = exports.correlationCoefficient = function 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;
+  }
+  var meanX = (0, _average.average)(x);
+  var meanY = (0, _average.average)(y);
+  var numerator = 0;
+  var sumSquaredX = 0;
+  var sumSquaredY = 0;
+  var _iterator = _createForOfIteratorHelper(x.entries()),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _step$value = _slicedToArray(_step.value, 2),
+        index = _step$value[0],
+        element = _step$value[1];
+      var deltaX = element - meanX;
+      var deltaY = y[index] - meanY;
+      numerator += deltaX * deltaY;
+      sumSquaredX += deltaX * deltaX;
+      sumSquaredY += deltaY * deltaY;
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  var denominator = Math.sqrt(sumSquaredX * sumSquaredY);
+  if (denominator === 0) {
+    return Number.NaN;
+  }
+  return numerator / denominator;
+};

package/module/es5/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/es5/Math/index.js

@@ -47,6 +47,17 @@ Object.keys(_calculator).forEach(function (key) {
     }
   });
 });
+var _correlationCoefficient = require("./correlationCoefficient");
+Object.keys(_correlationCoefficient).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _correlationCoefficient[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _correlationCoefficient[key];
+    }
+  });
+});
 var _degToRad = require("./degToRad");
 Object.keys(_degToRad).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
@@ -212,6 +223,17 @@ Object.keys(_min).forEach(function (key) {
     }
   });
 });
+var _mode = require("./mode");
+Object.keys(_mode).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _mode[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _mode[key];
+    }
+  });
+});
 var _multiples = require("./multiples");
 Object.keys(_multiples).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
@@ -267,6 +289,17 @@ Object.keys(_nPr).forEach(function (key) {
     }
   });
 });
+var _percentile = require("./percentile");
+Object.keys(_percentile).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _percentile[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _percentile[key];
+    }
+  });
+});
 var _primeFactorization = require("./primeFactorization");
 Object.keys(_primeFactorization).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;

package/module/es5/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/es5/Math/mode.js

@@ -0,0 +1,67 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mode = void 0;
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+/**
+ * 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]
+ */
+var mode = exports.mode = function mode(array) {
+  if (array.length === 0) {
+    return [];
+  }
+  var frequency = new Map();
+  var maxFrequency = 0;
+
+  // Count frequencies
+  var _iterator = _createForOfIteratorHelper(array),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var value = _step.value;
+      var count = (frequency.get(value) || 0) + 1;
+      frequency.set(value, count);
+      maxFrequency = Math.max(maxFrequency, count);
+    }
+
+    // Find all values with maximum frequency
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  var modes = [];
+  var _iterator2 = _createForOfIteratorHelper(frequency),
+    _step2;
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var _step2$value = _slicedToArray(_step2.value, 2),
+        _value = _step2$value[0],
+        _count = _step2$value[1];
+      if (_count === maxFrequency) {
+        modes.push(_value);
+      }
+    }
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
+  }
+  return modes.sort(function (a, b) {
+    return a - b;
+  });
+};

package/module/es5/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;