max-priority-queue-typed 2.5.1 → 2.5.3

package/src/data-structures/linked-list/singly-linked-list.ts

@@ -57,7 +57,7 @@ export class SinglyLinkedListNode<E = any> extends LinkedListNode<E> {
  * @remarks Time O(1), Space O(1)
  * @template E
  * @template R
- * 1. Node Structure: Each node contains three parts: a data field, a pointer (or reference) to the previous node, and a pointer to the next node. This structure allows traversal of the linked list in both directions.
+ * 1. Node Structure: Each node contains two parts: a data field and a pointer (or reference) to the next node. This structure allows forward-only traversal of the linked list.
  * 2. Bidirectional Traversal: Unlike doubly linked lists, singly linked lists can be easily traversed forwards but not backwards.
  * 3. No Centralized Index: Unlike arrays, elements in a linked list are not stored contiguously, so there is no centralized index. Accessing elements in a linked list typically requires traversing from the head or tail node.
  * 4. High Efficiency in Insertion and Deletion: Adding or removing elements in a linked list does not require moving other elements, making these operations more efficient than in arrays.
@@ -320,6 +320,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -386,6 +393,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -457,6 +471,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -510,6 +531,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -632,6 +660,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -694,6 +729,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -741,6 +783,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -794,6 +843,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -853,6 +909,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -921,6 +984,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -964,6 +1034,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1013,6 +1090,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1256,6 +1340,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1309,6 +1400,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1392,6 +1490,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

package/src/data-structures/linked-list/skip-linked-list.ts

@@ -7,7 +7,7 @@
  */
 
 import type { Comparator, EntryCallback } from '../../types';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 import { IterableEntryBase } from '../base';
 
 export class SkipListNode<K, V> {
@@ -72,7 +72,7 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
         [k, v] = toEntryFn(item as R);
       } else {
         if (!Array.isArray(item) || item.length < 2) {
-          throw new TypeError(ERR.invalidEntry('SkipList'));
+          raise(TypeError, ERR.invalidEntry('SkipList'));
         }
         [k, v] = item as [K, V];
       }
@@ -86,7 +86,7 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
   static createDefaultComparator<K>(): Comparator<K> {
     return (a: K, b: K): number => {
       if (typeof a === 'number' && typeof b === 'number') {
-        if (Number.isNaN(a) || Number.isNaN(b)) throw new TypeError(ERR.invalidNaN('SkipList'));
+        if (Number.isNaN(a) || Number.isNaN(b)) raise(TypeError, ERR.invalidNaN('SkipList'));
         return a - b;
       }
       if (typeof a === 'string' && typeof b === 'string') {
@@ -95,13 +95,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
       if (a instanceof Date && b instanceof Date) {
         const ta = a.getTime(),
           tb = b.getTime();
-        if (Number.isNaN(ta) || Number.isNaN(tb)) throw new TypeError(ERR.invalidDate('SkipList'));
+        if (Number.isNaN(ta) || Number.isNaN(tb)) raise(TypeError, ERR.invalidDate('SkipList'));
         return ta - tb;
       }
       if (typeof a === 'bigint' && typeof b === 'bigint') {
         return a < b ? -1 : a > b ? 1 : 0;
       }
-      throw new TypeError(ERR.comparatorRequired('SkipList'));
+      raise(TypeError, ERR.comparatorRequired('SkipList'));
     };
   }
 
@@ -158,6 +158,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -198,6 +205,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -241,6 +255,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -293,6 +314,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -375,6 +403,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -436,6 +471,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -480,6 +522,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -549,6 +598,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -593,6 +649,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -639,6 +702,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -683,6 +753,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -730,6 +807,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -782,6 +866,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -834,6 +925,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -883,6 +981,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -938,6 +1043,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1008,6 +1120,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1058,6 +1177,13 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

package/src/data-structures/matrix/matrix.ts

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import type { MatrixOptions } from '../../types';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 
 /**
  *
@@ -213,6 +213,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -279,6 +286,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -342,6 +356,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -375,7 +396,7 @@ export class Matrix {
    */
   add(matrix: Matrix): Matrix | undefined {
     if (!this.isMatchForCalculate(matrix)) {
-      throw new Error(ERR.matrixDimensionMismatch('addition'));
+      raise(Error, ERR.matrixDimensionMismatch('addition'));
     }
 
     const resultData: number[][] = [];
@@ -429,6 +450,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -446,7 +474,7 @@ export class Matrix {
    */
   subtract(matrix: Matrix): Matrix | undefined {
     if (!this.isMatchForCalculate(matrix)) {
-      throw new Error(ERR.matrixDimensionMismatch('subtraction'));
+      raise(Error, ERR.matrixDimensionMismatch('subtraction'));
     }
 
     const resultData: number[][] = [];
@@ -499,6 +527,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -532,7 +567,7 @@ export class Matrix {
    */
   multiply(matrix: Matrix): Matrix | undefined {
     if (this.cols !== matrix.rows) {
-      throw new Error(ERR.matrixDimensionMismatch('multiplication (A.cols must equal B.rows)'));
+      raise(Error, ERR.matrixDimensionMismatch('multiplication (A.cols must equal B.rows)'));
     }
 
     const resultData: number[][] = [];
@@ -591,6 +626,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -621,7 +663,7 @@ export class Matrix {
    */
   transpose(): Matrix {
     if (this.data.some(row => row.length !== this.cols)) {
-      throw new Error(ERR.matrixNotRectangular());
+      raise(Error, ERR.matrixNotRectangular());
     }
 
     const resultData: number[][] = [];
@@ -670,6 +712,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -693,7 +742,7 @@ export class Matrix {
   inverse(): Matrix | undefined {
     // Check if the matrix is square
     if (this.rows !== this.cols) {
-      throw new Error(ERR.matrixNotSquare());
+      raise(Error, ERR.matrixNotSquare());
     }
 
     // Create an augmented matrix [this | I]
@@ -723,7 +772,7 @@ export class Matrix {
 
       if (pivotRow === this.rows) {
         // Matrix is singular, and its inverse does not exist
-        throw new Error(ERR.matrixSingular());
+        raise(Error, ERR.matrixSingular());
       }
 
       // Swap rows to make the pivot the current row
@@ -734,7 +783,7 @@ export class Matrix {
 
       if (pivotElement === 0) {
         // Handle division by zero
-        throw new Error(ERR.matrixSingular());
+        raise(Error, ERR.matrixSingular());
       }
 
       augmentedMatrix._scaleRow(i, 1 / pivotElement);
@@ -793,6 +842,13 @@ export class Matrix {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -810,7 +866,7 @@ export class Matrix {
    */
   dot(matrix: Matrix): Matrix | undefined {
     if (this.cols !== matrix.rows) {
-      throw new Error(ERR.matrixDimensionMismatch('dot product (A.cols must equal B.rows)'));
+      raise(Error, ERR.matrixDimensionMismatch('dot product (A.cols must equal B.rows)'));
     }
 
     const resultData: number[][] = [];

package/src/data-structures/priority-queue/max-priority-queue.ts

@@ -7,7 +7,7 @@
  */
 import type { PriorityQueueOptions } from '../../types';
 import { PriorityQueue } from './priority-queue';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 
 /**
  * Max-oriented priority queue (max-heap) built on {@link PriorityQueue}.
@@ -86,7 +86,7 @@ export class MaxPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {
     super(elements, {
       comparator: (a: E, b: E): number => {
         if (typeof a === 'object' || typeof b === 'object') {
-          throw new TypeError(ERR.comparatorRequired('MaxPriorityQueue'));
+          raise(TypeError, ERR.comparatorRequired('MaxPriorityQueue'));
         }
         if (a < b) return 1;
         if (a > b) return -1;