max-priority-queue-typed 2.5.2 → 2.5.3

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

@@ -184,6 +184,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
      
      
      
@@ -243,6 +247,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
      
      
      
@@ -304,6 +312,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
    
    
    
@@ -353,6 +365,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
      
      
      
@@ -401,6 +417,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
      
      
      
@@ -477,6 +497,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
      
      
      
@@ -535,6 +559,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
    
    
    
@@ -579,6 +607,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
    
    
    
@@ -650,6 +682,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
      
      
      
@@ -717,6 +753,10 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
      
      
      

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

@@ -201,6 +201,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      
@@ -259,6 +263,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      
@@ -325,6 +333,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      
@@ -385,6 +397,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      
@@ -431,6 +447,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
    
    
    
+   
+   
+   
+   
    
    
    
@@ -524,6 +544,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      
@@ -585,6 +609,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      
@@ -634,6 +662,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      
@@ -682,6 +714,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
      
      
      

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

@@ -164,6 +164,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -207,6 +211,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -292,6 +300,14 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -320,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)
@@ -354,6 +370,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -401,6 +421,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -464,6 +488,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -512,6 +540,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -565,6 +597,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -615,6 +651,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -665,6 +705,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -696,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)
@@ -796,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;
@@ -821,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;

package/dist/types/data-structures/heap/heap.d.ts

@@ -9,7 +9,7 @@ import type { Comparator, DFSOrderPattern, ElementCallback, HeapOptions } from '
 import { IterableElementBase } from '../base';
 /**
  * Binary heap with pluggable comparator; supports fast insertion and removal of the top element.
- * @remarks Time O(1), Space O(1)
+ * @remarks Typical operations: O(log N) insert/remove, O(1) peek. Space O(N).
  * @template E
  * @template R
  * 1. Complete Binary Tree: Heaps are typically complete binary trees, meaning every level is fully filled except possibly for the last level, which has nodes as far left as possible.
@@ -195,6 +195,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -240,7 +244,7 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
     static heapify<EE = any, RR = any>(elements: Iterable<EE>, options: HeapOptions<EE, RR>): Heap<EE, RR>;
     /**
      * Insert an element.
-     * @remarks Time O(1) amortized, Space O(1)
+     * @remarks Time O(log N) amortized, Space O(1)
      * @param element - Element to insert.
      * @returns True.
      
@@ -273,6 +277,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -327,6 +335,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -375,10 +387,41 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
      
+      * @example
+   * // Heap with custom comparator (MaxHeap behavior)
+   *  interface Task {
+   *       id: number;
+   *       priority: number;
+   *       name: string;
+   *     }
+   *
+   *     // Custom comparator for max heap behavior (higher priority first)
+   *     const tasks: Task[] = [
+   *       { id: 1, priority: 5, name: 'Email' },
+   *       { id: 2, priority: 3, name: 'Chat' },
+   *       { id: 3, priority: 8, name: 'Alert' }
+   *     ];
+   *
+   *     const maxHeap = new Heap(tasks, {
+   *       comparator: (a: Task, b: Task) => b.priority - a.priority
+   *     });
+   *
+   *     console.log(maxHeap.size); // 3;
+   *
+   *     // Peek returns highest priority task
+   *     const topTask = maxHeap.peek();
+   *     console.log(topTask?.priority); // 8;
+   *     console.log(topTask?.name); // 'Alert';
+     */
+    /**
+     * @deprecated Use `pop` instead. Will be removed in a future major version.
       * @example
    * // Heap with custom comparator (MaxHeap behavior)
    *  interface Task {
@@ -406,6 +449,12 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    *     console.log(topTask?.name); // 'Alert';
      */
     poll(): E | undefined;
+    /**
+     * Remove and return the top element (min or max depending on comparator).
+     * @remarks Time O(log N) amortized, Space O(1)
+     * @returns The removed top element, or undefined if empty.
+     */
+    pop(): E | undefined;
     /**
      * Get the current top element without removing it.
      * @remarks Time O(1), Space O(1)
@@ -440,6 +489,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -538,6 +591,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -583,6 +640,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -595,13 +656,6 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    *     console.log(heap.isEmpty()); // true;
      */
     clear(): void;
-    /**
-     * Replace the backing array and rebuild the heap.
-     * @remarks Time O(N), Space O(N)
-     * @param elements - Iterable used to refill the heap.
-     * @returns Array of per-node results from fixing steps.
-     */
-    refill(elements: Iterable<E>): boolean[];
     /**
      * Check if an equal element exists in the heap.
      * @remarks Time O(N), Space O(1)
@@ -628,6 +682,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -672,6 +730,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -684,13 +746,17 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    *     console.log(heap.toArray().includes(4)); // false;
      */
     delete(element: E): boolean;
+    /**
+     * @deprecated Use `deleteWhere` instead. Will be removed in a future major version.
+     */
+    deleteBy(predicate: (element: E, index: number, heap: this) => boolean): boolean;
     /**
      * Delete the first element that matches a predicate.
      * @remarks Time O(N), Space O(1)
      * @param predicate - Function (element, index, heap) → boolean.
      * @returns True if an element was removed.
      */
-    deleteBy(predicate: (element: E, index: number, heap: this) => boolean): boolean;
+    deleteWhere(predicate: (element: E, index: number, heap: this) => boolean): boolean;
     /**
      * Set the equality comparator used by has/delete operations.
      * @remarks Time O(1), Space O(1)
@@ -724,6 +790,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -776,6 +846,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -820,6 +894,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -868,6 +946,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -916,6 +998,10 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1029,9 +1115,9 @@ export declare class FibonacciHeap<E> {
      * Push an element into the root list.
      * @remarks Time O(1) amortized, Space O(1)
      * @param element - Element to insert.
-     * @returns This heap.
+     * @returns True when the element is added.
      */
-    push(element: E): this;
+    push(element: E): boolean;
     peek(): E | undefined;
     /**
      * Collect nodes from a circular doubly linked list starting at head.