max-priority-queue-typed 2.5.1 → 2.5.2

package/src/data-structures/graph/directed-graph.ts

@@ -242,6 +242,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -334,6 +337,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -421,6 +427,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -508,6 +517,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -560,6 +572,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -684,6 +699,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -775,6 +793,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -823,6 +844,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -929,6 +953,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -1045,6 +1072,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/graph/undirected-graph.ts

@@ -251,6 +251,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -339,6 +342,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -422,6 +428,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -529,6 +538,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -581,6 +593,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -707,6 +722,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -877,6 +895,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -945,6 +966,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -993,6 +1017,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/hash/hash-map.ts

@@ -15,7 +15,7 @@ import type {
 } from '../../types';
 import { IterableEntryBase } from '../base';
 import { isWeakKey, rangeCheck } from '../../utils';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 
 /**
  * Hash-based map. Supports object keys and custom hashing; offers O(1) average set/get/has.
@@ -197,6 +197,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -240,6 +243,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -328,6 +334,12 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -397,6 +409,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -451,6 +466,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -516,6 +534,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -566,6 +587,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -635,6 +659,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -686,6 +713,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -739,6 +769,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -919,9 +952,7 @@ export class LinkedHashMap<K = any, V = any, R = [K, V]> extends IterableEntryBa
     if (this.isEntry(rawElement)) {
       return rawElement;
     }
-    throw new TypeError(
-      ERR.invalidArgument('If elements do not adhere to [key, value], provide options.toEntryFn to transform raw records.', 'HashMap')
-    );
+    raise(TypeError, ERR.invalidArgument('If elements do not adhere to [key, value], provide options.toEntryFn to transform raw records.', 'HashMap'));
   };
 
   get toEntryFn() {

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

@@ -8,7 +8,7 @@
 
 import type { Comparator, DFSOrderPattern, ElementCallback, HeapOptions } from '../../types';
 import { IterableElementBase } from '../base';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 
 /**
  * Binary heap with pluggable comparator; supports fast insertion and removal of the top element.
@@ -213,6 +213,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -308,6 +311,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -364,6 +370,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -422,6 +431,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -496,6 +508,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -595,6 +610,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -641,6 +659,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -692,6 +713,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -738,6 +762,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -834,6 +861,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -916,6 +946,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -968,6 +1001,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1019,6 +1055,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1077,6 +1116,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1094,7 +1136,7 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
     thisArg?: unknown
   ): Heap<EM, RM> {
     const { comparator, toElementFn, ...rest } = options ?? {};
-    if (!comparator) throw new TypeError(ERR.comparatorRequired('Heap.map'));
+    if (!comparator) raise(TypeError, ERR.comparatorRequired('Heap.map'));
     const out = this._createLike<EM, RM>([], { ...rest, comparator, toElementFn });
     let i = 0;
     for (const x of this) {
@@ -1124,7 +1166,7 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
 
   protected readonly _DEFAULT_COMPARATOR: Comparator<E> = (a: E, b: E): number => {
     if (typeof a === 'object' || typeof b === 'object') {
-      throw new TypeError(ERR.comparatorRequired('Heap'));
+      raise(TypeError, ERR.comparatorRequired('Heap'));
     }
     if (a > b) return 1;
     if (a < b) return -1;
@@ -1266,7 +1308,7 @@ export class FibonacciHeap<E> {
   constructor(comparator?: Comparator<E>) {
     this.clear();
     this._comparator = comparator || this._defaultComparator;
-    if (typeof this.comparator !== 'function') throw new TypeError(ERR.notAFunction('comparator', 'FibonacciHeap'));
+    if (typeof this.comparator !== 'function') raise(TypeError, ERR.notAFunction('comparator', 'FibonacciHeap'));
   }
 
   protected _root?: FibonacciHeapNode<E>;

package/src/data-structures/heap/max-heap.ts

@@ -6,7 +6,7 @@
  */
 import type { HeapOptions } from '../../types';
 import { Heap } from './heap';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 
 /**
  * @template E
@@ -80,7 +80,7 @@ export class MaxHeap<E = any, R = any> extends Heap<E, R> {
     super(elements, {
       comparator: (a: E, b: E): number => {
         if (typeof a === 'object' || typeof b === 'object') {
-          throw new TypeError(ERR.comparatorRequired('MaxHeap'));
+          raise(TypeError, ERR.comparatorRequired('MaxHeap'));
         }
         if (a < b) return 1;
         if (a > b) return -1;

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

@@ -296,6 +296,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -364,6 +367,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -431,6 +437,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -489,6 +498,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -580,6 +592,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -628,6 +643,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -715,6 +733,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -838,6 +859,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -893,6 +917,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -950,6 +977,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -993,6 +1023,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1040,6 +1073,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1093,6 +1129,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1149,6 +1188,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1213,6 +1255,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1265,6 +1310,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1338,6 +1386,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+