max-priority-queue-typed 2.5.2 → 2.6.0

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

@@ -241,6 +241,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -336,6 +343,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -426,6 +440,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -516,6 +537,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -571,6 +599,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -698,6 +733,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -792,6 +834,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -843,6 +892,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -909,7 +965,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[]>();
@@ -952,6 +1008,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1071,6 +1134,13 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -250,6 +250,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -341,6 +348,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -427,6 +441,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -537,6 +558,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -592,6 +620,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -679,7 +714,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[]>();
   }
@@ -721,6 +756,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -894,6 +936,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -965,6 +1014,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1016,6 +1072,13 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -196,6 +196,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -242,6 +249,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -332,6 +346,20 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -366,7 +394,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);
@@ -375,7 +403,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;
   }
 
   /**
@@ -408,6 +436,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -428,7 +463,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;
   }
@@ -465,6 +504,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -533,6 +579,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -586,6 +639,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -658,6 +718,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -712,6 +779,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -768,6 +842,13 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -803,11 +884,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;
   }
 
   /**
@@ -1015,9 +1096,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);
 
@@ -1053,7 +1134,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[] {
@@ -1062,7 +1143,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;
   }
@@ -1146,13 +1231,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 {