data-structure-typed 2.5.2 → 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.
    *
@@ -283,6 +312,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -343,6 +379,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -392,6 +435,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -441,6 +491,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -499,6 +556,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -572,6 +636,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -588,18 +659,18 @@ var _Stack = class _Stack 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.
@@ -645,6 +716,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -691,6 +769,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -743,6 +828,13 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -815,6 +907,13 @@ 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.
    *
@@ -410,6 +439,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -482,6 +518,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -541,6 +584,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -595,6 +645,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -641,6 +698,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -691,6 +755,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -823,6 +894,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -899,6 +977,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -958,6 +1043,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1035,6 +1127,13 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1085,6 +1184,13 @@ 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

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { BST } from './bst';
-import type { AVLTreeOptions, BinaryTreeDeleteResult, BinaryTreeOptions, BSTNOptKeyOrNode, EntryCallback, FamilyPosition, IterationType, RBTNColor } from '../../types';
+import type { AVLTreeOptions, BinaryTreeOptions, BSTNOptKeyOrNode, EntryCallback, FamilyPosition, IterationType, RBTNColor } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 /**
  * Represents a Node in an AVL (Adelson-Velsky and Landis) Tree.
@@ -378,6 +378,34 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -497,6 +525,27 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -525,7 +574,7 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
    *     console.log(avl.has(3)); // false;
    *     console.log(avl.size); // 6;
      */
-    delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): BinaryTreeDeleteResult<AVLTreeNode<K, V>>[];
+    delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
     /**
      * Rebuilds the tree to be perfectly balanced.
      * @remarks AVL trees are already height-balanced, but this makes them *perfectly* balanced (minimal height and all leaves at N or N-1).
@@ -578,6 +627,20 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -687,6 +750,27 @@ 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

@@ -76,6 +76,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -149,6 +163,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -221,6 +249,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -294,6 +336,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -365,6 +421,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -439,6 +509,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -484,6 +568,13 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -524,6 +615,13 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+