data-structure-typed 2.5.2 → 2.6.0

package/dist/esm/hash.mjs

@@ -320,6 +320,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -365,6 +372,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -453,6 +467,20 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -496,7 +524,7 @@ var HashMap = class extends IterableEntryBase {
       if (this.store[strKey] === void 0) this._size++;
       this._store[strKey] = { key, value };
     }
-    return true;
+    return this;
   }
   /**
     * Insert many entries from an iterable.
@@ -528,6 +556,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -548,7 +583,11 @@ var HashMap = class extends IterableEntryBase {
       let key, value;
       if (this.isEntry(rawEle)) [key, value] = rawEle;
       else if (this._toEntryFn) [key, value] = this._toEntryFn(rawEle);
-      if (key !== void 0 && value !== void 0) results.push(this.set(key, value));
+      if (key !== void 0 && value !== void 0) {
+        const sizeBefore = this._size;
+        this.set(key, value);
+        results.push(sizeBefore < this._size);
+      }
     }
     return results;
   }
@@ -584,6 +623,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -651,6 +697,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -703,6 +756,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -773,6 +833,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -826,6 +893,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -881,6 +955,13 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1094,7 +1175,7 @@ var LinkedHashMap = class extends IterableEntryBase {
    * @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, value) {
     let node;
@@ -1129,7 +1210,7 @@ var LinkedHashMap = class extends IterableEntryBase {
       this._sentinel.prev = node;
       this._size++;
     }
-    return true;
+    return this;
   }
   setMany(entryOrRawElements) {
     const results = [];
@@ -1137,7 +1218,11 @@ var LinkedHashMap = class extends IterableEntryBase {
       let key, value;
       if (this.isEntry(rawEle)) [key, value] = rawEle;
       else if (this._toEntryFn) [key, value] = this._toEntryFn(rawEle);
-      if (key !== void 0 && value !== void 0) results.push(this.set(key, value));
+      if (key !== void 0 && value !== void 0) {
+        const sizeBefore = this._size;
+        this.set(key, value);
+        results.push(sizeBefore < this._size);
+      }
     }
     return results;
   }
@@ -1215,13 +1300,16 @@ var LinkedHashMap = class extends IterableEntryBase {
    * 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) {
     rangeCheck(index, 0, this._size - 1);
     let node = this.head;
     while (index--) node = node.next;
-    return this._deleteNode(node);
+    const entry = [node.key, node.value];
+    this._deleteNode(node);
+    return entry;
   }
   isEmpty() {
     return this._size === 0;

package/dist/esm/heap.mjs

@@ -184,6 +184,35 @@ var IterableElementBase = class {
     for (const ele of this) if (ele === element) return true;
     return false;
   }
+  /**
+   * Check whether a value exists (Array-compatible alias for `has`).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+   * @param element - Element to search for (uses `===`).
+   * @returns `true` if found.
+   */
+  includes(element) {
+    return this.has(element);
+  }
+  /**
+   * Return an iterator of `[index, value]` pairs (Array-compatible).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+   */
+  *entries() {
+    let index = 0;
+    for (const value of this) {
+      yield [index++, value];
+    }
+  }
+  /**
+   * Return an iterator of numeric indices (Array-compatible).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+   */
+  *keys() {
+    let index = 0;
+    for (const _ of this) {
+      yield index++;
+    }
+  }
   /**
    * Reduces all elements to a single accumulated value.
    *
@@ -316,6 +345,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -372,7 +408,7 @@ var Heap = class _Heap extends IterableElementBase {
   }
   /**
     * 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.
     
@@ -402,6 +438,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -459,6 +502,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -523,6 +573,40 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+     * @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.
     
     
     
@@ -553,6 +637,14 @@ var Heap = class _Heap extends IterableElementBase {
   *     console.log(topTask?.name); // 'Alert';
     */
   poll() {
+    return this.pop();
+  }
+  /**
+   * 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() {
     if (this.elements.length === 0) return;
     const value = this.elements[0];
     const last = this.elements.pop();
@@ -593,6 +685,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -693,6 +792,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -740,6 +846,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -757,16 +870,6 @@ var Heap = class _Heap extends IterableElementBase {
   clear() {
     this._elements = [];
   }
-  /**
-   * 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) {
-    this._elements = Array.from(elements);
-    return this.fix();
-  }
   /**
     * Check if an equal element exists in the heap.
     * @remarks Time O(N), Space O(1)
@@ -790,6 +893,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -837,6 +947,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -861,7 +978,7 @@ var Heap = class _Heap extends IterableElementBase {
     }
     if (index < 0) return false;
     if (index === 0) {
-      this.poll();
+      this.pop();
     } else if (index === this.elements.length - 1) {
       this.elements.pop();
     } else {
@@ -871,13 +988,19 @@ var Heap = class _Heap extends IterableElementBase {
     }
     return true;
   }
+  /**
+   * @deprecated Use `deleteWhere` instead. Will be removed in a future major version.
+   */
+  deleteBy(predicate) {
+    return this.deleteWhere(predicate);
+  }
   /**
    * 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) {
+  deleteWhere(predicate) {
     let idx = -1;
     for (let i = 0; i < this.elements.length; i++) {
       if (predicate(this.elements[i], i, this)) {
@@ -887,7 +1010,7 @@ var Heap = class _Heap extends IterableElementBase {
     }
     if (idx < 0) return false;
     if (idx === 0) {
-      this.poll();
+      this.pop();
     } else if (idx === this.elements.length - 1) {
       this.elements.pop();
     } else {
@@ -930,6 +1053,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1010,6 +1140,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1063,6 +1200,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1115,6 +1259,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1174,6 +1325,13 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1370,7 +1528,7 @@ var FibonacciHeap = class {
    * 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) {
     const node = this.createNode(element);
@@ -1379,7 +1537,7 @@ var FibonacciHeap = class {
     this.mergeWithRoot(node);
     if (!this.min || this.comparator(node.element, this.min.element) <= 0) this._min = node;
     this._size++;
-    return this;
+    return true;
   }
   peek() {
     return this.min ? this.min.element : void 0;