umt 2.5.0 → 2.7.0

package/module/es5/DataStructure/priorityQueue.d.ts

@@ -0,0 +1,241 @@
+/**
+ * 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 declare class PriorityQueue<T> {
+    private heap;
+    private minPriority;
+    /**
+     * 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?: Array<{
+        value: T;
+        priority: number;
+    }>);
+    /**
+     * 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(): number;
+    /**
+     * 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(): boolean;
+    /**
+     * 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: T, priority: number): void;
+    /**
+     * 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: T): void;
+    /**
+     * 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(): T | undefined;
+    /**
+     * 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(): T | undefined;
+    /**
+     * 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(): number | undefined;
+    /**
+     * 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(): void;
+    /**
+     * 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(): T[];
+    /**
+     * 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(): Array<{
+        value: T;
+        priority: number;
+    }>;
+    /**
+     * Updates the minimum priority when adding elements.
+     * @param priority - The priority being added
+     */
+    private updateMinPriorityOnAdd;
+    /**
+     * Updates the minimum priority from all elements (used in constructor).
+     */
+    private updateMinPriority;
+    /**
+     * Builds a max heap from the current heap array.
+     */
+    private buildHeap;
+    /**
+     * Moves an element up the heap to maintain heap property.
+     * @param index - The index of the element to move up
+     */
+    private heapifyUp;
+    /**
+     * Moves an element down the heap to maintain heap property.
+     * @param index - The index of the element to move down
+     */
+    private heapifyDown;
+    /**
+     * Swaps two elements in the heap.
+     * @param i - First index
+     * @param j - Second index
+     */
+    private swap;
+}

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/Date/birthday.js

@@ -19,7 +19,21 @@ var birthday = exports.birthday = function birthday(year, mon, day) {
   var timeDifference = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 9;
   var birthdayDate = new Date((0, _new.newDateInt)(year, mon, day));
   var nowTime = (0, _now.now)(timeDifference);
-  var y = nowTime.getFullYear() - birthdayDate.getFullYear();
-  var r = nowTime < (0, _new.newDateInt)(nowTime.getFullYear(), birthdayDate.getMonth() - 1, birthdayDate.getDay()) ? y - 1 : y;
-  return year < 100 ? 1900 + y : r;
+  var currentYear = nowTime.getFullYear();
+  var birthYear = birthdayDate.getFullYear();
+
+  // Calculate base age
+  var age = currentYear - birthYear;
+
+  // Check if birthday hasn't occurred this year yet
+  var thisYearBirthday = new Date(currentYear, birthdayDate.getMonth(), birthdayDate.getDate());
+  if (nowTime < thisYearBirthday) {
+    age -= 1;
+  }
+
+  // Handle future birthdays (should return 0 or non-negative)
+  if (age < 0) {
+    return 0;
+  }
+  return age;
 };

package/module/es5/Date/isLeapYear.js

@@ -15,5 +15,8 @@ exports.isLeapYear = void 0;
  * isLeapYear(2023); // Returns false (not divisible by 4)
  */
 var isLeapYear = exports.isLeapYear = function isLeapYear(year) {
+  if (!Number.isInteger(year)) {
+    return false;
+  }
   return year % 4 === 0 && year % 100 !== 0 || year % 400 === 0;
 };

package/module/es5/Error/index.d.ts

@@ -1 +1,2 @@
+export * from "./retry";
 export * from "./safeExecute";

package/module/es5/Error/index.js

@@ -3,6 +3,17 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
+var _retry = require("./retry");
+Object.keys(_retry).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _retry[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _retry[key];
+    }
+  });
+});
 var _safeExecute = require("./safeExecute");
 Object.keys(_safeExecute).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;