data-structure-typed 2.5.3 → 2.6.1

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

@@ -29,7 +29,7 @@ import { ERR, raise } from '../../common';
  */
 export class BinaryIndexedTree implements Iterable<number> {
   protected readonly _size: number;
-  protected _tree: number[];  // 1-indexed BIT array
+  protected _tree: number[]; // 1-indexed BIT array
 
   /**
    * Construct a BIT of given size (all zeros), or from an initial values array.
@@ -53,84 +53,18 @@ export class BinaryIndexedTree implements Iterable<number> {
 
   // ─── Core operations ──────────────────────────────────────────
 
+  get size(): number {
+    return this._size;
+  }
+
   /**
    * Point update: add delta to the value at index (0-based).
    * Time: O(log n)
-  
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Add delta at index
- *  const bit = new BinaryIndexedTree([1, 2, 3, 4, 5]);
- *     bit.update(2, 7);
- *     console.log(bit.get(2)); // 10;
+   * @example
+   * // Add delta at index
+   *  const bit = new BinaryIndexedTree([1, 2, 3, 4, 5]);
+   *     bit.update(2, 7);
+   *     console.log(bit.get(2)); // 10;
    */
   update(index: number, delta: number): void {
     this._checkIndex(index);
@@ -140,82 +74,11 @@ export class BinaryIndexedTree implements Iterable<number> {
   /**
    * Point set: set the value at index to an absolute value (0-based).
    * Time: O(log n)
-   
-  
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Set value at index
- *  const bit = new BinaryIndexedTree([1, 2, 3]);
- *     bit.set(1, 10);
- *     console.log(bit.get(1)); // 10;
+   * @example
+   * // Set value at index
+   *  const bit = new BinaryIndexedTree([1, 2, 3]);
+   *     bit.set(1, 10);
+   *     console.log(bit.get(1)); // 10;
    */
   set(index: number, value: number): void {
     this._checkIndex(index);
@@ -226,81 +89,11 @@ export class BinaryIndexedTree implements Iterable<number> {
   /**
    * Get the point value at index (0-based).
    * Time: O(log n)
-  
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Get value at index
- *  const bit = new BinaryIndexedTree([1, 2, 3]);
- *     console.log(bit.get(0)); // 1;
- *     console.log(bit.get(2)); // 3;
+   * @example
+   * // Get value at index
+   *  const bit = new BinaryIndexedTree([1, 2, 3]);
+   *     console.log(bit.get(0)); // 1;
+   *     console.log(bit.get(2)); // 3;
    */
   get(index: number): number {
     this._checkIndex(index);
@@ -310,164 +103,25 @@ export class BinaryIndexedTree implements Iterable<number> {
   /**
    * Prefix sum query: returns sum of elements [0..index] (inclusive, 0-based).
    * Time: O(log n)
-   
-  
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Prefix sum
- *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
- *     console.log(bit.query(2)); // 6;
+   * @example
+   * // Prefix sum
+   *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
+   *     console.log(bit.query(2)); // 6;
    */
   query(index: number): number {
     this._checkIndex(index);
     return this._prefixSum(index + 1);
   }
 
+  // ─── Binary search ───────────────────────────────────────────
+
   /**
    * Range sum query: returns sum of elements [start..end] (inclusive, 0-based).
    * Time: O(log n)
-  
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Range sum
- *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
- *     console.log(bit.queryRange(1, 2)); // 5;
+   * @example
+   * // Range sum
+   *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
+   *     console.log(bit.queryRange(1, 2)); // 5;
    */
   queryRange(start: number, end: number): number {
     this._checkIndex(start);
@@ -477,89 +131,16 @@ export class BinaryIndexedTree implements Iterable<number> {
     return this._prefixSum(end + 1) - this._prefixSum(start);
   }
 
-  // ─── Binary search ───────────────────────────────────────────
-
   /**
    * Find the smallest index i such that prefix sum [0..i] >= sum.
    * Requires all values to be non-negative (behavior undefined otherwise).
    * Returns size if no such index exists.
    * Time: O(log n)
-   
-  
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Find index with prefix sum ≥ target
- *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
- *     const idx = bit.lowerBound(4);
- *     console.log(idx); // >= 0;
+   * @example
+   * // Find index with prefix sum ≥ target
+   *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
+   *     const idx = bit.lowerBound(4);
+   *     console.log(idx); // >= 0;
    */
   lowerBound(sum: number): number {
     let pos = 0;
@@ -577,46 +158,18 @@ export class BinaryIndexedTree implements Iterable<number> {
     return pos; // 0-based
   }
 
+  // ─── Standard interface ──────────────────────────────────────
+
   /**
    * Find the smallest index i such that prefix sum [0..i] > sum.
    * Requires all values to be non-negative (behavior undefined otherwise).
    * Returns size if no such index exists.
    * Time: O(log n)
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Find index with prefix sum > target
- *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
- *     const idx = bit.upperBound(4);
- *     console.log(idx); // >= 0;
+   * @example
+   * // Find index with prefix sum > target
+   *  const bit = new BinaryIndexedTree([1, 2, 3, 4]);
+   *     const idx = bit.upperBound(4);
+   *     console.log(idx); // >= 0;
    */
   upperBound(sum: number): number {
     let pos = 0;
@@ -634,12 +187,6 @@ export class BinaryIndexedTree implements Iterable<number> {
     return pos; // 0-based
   }
 
-  // ─── Standard interface ──────────────────────────────────────
-
-  get size(): number {
-    return this._size;
-  }
-
   isEmpty(): boolean {
     return this._size === 0;
   }
@@ -655,40 +202,10 @@ export class BinaryIndexedTree implements Iterable<number> {
   /**
    * Returns the point values as a plain array.
    * Time: O(n log n)
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Convert to array
- *  const bit = new BinaryIndexedTree([1, 2, 3]);
- *     console.log(bit.toArray()); // [1, 2, 3];
+   * @example
+   * // Convert to array
+   *  const bit = new BinaryIndexedTree([1, 2, 3]);
+   *     console.log(bit.toArray()); // [1, 2, 3];
    */
   toArray(): number[] {
     const result: number[] = [];
@@ -752,7 +269,7 @@ export class BinaryIndexedTree implements Iterable<number> {
   /** 1-based point query: get exact value at pos. */
   protected _pointQuery(pos: number): number {
     let val = this._tree[pos];
-    const lca = pos - (pos & -pos);  // parent in prefix-sum sense
+    const lca = pos - (pos & -pos); // parent in prefix-sum sense
     pos--;
     while (pos > lca) {
       val -= this._tree[pos];