binary-tree-typed 2.5.0 → 2.5.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "binary-tree-typed",
-  "version": "2.5.0",
+  "version": "2.5.1",
   "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.0"
+    "data-structure-typed": "^2.5.1"
   }
 }

package/src/data-structures/base/index.ts

@@ -1,2 +1,3 @@
 export * from './iterable-entry-base';
 export * from './iterable-element-base';
+export * from './linear-base';

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

@@ -19,7 +19,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * @returns Iterator of `[K, V]`.
    * @remarks Time O(n) to iterate, Space O(1)
    */
-  *[Symbol.iterator](...args: any[]): IterableIterator<[K, V]> {
+  *[Symbol.iterator](...args: unknown[]): IterableIterator<[K, V]> {
     yield* this._getIterator(...args);
   }
 
@@ -63,7 +63,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * @returns `true` if all pass; otherwise `false`.
    * @remarks Time O(n), Space O(1)
    */
-  every(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean {
+  every(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): boolean {
     let index = 0;
     for (const item of this) {
       if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
@@ -80,7 +80,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * @returns `true` if any passes; otherwise `false`.
    * @remarks Time O(n), Space O(1)
    */
-  some(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean {
+  some(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): boolean {
     let index = 0;
     for (const item of this) {
       if (predicate.call(thisArg, item[1], item[0], index++, this)) {
@@ -96,7 +96,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * @param thisArg - Optional `this` for callback.
    * @remarks Time O(n), Space O(1)
    */
-  forEach(callbackfn: EntryCallback<K, V, void>, thisArg?: any): void {
+  forEach(callbackfn: EntryCallback<K, V, void>, thisArg?: unknown): void {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
@@ -111,7 +111,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * @returns Matching `[key, value]` or `undefined`.
    * @remarks Time O(n), Space O(1)
    */
-  find(callbackfn: EntryCallback<K, V, boolean>, thisArg?: any): [K, V] | undefined {
+  find(callbackfn: EntryCallback<K, V, boolean>, thisArg?: unknown): [K, V] | undefined {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
@@ -228,19 +228,19 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * Map entries using an implementation-specific strategy.
    * @remarks Time O(n), Space O(n)
    */
-  abstract map(...args: any[]): any;
+  abstract map(...args: unknown[]): unknown;
 
   /**
    * Filter entries and return the same-species structure.
    * @returns A new instance of the same concrete class (`this` type).
    * @remarks Time O(n), Space O(n)
    */
-  abstract filter(...args: any[]): this;
+  abstract filter(...args: unknown[]): this;
 
   /**
    * Underlying iterator for the default iteration protocol.
    * @returns Iterator of `[K, V]`.
    * @remarks Time O(n), Space O(1)
    */
-  protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
+  protected abstract _getIterator(...args: unknown[]): IterableIterator<[K, V]>;
 }

package/src/data-structures/base/linear-base.ts

@@ -148,7 +148,7 @@ export abstract class LinearBase<
    * @returns Index or `-1`.
    * @remarks Time O(n), Space O(1)
    */
-  findIndex(predicate: ElementCallback<E, R, boolean>, thisArg?: any): number {
+  findIndex(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): number {
     for (let i = 0; i < this.length; i++) {
       const item = this.at(i);
       if (item !== undefined && predicate.call(thisArg, item, i, this)) return i;
@@ -389,7 +389,7 @@ export abstract class LinearBase<
    * @returns Iterator of elements from tail to head.
    * @remarks Time O(n), Space O(1)
    */
-  protected abstract _getReverseIterator(...args: any[]): IterableIterator<E>;
+  protected abstract _getReverseIterator(...args: unknown[]): IterableIterator<E>;
 }
 
 /**
@@ -621,7 +621,7 @@ export abstract class LinearLinkedBase<
    * @returns Iterator over nodes.
    * @remarks Time O(n), Space O(1)
    */
-  protected abstract _getNodeIterator(...args: any[]): IterableIterator<NODE>;
+  protected abstract _getNodeIterator(...args: unknown[]): IterableIterator<NODE>;
 
   /**
    * Get previous node of a given node.

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

@@ -375,6 +375,90 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -432,6 +516,69 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -492,6 +639,48 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Rebalance the tree
  *  const avl = new AVLTree<number>();
@@ -561,6 +750,69 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
     * @example

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

@@ -70,6 +70,48 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Add delta at index
  *  const bit = new BinaryIndexedTree([1, 2, 3, 4, 5]);
@@ -99,6 +141,48 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Set value at index
  *  const bit = new BinaryIndexedTree([1, 2, 3]);
@@ -128,6 +212,48 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get value at index
  *  const bit = new BinaryIndexedTree([1, 2, 3]);
@@ -157,6 +283,48 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Prefix sum
  *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
@@ -184,6 +352,48 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Range sum
  *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
@@ -219,6 +429,48 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Find index with prefix sum ≥ target
  *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
@@ -248,6 +500,27 @@ export class BinaryIndexedTree implements Iterable<number> {
    * Time: O(log n)
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Find index with prefix sum > target
  *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
@@ -293,6 +566,27 @@ export class BinaryIndexedTree implements Iterable<number> {
    * Time: O(n log n)
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Convert to array
  *  const bit = new BinaryIndexedTree([1, 2, 3]);
@@ -322,7 +616,7 @@ export class BinaryIndexedTree implements Iterable<number> {
         if (i < size) {
           return { value: self._pointQuery(i++ + 1), done: false };
         }
-        return { value: undefined as any, done: true };
+        return { value: undefined, done: true } as IteratorResult<number>;
       }
     };
   }