data-structure-typed 2.6.1 → 2.6.2

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

@@ -26,434 +26,53 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      * @param sizeOrElements - number of elements, or an array of initial values
      */
     constructor(sizeOrElements: number | number[]);
+    get size(): number;
     /**
      * 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;
     /**
      * 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;
     /**
      * 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;
     /**
      * 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;
     /**
      * 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;
     /**
@@ -461,88 +80,11 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      * 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;
     /**
@@ -550,90 +92,23 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      * 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;
-    get size(): number;
     isEmpty(): boolean;
     clear(): void;
     clone(): BinaryIndexedTree;
     /**
      * 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[];
     /**