data-structure-typed 2.5.3 → 2.6.0

package/dist/esm-legacy/stack.mjs

@@ -158,6 +158,35 @@ var _IterableElementBase = class _IterableElementBase {
     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.
    *
@@ -291,6 +320,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -355,6 +387,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -408,6 +443,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -461,6 +499,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -523,6 +564,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -600,6 +644,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -677,6 +724,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -727,6 +777,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -783,6 +836,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -859,6 +915,9 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     

package/dist/esm-legacy/trie.mjs

@@ -183,6 +183,35 @@ var _IterableElementBase = class _IterableElementBase {
     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.
    *
@@ -418,6 +447,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -494,6 +526,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -557,6 +592,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -615,6 +653,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -665,6 +706,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -719,6 +763,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -855,6 +902,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -935,6 +985,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -998,6 +1051,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1079,6 +1135,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1133,6 +1192,9 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     

package/dist/types/data-structures/base/iterable-element-base.d.ts

@@ -118,6 +118,23 @@ export declare abstract class IterableElementBase<E, R> implements Iterable<E> {
      * Time O(n) in the worst case. Space O(1).
      */
     has(element: E): boolean;
+    /**
+     * 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: E): boolean;
+    /**
+     * 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(): IterableIterator<[number, E]>;
+    /**
+     * 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(): IterableIterator<number>;
     reduce(callbackfn: ReduceElementCallback<E, R>): E;
     reduce(callbackfn: ReduceElementCallback<E, R>, initialValue: E): E;
     reduce<U>(callbackfn: ReduceElementCallback<E, R, U>, initialValue: U): U;

package/dist/types/data-structures/base/linear-base.d.ts

@@ -173,6 +173,12 @@ export declare abstract class LinearBase<E, R = any, NODE extends LinkedListNode
      * @remarks Time O(n), Space O(1)
      */
     abstract reverse(): this;
+    /**
+     * Return a new instance of the same type with elements in reverse order (non-mutating).
+     * @remarks Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O(n), Space O(n).
+     * @returns A new reversed instance.
+     */
+    toReversed(): this;
     /**
      * Append one element or node to the tail.
      * @param elementOrNode - Element or node.

package/dist/types/data-structures/binary-tree/avl-tree.d.ts

@@ -402,6 +402,18 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -536,6 +548,15 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -622,6 +643,12 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -746,6 +773,15 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts

@@ -92,6 +92,12 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -173,6 +179,12 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -253,6 +265,12 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -334,6 +352,12 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -413,6 +437,12 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -495,6 +525,12 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -540,6 +576,9 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
      
      
      
@@ -584,6 +623,9 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
      
      
      

package/dist/types/data-structures/binary-tree/binary-tree.d.ts

@@ -387,6 +387,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -443,6 +446,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -511,6 +517,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -555,6 +564,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -604,6 +616,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -666,6 +681,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -706,6 +724,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -759,6 +780,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -811,6 +835,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -864,6 +891,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -918,6 +948,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -988,6 +1021,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1037,6 +1073,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1094,6 +1133,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1147,6 +1189,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1200,6 +1245,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1278,6 +1326,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1328,6 +1379,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1398,6 +1452,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1444,6 +1501,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1492,6 +1552,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1542,6 +1605,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1594,6 +1660,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1649,6 +1718,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1708,6 +1780,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+