data-structure-typed 2.5.2 → 2.6.0

package/dist/cjs/stack.cjs

@@ -161,6 +161,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.
    *
@@ -287,6 +316,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -347,6 +383,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -396,6 +439,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -445,6 +495,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -503,6 +560,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -576,6 +640,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -592,18 +663,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.
@@ -649,6 +720,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -695,6 +773,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -747,6 +832,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -819,6 +911,13 @@ var Stack = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     

package/dist/cjs/trie.cjs

@@ -186,6 +186,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.
    *
@@ -415,6 +444,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -487,6 +523,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -546,6 +589,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -600,6 +650,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -646,6 +703,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -696,6 +760,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -828,6 +899,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -904,6 +982,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -963,6 +1048,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1040,6 +1132,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1090,6 +1189,13 @@ var Trie = class extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+