data-structure-typed 2.5.2 → 2.6.0

package/dist/esm/stack.mjs

@@ -159,6 +159,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.
    *
@@ -285,6 +314,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -345,6 +381,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -394,6 +437,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -443,6 +493,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -501,6 +558,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -574,6 +638,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -590,18 +661,18 @@ var Stack = class extends IterableElementBase {
     */
   delete(element) {
     const idx = this._indexOfByEquals(element);
-    return this.deleteAt(idx);
+    return this.deleteAt(idx) !== void 0;
   }
   /**
    * Delete the element at an index.
    * @remarks Time O(N), Space O(1)
    * @param index - Zero-based index from the bottom.
-   * @returns True if removed.
+   * @returns The removed element, or undefined if the index is out of range.
    */
   deleteAt(index) {
-    if (index < 0 || index >= this.elements.length) return false;
+    if (index < 0 || index >= this.elements.length) return void 0;
     const spliced = this.elements.splice(index, 1);
-    return spliced.length === 1;
+    return spliced[0];
   }
   /**
    * Delete the first element that satisfies a predicate.
@@ -647,6 +718,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -693,6 +771,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -745,6 +830,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -817,6 +909,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     

package/dist/esm/trie.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.
    *
@@ -413,6 +442,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -485,6 +521,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -544,6 +587,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -598,6 +648,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -644,6 +701,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -694,6 +758,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -826,6 +897,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -902,6 +980,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -961,6 +1046,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1038,6 +1130,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1088,6 +1187,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+