binary-tree-typed 2.5.1 → 2.5.3

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

@@ -8,7 +8,7 @@
 
 import type { DijkstraResult, EntryCallback, GraphOptions, VertexKey } from '../../types';
 import { uuidV4 } from '../../utils';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 import { IterableEntryBase } from '../base';
 import { IGraph } from '../../interfaces';
 import { Heap } from '../heap';
@@ -275,7 +275,7 @@ export abstract class AbstractGraph<
         const newEdge = this.createEdge(srcOrEdge, dest, weight, value);
         return this._addEdge(newEdge);
       } else {
-        throw new TypeError(ERR.invalidArgument('dest must be a Vertex or vertex key when srcOrEdge is an Edge.', 'Graph'));
+        raise(TypeError, ERR.invalidArgument('dest must be a Vertex or vertex key when srcOrEdge is an Edge.', 'Graph'));
       }
     }
   }

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

@@ -238,6 +238,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -330,6 +337,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -417,6 +431,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -504,6 +525,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -556,6 +584,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -680,6 +715,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -771,6 +813,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -819,6 +868,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -885,7 +941,7 @@ export class DirectedGraph<
    * Remove all vertices and edges.
    * @remarks Time O(V + E), Space O(1)
    */
-  clear() {
+  clear(): void {
     this._vertexMap = new Map<VertexKey, VO>();
     this._inEdgeMap = new Map<VO, EO[]>();
     this._outEdgeMap = new Map<VO, EO[]>();
@@ -925,6 +981,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1041,6 +1104,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -247,6 +247,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -335,6 +342,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -418,6 +432,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -525,6 +546,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -577,6 +605,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -664,7 +699,7 @@ export class UndirectedGraph<
    * Remove all vertices and edges.
    * @remarks Time O(V + E), Space O(1)
    */
-  clear() {
+  clear(): void {
     this._vertexMap = new Map<VertexKey, VO>();
     this._edgeMap = new Map<VO, EO[]>();
   }
@@ -703,6 +738,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -873,6 +915,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -941,6 +990,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -989,6 +1045,13 @@ 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.
@@ -193,6 +193,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -236,6 +243,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -320,6 +334,20 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -354,7 +382,7 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
  *     // Verify entries
  *     console.log([...map.entries()]); // length: 4;
    */
-  set(key: K, value: V): boolean {
+  set(key: K, value: V): this {
     if (this._isObjKey(key)) {
       if (!this.objMap.has(key)) this._size++;
       this.objMap.set(key, value);
@@ -363,7 +391,7 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
       if (this.store[strKey] === undefined) this._size++;
       this._store[strKey] = { key, value };
     }
-    return true;
+    return this;
   }
 
   /**
@@ -393,6 +421,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -413,7 +448,11 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
       let key: K | undefined, value: V | undefined;
       if (this.isEntry(rawEle)) [key, value] = rawEle;
       else if (this._toEntryFn) [key, value] = this._toEntryFn(rawEle);
-      if (key !== undefined && value !== undefined) results.push(this.set(key, value));
+      if (key !== undefined && value !== undefined) {
+        const sizeBefore = this._size;
+        this.set(key, value);
+        results.push(sizeBefore < this._size);
+      }
     }
     return results;
   }
@@ -447,6 +486,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -512,6 +558,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -562,6 +615,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -631,6 +691,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -682,6 +749,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -735,6 +809,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -770,11 +851,11 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
  *     console.log(values); // contains 7;
    */
 
-  filter(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): any {
+  filter(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): this {
     const out = this._createLike<K, V, [K, V]>();
     let index = 0;
     for (const [key, value] of this) if (predicate.call(thisArg, value, key, index++, this)) out.set(key, value);
-    return out;
+    return out as this;
   }
 
   /**
@@ -919,9 +1000,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() {
@@ -984,9 +1063,9 @@ export class LinkedHashMap<K = any, V = any, R = [K, V]> extends IterableEntryBa
    * @remarks Time O(1), Space O(1)
    * @param key - Key.
    * @param [value] - Value.
-   * @returns True when the operation succeeds.
+   * @returns This map (for chaining).
    */
-  set(key: K, value?: V): boolean {
+  set(key: K, value?: V): this {
     let node: HashMapLinkedNode<K, V | undefined> | undefined;
     const isNewKey = !this.has(key);
 
@@ -1022,7 +1101,7 @@ export class LinkedHashMap<K = any, V = any, R = [K, V]> extends IterableEntryBa
       this._size++;
     }
 
-    return true;
+    return this;
   }
 
   setMany(entryOrRawElements: Iterable<R | [K, V]>): boolean[] {
@@ -1031,7 +1110,11 @@ export class LinkedHashMap<K = any, V = any, R = [K, V]> extends IterableEntryBa
       let key: K | undefined, value: V | undefined;
       if (this.isEntry(rawEle)) [key, value] = rawEle;
       else if (this._toEntryFn) [key, value] = this._toEntryFn(rawEle);
-      if (key !== undefined && value !== undefined) results.push(this.set(key, value));
+      if (key !== undefined && value !== undefined) {
+        const sizeBefore = this._size;
+        this.set(key, value);
+        results.push(sizeBefore < this._size);
+      }
     }
     return results;
   }
@@ -1115,13 +1198,16 @@ export class LinkedHashMap<K = any, V = any, R = [K, V]> extends IterableEntryBa
    * Delete the entry at a given index.
    * @remarks Time O(N), Space O(1)
    * @param index - Zero-based index.
-   * @returns True if removed.
+   * @returns The removed entry [key, value].
+   * @throws {RangeError} If index is out of bounds.
    */
-  deleteAt(index: number): boolean {
+  deleteAt(index: number): [K, V | undefined] {
     rangeCheck(index, 0, this._size - 1);
     let node = this.head;
     while (index--) node = node.next;
-    return this._deleteNode(node);
+    const entry: [K, V | undefined] = [node.key as K, node.value];
+    this._deleteNode(node);
+    return entry;
   }
 
   isEmpty(): boolean {