umt 2.6.0 → 2.8.0

package/module/es5/Crypto/encodeBase32.js

@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.encodeBase32 = void 0;
+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; }
+/**
+ * Encodes a string or Uint8Array to Base32 format
+ * @param {string | Uint8Array} input - The input to encode
+ * @returns {string} Base32 encoded string
+ * @example encodeBase32("Hello"); // "JBSWY3DP"
+ */
+var encodeBase32 = exports.encodeBase32 = function encodeBase32(input) {
+  var alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";
+  var bytes = typeof input === "string" ? new TextEncoder().encode(input) : input;
+  var result = "";
+  var buffer = 0;
+  var bufferLength = 0;
+  var _iterator = _createForOfIteratorHelper(bytes),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _byte = _step.value;
+      buffer = buffer << 8 | _byte;
+      bufferLength += 8;
+      while (bufferLength >= 5) {
+        bufferLength -= 5;
+        result += alphabet[buffer >> bufferLength & 0x1f];
+      }
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  if (bufferLength > 0) {
+    result += alphabet[buffer << 5 - bufferLength & 0x1f];
+  }
+  var paddingLength = (8 - result.length % 8) % 8;
+  result += "=".repeat(paddingLength);
+  return result;
+};

package/module/es5/Crypto/encodeBase58.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Encodes a string or Uint8Array to Base58 format
+ * @param {string | Uint8Array} input - The input to encode
+ * @returns {string} Base58 encoded string
+ * @example encodeBase58("Hello"); // "9Ajdvzr"
+ */
+export declare const encodeBase58: (input: string | Uint8Array) => string;

package/module/es5/Crypto/encodeBase58.js

@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.encodeBase58 = void 0;
+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; }
+/**
+ * Encodes a string or Uint8Array to Base58 format
+ * @param {string | Uint8Array} input - The input to encode
+ * @returns {string} Base58 encoded string
+ * @example encodeBase58("Hello"); // "9Ajdvzr"
+ */
+var encodeBase58 = exports.encodeBase58 = function encodeBase58(input) {
+  var alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
+  var bytes = typeof input === "string" ? new TextEncoder().encode(input) : input;
+  var encoded = "";
+  var bigNumber = BigInt(0);
+  var _iterator = _createForOfIteratorHelper(bytes),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _byte = _step.value;
+      bigNumber = bigNumber * BigInt(256) + BigInt(_byte);
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  while (bigNumber > 0) {
+    var remainder = Number(bigNumber % BigInt(58));
+    encoded = alphabet[remainder] + encoded;
+    bigNumber /= BigInt(58);
+  }
+  var leadingZeros = 0;
+  var _iterator2 = _createForOfIteratorHelper(bytes),
+    _step2;
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var _byte2 = _step2.value;
+      if (_byte2 !== 0) {
+        break;
+      }
+      leadingZeros++;
+    }
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
+  }
+  return "1".repeat(leadingZeros) + encoded;
+};

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

@@ -0,0 +1,6 @@
+export * from "./decodeBase32";
+export * from "./decodeBase32ToString";
+export * from "./decodeBase58";
+export * from "./decodeBase58ToString";
+export * from "./encodeBase32";
+export * from "./encodeBase58";

package/module/es5/Crypto/index.js

@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _decodeBase = require("./decodeBase32");
+Object.keys(_decodeBase).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _decodeBase[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _decodeBase[key];
+    }
+  });
+});
+var _decodeBase32ToString = require("./decodeBase32ToString");
+Object.keys(_decodeBase32ToString).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _decodeBase32ToString[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _decodeBase32ToString[key];
+    }
+  });
+});
+var _decodeBase2 = require("./decodeBase58");
+Object.keys(_decodeBase2).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _decodeBase2[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _decodeBase2[key];
+    }
+  });
+});
+var _decodeBase58ToString = require("./decodeBase58ToString");
+Object.keys(_decodeBase58ToString).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _decodeBase58ToString[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _decodeBase58ToString[key];
+    }
+  });
+});
+var _encodeBase = require("./encodeBase32");
+Object.keys(_encodeBase).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _encodeBase[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _encodeBase[key];
+    }
+  });
+});
+var _encodeBase2 = require("./encodeBase58");
+Object.keys(_encodeBase2).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _encodeBase2[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _encodeBase2[key];
+    }
+  });
+});

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

@@ -0,0 +1 @@
+export * from "./priorityQueue";

package/module/es5/DataStructure/index.js

@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _priorityQueue = require("./priorityQueue");
+Object.keys(_priorityQueue).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _priorityQueue[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _priorityQueue[key];
+    }
+  });
+});

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;
+}