binary-tree-typed 2.5.3 → 2.6.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "binary-tree-typed",
-  "version": "2.5.3",
+  "version": "2.6.0",
   "description": "Binary Tree. Javascript & Typescript Data Structure.",
   "browser": "dist/umd/binary-tree-typed.min.js",
   "umd:main": "dist/umd/binary-tree-typed.min.js",
@@ -178,6 +178,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^2.5.3"
+    "data-structure-typed": "^2.6.0"
   }
 }

package/src/data-structures/base/iterable-element-base.ts

@@ -191,6 +191,38 @@ export abstract class IterableElementBase<E, R> implements Iterable<E> {
     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: E): boolean {
+    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(): IterableIterator<[number, E]> {
+    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(): IterableIterator<number> {
+    let index = 0;
+    for (const _ of this) {
+      yield index++;
+    }
+  }
+
   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/src/data-structures/base/linear-base.ts

@@ -327,6 +327,17 @@ export abstract class LinearBase<
    */
   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 {
+    const cloned = this.clone();
+    cloned.reverse();
+    return cloned as this;
+  }
+
   /**
    * Append one element or node to the tail.
    * @param elementOrNode - Element or node.

package/src/data-structures/binary-tree/avl-tree.ts

@@ -494,6 +494,18 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -638,6 +650,15 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -736,6 +757,12 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -888,6 +915,15 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    

package/src/data-structures/binary-tree/binary-indexed-tree.ts

@@ -119,6 +119,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -204,6 +210,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -289,6 +301,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -374,6 +392,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -457,6 +481,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -548,6 +578,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -608,6 +644,9 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
    
    
    
@@ -681,6 +720,9 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/binary-tree/binary-tree.ts

@@ -596,6 +596,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -657,6 +660,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -780,6 +786,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -831,6 +840,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -908,6 +920,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1025,6 +1040,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1070,6 +1088,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1210,6 +1231,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1289,6 +1313,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1362,6 +1389,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1428,6 +1458,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1530,6 +1563,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1583,6 +1619,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1648,6 +1687,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1743,6 +1785,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1812,6 +1857,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2122,6 +2170,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2214,6 +2265,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2365,6 +2419,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2469,6 +2526,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2591,6 +2651,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2757,6 +2820,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2814,6 +2880,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2875,6 +2944,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2969,6 +3041,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/binary-tree/bst.ts

@@ -509,6 +509,12 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -619,6 +625,12 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -725,6 +737,12 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -843,6 +861,12 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -980,6 +1004,12 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1182,6 +1212,9 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
    
    
    
@@ -1553,6 +1586,15 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1689,6 +1731,12 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1835,6 +1883,9 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
    
    
    
@@ -1945,6 +1996,9 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
    
    
    
@@ -2054,6 +2108,9 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
    
    
    
@@ -2207,6 +2264,9 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
    
    
    
@@ -2416,6 +2476,9 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
    
    
    
@@ -2493,6 +2556,9 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
    
    
    
@@ -2626,6 +2692,12 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    

package/src/data-structures/binary-tree/red-black-tree.ts

@@ -468,6 +468,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1016,6 +1028,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1244,6 +1268,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1464,6 +1500,15 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1630,6 +1675,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+