data-structure-typed 2.5.1 → 2.5.3

package/dist/types/data-structures/graph/directed-graph.d.ts

@@ -176,6 +176,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -231,6 +239,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -288,6 +304,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -333,6 +357,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -377,6 +409,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -449,6 +489,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -503,6 +551,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -543,6 +599,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -610,6 +674,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -673,6 +745,14 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/graph/undirected-graph.d.ts

@@ -193,6 +193,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -247,6 +255,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -309,6 +325,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -365,6 +389,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -407,6 +439,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -496,6 +536,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -553,6 +601,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -598,6 +654,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -642,6 +706,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/hash/hash-map.d.ts

@@ -156,6 +156,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -195,6 +203,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -268,6 +284,22 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -304,7 +336,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
    *     // Verify entries
    *     console.log([...map.entries()]); // length: 4;
      */
-    set(key: K, value: V): boolean;
+    set(key: K, value: V): this;
     /**
      * Insert many entries from an iterable.
      * @remarks Time O(N), Space O(N)
@@ -330,6 +362,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -373,6 +413,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -432,6 +480,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -476,6 +532,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -525,6 +589,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -571,6 +643,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -617,6 +697,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -652,7 +740,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
    *     console.log(values); // contains 3; // 'Bob', 'Eve'
    *     console.log(values); // contains 7;
      */
-    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): any;
+    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): this;
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
      * @remarks Time O(N), Space O(N)
@@ -752,9 +840,9 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @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;
     setMany(entryOrRawElements: Iterable<R | [K, V]>): boolean[];
     has(key: K): boolean;
     get(key: K): V | undefined;
@@ -777,9 +865,10 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * 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];
     isEmpty(): boolean;
     isEntry(rawElement: unknown): rawElement is [K, V];
     clear(): void;