data-structure-typed 0.9.16 → 1.3.0

package/dist/data-structures/binary-tree/avl-tree.d.ts

@@ -1,17 +1,88 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 import { BST, BSTNode } from './bst';
-import type { AVLTreeDeleted, BinaryTreeNodeId } from '../types';
-export declare class AVLTreeNode<T> extends BSTNode<T> {
-    clone(): AVLTreeNode<T>;
+import type { AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeletedResult, BinaryTreeNodeId } from '../../types';
+import { IAVLTree, IAVLTreeNode } from '../../interfaces';
+export declare class AVLTreeNode<T = any, NEIGHBOR extends AVLTreeNode<T, NEIGHBOR> = AVLTreeNodeNested<T>> extends BSTNode<T, NEIGHBOR> implements IAVLTreeNode<T, NEIGHBOR> {
+    constructor(id: BinaryTreeNodeId, val?: T);
 }
-export declare class AVLTree<T> extends BST<T> {
-    createNode(id: BinaryTreeNodeId, val: T, count?: number): AVLTreeNode<T>;
-    put(id: BinaryTreeNodeId, val: T | null, count?: number): AVLTreeNode<T> | null;
-    remove(id: BinaryTreeNodeId, isUpdateAllLeftSum?: boolean): AVLTreeDeleted<T>[];
-    balanceFactor(node: AVLTreeNode<T>): number;
-    updateHeight(node: AVLTreeNode<T>): void;
-    balancePath(node: AVLTreeNode<T>): void;
-    balanceLL(A: AVLTreeNode<T>): void;
-    balanceLR(A: AVLTreeNode<T>): void;
-    balanceRR(A: AVLTreeNode<T>): void;
-    balanceRL(A: AVLTreeNode<T>): void;
+export declare class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode> extends BST<N> implements IAVLTree<N> {
+    /**
+     * This is a constructor function for an AVL tree data structure in TypeScript.
+     * @param {AVLTreeOptions} [options] - The `options` parameter is an optional object that can be passed to the
+     * constructor of the AVLTree class. It allows you to customize the behavior of the AVL tree by providing different
+     * options.
+     */
+    constructor(options?: AVLTreeOptions);
+    /**
+     * The function creates a new AVL tree node with the given id and value.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is used to uniquely
+     * identify each node in the tree.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the node. It represents the value
+     * that will be stored in the node.
+     * @returns a new AVLTreeNode object with the specified id and value.
+     */
+    createNode(id: BinaryTreeNodeId, val?: N['val']): N;
+    /**
+     * The function overrides the add method of a binary tree node and balances the tree after inserting a new node.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that we want to add.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the node being added. It is of type
+     * `N['val']`, which means it should be of the same type as the `val` property of the nodes in the binary tree.
+     * @returns The method is returning the inserted node, or null or undefined if the insertion was not successful.
+     */
+    add(id: BinaryTreeNodeId, val?: N['val']): N | null | undefined;
+    /**
+     * The function overrides the remove method of the Binary Search Tree class, performs the removal operation, and
+     * then balances the tree if necessary.
+     * @param {BinaryTreeNodeId} id - The `id` parameter represents the identifier of the binary tree node that needs to be
+     * removed from the AVL tree.
+     * @param {boolean} [isUpdateAllLeftSum] - The `isUpdateAllLeftSum` parameter is an optional boolean parameter that
+     * determines whether the left sum of all nodes in the AVL tree should be updated after removing a node. If
+     * `isUpdateAllLeftSum` is set to `true`, the left sum of all nodes will be recalculated.
+     * @returns The method is returning an array of `AVLTreeDeleted<N>` objects.
+     */
+    remove(id: BinaryTreeNodeId, isUpdateAllLeftSum?: boolean): BinaryTreeDeletedResult<N>[];
+    /**
+     * The balance factor of a given AVL tree node is calculated by subtracting the height of its left subtree from the
+     * height of its right subtree.
+     * @param node - The parameter "node" is of type N, which represents a node in an AVL tree.
+     * @returns The balance factor of the given AVL tree node.
+     */
+    protected _balanceFactor(node: N): number;
+    /**
+     * The function updates the height of a node in an AVL tree based on the heights of its left and right subtrees.
+     * @param node - The parameter `node` is an AVLTreeNode object, which represents a node in an AVL tree.
+     */
+    protected _updateHeight(node: N): void;
+    /**
+     * The `_balancePath` function balances the AVL tree by performing appropriate rotations based on the balance factor of
+     * each node in the path from the given node to the root.
+     * @param node - The `node` parameter is an AVLTreeNode object, which represents a node in an AVL tree.
+     */
+    protected _balancePath(node: N): void;
+    /**
+     * The `_balanceLL` function performs a left-left rotation on an AVL tree to balance it.
+     * @param A - The parameter A is an AVLTreeNode object.
+     */
+    protected _balanceLL(A: N): void;
+    /**
+     * The `_balanceLR` function performs a left-right rotation to balance an AVL tree.
+     * @param A - A is an AVLTreeNode object.
+     */
+    protected _balanceLR(A: N): void;
+    /**
+     * The `_balanceRR` function performs a right-right rotation on an AVL tree to balance it.
+     * @param A - The parameter A is an AVLTreeNode object.
+     */
+    protected _balanceRR(A: N): void;
+    /**
+     * The `_balanceRL` function performs a right-left rotation to balance an AVL tree.
+     * @param A - A is an AVLTreeNode object.
+     */
+    protected _balanceRL(A: N): void;
 }

package/dist/data-structures/binary-tree/avl-tree.js

@@ -1,130 +1,145 @@
 "use strict";
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        if (typeof b !== "function" && b !== null)
-            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.AVLTree = exports.AVLTreeNode = void 0;
-var bst_1 = require("./bst");
-var AVLTreeNode = /** @class */ (function (_super) {
-    __extends(AVLTreeNode, _super);
-    function AVLTreeNode() {
-        return _super !== null && _super.apply(this, arguments) || this;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+const bst_1 = require("./bst");
+class AVLTreeNode extends bst_1.BSTNode {
+    constructor(id, val) {
+        super(id, val);
     }
-    AVLTreeNode.prototype.clone = function () {
-        return new AVLTreeNode(this.id, this.val, this.count);
-    };
-    return AVLTreeNode;
-}(bst_1.BSTNode));
+}
 exports.AVLTreeNode = AVLTreeNode;
-var AVLTree = /** @class */ (function (_super) {
-    __extends(AVLTree, _super);
-    function AVLTree() {
-        return _super !== null && _super.apply(this, arguments) || this;
+class AVLTree extends bst_1.BST {
+    /**
+     * This is a constructor function for an AVL tree data structure in TypeScript.
+     * @param {AVLTreeOptions} [options] - The `options` parameter is an optional object that can be passed to the
+     * constructor of the AVLTree class. It allows you to customize the behavior of the AVL tree by providing different
+     * options.
+     */
+    constructor(options) {
+        super(options);
+    }
+    /**
+     * The function creates a new AVL tree node with the given id and value.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is used to uniquely
+     * identify each node in the tree.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the node. It represents the value
+     * that will be stored in the node.
+     * @returns a new AVLTreeNode object with the specified id and value.
+     */
+    createNode(id, val) {
+        return new AVLTreeNode(id, val);
     }
-    AVLTree.prototype.createNode = function (id, val, count) {
-        return new AVLTreeNode(id, val, count);
-    };
-    AVLTree.prototype.put = function (id, val, count) {
-        var inserted = _super.prototype.put.call(this, id, val, count);
+    /**
+     * The function overrides the add method of a binary tree node and balances the tree after inserting a new node.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that we want to add.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the node being added. It is of type
+     * `N['val']`, which means it should be of the same type as the `val` property of the nodes in the binary tree.
+     * @returns The method is returning the inserted node, or null or undefined if the insertion was not successful.
+     */
+    add(id, val) {
+        // TODO support node as a param
+        const inserted = super.add(id, val);
         if (inserted)
-            this.balancePath(inserted);
+            this._balancePath(inserted);
         return inserted;
-    };
-    AVLTree.prototype.remove = function (id, isUpdateAllLeftSum) {
-        var e_1, _a;
-        var deletedResults = _super.prototype.remove.call(this, id, isUpdateAllLeftSum);
-        try {
-            for (var deletedResults_1 = __values(deletedResults), deletedResults_1_1 = deletedResults_1.next(); !deletedResults_1_1.done; deletedResults_1_1 = deletedResults_1.next()) {
-                var needBalanced = deletedResults_1_1.value.needBalanced;
-                if (needBalanced) {
-                    this.balancePath(needBalanced);
-                }
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (deletedResults_1_1 && !deletedResults_1_1.done && (_a = deletedResults_1.return)) _a.call(deletedResults_1);
+    }
+    /**
+     * The function overrides the remove method of the Binary Search Tree class, performs the removal operation, and
+     * then balances the tree if necessary.
+     * @param {BinaryTreeNodeId} id - The `id` parameter represents the identifier of the binary tree node that needs to be
+     * removed from the AVL tree.
+     * @param {boolean} [isUpdateAllLeftSum] - The `isUpdateAllLeftSum` parameter is an optional boolean parameter that
+     * determines whether the left sum of all nodes in the AVL tree should be updated after removing a node. If
+     * `isUpdateAllLeftSum` is set to `true`, the left sum of all nodes will be recalculated.
+     * @returns The method is returning an array of `AVLTreeDeleted<N>` objects.
+     */
+    remove(id, isUpdateAllLeftSum) {
+        const deletedResults = super.remove(id, isUpdateAllLeftSum);
+        for (const { needBalanced } of deletedResults) {
+            if (needBalanced) {
+                this._balancePath(needBalanced);
             }
-            finally { if (e_1) throw e_1.error; }
         }
         return deletedResults;
-    };
-    AVLTree.prototype.balanceFactor = function (node) {
+    }
+    /**
+     * The balance factor of a given AVL tree node is calculated by subtracting the height of its left subtree from the
+     * height of its right subtree.
+     * @param node - The parameter "node" is of type N, which represents a node in an AVL tree.
+     * @returns The balance factor of the given AVL tree node.
+     */
+    _balanceFactor(node) {
         if (!node.right) // node has no right subtree
             return -node.height;
         else if (!node.left) // node has no left subtree
             return +node.height;
         else
             return node.right.height - node.left.height;
-    };
-    AVLTree.prototype.updateHeight = function (node) {
+    }
+    /**
+     * The function updates the height of a node in an AVL tree based on the heights of its left and right subtrees.
+     * @param node - The parameter `node` is an AVLTreeNode object, which represents a node in an AVL tree.
+     */
+    _updateHeight(node) {
         if (!node.left && !node.right) // node is a leaf
             node.height = 0;
         else if (!node.left) {
             // node has no left subtree
-            var rightHeight = node.right ? node.right.height : 0;
+            const rightHeight = node.right ? node.right.height : 0;
             node.height = 1 + rightHeight;
         }
         else if (!node.right) // node has no right subtree
             node.height = 1 + node.left.height;
         else
             node.height = 1 + Math.max(node.right.height, node.left.height);
-    };
-    AVLTree.prototype.balancePath = function (node) {
-        var path = this.getPathToRoot(node);
-        for (var i = path.length - 1; i >= 0; i--) {
-            var A = path[i];
-            this.updateHeight(A);
-            switch (this.balanceFactor(A)) {
+    }
+    /**
+     * The `_balancePath` function balances the AVL tree by performing appropriate rotations based on the balance factor of
+     * each node in the path from the given node to the root.
+     * @param node - The `node` parameter is an AVLTreeNode object, which represents a node in an AVL tree.
+     */
+    _balancePath(node) {
+        const path = this.getPathToRoot(node);
+        for (let i = path.length - 1; i >= 0; i--) {
+            const A = path[i];
+            this._updateHeight(A);
+            switch (this._balanceFactor(A)) {
                 case -2:
                     if (A && A.left) {
-                        if (this.balanceFactor(A.left) <= 0) {
-                            this.balanceLL(A); // Perform LL rotation
+                        if (this._balanceFactor(A.left) <= 0) {
+                            this._balanceLL(A); // Perform LL rotation
                         }
                         else {
-                            this.balanceLR(A); // Perform LR rotation
+                            this._balanceLR(A); // Perform LR rotation
                         }
                     }
                     break;
                 case +2:
                     if (A && A.right) {
-                        if (this.balanceFactor(A.right) >= 0) {
-                            this.balanceRR(A); // Perform RR rotation
+                        if (this._balanceFactor(A.right) >= 0) {
+                            this._balanceRR(A); // Perform RR rotation
                         }
                         else {
-                            this.balanceRL(A); // Perform RL rotation
+                            this._balanceRL(A); // Perform RL rotation
                         }
                     }
             }
         }
-    };
-    AVLTree.prototype.balanceLL = function (A) {
-        var parentOfA = A.parent;
-        var B = A.left; // A is left-heavy and B is left-heavy
+    }
+    /**
+     * The `_balanceLL` function performs a left-left rotation on an AVL tree to balance it.
+     * @param A - The parameter A is an AVLTreeNode object.
+     */
+    _balanceLL(A) {
+        const parentOfA = A.parent;
+        const B = A.left; // A is left-heavy and B is left-heavy
         A.parent = B;
         if (B && B.right) {
             B.right.parent = A;
@@ -133,7 +148,7 @@ var AVLTree = /** @class */ (function (_super) {
             B.parent = parentOfA;
         if (A === this.root) {
             if (B)
-                this.root = B;
+                this._setRoot(B);
         }
         else {
             if ((parentOfA === null || parentOfA === void 0 ? void 0 : parentOfA.left) === A) {
@@ -148,14 +163,18 @@ var AVLTree = /** @class */ (function (_super) {
             A.left = B.right; // Make T2 the left subtree of A
             B.right = A; // Make A the left child of B
         }
-        this.updateHeight(A);
+        this._updateHeight(A);
         if (B)
-            this.updateHeight(B);
-    };
-    AVLTree.prototype.balanceLR = function (A) {
-        var parentOfA = A.parent;
-        var B = A.left; // A is left-heavy
-        var C = null;
+            this._updateHeight(B);
+    }
+    /**
+     * The `_balanceLR` function performs a left-right rotation to balance an AVL tree.
+     * @param A - A is an AVLTreeNode object.
+     */
+    _balanceLR(A) {
+        const parentOfA = A.parent;
+        const B = A.left; // A is left-heavy
+        let C = null;
         if (B) {
             C = B.right; // B is right-heavy
         }
@@ -174,7 +193,7 @@ var AVLTree = /** @class */ (function (_super) {
         }
         if (A === this.root) {
             if (C)
-                this.root = C;
+                this._setRoot(C);
         }
         else {
             if (parentOfA) {
@@ -193,13 +212,17 @@ var AVLTree = /** @class */ (function (_super) {
             C.left = B;
             C.right = A;
         }
-        this.updateHeight(A); // Adjust heights
-        B && this.updateHeight(B);
-        C && this.updateHeight(C);
-    };
-    AVLTree.prototype.balanceRR = function (A) {
-        var parentOfA = A.parent;
-        var B = A.right; // A is right-heavy and B is right-heavy
+        this._updateHeight(A); // Adjust heights
+        B && this._updateHeight(B);
+        C && this._updateHeight(C);
+    }
+    /**
+     * The `_balanceRR` function performs a right-right rotation on an AVL tree to balance it.
+     * @param A - The parameter A is an AVLTreeNode object.
+     */
+    _balanceRR(A) {
+        const parentOfA = A.parent;
+        const B = A.right; // A is right-heavy and B is right-heavy
         A.parent = B;
         if (B) {
             if (B.left) {
@@ -209,7 +232,7 @@ var AVLTree = /** @class */ (function (_super) {
         }
         if (A === this.root) {
             if (B)
-                this.root = B;
+                this._setRoot(B);
         }
         else {
             if (parentOfA) {
@@ -225,13 +248,17 @@ var AVLTree = /** @class */ (function (_super) {
             A.right = B.left; // Make T2 the right subtree of A
             B.left = A;
         }
-        this.updateHeight(A);
-        B && this.updateHeight(B);
-    };
-    AVLTree.prototype.balanceRL = function (A) {
-        var parentOfA = A.parent;
-        var B = A.right; // A is right-heavy
-        var C = null;
+        this._updateHeight(A);
+        B && this._updateHeight(B);
+    }
+    /**
+     * The `_balanceRL` function performs a right-left rotation to balance an AVL tree.
+     * @param A - A is an AVLTreeNode object.
+     */
+    _balanceRL(A) {
+        const parentOfA = A.parent;
+        const B = A.right; // A is right-heavy
+        let C = null;
         if (B) {
             C = B.left; // B is left-heavy
         }
@@ -249,7 +276,7 @@ var AVLTree = /** @class */ (function (_super) {
         }
         if (A === this.root) {
             if (C)
-                this.root = C;
+                this._setRoot(C);
         }
         else {
             if (parentOfA) {
@@ -269,10 +296,9 @@ var AVLTree = /** @class */ (function (_super) {
             C.left = A;
         if (C)
             C.right = B;
-        this.updateHeight(A); // Adjust heights
-        B && this.updateHeight(B);
-        C && this.updateHeight(C);
-    };
-    return AVLTree;
-}(bst_1.BST));
+        this._updateHeight(A); // Adjust heights
+        B && this._updateHeight(B);
+        C && this._updateHeight(C);
+    }
+}
 exports.AVLTree = AVLTree;

package/dist/data-structures/binary-tree/b-tree.js

@@ -1,9 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BTree = void 0;
-var BTree = /** @class */ (function () {
-    function BTree() {
-    }
-    return BTree;
-}());
+class BTree {
+}
 exports.BTree = BTree;

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

@@ -1,8 +1,46 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 export declare class BinaryIndexedTree {
-    private readonly _sumTree;
+    /**
+     * The constructor initializes an array with a specified length and fills it with zeros.
+     * @param {number} n - The parameter `n` represents the size of the array that will be used to store the sum tree. The
+     * sum tree is a binary tree data structure used to efficiently calculate the sum of a range of elements in an array.
+     * The size of the sum tree array is `n + 1` because
+     */
     constructor(n: number);
+    private _sumTree;
+    get sumTree(): number[];
     static lowBit(x: number): number;
+    /**
+     * The update function updates the values in a binary indexed tree by adding a delta value to the specified index and
+     * its ancestors.
+     * @param {number} i - The parameter `i` represents the index of the element in the `_sumTree` array that needs to be
+     * updated.
+     * @param {number} delta - The "delta" parameter represents the change in value that needs to be added to the element
+     * at index "i" in the "_sumTree" array.
+     */
     update(i: number, delta: number): void;
+    /**
+     * The function calculates the prefix sum of an array using a binary indexed tree.
+     * @param {number} i - The parameter "i" in the function "getPrefixSum" represents the index of the element in the
+     * array for which we want to calculate the prefix sum.
+     * @returns The function `getPrefixSum` returns the prefix sum of the elements in the binary indexed tree up to index
+     * `i`.
+     */
     getPrefixSum(i: number): number;
+    /**
+     * The function `getRangeSum` calculates the sum of a range of numbers in an array.
+     * @param {number} start - The start parameter is the starting index of the range for which we want to calculate the
+     * sum.
+     * @param {number} end - The "end" parameter represents the ending index of the range for which we want to calculate
+     * the sum.
+     * @returns the sum of the elements in the range specified by the start and end indices.
+     */
     getRangeSum(start: number, end: number): number;
+    protected _setSumTree(value: number[]): void;
 }

package/dist/data-structures/binary-tree/binary-indexed-tree.js

@@ -1,32 +1,73 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BinaryIndexedTree = void 0;
-var BinaryIndexedTree = /** @class */ (function () {
-    function BinaryIndexedTree(n) {
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+class BinaryIndexedTree {
+    /**
+     * The constructor initializes an array with a specified length and fills it with zeros.
+     * @param {number} n - The parameter `n` represents the size of the array that will be used to store the sum tree. The
+     * sum tree is a binary tree data structure used to efficiently calculate the sum of a range of elements in an array.
+     * The size of the sum tree array is `n + 1` because
+     */
+    constructor(n) {
         this._sumTree = new Array(n + 1).fill(0);
     }
-    BinaryIndexedTree.lowBit = function (x) {
+    get sumTree() {
+        return this._sumTree;
+    }
+    static lowBit(x) {
         return x & (-x);
-    };
-    BinaryIndexedTree.prototype.update = function (i, delta) {
+    }
+    /**
+     * The update function updates the values in a binary indexed tree by adding a delta value to the specified index and
+     * its ancestors.
+     * @param {number} i - The parameter `i` represents the index of the element in the `_sumTree` array that needs to be
+     * updated.
+     * @param {number} delta - The "delta" parameter represents the change in value that needs to be added to the element
+     * at index "i" in the "_sumTree" array.
+     */
+    update(i, delta) {
         while (i < this._sumTree.length) {
             this._sumTree[i] += delta;
             i += BinaryIndexedTree.lowBit(i);
         }
-    };
-    BinaryIndexedTree.prototype.getPrefixSum = function (i) {
-        var sum = 0;
+    }
+    /**
+     * The function calculates the prefix sum of an array using a binary indexed tree.
+     * @param {number} i - The parameter "i" in the function "getPrefixSum" represents the index of the element in the
+     * array for which we want to calculate the prefix sum.
+     * @returns The function `getPrefixSum` returns the prefix sum of the elements in the binary indexed tree up to index
+     * `i`.
+     */
+    getPrefixSum(i) {
+        let sum = 0;
         while (i > 0) {
             sum += this._sumTree[i];
             i -= BinaryIndexedTree.lowBit(i);
         }
         return sum;
-    };
-    BinaryIndexedTree.prototype.getRangeSum = function (start, end) {
+    }
+    /**
+     * The function `getRangeSum` calculates the sum of a range of numbers in an array.
+     * @param {number} start - The start parameter is the starting index of the range for which we want to calculate the
+     * sum.
+     * @param {number} end - The "end" parameter represents the ending index of the range for which we want to calculate
+     * the sum.
+     * @returns the sum of the elements in the range specified by the start and end indices.
+     */
+    getRangeSum(start, end) {
         if (!(0 <= start && start <= end && end <= this._sumTree.length))
             throw 'Index out of bounds';
         return this.getPrefixSum(end) - this.getPrefixSum(start);
-    };
-    return BinaryIndexedTree;
-}());
+    }
+    _setSumTree(value) {
+        this._sumTree = value;
+    }
+}
 exports.BinaryIndexedTree = BinaryIndexedTree;