data-structure-typed 2.5.2 → 2.5.3

package/dist/esm/hash.mjs

@@ -323,6 +323,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -368,6 +372,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -459,6 +467,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -496,7 +512,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.
@@ -531,6 +547,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -548,7 +568,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;
   }
@@ -587,6 +611,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -654,6 +682,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -706,6 +738,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -776,6 +812,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -829,6 +869,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -884,6 +928,10 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1094,7 +1142,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 +1177,7 @@ var LinkedHashMap = class extends IterableEntryBase {
       this._sentinel.prev = node;
       this._size++;
     }
-    return true;
+    return this;
   }
   setMany(entryOrRawElements) {
     const results = [];
@@ -1137,7 +1185,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 +1267,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

@@ -319,6 +319,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -372,7 +376,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.
     
@@ -405,6 +409,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -462,6 +470,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -522,10 +534,41 @@ 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.
      * @example
   * // Heap with custom comparator (MaxHeap behavior)
   *  interface Task {
@@ -553,6 +596,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();
@@ -596,6 +647,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -696,6 +751,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -743,6 +802,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -757,16 +820,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)
@@ -793,6 +846,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -840,6 +897,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -861,7 +922,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 +932,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 +954,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 {
@@ -933,6 +1000,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1013,6 +1084,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1066,6 +1141,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1118,6 +1197,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1177,6 +1260,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1370,7 +1457,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 +1466,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;